Optimized projections for compressed sensing via rank-constrained nearest correlation matrix
From MaRDI portal
Publication:2450944
DOI10.1016/j.acha.2013.08.005zbMath1350.94017arXiv1309.3676OpenAlexW3098136770MaRDI QIDQ2450944
Publication date: 26 May 2014
Published in: Applied and Computational Harmonic Analysis (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1309.3676
Random fields; image analysis (62M40) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)
Related Items
Improving the Incoherence of a Learned Dictionary via Rank Shrinkage ⋮ Measurement matrix optimization via mutual coherence minimization for compressively sensed signals reconstruction
Cites Work
- Equiangular tight frames
- Iterative hard thresholding for compressed sensing
- Decoding by Linear Programming
- Sparse representations in unions of bases
- Greed is Good: Algorithmic Results for Sparse Approximation
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Calibrating Least Squares Semidefinite Programming with Equality and Inequality Constraints
- Lower bounds on the maximum cross correlation of signals (Corresp.)
- Optimized Projections for Compressed Sensing
- A Fast Approach for Overcomplete Sparse Decomposition Based on Smoothed $\ell ^{0}$ Norm
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Rank reduction of correlation matrices by majorization
- Learning to Sense Sparse Signals: Simultaneous Sensing Matrix and Sparsifying Dictionary Optimization
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Stable signal recovery from incomplete and inaccurate measurements
- Compressed sensing
