The null space property for sparse recovery from multiple measurement vectors
From MaRDI portal
Publication:533503
DOI10.1016/j.acha.2010.11.002zbMath1228.65057OpenAlexW2147846067MaRDI QIDQ533503
Publication date: 3 May 2011
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.acha.2010.11.002
Computational methods for sparse matrices (65F50) Numerical solutions to overdetermined systems, pseudoinverses (65F20) Inverse problems in linear algebra (15A29)
Related Items
On the decay of the smallest singular value of submatrices of rectangular matrices, The null space property of the weighted ℓr − ℓ1 minimization, Exact recovery of sparse multiple measurement vectors by \(l_{2,p}\)-minimization, Analysis of convergence for the alternating direction method applied to joint sparse recovery, On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing, On rank awareness, thresholding, and MUSIC for joint sparse recovery, Real versus complex null space properties for sparse vector recovery, Recovery of Low Rank Symmetric Matrices via Schatten p Norm Minimization, A mixed ℓ1 regularization approach for sparse simultaneous approximation of parameterized PDEs, Reconstruction of jointly sparse vectors via manifold optimization, New conditions on stable recovery of weighted sparse signals via weighted \(l_1\) minimization, A simple Gaussian measurement bound for exact recovery of block-sparse signals, Enhanced joint sparsity via iterative support detection, Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit, On the Kähler form of complex \(L^{p}\) space and its Lagrangian subspaces
Cites Work
- Unnamed Item
- Highly sparse representations from dictionaries are unique and independent of the sparseness measure
- The restricted isometry property and its implications for compressed sensing
- A note on guaranteed sparse recovery via \(\ell_1\)-minimization
- Real versus complex null space properties for sparse vector recovery
- Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Continuous rotation invariant valuations on convex sets
- Derivatives of the \(L^p\)-cosine transform.
- Range characterization of the cosine transform on higher Grassmannians
- Sparse recovery with pre-Gaussian random matrices
- Non-asymptotic theory of random matrices: extreme singular values
- Restricted isometry properties and nonconvex compressive sensing
- Sparse representations in unions of bases
- Recovery of Short, Complex Linear Combinations Via<tex>$ell _1$</tex>Minimization
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Smoothed analysis of algorithms
- From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- Sparse solutions to linear inverse problems with multiple measurement vectors
- A sparse signal reconstruction perspective for source localization with sensor arrays
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements