Theory and applications of compressed sensing
From MaRDI portal
Publication:2864809
DOI10.1002/gamm.201310005zbMath1283.94018arXiv1203.3815MaRDI QIDQ2864809
Publication date: 26 November 2013
Published in: GAMM-Mitteilungen (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1203.3815
dimension reduction; random matrices; frames; sparse approximation; greedy algorithms; sparse recovery; \(\ell_1\) minimization; ill-posed inverse problems
65F22: Ill-posedness and regularization problems in numerical linear algebra
90C25: Convex programming
68U10: Computing methodologies for image processing
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
94A20: Sampling theory in information and communication theory
Related Items
Shearlets: Theory and Applications, A survey on compressive sensing: classical results and recent advancements, Alternating direction method of multipliers for penalized zero-variance discriminant analysis, An orthogonal method for measurement matrix optimization, Revisiting compressed sensing: exploiting the efficiency of simplex and sparsification methods, Compressed solving: a numerical approximation technique for elliptic PDEs based on compressed sensing, An improved algorithm for basis pursuit problem and its applications, Data-driven attacks and data recovery with noise on state estimation of smart grid, Sparse matrices in frame theory, Lattices from tight frames and vertex transitive graphs, A fast algorithm for the semi-definite relaxation of the state estimation problem in power grids, Estimation in High Dimensions: A Geometric Perspective, Compressive Imaging and Characterization of Sparse Light Deflection Maps
Uses Software
Cites Work
- Unnamed Item
- The restricted isometry property for time-frequency structured random matrices
- Restricted isometries for partial random circulant matrices
- Compressed sensing with coherent and redundant dictionaries
- The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)
- Explicit constructions of RIP matrices and related problems
- Compactly supported shearlets are optimally sparse
- The restricted isometry property and its implications for compressed sensing
- Fusion frames and distributed processing
- Combinatorial sublinear-time Fourier algorithms
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Uniform uncertainty principle and signal recovery via regularized orthogonal matching pursuit
- A simple proof of the restricted isometry property for random matrices
- Grassmannian frames with applications to coding and communication
- The cosparse analysis model and algorithms
- Analysis of inpainting via clustered sparsity and microlocal analysis
- Geometric separation by single-pass alternating thresholding
- Deterministic constructions of compressed sensing matrices
- Beyond coherence: Recovering structured time-frequency representations
- Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
- Clustered Sparsity and Separation of Cartoon and Texture
- Uncertainty Principles and Signal Recovery
- Compressed sensing and best đ-term approximation
- New and Improved JohnsonâLindenstrauss Embeddings via the Restricted Isometry Property
- Extensions of Lipschitz mappings into a Hilbert space
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Stable recovery of sparse overcomplete representations in the presence of noise
- 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
- Compressed Sensing and Redundant Dictionaries
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Atomic Decomposition by Basis Pursuit
- Uncertainty principles and ideal atomic decomposition
- High-Resolution Radar via Compressed Sensing
- Xampling: Signal Acquisition and Processing in Union of Subspaces
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
- A generalized uncertainty principle and sparse representation in pairs of bases
- Matching pursuits with time-frequency dictionaries
- Microlocal Analysis of the Geometric Separation Problem
- Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit
- Sparse Recovery From Combined Fusion Frame Measurements
- Sparse nonnegative solution of underdetermined linear equations by linear programming
- Neighborliness of randomly projected simplices in high dimensions
- Optimally sparse representation in general (nonorthogonal) dictionaries via â 1 minimization
- Compressed sensing
