Fusion of sparse reconstruction algorithms for multiple measurement vectors
From MaRDI portal
Publication:2360137
DOI10.1007/s12046-016-0552-1zbMath1365.94068arXiv1504.01705OpenAlexW2962731902MaRDI QIDQ2360137
K. G. Deepa, K. V. S. Hari, Sooraj K. Ambat
Publication date: 26 June 2017
Published in: Sādhanā (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.01705
Related Items
Uses Software
Cites Work
- Unnamed Item
- Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Algorithms for simultaneous sparse approximation. II: Convex relaxation
- Fixed point for set-valued mappings satisfying an implicit relation in partially ordered metric spaces
- Probing the Pareto Frontier for Basis Pursuit Solutions
- An Empirical Bayesian Strategy for Solving the Simultaneous Sparse Approximation Problem
- Fusion of Algorithms for Compressed Sensing
- A Committee Machine Approach for Compressed Sensing Signal Reconstruction
- A Plurality of Sparse Representations Is Better Than the Sparsest One Alone
- Subspace Pursuit for Compressive Sensing Signal Reconstruction
- Sparse solutions to linear inverse problems with multiple measurement vectors
- A sparse signal reconstruction perspective for source localization with sensor arrays