Stochastic greedy algorithms for multiple measurement vectors
From MaRDI portal
Publication:2028927
DOI10.3934/ipi.2020066OpenAlexW3097842022MaRDI QIDQ2028927
Anna Ma, Rachel Grotheer, Natalie Durgin, Shuang Li, Chenxi Huang, Deanna Needell, Jing Qin
Publication date: 3 June 2021
Published in: Inverse Problems and Imaging (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1711.01521
stochastic optimizationsignal recoverycompressive sensingjoint sparsitymultiple measurement vectorsvideo recovery
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Applications of operator theory in optimization, convex analysis, mathematical programming, economics (47N10) Randomized algorithms (68W20)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Split Bregman algorithms for multiple measurement vector problem
- A mathematical introduction to compressive sensing
- Iterative hard thresholding for compressed sensing
- Fast global convergence of gradient methods for high-dimensional statistical recovery
- On the concept of matrix derivative
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Algorithms for simultaneous sparse approximation. I: Greedy pursuit
- Unconditional bases are optimal bases for data compression and for statistical estimation
- Compressed anomaly detection with multiple mixed observations
- Greedy-like algorithms for the cosparse analysis model
- Hard Thresholding Pursuit: An Algorithm for Compressive Sensing
- Greed is Good: Algorithmic Results for Sparse Approximation
- Sparse and Redundant Representations
- Linear Convergence of Stochastic Iterative Greedy Algorithms With Sparse Constraints
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- Distributed Spectrum Sensing for Cognitive Radio Networks by Exploiting Sparsity
- Greedy Algorithms for Joint Sparse Recovery
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
- CGIHT: conjugate gradient iterative hard thresholding for compressed sensing and matrix completion
- Batched Stochastic Gradient Descent with Weighted Sampling
- Atomic Norm Minimization for Modal Analysis From Random and Compressed Samples
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Subspace Methods for Joint Sparse Recovery
- Rank Awareness in Joint Sparse Recovery
- Compressive MUSIC: Revisiting the Link Between Compressive Sensing and Array Signal Processing
- Sparse Recovery With Orthogonal Matching Pursuit Under RIP
- Sparse solutions to linear inverse problems with multiple measurement vectors
