Approximate Message Passing with Nearest Neighbor Sparsity Pattern Learning
arXiv:1601.00543
Abstract
We consider the problem of recovering clustered sparse signals with no prior knowledge of the sparsity pattern. Beyond simple sparsity, signals of interest often exhibits an underlying sparsity pattern which, if leveraged, can improve the reconstruction performance. However, the sparsity pattern is usually unknown a priori. Inspired by the idea of k-nearest neighbor (k-NN) algorithm, we propose an efficient algorithm termed approximate message passing with nearest neighbor sparsity pattern learning (AMP-NNSPL), which learns the sparsity pattern adaptively. AMP-NNSPL specifies a flexible spike and slab prior on the unknown signal and, after each AMP iteration, sets the sparse ratios as the average of the nearest neighbor estimates via expectation maximization (EM). Experimental results on both synthetic and real data demonstrate the superiority of our proposed algorithm both in terms of reconstruction performance and computational complexity.
arXiv comment5 pages, 4 figures
References in corpus (10)
- Message Passing Algorithms for Compressed Sensing
- Compressed Sensing of Block-Sparse Signals: Uncertainty Relations and Efficient Recovery
- Sparse Signal Recovery with Temporally Correlated Source Vectors Using Sparse Bayesian Learning
- Extension of SBL Algorithms for the Recovery of Block Sparse Signals with Intra-Block Correlation
- Expectation-Maximization Gaussian-Mixture Approximate Message Passing
- Learning with Structured Sparsity
- Compressive Imaging using Approximate Message Passing and a Markov-Tree Prior
- Two-Dimensional Pattern-Coupled Sparse Bayesian Learning via Generalized Approximate Message Passing
- A Message-Passing Receiver for BICM-OFDM over Unknown Clustered-Sparse Channels
- Spatio-temporal Spike and Slab Priors for Multiple Measurement Vector Problems