How little data is enough? Phase-diagram analysis of sparsity-regularized X-ray computed tomography
Published 2015 View Full Article
- Home
- Publications
- Publication Search
- Publication Details
Title
How little data is enough? Phase-diagram analysis of sparsity-regularized X-ray computed tomography
Authors
Keywords
-
Journal
PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES
Volume 373, Issue 2043, Pages 20140387-20140387
Publisher
The Royal Society
Online
2015-05-05
DOI
10.1098/rsta.2014.0387
References
Ask authors/readers for more resources
Related references
Note: Only part of the references are listed.- Universality in polytope phase transitions and message passing algorithms
- (2015) Mohsen Bayati et al. ANNALS OF APPLIED PROBABILITY
- Empirical average-case relation between undersampling and sparsity in X-ray CT
- (2015) Jakob S. Jørgensen et al. Inverse Problems and Imaging
- Compressed sampling strategies for tomography
- (2014) Yan Kaganovsky et al. JOURNAL OF THE OPTICAL SOCIETY OF AMERICA A-OPTICS IMAGE SCIENCE AND VISION
- Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization
- (2013) Deanna Needell et al. IEEE TRANSACTIONS ON IMAGE PROCESSING
- The Computational Complexity of the Restricted Isometry Property, the Nullspace Property, and Related Concepts in Compressed Sensing
- (2013) Andreas M. Tillmann et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- Average case recovery analysis of tomographic compressive sensing
- (2013) Stefania Petra et al. LINEAR ALGEBRA AND ITS APPLICATIONS
- First-order convex feasibility algorithms for x-ray CT
- (2013) Emil Y. Sidky et al. MEDICAL PHYSICS
- Stable Image Reconstruction Using Total Variation Minimization
- (2013) Deanna Needell et al. SIAM Journal on Imaging Sciences
- Quantifying Admissible Undersampling for Sparsity-Exploiting Iterative Image Reconstruction in X-Ray CT
- (2012) Jakob S. Jorgensen et al. IEEE TRANSACTIONS ON MEDICAL IMAGING
- Convex optimization problem prototyping for image reconstruction in computed tomography with the Chambolle–Pock algorithm
- (2012) Emil Y Sidky et al. PHYSICS IN MEDICINE AND BIOLOGY
- Improved total variation-based CT image reconstruction applied to clinical data
- (2011) Ludwig Ritschl et al. PHYSICS IN MEDICINE AND BIOLOGY
- Exponential Bounds Implying Construction of Compressed Sensing Matrices, Error-Correcting Codes, and Neighborly Polytopes by Random Sampling
- (2010) David L. Donoho et al. IEEE TRANSACTIONS ON INFORMATION THEORY
- A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
- (2010) Antonin Chambolle et al. JOURNAL OF MATHEMATICAL IMAGING AND VISION
- Evaluation of sparse-view reconstruction from flat-panel-detector cone-beam CT
- (2010) Junguo Bian et al. PHYSICS IN MEDICINE AND BIOLOGY
- Precise Undersampling Theorems
- (2010) David L. Donoho et al. PROCEEDINGS OF THE IEEE
- Sparse Recovery Using Sparse Matrices
- (2010) Anna Gilbert et al. PROCEEDINGS OF THE IEEE
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- (2009) D. Donoho et al. PHILOSOPHICAL TRANSACTIONS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES
- A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
- (2009) Amir Beck et al. SIAM Journal on Imaging Sciences
- Prior image constrained compressed sensing (PICCS): A method to accurately reconstruct dynamic CT images from highly undersampled projection data sets
- (2008) Guang-Hong Chen et al. MEDICAL PHYSICS
- Image reconstruction in circular cone-beam computed tomography by constrained, total-variation minimization
- (2008) Emil Y Sidky et al. PHYSICS IN MEDICINE AND BIOLOGY
Find Funding. Review Successful Grants.
Explore over 25,000 new funding opportunities and over 6,000,000 successful grants.
ExplorePublish scientific posters with Peeref
Peeref publishes scientific posters from all research disciplines. Our Diamond Open Access policy means free access to content and no publication fees for authors.
Learn More