Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem
arXiv:1111.5272 · doi:10.1109/TSP.2012.2222382
Abstract
In this work, a Bayesian approximate message passing algorithm is proposed for solving the multiple measurement vector (MMV) problem in compressive sensing, in which a collection of sparse signal vectors that share a common support are recovered from undersampled noisy measurements. The algorithm, AMP-MMV, is capable of exploiting temporal correlations in the amplitudes of non-zero coefficients, and provides soft estimates of the signal vectors as well as the underlying support. Central to the proposed approach is an extension of recently developed approximate message passing techniques to the amplitude-correlated MMV setting. Aided by these techniques, AMP-MMV offers a computational complexity that is linear in all problem dimensions. In order to allow for automatic parameter tuning, an expectation-maximization algorithm that complements AMP-MMV is described. Finally, a detailed numerical study demonstrates the power of the proposed approach and its particular suitability for application to high-dimensional problems.
arXiv comment28 pages, 9 figures
References in corpus (8)
- Message Passing Algorithms for Compressed Sensing
- Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learning
- The dynamics of message passing on dense graphs, with applications to compressed sensing
- Modified-CS: Modifying Compressive Sensing for Problems with Partially Known Support
- Kalman Filtered Compressed Sensing
- Joint-sparse recovery from multiple measurements
- Subspace Methods for Joint Sparse Recovery
- Belief propagation for joint sparse recovery
Cited by in corpus (39)
- Massive Connectivity with Massive MIMO-Part I: Device Activity Detection and Channel Estimation
- Sparse Signal Processing for Grant-Free Massive Connectivity: A Future Paradigm for Random Access Protocols in the Internet of Things
- Sparse Activity Detection for Massive Connectivity
- Dynamic Compressive Sensing of Time-Varying Signals via Approximate Message Passing
- A GAMP Based Low Complexity Sparse Bayesian Learning Algorithm
- Multi-Cell Sparse Activity Detection for Massive Random Access: Massive MIMO versus Cooperative MIMO
- Compressive Sensing with Prior Support Quality Information and Application to Massive MIMO Channel Estimation with Temporal Correlation
- A Unified Bayesian Inference Framework for Generalized Linear Models
- Hybrid Approximate Message Passing
- Multi-frequency Electromagnetic Tomography for Acute Stroke Detection Using Frequency Constrained Sparse Bayesian Learning
- Decentralized Joint-Sparse Signal Recovery: A Sparse Bayesian Learning Approach
- Shapelet-based Sparse Representation for Landcover Classification of Hyperspectral Images
- Forest Sparsity for Multi-channel Compressive Sensing
- Multi-Layer Bilinear Generalized Approximate Message Passing
- Performance Analysis of Approximate Message Passing for Distributed Compressed Sensing
- Performance Limits for Noisy Multi-Measurement Vector Problems
- Application of Compressive Sensing Techniques in Distributed Sensor Networks: A Survey
- Performance Limits with Additive Error Metrics in Noisy Multi-Measurement Vector Problem
- Bayesian Optimal Approximate Message Passing to Recover Structured Sparse Signals
- Temporal-Structure-Assisted Gradient Aggregation for Over-the-Air Federated Edge Learning
- Structural Sparsity in Multiple Measurements
- Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing
- Inference in Multi-Layer Networks with Matrix-Valued Unknowns
- Statistical Physics and Information Theory Perspectives on Linear Inverse Problems
- Reconfigurable Intelligent Surface for Massive Connectivity
- Image Reconstruction for Multi-frequency Electromagnetic Tomography based on Multiple Measurement Vector Model
- Jointly Sparse Signal Recovery and Support Recovery via Deep Learning with Applications in MIMO-based Grant-Free Random Access
- Algorithm Unrolling for Massive Access via Deep Neural Network with Theoretical Guarantee
- Orthogonal subspace based fast iterative thresholding algorithms for joint sparsity recovery
- An adaptive shortest-solution guided decimation approach to sparse high-dimensional linear regression
- Performance Analysis of Cell-Free Massive MIMO Systems with Massive Connectivity
- Deep-Learned Approximate Message Passing for Asynchronous Massive Connectivity
- PDRS: A Fast Non-iterative Scheme for Massive Grant-free Access in Massive MIMO
- An approximate message passing approach for compressive hyperspectral imaging using a simultaneous low-rank and joint-sparsity prior
- Algorithm Unfolding for Block-sparse and MMV Problems with Reduced Training Overhead
- Sparse Signal Recovery in the Presence of Intra-Vector and Inter-Vector Correlation
- Generalized orthogonal matching pursuit for multiple measurements - A structural approach
- Deterministic Compressed Domain Analysis ofMulti-channel ECG Measurements
- Many-User Multiple Access with Random User Activity: Achievability Bounds and Efficient Schemes