Constraint optimization algorithms for digital image reconstruction from projections
Constraint optimization algorithms for digital image reconstruction from projections
The reconstructing of an image from its projections is formulated and solved as a constraint optimization problem. A general cost criterion is optimized and the result is applied to various specific cost functions such as entropy; variance and local discontinuity producing several relationships (models) between the image and the Lagrange multipliers. The frequency domain counterparts of these models create new interpolation schemes of which a Eessel type is used extensively. Derivative dependent cost criteria lead to smoother reconstructions. Employing the block successive relaxation iterative method and exploiting regions of equal elements in the new matrices of the linear system for the variance model, a stable algorithm is given and its convergence ib proven. This algorithm is very fast without employing any approximation of the matrices involved. Using the back projection model a non recursive algorithm is presented based on the block diagonalization of the permuted block circulant matrices introduced here. This diagonalization is achieved by the block Fourier transform. The optimization procedure was extended for the reconstruction from fan beam projections. The fan beam counterpart of the above non recursive algorithm is presented. The Fourier transform of a fan beam projection gives a slice of a new transform, the angular projection transform. A convolution algorithm based on this projection slice theorem is also presented.
University of Southampton
Goutis, Constantinos Elia
1978
Goutis, Constantinos Elia
Goutis, Constantinos Elia
(1978)
Constraint optimization algorithms for digital image reconstruction from projections.
University of Southampton, Doctoral Thesis.
Record type:
Thesis
(Doctoral)
Abstract
The reconstructing of an image from its projections is formulated and solved as a constraint optimization problem. A general cost criterion is optimized and the result is applied to various specific cost functions such as entropy; variance and local discontinuity producing several relationships (models) between the image and the Lagrange multipliers. The frequency domain counterparts of these models create new interpolation schemes of which a Eessel type is used extensively. Derivative dependent cost criteria lead to smoother reconstructions. Employing the block successive relaxation iterative method and exploiting regions of equal elements in the new matrices of the linear system for the variance model, a stable algorithm is given and its convergence ib proven. This algorithm is very fast without employing any approximation of the matrices involved. Using the back projection model a non recursive algorithm is presented based on the block diagonalization of the permuted block circulant matrices introduced here. This diagonalization is achieved by the block Fourier transform. The optimization procedure was extended for the reconstruction from fan beam projections. The fan beam counterpart of the above non recursive algorithm is presented. The Fourier transform of a fan beam projection gives a slice of a new transform, the angular projection transform. A convolution algorithm based on this projection slice theorem is also presented.
This record has no associated files available for download.
More information
Published date: 1978
Identifiers
Local EPrints ID: 463858
URI: http://eprints.soton.ac.uk/id/eprint/463858
PURE UUID: d5f587f2-a533-4b79-b1f4-fe1e349106b5
Catalogue record
Date deposited: 04 Jul 2022 20:58
Last modified: 04 Jul 2022 20:58
Export record
Contributors
Author:
Constantinos Elia Goutis
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics