Average case recovery analysis of tomographic compressive sensing

DOI10.1016/J.LAA.2013.06.034MaRDI QIDQ2437338zbMATHOpenAlexFDO

Authors Stefania Petra, Christoph Schnörr

Publication date 3 March 2014

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

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

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)

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.

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

Cites work

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

Cited in

(7)

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

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)