Successful Recovery Performance Guarantees of Noisy SOMP

08/31/2021
by   Wei Zhang, et al.
0

The simultaneous orthogonal matching pursuit (SOMP) is a popular, greedy approach for common support recovery of a row-sparse matrix. The support recovery guarantee of SOMP has been extensively studied under the noiseless scenario. Compared to the noiseless scenario, the performance analysis of noisy SOMP is still nascent, in which only the restricted isometry property (RIP)-based analysis has been studied. In this paper, we present the mutual incoherence property (MIP)-based study for performance analysis of noisy SOMP. Specifically, when noise is bounded, we provide the condition on which the exact support recovery is guaranteed in terms of the MIP. When noise is unbounded, we instead derive a bound on the successful recovery probability (SRP) that depends on the specific distribution of noise. Then we focus on the common case when noise is random Gaussian and show that the lower bound of SRP follows Tracy-Widom law distribution. The analysis reveals the number of measurements, noise level, the number of sparse vectors, and the value of MIP constant that are required to guarantee a predefined recovery performance. Theoretically, we show that the MIP constant of the measurement matrix must increase proportional to the noise standard deviation, and the number of sparse vectors needs to grow proportional to the noise variance. Finally, we extensively validate the derived analysis through numerical simulations.

READ FULL TEXT

page 20

page 21

page 22

page 23

research
12/30/2019

Joint Sparse Recovery Using Signal Space Matching Pursuit

In this paper, we put forth a new joint sparse recovery algorithm called...
research
08/08/2016

Sparse recovery via Orthogonal Least-Squares under presence of Noise

We consider the Orthogonal Least-Squares (OLS) algorithm for the recover...
research
03/29/2013

A problem dependent analysis of SOCP algorithms in noisy compressed sensing

Under-determined systems of linear equations with sparse solutions have ...
research
01/11/2019

Precise Performance Analysis of the Box-Elastic Net under Matrix Uncertainties

In this letter, we consider the problem of recovering an unknown sparse ...
research
08/12/2020

Signal-Dependent Performance Analysis of Orthogonal Matching Pursuit for Exact Sparse Recovery

Exact recovery of K-sparse signals x ∈ℝ^n from linear measurements y=Ax,...
research
01/19/2018

Sparse recovery based on q-ratio constrained minimal singular values

We study verifiable sufficient conditions and computable performance bou...
research
10/25/2021

Support Recovery Guarantees for Periodic Signals with Nested Periodic Dictionaries

Periodic signals composed of periodic mixtures admit sparse representati...

Please sign up or login with your details

Forgot password? Click here to reset