arXiv subjects

Emil Y. Sidky

Publications and source records attributed to Emil Y. Sidky.

40 records · Page 3Linked to original sources

arXiv2011

High resolution image reconstruction with constrained, total-variation minimization

This work is concerned with applying iterative image reconstruction, based on constrained total-variation minimization, to low-intensity X-ray CT systems that have a high sampling rate. Such systems pose a challenge for iterative image reconstruction, because a very fine image grid is needed to realize the resolution inherent in such scanners. These image arrays lead to under-determined imaging models whose inversion is unstable and can result in undesirable artifacts and noise patterns. There are many possibilities to stabilize the imaging model, and this work proposes a method which may have an advantage in terms of algorithm efficiency. The proposed method introduces additional constraints in the optimization problem; these constraints set to zero high spatial frequency components which are beyond the sensing capability of the detector. The method is demonstrated with an actual CT data set and compared with another method based on projection up-sampling.

physics.med-ph↗

arXiv2010

A constrained, total-variation minimization algorithm for low-intensity X-ray CT

Purpose: We develop an iterative image-reconstruction algorithm for application to low-intensity computed tomography (CT) projection data, which is based on constrained, total-variation (TV) minimization. The algorithm design focuses on recovering structure on length scales comparable to a detector-bin width. Method: Recovering the resolution on the scale of a detector bin, requires that pixel size be much smaller than the bin width. The resulting image array contains many more pixels than data, and this undersampling is overcome with a combination of Fourier upsampling of each projection and the use of constrained, TV-minimization, as suggested by compressive sensing. The presented pseudo-code for solving constrained, TV-minimization is designed to yield an accurate solution to this optimization problem within 100 iterations. Results: The proposed image-reconstruction algorithm is applied to a low-intensity scan of a rabbit with a thin wire, to test resolution. The proposed algorithm is compared with filtered back-projection (FBP). Conclusion: The algorithm may have some advantage over FBP in that the resulting noise-level is lowered at equivalent contrast levels of the wire.

physics.med-ph↗

arXiv2009

Accurate image reconstruction from few-views and limited-angle data in divergent-beam CT

In practical applications of tomographic imaging, there are often challenges for image reconstruction due to under-sampling and insufficient data. In computed tomography (CT), for example, image reconstruction from few views would enable rapid scanning with a reduced x-ray dose delivered to the patient. Limited-angle problems are also of practical significance in CT. In this work, we develop and investigate an iterative image reconstruction algorithm based on the minimization of the image total variation (TV) that applies to divergent-beam CT. Numerical demonstrations of our TV algorithm are performed with various insufficient data problems in fan-beam CT. The TV algorithm can be generalized to cone-beam CT as well as other tomographic imaging modalities.

physics.med-ph↗

arXiv2009

Enhanced imaging of microcalcifications in digital breast tomosynthesis through improved image-reconstruction algorithms

PURPOSE: We develop a practical, iterative algorithm for image-reconstruction in under-sampled tomographic systems, such as digital breast tomosynthesis (DBT). METHOD: The algorithm controls image regularity by minimizing the image total $p$-variation (TpV), a function that reduces to the total variation when $p=1.0$ or the image roughness when $p=2.0$. Constraints on the image, such as image positivity and estimated projection-data tolerance, are enforced by projection onto convex sets (POCS). The fact that the tomographic system is under-sampled translates to the mathematical property that many widely varied resultant volumes may correspond to a given data tolerance. Thus the application of image regularity serves two purposes: (1) reduction of the number of resultant volumes out of those allowed by fixing the data tolerance, finding the minimum image TpV for fixed data tolerance, and (2) traditional regularization, sacrificing data fidelity for higher image regularity. The present algorithm allows for this dual role of image regularity in under-sampled tomography. RESULTS: The proposed image-reconstruction algorithm is applied to three clinical DBT data sets. The DBT cases include one with microcalcifications and two with masses. CONCLUSION: Results indicate that there may be a substantial advantage in using the present image-reconstruction algorithm for microcalcification imaging.

physics.med-ph↗