2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2012
DOI: 10.1109/icassp.2012.6288748
|View full text |Cite
|
Sign up to set email alerts
|

Robustness of orthogonal matching pursuit for multiple measurement vectors in noisy scenario

Abstract: In this paper, we consider orthogonal matching pursuit (OMP) algorithm for multiple measurement vectors (MMV) problem. The robustness of OMPMMV is studied under general perturbationswhen the measurement vectors as well as the sensing matrix are incorporated with additive noise. The main result shows that although exact recovery of the sparse solutions is unrealistic in noisy scenario, recovery of the support set of the solutions is guaranteed under suitable conditions. Specifically, a sufficient condition is d… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2013
2013
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 13 publications
(8 citation statements)
references
References 11 publications
(22 reference statements)
0
8
0
Order By: Relevance
“…Regarding older works, it is also worth pointing out that the ERC δ |S|+1 < 1/((1+ √ 2) |S|), first obtained in [17, Theorem 5.2] for OMP, has been shown to remain valid for SOMP in [11,Corollary 1]. Thereby, the authors of [11] also proved that the older ERC δ |S|+1 < 1/(3 |S|), initially derived in [8, Theorem 3.1] for OMP, remains correct for SOMP as δ |S|+1 < 1/(3 |S|) is implied by δ |S|+1 < 1/((1 + √ 2) |S|). Very recently, (ERC2) was extended to SOMP in [27,Remark 1].…”
Section: Contribution and Related Workmentioning
confidence: 93%
“…Regarding older works, it is also worth pointing out that the ERC δ |S|+1 < 1/((1+ √ 2) |S|), first obtained in [17, Theorem 5.2] for OMP, has been shown to remain valid for SOMP in [11,Corollary 1]. Thereby, the authors of [11] also proved that the older ERC δ |S|+1 < 1/(3 |S|), initially derived in [8, Theorem 3.1] for OMP, remains correct for SOMP as δ |S|+1 < 1/(3 |S|) is implied by δ |S|+1 < 1/((1 + √ 2) |S|). Very recently, (ERC2) was extended to SOMP in [27,Remark 1].…”
Section: Contribution and Related Workmentioning
confidence: 93%
“…Modifying from (25) and ignoring the quantization error, we can get a delay-quantized on-grid model for the measurements from N d OFDM symbols as Y(n t , n r ) = C τ P(n t , n r )D g (n t , n r )V d…”
Section: B High-resolution Approach: 1d Compressive Sensingmentioning
confidence: 99%
“…Resolution for τ and f D, may be improved by using traditional super-resolution spectrum analysis techniques such as 2D-ESPRIT [16] and 2-D Matrix Pencil [17], [18], based on the signal model in (25). However, these techniques require the number of measurements to be larger than the number of multipath signals in each dimension.…”
Section: B High-resolution Approach: 1d Compressive Sensingmentioning
confidence: 99%
“…Similarly, there exist three main approaches for solving MMVs. The first approach is the extended version of the greedy-based SMV solvers such as MMV basic matching pursuit (M-BMP), MMV order recursive matching pursuit (M-ORMP), and MMV orthogonal matching pursuit (M-OMP) [ 17 , 18 , 19 ]. The second approach is relaxed-to-be-convex algorithms such as the joint approximation algorithm (JLZA) [ 20 ].…”
Section: Background and Introductionmentioning
confidence: 99%