Joint Sparse Recovery Using Signal Space Matching Pursuit

by   Junhan Kim, et al.

In this paper, we put forth a new joint sparse recovery algorithm called signal space matching pursuit (SSMP). The key idea of the proposed SSMP algorithm is to sequentially investigate the support of jointly sparse vectors to minimize the subspace distance to the residual space. Our performance guarantee analysis indicates that SSMP accurately reconstructs any row K-sparse matrix of rank r in the full row rank scenario if the sampling matrix A satisfies krank(A) > K+1, which meets the fundamental minimum requirement on A to ensure exact recovery. We also show that SSMP guarantees exact reconstruction in at most K-r+r/L iterations, provided that A satisfies the restricted isometry property (RIP) of order L(K-r)+r+1 with δ_L(K-r)+r+1 < max{√(r)/√(K+r/4)+√(r/4), √(L)/√(K)+1.15 √(L)}, where L is the number of indices chosen in each iteration. This implies that the requirement on the RIP constant becomes less restrictive when r increases. Such behavior seems to be natural but has not been reported for most of conventional methods. We further show that if r=1, then by running more than K iterations, the performance guarantee of SSMP can be improved to δ_ 7.8K < 0.155. In addition, we show that under a suitable RIP condition, the reconstruction error of SSMP is upper bounded by a constant multiple of the noise power, which demonstrates the stability of SSMP under measurement noise. Finally, from extensive numerical experiments, we show that SSMP outperforms conventional joint sparse recovery algorithms both in noiseless and noisy scenarios.



There are no comments yet.


page 1

page 2

page 3

page 4


A Sharp Condition for Exact Support Recovery of Sparse Signals With Orthogonal Matching Pursuit

Support recovery of sparse signals from noisy measurements with orthogon...

Successful Recovery Performance Guarantees of Noisy SOMP

The simultaneous orthogonal matching pursuit (SOMP) is a popular, greedy...

An Optimal Restricted Isometry Condition for Exact Sparse Recovery with Orthogonal Least Squares

The orthogonal least squares (OLS) algorithm is popularly used in sparse...

Greedy Sparse Signal Recovery Algorithm Based on Bit-wise MAP detection

We propose a novel greedy algorithm for the support recovery of a sparse...

Reconstruction of jointly sparse vectors via manifold optimization

In this paper, we consider the challenge of reconstructing jointly spars...

Orthogonal subspace based fast iterative thresholding algorithms for joint sparsity recovery

Sparse signal recoveries from multiple measurement vectors (MMV) with jo...

When does OMP achieves support recovery with continuous dictionaries?

This paper presents new theoretical results on sparse recovery guarantee...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.