Empirical average-case relation between undersampling and sparsity in X-ray CT
From MaRDI portal
Publication:256004
DOI10.3934/IPI.2015.9.431zbMATH Open1332.90393arXiv1211.5658OpenAlexW2963927656WikidataQ36716411 ScholiaQ36716411MaRDI QIDQ256004FDOQ256004
Authors: Emil Y. Sidky, Per Christian Hansen, Xiaochuan Pan, Jakob S. Jørgensen 
Publication date: 9 March 2016
Published in: Inverse Problems and Imaging (Search for Journal in Brave)
Abstract: In x-ray computed tomography (CT) it is generally acknowledged that reconstruction methods exploiting image sparsity allow reconstruction from a significantly reduced number of projections. The use of such reconstruction methods is motivated by recent progress in compressed sensing (CS). However, the CS framework provides neither guarantees of accurate CT reconstruction, nor any relation between sparsity and a sufficient number of measurements for recovery, i.e., perfect reconstruction from noise-free data. We consider reconstruction through 1-norm minimization, as proposed in CS, from data obtained using a standard CT fan-beam sampling pattern. In empirical simulation studies we establish quantitatively a relation between the image sparsity and the sufficient number of measurements for recovery within image classes motivated by tomographic applications. We show empirically that the specific relation depends on the image class and in many cases exhibits a sharp phase transition as seen in CS, i.e. same-sparsity image require the same number of projections for recovery. Finally we demonstrate that the relation holds independently of image size and is robust to small amounts of additive Gaussian noise.
Full work available at URL: https://arxiv.org/abs/1211.5658
Recommendations
- Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT
- Sparse tomography
- Image reconstruction from a small number of projections
- Improved compressed sensing-based algorithm for sparse-view CT image reconstruction
- Phase transitions and cosparse tomographic recovery of compound solid bodies from few projections
Applications of mathematical programming (90C90) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Inverse problems in linear algebra (15A29) Radon transform (44A12)
Cites Work
- Nonlinear total variation based noise removal algorithms
- Title not available (Why is that?)
- Rank-Deficient and Discrete Ill-Posed Problems
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Compressed sensing
- Discrete tomography. Foundations, algorithms, and applications
- A numerical exploration of compressed sampling recovery
- AIR tools -- a MATLAB package of algebraic iterative reconstruction methods
- Average case recovery analysis of tomographic compressive sensing
- Stable image reconstruction using total variation minimization
- Necessary and sufficient conditions for linear convergence of \(\ell^1\)-regularization
- Compressed sensing and best \(k\)-term approximation
- Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT
- A mathematical introduction to compressive sensing
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Why do commercial CT scanners still employ traditional, filtered back-projection for image reconstruction?
- Belief-propagation reconstruction for discrete tomography
- Deterministic matrices matching the compressed sensing phase transitions of Gaussian random matrices
- Sparsity and incoherence in compressive sampling
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Neighborliness of randomly projected simplices in high dimensions
Cited In (7)
- Shearlet-based regularization in statistical inverse learning with an application to x-ray tomography
- AIR tools II: algebraic iterative reconstruction methods, improved implementation
- Sparsity/undersampling tradeoffs in anisotropic undersampling, with applications in MR imaging/spectroscopy
- Average case recovery analysis of tomographic compressive sensing
- Phase transitions and cosparse tomographic recovery of compound solid bodies from few projections
- Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT
- Convergence analysis for column-action methods in image reconstruction
Uses Software
This page was built for publication: Empirical average-case relation between undersampling and sparsity in X-ray CT
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q256004)
