2010
DOI: 10.1109/jstsp.2010.2042412
|View full text |Cite
|
Sign up to set email alerts
|

Signal Recovery From Incomplete and Inaccurate Measurements Via Regularized Orthogonal Matching Pursuit

Abstract: Abstract. We demonstrate a simple greedy algorithm that can reliably recover a vector v ∈ R d from incomplete and inaccurate measurements x = Φv + e. Here Φ is a N × d measurement matrix with N ≪ d, and e is an error vector. Our algorithm, Regularized Orthogonal Matching Pursuit (ROMP), seeks to close the gap between two major approaches to sparse recovery. It combines the speed and ease of implementation of the greedy methods with the strong guarantees of the convex programming methods.For any measurement mat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

4
485
0
3

Year Published

2012
2012
2019
2019

Publication Types

Select...
5
3
1

Relationship

0
9

Authors

Journals

citations
Cited by 779 publications
(492 citation statements)
references
References 20 publications
4
485
0
3
Order By: Relevance
“…However, recent research has clarified that Greedy methods succeed empirically and theoretically in many situations where convex relaxation works. Some Greedy methods can actually have performance guarantees that match those obtained for convex optimization approaches [39]. In this paper, we focus on the convex optimization methods with the application to SAIRs.…”
Section: Principles Of Csmentioning
confidence: 99%
“…However, recent research has clarified that Greedy methods succeed empirically and theoretically in many situations where convex relaxation works. Some Greedy methods can actually have performance guarantees that match those obtained for convex optimization approaches [39]. In this paper, we focus on the convex optimization methods with the application to SAIRs.…”
Section: Principles Of Csmentioning
confidence: 99%
“…Tropp and Gilbert point out that matching pursuit (MP) algorithm and Orthogonal matching pursuit (OMP) [2] algorithm can guarantee a good reconstruction result with lower computational complexity. With the development and progress of CS, many algorithms based on the principle of Matching pursuit are proposed, for example: Stagewise orthogonal matching pursuit (StOMP) [5], Regularized orthogonal matching pursuit (ROMP) [6], etc. At the same time, in order to achieve a better reconstruction result, another kind of algorithm is proposed, which uses sparse matrix as measurements matrix taking sample.…”
Section: Donoho In 2006mentioning
confidence: 99%
“…Based on the theory of sparse representation [8], we formulate the following optimization problem to restore the feature vector from Eq. (9):…”
Section: The Restoration Of the Phase Contrast Imagesmentioning
confidence: 99%
“…We propose an iterative optimization algorithm to solve this min-ℓ 1 optimization problem since it is known that there is no closed-form solution for such a problem. We first search the best-matching N bases in the dictionary {H m } with the matching pursuit algorithm [8], and then utilize a non-negative multiplicative updating method [9] to obtain the nonnegative feature vectors {Ψ m k }. The procedure is described in Algorithm 1.…”
Section: The Restoration Of the Phase Contrast Imagesmentioning
confidence: 99%