skip to main content
10.1145/3506651.3506655acmotherconferencesArticle/Chapter ViewAbstractPublication PagesdmipConference Proceedingsconference-collections
research-article

New Level-Set-Based Shape Recovery Method and its application to sparse-view shape tomography

Authors Info & Claims
Published:21 February 2022Publication History

ABSTRACT

The recovery of shapes from a few numbers of their projections is very important in Computed tomography. In this paper, we propose a novel scheme based on a collocation set of Gaussian functions to represent any object by using a limited number of projections. This approach provides a continuous representation of both the implicit function and its zero level set. We show that the appropriate choice of a basis function to represent the parametric level-set leads to an optimization problem with a modest number of parameters, which exceeds many difficulties with traditional level set methods, such as regularization, re-initialization, and use of signed distance function. For the purposes of this paper, we used a dictionary of Gaussian function to provide flexibility in the representation of shapes with few terms as a basis function located at lattice points to parameterize the level set function. We propose a convex program to recover the dictionary coefficients successfully so it works stably with only four projections by overcoming the issue of local-minimum of the cost function. Finally, the performance of the proposed approach in three examples of inverse problems shows that our method compares favorably to Sparse Shape Composition (SSC), Total Variation, and Dual Problem.

References

  1. Aghasi, A., and Justin Romberg. 2013. Sparse shape reconstruction. SIAM Journal on Imaging Sciences, 6(4):2075–2108.Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. Aghasi, A., Kilmer, M., and Miller, E. L. 2011. Parametric level set methods for inverse problems. SIAM Journal on Imaging Sciences, 4(2): 618–650.Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Chambolle, A. and Pock, T. 2011. A first-order primal-dual algorithm for convex problems with applications to imaging. Journal of mathematical imaging and vision, 40(1): 120–145.Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Kak, A. C. and Slaney, M. 2001. Principles of Computerized Tomographic Imaging. SIAM.Google ScholarGoogle Scholar
  5. Dermanis, A., Grun, A. and Sanso, F. 2000. Geomatics Methods for the Analysis of Data in the Earth Sciences. Springer, Berlin.Google ScholarGoogle Scholar
  6. Gelas, A., Bernard, O., Friboulet, D., Prost, R., and INSA, V. 2007. Compactly supported radial basis functions-based collocation method for level-set evolution in image segmentation. IEEE Transactions on Image Processing, 16 :1873–1887.Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. Kadu, A. and Tristan van L. 2019. A convex formulation for Binary Tomography. IEEE Transactions on Computational Imaging 6: 1-11.Google ScholarGoogle ScholarCross RefCross Ref
  8. Kirsch, A.1993. The domain derivative and two applications in inverse scattering theory. Inverse Problems, 9: 81–96.Google ScholarGoogle ScholarCross RefCross Ref
  9. Miller, E. L., Kilmer, M., and Rappaport, C. 2000. A new shape-based method for object localization and characterization from scattered field data. IEEE Transactions on Geoscience and Remote Sensing, 38 :1682–1696.Google ScholarGoogle ScholarCross RefCross Ref
  10. Natterer, F. 2001. The Mathematics of Computerized Tomography. SIAM.Google ScholarGoogle Scholar
  11. Santosa, F. 1996. A level-set approach for inverse problems involving obstacles. ESAIM: Control, Optimization and Calculus of Variations, 1: 17– 33.Google ScholarGoogle ScholarCross RefCross Ref
  12. Herman, G. T. and Kuba, A. 2007. Advances in Discrete Tomography and Its Applications. Birkhäuser, Boston.Google ScholarGoogle Scholar
  13. Herman, G. T. and Kuba, A. 1999. Discrete Tomography: Foundations, Algorithms, and Applications. Birkhäuser, Boston.Google ScholarGoogle ScholarCross RefCross Ref
  14. Zhao, H. K., Chan, T., Merriman, B., and Osher, S. 1996. A variational level set approach to multiphase motion. Journal of computational physics, 127: 179–195.Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Tian, H. Y., Reutskiy, S. and Chen, CS. 2008. A basis function for approximation and the solutions of partial differential equations. Numerical Methods for Partial Differential Equations, 24: 1018–1036.Google ScholarGoogle ScholarCross RefCross Ref
  16. Kastner, J. 2012. Conference on Industrial Computed Tomography (ICT) 2012. Proceedings, Shaker Verlag, Aachen, Germany.Google ScholarGoogle Scholar
  17. Cardiff, M. and Kitanidis, P. K. 2009. Bayesian inversion for faces detection: An extensible level set framework. Water Resources Research, p. W10416, 45.Google ScholarGoogle Scholar
  18. Kilmer, M., Miller, E., Enriquez, M., and Boas, D. 2004. Cortical constraint method for diffuse optical brain imaging. In Proceedings of SPIE, p. 381, 5559.Google ScholarGoogle Scholar
  19. Schmidt, M. 2005. minfunc: unconstrained differentiable multivariate optimization in MATLAB. 2005.Google ScholarGoogle Scholar
  20. Schmidt, M. W., Van Den Berg, E., Friedlander, M. P., and Murphy, K. P. 2009. Optimizing costly functions with simple constraints: A limited-memory projected quasi-Newton algorithm. In AISTATS, 456-463.Google ScholarGoogle Scholar
  21. Dorn, O. and Lesselier, D. 2006. Level set methods for inverse scattering. Inverse Problems, 22: R67.Google ScholarGoogle ScholarCross RefCross Ref
  22. Bernard, O., Friboulet, D., Thevenaz, P., and Unser, M. 2009. Variational B-spline level-set: a linear filtering approach for fast deformable model evolution. IEEE Transactions on Image Processing, 18: 1179–1191.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Dorn, O. and Villegas, R.2008. History matching of petroleum reservoirs using a level set technique. Inverse problems, p. 035015, 24.Google ScholarGoogle Scholar
  24. Kress, R. and Zinn, A. 1992. On the numerical solution of the three-dimensional inverse obstacle scattering problem. Journal of Computational and Applied Mathematics, 42: 49–61.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Kress, R. and Rundell, W. 1994. A quasi-Newton method in inverse obstacle scattering. Inverse Problems, 10 :1145–1157.Google ScholarGoogle ScholarCross RefCross Ref
  26. Deans, S. R. 1983. The Radon Transform and Some of Its Applications. A Wiley-Interscience Publication, New York.Google ScholarGoogle Scholar
  27. Chan, T. F. and Vese, L. A. 2001. Active contours without edges. IEEE Transactions on image processing, 10 :266–277.Google ScholarGoogle ScholarDigital LibraryDigital Library
  28. Buzug, T. M. 2008. Computed Tomography. Springer-Verlag, Berlin.Google ScholarGoogle Scholar

Recommendations

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Sign in
  • Published in

    cover image ACM Other conferences
    DMIP '21: Proceedings of the 2021 4th International Conference on Digital Medicine and Image Processing
    November 2021
    87 pages
    ISBN:9781450386487
    DOI:10.1145/3506651

    Copyright © 2021 ACM

    © 2021 Association for Computing Machinery. ACM acknowledges that this contribution was authored or co-authored by an employee, contractor or affiliate of a national government. As such, the Government retains a nonexclusive, royalty-free right to publish or reproduce this article, or to allow others to do so, for Government purposes only.

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    • Published: 21 February 2022

    Permissions

    Request permissions about this article.

    Request Permissions

    Check for updates

    Qualifiers

    • research-article
    • Research
    • Refereed limited

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

HTML Format

View this article in HTML Format .

View HTML Format