# Joint K-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares

@article{Soussen2013JointKA,
title={Joint K-Step Analysis of Orthogonal Matching Pursuit and Orthogonal Least Squares},
author={Charles Soussen and R{\'e}mi Gribonval and J{\'e}r{\^o}me Idier and C{\'e}dric Herzet},
journal={IEEE Transactions on Information Theory},
year={2013},
volume={59},
pages={3158-3174}
}
• Published 2 November 2011
• Mathematics
• IEEE Transactions on Information Theory
Tropp's analysis of orthogonal matching pursuit (OMP) using the exact recovery condition (ERC) is extended to a first exact recovery analysis of orthogonal least squares (OLS). We show that when the ERC is met, OLS is guaranteed to exactly recover the unknown support in at most k iterations where k denotes the support cardinality. Moreover, we provide a closer look at the analysis of both OMP and OLS when the ERC is not fulfilled. The existence of dictionaries for which some subsets are never…
89 Citations

## Figures from this paper

### Enhanced Recovery Conditions for OMP/OLS by Exploiting both Coherence and Decay

• Computer Science
• 2014
Conditions under which OMP and OLS succeed in recovering the true sparse vector are studied, expressed in terms of the mutual coherence of the dictionary $\mu$ and encompass, as particular cases, some well-known results of the literature.

### Unrecoverable subsets by OMP and Basis Pursuit

• Mathematics
• 2013
There is an extensive literature dedicated to the exact recovery of a given subset by Orthogonal Matching Pursuit (OMP) and Basis Pursuit (BP). We consider Tropp's exact recovery condition (ERC) for

### Sign preservation analysis of orthogonal greedy algorithms

• Computer Science
• 2020
It is proved that the weights of the selected atoms have the correct sign in the best current approximation at any of the K iterations, which allows for the first time an exact support recovery property based on mutual coherence for non-negative versions of OMP and OLS.

### Exact Recovery of Sparse Signals via Orthogonal Matching Pursuit: How Many Iterations Do We Need?

• Computer Science
• 2012
This analysis shows that OMP can accurately recover all $K-sparse signals within$\lceil 2.8 K \rceil\$ iterations when the measurement matrix satisfies a restricted isometry property (RIP).

### Signal Recovery in Uncorrelated and Correlated Dictionaries Using Orthogonal Least Squares

• Computer Science
ArXiv
• 2016
This paper shows that a method in the least squares family, known in the literature as Orthogonal Least Squares (OLS), adapted for compressed recovery problems, has competitive recovery performance and computation complexity, that makes it a suitable alternative to popular greedy methods like orthogonal Matching Pursuit (OMP).

### Recovery Conditions of Sparse Signals Using Orthogonal Least Squares-Type Algorithms

• L. Lu
• Computer Science
• 2022
The results indicate that for K-sparse signals, when MIP or SNR satisfies certain conditions, OLS and MOLS obtain reliable reconstruction in at most K iterations, while BOLS succeeds in at least K/d iterations where d is the block length.

### Exact Recovery of Sparse Signals Using Orthogonal Matching Pursuit: How Many Iterations Do We Need?

• Computer Science
IEEE Transactions on Signal Processing
• 2016
This analysis shows that OMP can accurately recover all K-sparse signals within [2.8 K] iterations when the measurement matrix satisfies a restricted isometry property (RIP).

### Coherence-based Partial Exact Recovery Condition for OMP/OLS

• Computer Science
ArXiv
• 2012
This work addresses the exact recovery of the support of a k-sparse vector with orthogonal Matching Pursuit and Orthogonal Least Squares in a noiseless setting and derives a new sufficient and worst-case necessary condition for their success in k steps.

## References

SHOWING 1-10 OF 52 REFERENCES

### Analysis of Orthogonal Matching Pursuit Using the Restricted Isometry Property

• Computer Science
IEEE Transactions on Information Theory
• 2010
This paper demonstrates that the restricted isometry property (RIP) can be used for a very straightforward analysis of OMP and concludes that the RIP of order K+1 (with isometry constant δ <; [ 1/( 3√K)]) is sufficient for OMP to exactly recover any K-sparse signal.

### On the Difference Between Orthogonal Matching Pursuit and Orthogonal Least Squares

• Mathematics
• 2007
Greedy algorithms are often used to solve under- determined inverse problems when the solution is constrained to be sparse, i.e. the solution is only expected to have a relati vely small number of

### Sparse Solution of Underdetermined Systems of Linear Equations by Stagewise Orthogonal Matching Pursuit

• Computer Science
IEEE Transactions on Information Theory
• 2012
Stagewise Orthogonal Matching Pursuit (StOMP) successively transforms the signal into a negligible residual, and numerical examples showing that StOMP rapidly and reliably finds sparse solutions in compressed sensing, decoding of error-correcting codes, and overcomplete representation are given.

### Orthogonal Matching Pursuit from Noisy Measurements : A New Analysis ∗

• Computer Science
• 2009
This work strengthens the result by showing that a lower number of measurements, m = 2k log(n − k), is in fact sufficient for asymptotic recovery and is also sufficient for detection of the spars ity pattern (support) of the vector with measurement errors provided the signal-t o-noise ratio (SNR) scales to infinity.

### Orthogonal Matching Pursuit From Noisy Random Measurements: A New Analysis

• Computer Science
NIPS
• 2009
This work strengthens the result that orthogonal matching pursuit can recover a k-sparse n-dimensional real vector from m = 4k log(n) noise-free linear measurements obtained through a random Gaussian measurement matrix by showing that a lower number of measurements is in fact sufficient for asymptotic recovery.

### Signal Recovery From Random Measurements Via Orthogonal Matching Pursuit

• Computer Science
IEEE Transactions on Information Theory
• 2007
This paper demonstrates theoretically and empirically that a greedy algorithm called orthogonal matching pursuit (OMP) can reliably recover a signal with m nonzero entries in dimension d given O(m ln

### Forward sequential algorithms for best basis selection

• Computer Science
• 1999
Experimental results are presented which demonstrate that the ORMP method is the best procedure in terms of its ability to give the most compact signal representation, followed by MMP and then BMP which gives the poorest results.

### Greedy Deconvolution of Point-like Objects

• Computer Science
• 2009
A recovery condition is derived which uses the kind of structure one assumes on the signal and works without the concept of coherence and is applied exemplarily to Dirac peaks convolved with Gaussian kernel as used in mass spectrometry.

### A Remark on the Restricted Isometry Property in Orthogonal Matching Pursuit

• Mathematics
IEEE Transactions on Information Theory
• 2012
This result positively verifies the conjecture given by Dai and Milenkovic in 2009 that a greedy algorithm called Orthogonal Matching Pursuit (OMP) can recover every K-sparse signal x in K iterations from Ax.

### Sparse Recovery With Orthogonal Matching Pursuit Under RIP

• Tong Zhang
• Computer Science
IEEE Transactions on Information Theory
• 2011
It is shown that if the restricted isometry property (RIP) is satisfied at sparsity level <i>O</i>(k̅), then OMP can stably recover a k̅-sparse signal in 2-norm under measurement noise.