An adapted fan volume sampling scheme for 3-D algebraic reconstruction in linear tomosynthesis

We study the reconstruction process when the X-ray source translates along a finite straight line, the detector moving or not. This process, called linear tomosynthesis, induces a limited angle of view, which causes the vertical spatial resolution to be poor. To improve this resolution, we use itera...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on nuclear science 2002-10, Vol.49 (5), p.2366-2372
Main Authors: Bleuet, P., Guillemaud, R., Desbat, L., Magnin, I.
Format: Article
Language:English
Subjects:
Algebra
Algorithms
Computation
Iterative algorithms
Iterative methods
Projection
Reconstruction
Reconstruction algorithms
Regularization
Sampling
Sampling methods
Spatial resolution
Studies
Testing
Tomography
Trajectories
Two dimensional displays
X-ray detection
X-ray detectors
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We study the reconstruction process when the X-ray source translates along a finite straight line, the detector moving or not. This process, called linear tomosynthesis, induces a limited angle of view, which causes the vertical spatial resolution to be poor. To improve this resolution, we use iterative algebraic reconstruction methods, which are commonly used for tomographic reconstruction from a reduced number of projections. With noisy projections, such algorithms produce poor quality reconstructions. To prevent this, we use a first object prior knowledge, consisting of piecewise smoothness constraint. To reduce the computation time associated with both reconstruction and regularization processes, we introduce a second geometrical prior knowledge, based on the linear trajectory of the X-ray source. This linear source trajectory allows us to reconstruct a series of two-dimensional (2-D) planes in a fan organization of the volume. Using this adapted fan volume sampling scheme, we reduce the computation time by transforming the initial three-dimensional (3-D) problem into a series of 2-D problems. Obviously, the algorithm becomes directly parallelizable. Focusing on a particular region of interest becomes easier too. The regularization process can easily be implemented with this scheme. We test the algorithm using experimental projections. The quality of the reconstructed object is conserved, while the computation time is considerably reduced, even without any parallelization of the algorithm.
ISSN:0018-9499
1558-1578
DOI:10.1109/TNS.2002.803683