Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT
TL;DR: In this paper, the authors study recoverability in CT with sparsity and total variation priors, and propose new computational methods to test recoverability by verifying solution uniqueness conditions, using both reconstruction and uniqueness testing, empirically studying the number of CT measurements sufficient for recovery on new classes of sparse test images.
read more
Abstract: We study recoverability in fan-beam computed tomography (CT) with sparsity and total variation priors: how many underdetermined linear measurements suffice for recovering images of given sparsity? Results from compressed sensing (CS) establish such conditions for example for random measurements, but not for CT. Recoverability is typically tested by checking whether a computed solution recovers the original. This approach cannot guarantee solution uniqueness and the recoverability decision therefore depends on the optimization algorithm. We propose new computational methods to test recoverability by verifying solution uniqueness conditions. Using both reconstruction and uniqueness testing, we empirically study the number of CT measurements sufficient for recovery on new classes of sparse test images. We demonstrate an average-case relation between sparsity and sufficient sampling and observe a sharp phase transition as known from CS, but never established for CT. In addition to assessing recoverability mor...
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
How little data is enough? Phase-diagram analysis of sparsity-regularized X-ray computed tomography
TL;DR: In this paper, phase-diagram analysis is used to predict the sufficient number of projections for accurately reconstructing a large-scale image of a given sparsity by means of total-variation regularization.
•Book
Compressive Imaging: Structure, Sampling, Learning
Ben Adcock,Anders C. Hansen +1 more
- 16 Sep 2021
TL;DR: An in-depth treatment of compressive imaging, with an eye to the next decade of imaging research, and using both empirical and mathematical insights, examines the potential benefits and the pitfalls of these latest approaches.
43
How little data is enough? Phase-diagram analysis of sparsity-regularized X-ray CT
TL;DR: Preliminary results of how well phase-diagram analysis can predict the sufficient number of projections for accurately reconstructing a large-scale image of a given sparsity by means of total-variation regularization are shown.
Sampling limits for electron tomography with sparsity-exploiting reconstructions.
TL;DR: Numerical simulations of ET performance of ℓ1-norm and total-variation (TV) minimization under various imaging conditions show specimens with more complex structures generally require more projections for exact reconstruction, but once sufficient data is acquired, dividing the beam dose over more projections provides no improvements-analogous to the traditional dose-fraction theorem.
15
References
Nonlinear total variation based noise removal algorithms
TL;DR: In this article, a constrained optimization type of numerical algorithm for removing noise from images is presented, where the total variation of the image is minimized subject to constraints involving the statistics of the noise.
17.3K
Atomic Decomposition by Basis Pursuit
TL;DR: Basis Pursuit (BP) is a principle for decomposing a signal into an "optimal" superposition of dictionary elements, where optimal means having the smallest l1 norm of coefficients among all such decompositions.
11.3K
Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Emmanuel J. Candès,Terence Tao +1 more
TL;DR: If the objects of interest are sparse in a fixed basis or compressible, then it is possible to reconstruct f to within very high accuracy from a small number of random measurements by solving a simple linear program.
•Posted Content
Near Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
Emmanuel J. Candès,Terence Tao +1 more
TL;DR: In this article, it was shown that if the objects of interest are sparse or compressible in the sense that the reordered entries of a signal $f \in {\cal F}$ decay like a power-law, then it is possible to reconstruct $f$ to within very high accuracy from a small number of random measurements.
5.6K
A First-Order Primal-Dual Algorithm for Convex Problems with Applications to Imaging
Antonin Chambolle,Thomas Pock +1 more
TL;DR: A first-order primal-dual algorithm for non-smooth convex optimization problems with known saddle-point structure can achieve O(1/N2) convergence on problems, where the primal or the dual objective is uniformly convex, and it can show linear convergence, i.e. O(ωN) for some ω∈(0,1), on smooth problems.