Performance Limits with Additive Error Metrics in Noisy Multi-Measurement Vector Problem
arXiv:1801.00552 · doi:10.1109/TSP.2018.2866844
Abstract
Real-world applications such as magnetic resonance imaging with multiple coils, multi-user communication, and diffuse optical tomography often assume a linear model where several sparse signals sharing common sparse supports are acquired by several measurement matrices and then contaminated by noise. Multi-measurement vector (MMV) problems consider the estimation or reconstruction of such signals. In different applications, the estimation error that we want to minimize could be the mean squared error or other metrics such as the mean absolute error and the support set error. Seeing that minimizing different error metrics is useful in MMV problems, we study information-theoretic performance limits for MMV signal estimation with arbitrary additive error metrics. We also propose a message passing algorithmic framework that achieves the optimal performance, and rigorously prove the optimality of our algorithm for a special case. We further conjecture the optimality of our algorithm for some general cases, and back it up through numerical examples. As an application of our MMV algorithm, we propose a novel setup for active user detection in multi-user communication and demonstrate the promise of our proposed setup.
arXiv comment11 pages, 5 figures. Accepted by IEEE Transactions on Signal Processing
References in corpus (17)
- Message Passing Algorithms for Compressed Sensing
- The dynamics of message passing on dense graphs, with applications to compressed sensing
- Reduce and Boost: Recovering Arbitrary Sets of Jointly Sparse Vectors
- Joint-sparse recovery from multiple measurements
- Probabilistic Reconstruction in Compressed Sensing: Algorithms, Phase Diagrams, and Threshold Achieving Matrices
- Subspace Methods for Joint Sparse Recovery
- Efficient High-Dimensional Inference in the Multiple Measurement Vector Problem
- Approximate message-passing decoder and capacity-achieving sparse superposition codes
- On-Off Random Access Channels: A Compressed Sensing Framework
- Measurement Bounds for Sparse Signal Ensembles via Graphical Models
- Performance Analysis of Approximate Message Passing for Distributed Compressed Sensing
- Performance Limits for Noisy Multi-Measurement Vector Problems
- Signal Estimation with Additive Error Metrics in Compressed Sensing
- Improving M-SBL for Joint Sparse Recovery using a Subspace Penalty
- Sparse Multinomial Logistic Regression via Approximate Message Passing
- Performance Regions in Compressed Sensing from Noisy Measurements
- Statistical Physics and Information Theory Perspectives on Linear Inverse Problems