Compressive Sensing

DOI10.1007/978-1-4939-0790-8_6zbMath1331.94019OpenAlexW4211007270MaRDI QIDQ2789803

Massimo Fornasier, Holger Rauhut

Publication date: 2 March 2016

Published in: Handbook of Mathematical Methods in Imaging (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-1-4939-0790-8_6

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08) Machine vision and scene understanding (68T45)

Related Items

A sequential ADMM algorithm to find sparse LCP solutions using a \(l_2-l_1\) regularization technique with application in bimatrix game, Accelerating the Bayesian inference of inverse problems by using data-driven compressive sensing method based on proper orthogonal decomposition

Uses Software

• PDCO
• UNLocBoX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Nonlinear total variation based noise removal algorithms
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• The restricted isometry property for time-frequency structured random matrices
• Remote sensing via \(\ell_1\)-minimization
• Restricted isometries for partial random circulant matrices
• Convergence of fixed-point continuation algorithms for matrix rank minimization
• The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
• Phase transitions for greedy sparse approximation algorithms
• Explicit constructions of RIP matrices and related problems
• A convergent overlapping domain decomposition method for total variation minimization
• Iterative hard thresholding for compressed sensing
• Random sampling of sparse trigonometric polynomials
• The restricted isometry property and its implications for compressed sensing
• Widths of embeddings in function spaces
• Sparsity in time-frequency representations
• A note on guaranteed sparse recovery via \(\ell_1\)-minimization
• On compressive sensing applied to radar
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
• A simple proof of the restricted isometry property for random matrices
• Random projections of regular simplices
• Selecting a proportion of characters
• Grassmannian frames with applications to coding and communication
• Least angle regression. (With discussion)
• Optimal recovery and \(n\)-widths for convex classes of functions
• A first-order primal-dual algorithm for convex problems with applications to imaging
• The application of joint sparsity and total variation minimization algorithms to a real-life art restoration problem
• On signal reconstruction without phase
• High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
• Exact matrix completion via convex optimization
• Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective
• Compressed Remote Sensing of Sparse Objects
• A Singular Value Thresholding Algorithm for Matrix Completion
• Counting faces of randomly projected polytopes when the projection radically lowers dimension
• Compressed sensing and best 𝑘-term approximation
• New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property
• NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS
• Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization
• On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables
• On sparse reconstruction from Fourier and Gaussian measurements
• On Sparse Representations in Arbitrary Redundant Bases
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Sparse representations in unions of bases
• Greed is Good: Algorithmic Results for Sparse Approximation
• Probing the Pareto Frontier for Basis Pursuit Solutions
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse
• Stability Results for Random Sampling of Sparse Trigonometric Polynomials
• Compressive Sensing by Random Convolution
• Iteratively reweighted least squares minimization for sparse recovery
• Linear Inversion of Band-Limited Reflection Seismograms
• Signal Recovery and the Large Sieve
• DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS
• Atomic Decomposition by Basis Pursuit
• A new approach to variable selection in least squares problems
• Uncertainty principles and ideal atomic decomposition
• An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
• A generalized uncertainty principle and sparse representation in pairs of bases
• Rate of Convergence of Lawson's Algorithm
• Sparse Approximate Solutions to Linear Systems
• Matching pursuits with time-frequency dictionaries
• Neighborliness of randomly projected simplices in high dimensions
• Restoration of Color Images by Vector Valued BV Functions and Variational Calculus
• Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ ¹ minimization
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• An introduction to frames and Riesz bases