On the Difference Between Orthogonal Matching Pursuit and Orthogonal Least Squares

@inproceedings{Blumensath2007OnTD,
  title={On the Difference Between Orthogonal Matching Pursuit and Orthogonal Least Squares},
  author={Thomas Blumensath and Mike E. Davies},
  year={2007}
}
Greedy algorithms are often used to solve underdetermined inverse problems when the solution is constrain ed to be sparse, i.e. the solution is only expected to have a relati vely small number of non-zero elements. Two different algorithms have been suggested to solve such problems in the signal processing and control community, orthogonal Matching Pursui t and orthogonal Least Squares respectively. In the current literature, there exist a great deal of confusion between the two strateg ies… CONTINUE READING
Highly Cited
This paper has 113 citations. REVIEW CITATIONS

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 58 extracted citations

Multi-Channel Sparse Data Conversion With a Single Analog-to-Digital Converter

IEEE Journal on Emerging and Selected Topics in Circuits and Systems • 2012
View 5 Excerpts
Highly Influenced

An experimental study on application of Orthogonal Matching Pursuit algorithm for image denoising

2013 International Mutli-Conference on Automation, Computing, Communication, Control and Compressed Sensing (iMac4s) • 2013
View 3 Excerpts
Highly Influenced

Dual-Tree wavelet scattering network with parametric log transformation for object classification

2017 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) • 2017
View 1 Excerpt

Fast least squares pursuits for sparse recovery

2017 International Conference on Sampling Theory and Applications (SampTA) • 2017
View 1 Excerpt

Image reconstruction based on combination of modified CoSaMP and orthogonal wavelets

2017 International Conference on Intelligent Computing, Instrumentation and Control Technologies (ICICICT) • 2017
View 2 Excerpts

114 Citations

02040'10'12'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 114 citations based on the available data.

See our FAQ for additional information.

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Matching pursuits with time-frequency dictionaries

IEEE Trans. Signal Processing • 1993
View 13 Excerpts
Highly Influenced

Optimized orthogonal matching pursuit approach

IEEE Signal Processing Letters • 2002
View 4 Excerpts
Highly Influenced

Matrix computations (3. ed.)

View 3 Excerpts
Highly Influenced

Adaptive time-freque ncy decompositions

S. Mallat, G. Davis, Z. Zhang
SPIE Journal of Optical Engineering , vol. 33, pp. 2183–2191, July 1994. • 1994
View 5 Excerpts
Highly Influenced

Nataratjan, “Sparse approximat solutions to linea r systems,”SIAM

B K.
Journal on Computing , • 1995
View 2 Excerpts

Orthog onal matching pursuit: recursive function approximation with applicati ons to wavelet decomposition

Y. C. Pati, R. Rezaifar, P. S. Krishnaprasad
27h Asilomar Conf. on Signals, Systems and Comput. , Nov. 1993. • 1993
View 2 Excerpts

Similar Papers

Loading similar papers…