Theory and applications of compressed sensing
From MaRDI portal
Publication:2864809
DOI10.1002/GAMM.201310005zbMATH Open1283.94018arXiv1203.3815OpenAlexW2962786165MaRDI QIDQ2864809FDOQ2864809
Publication date: 26 November 2013
Published in: GAMM-Mitteilungen (Search for Journal in Brave)
Abstract: Compressed sensing is a novel research area, which was introduced in 2006, and since then has already become a key concept in various areas of applied mathematics, computer science, and electrical engineering. It surprisingly predicts that high-dimensional signals, which allow a sparse representation by a suitable basis or, more generally, a frame, can be recovered from what was previously considered highly incomplete linear measurements by using efficient algorithms. This article shall serve as an introduction to and a survey about compressed sensing.
Full work available at URL: https://arxiv.org/abs/1203.3815
dimension reductionsparse approximationsparse recoveryframesrandom matricesgreedy algorithms\(\ell_1\) minimizationill-posed inverse problems
Convex programming (90C25) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Ill-posedness and regularization problems in numerical linear algebra (65F22) Computing methodologies for image processing (68U10) Sampling theory in information and communication theory (94A20)
Cites Work
- Title not available (Why is that?)
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Atomic Decomposition by Basis Pursuit
- Extensions of Lipschitz mappings into a Hilbert space
- Matching pursuits with time-frequency dictionaries
- Optimally sparse representation in general (nonorthogonal) dictionaries via โ 1 minimization
- Stable recovery of sparse overcomplete representations in the presence of noise
- A simple proof of the restricted isometry property for random matrices
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Compressed sensing
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- Compressed sensing and best ๐-term approximation
- Greed is Good: Algorithmic Results for Sparse Approximation
- Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing
- Uncertainty principles and ideal atomic decomposition
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Neighborliness of randomly projected simplices in high dimensions
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Compactly supported shearlets are optimally sparse
- Fusion frames and distributed processing
- Combinatorial sublinear-time Fourier algorithms
- Grassmannian frames with applications to coding and communication
- Uncertainty Principles and Signal Recovery
- The restricted isometry property and its implications for compressed sensing
- The cosparse analysis model and algorithms
- Analysis of inpainting via clustered sparsity and microlocal analysis
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Compressed Sensing and Redundant Dictionaries
- Microlocal Analysis of the Geometric Separation Problem
- Deterministic constructions of compressed sensing matrices
- New and Improved JohnsonโLindenstrauss Embeddings via the Restricted Isometry Property
- Explicit constructions of RIP matrices and related problems
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Compressed sensing with coherent and redundant dictionaries
- Restricted isometries for partial random circulant matrices
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- High-Resolution Radar via Compressed Sensing
- The restricted isometry property for time-frequency structured random matrices
- A generalized uncertainty principle and sparse representation in pairs of bases
- Sparse Recovery From Combined Fusion Frame Measurements
- Geometric separation by single-pass alternating thresholding
- Xampling: Signal Acquisition and Processing in Union of Subspaces
- Clustered sparsity and separation of cartoon and texture
- Beyond coherence: Recovering structured time-frequency representations
Cited In (22)
- An Introduction to Compressed Sensing
- Sparse matrices in frame theory
- Data-driven attacks and data recovery with noise on state estimation of smart grid
- Sampling theory, a renaissance. Compressive sensing and other developments
- Estimation in High Dimensions: A Geometric Perspective
- A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids
- Compressive Imaging and Characterization of Sparse Light Deflection Maps
- Tight-frame-like analysis-sparse recovery using nontight sensing matrices
- Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing
- Title not available (Why is that?)
- An orthogonal method for measurement matrix optimization
- Toeplitz Compressed Sensing Matrices With Applications to Sparse Channel Estimation
- Lattices from tight frames and vertex transitive graphs
- Theory of Sparse Coprime Sensing in Multiple Dimensions
- Shearlets: Theory and Applications
- Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods
- Theory of compressive sensing via \(\ell_1\)-minimization: a non-RIP analysis and extensions
- Compressed sensing and its applications. Second international MATHEON conference, December 2015
- An improved algorithm for basis pursuit problem and its applications
- A survey on compressive sensing: classical results and recent advancements
- Alternating direction method of multipliers for penalized zero-variance discriminant analysis
- New inertial self-adaptive algorithms for the split common null-point problem: application to data classifications
Uses Software
Recommendations
- Title not available (Why is that?) ๐ ๐
- Compressed sensing ๐ ๐
- A Survey of Compressed Sensing ๐ ๐
- Compressive Sensing ๐ ๐
- Compressed sensing and sparse filtering ๐ ๐
- Structured Compressed Sensing: From Theory to Applications ๐ ๐
- Compressive Sensing ๐ ๐
- Compressed sensing ๐ ๐
- Compressed sensing: a survey ๐ ๐
- Compressed sensing in information processing ๐ ๐
This page was built for publication: Theory and applications of compressed sensing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864809)
