Open Access
1 April 2001 Use of penalty terms in gradient-based iterative reconstruction schemes for optical tomography
Andreas H. Hielscher, Sebastian Bartel
Author Affiliations +
It is well known that the reconstruction problem in optical tomography is ill-posed. In other words, many different spatial distributions of optical properties inside the medium can lead to the same detector readings on the surface of the medium under consideration. Therefore, the choice of an appropriate method to overcome this problem is of crucial importance for any successful optical tomographic image reconstruction algorithm. In this work we approach the problem within a gradient-based iterative image reconstruction scheme. The image reconstruction is considered to be a minimization of an appropriately defined objective function. The objective function can be separated into a least-square-error term, which compares predicted and actual detector readings, and additional penalty terms that may contain a priori information about the system. For the efficient minimization of this objective function the gradient with respect to the spatial distribution of optical properties is calculated. Besides presenting the underlying concepts in our approach to overcome illposedness in optical tomography, we will show numerical results that demonstrate how prior knowledge, represented as penalty terms, can improve the reconstruction results.
©(2001) Society of Photo-Optical Instrumentation Engineers (SPIE)
Andreas H. Hielscher and Sebastian Bartel "Use of penalty terms in gradient-based iterative reconstruction schemes for optical tomography," Journal of Biomedical Optics 6(2), (1 April 2001). https://doi.org/10.1117/1.1352753
Published: 1 April 2001
Lens.org Logo
CITATIONS
Cited by 53 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Tissues

Optical properties

Image restoration

Image quality

Optical tomography

Tissue optics

Reconstruction algorithms

Back to Top