Average case recovery analysis of tomographic compressive sensing

DOI10.1016/J.LAA.2013.06.034zbMATH Open1282.65048arXiv1208.5894OpenAlexW2033397583MaRDI QIDQ2437338FDOQ2437338

Authors: Stefania Petra, Christoph Schnörr 

Publication date: 3 March 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Abstract: The reconstruction of three-dimensional sparse volume functions from few tomographic projections constitutes a challenging problem in image reconstruction and turns out to be a particular instance problem of compressive sensing. The tomographic measurement matrix encodes the incidence relation of the imaging process, and therefore is not subject to design up to small perturbations of non-zero entries. We present an average case analysis of the recovery properties and a corresponding tail bound to establish weak thresholds, in excellent agreement with numerical experiments. Our result improve the state-of-the-art of tomographic imaging in experimental fluid dynamics by a factor of three.

Full work available at URL: https://arxiv.org/abs/1208.5894

Recommendations

• TomoPIV meets compressed sensing
• Critical parameter values and reconstruction properties of discrete tomography: application to experimental fluid dynamics
• Phase transitions and cosparse tomographic recovery of compound solid bodies from few projections
• Empirical average-case relation between undersampling and sparsity in X-ray CT
• Compressed sensing

zbMATH Keywords

sparsitylarge deviationcompressed sensingnonnegative least squaresunderdetermined systems of linear equationstail boundalgebraic reconstructionTomoPIV

Mathematics Subject Classification ID

Ill-posedness and regularization problems in numerical linear algebra (65F22) Computing methodologies for image processing (68U10)

Cites Work

• Compressive sampling
• On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
• Title not available (Why is that?)
• Asymptotic theory of statistics and probability
• Compressed sensing
• Sparse nonnegative solution of underdetermined linear equations by linear programming
• Enumeration of Seven-Argument Threshold Functions
• Probabilistic methods for algorithmic discrete mathematics
• Weighted sums of certain dependent random variables
• Probability of unique integer solution to a system of linear equations
• Counting the faces of randomly-projected hypercubes and orthants, with applications
• Sparse Recovery of Nonnegative Signals With Minimal Expansion
• A Problem in Geometric Probability.
• A Unique “Nonnegative” Solution to an Underdetermined System: From Vectors to Matrices
• For most large underdetermined systems of equations, the minimal 𝓁₁‐norm near‐solution approximates the sparsest near‐solution
• TomoPIV meets compressed sensing

Cited In (4)

• Empirical average-case relation between undersampling and sparsity in X-ray CT
• Efficient sensing of von Kármán vortices using compressive sensing
• Shearlet-based regularization in statistical inverse learning with an application to x-ray tomography
• Testable uniqueness conditions for empirical assessment of undersampling levels in total variation-regularized X-ray CT

This page was built for publication: Average case recovery analysis of tomographic compressive sensing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2437338)