Stochastic Greedy Algorithms For Multiple Measurement Vectors

11/05/2017
by   Jing Qin, et al.
0

Sparse representation of a single measurement vector (SMV) has been explored in a variety of compressive sensing applications. Recently, SMV models have been extended to solve multiple measurement vectors (MMV) problems, where the underlying signal is assumed to have joint sparse structures. To circumvent the NP-hardness of the ℓ_0 minimization problem, many deterministic MMV algorithms solve the convex relaxed models with limited efficiency. In this paper, we develop stochastic greedy algorithms for solving the joint sparse MMV reconstruction problem. In particular, we propose the MMV Stochastic Iterative Hard Thresholding (MStoIHT) and MMV Stochastic Gradient Matching Pursuit (MStoGradMP) algorithms, and we also utilize the mini-batching technique to further improve their performance. Convergence analysis indicates that the proposed algorithms are able to converge faster than their SMV counterparts, i.e., concatenated StoIHT and StoGradMP, under certain conditions. Numerical experiments have illustrated the superior effectiveness of the proposed algorithms over their SMV counterparts.

READ FULL TEXT

page 22

page 23

research
06/07/2023

Stochastic Natural Thresholding Algorithms

Sparse signal recovery is one of the most fundamental problems in variou...
research
10/28/2021

Iterative and greedy algorithms for the sparsity in levels model in compressed sensing

Motivated by the question of optimal functional approximation via compre...
research
04/28/2011

Iterative Reweighted Algorithms for Sparse Signal Recovery with Temporally Correlated Source Vectors

Iterative reweighted algorithms, as a class of algorithms for sparse sig...
research
05/09/2019

Stochastic Iterative Hard Thresholding for Graph-structured Sparsity Optimization

Stochastic optimization algorithms update models with cheap per-iteratio...
research
01/10/2014

Extension of Sparse Randomized Kaczmarz Algorithm for Multiple Measurement Vectors

The Kaczmarz algorithm is popular for iteratively solving an overdetermi...
research
08/21/2004

Invariant Stochastic Encoders

The theory of stochastic vector quantisers (SVQ) has been extended to al...
research
02/21/2011

Improved RIP Analysis of Orthogonal Matching Pursuit

Orthogonal Matching Pursuit (OMP) has long been considered a powerful he...

Please sign up or login with your details

Forgot password? Click here to reset