A Caltech Library Service

Greedy Signal Recovery Review

Needell, Deanna and Tropp, Joel and Vershynin, Roman (2008) Greedy Signal Recovery Review. In: 2008 42nd Asilomar Conference on Signals, Systems and Computers. IEEE , Piscataway, NJ, pp. 1048-1050. ISBN 978-1-4244-2941-7.

[img] PDF - Published Version
See Usage Policy.

[img] PDF - Accepted Version
See Usage Policy.


Use this Persistent URL to link to this item:


The two major approaches to sparse recovery are L_1-minimization and greedy methods. Recently, Needell and Vershynin developed regularized orthogonal matching pursuit (ROMP) that has bridged the gap between these two approaches. ROMP is the first stable greedy algorithm providing uniform guarantees. Even more recently, Needell and Tropp developed the stable greedy algorithm compressive sampling matching pursuit (CoSaMP). CoSaMP provides uniform guarantees and improves upon the stability bounds and RIC requirements of ROMP. CoSaMP offers rigorous bounds on computational cost and storage. In many cases, the running time is just O(N log N), where N is the ambient dimension of the signal. This review summarizes these major advances.

Item Type:Book Section
Related URLs:
URLURL TypeDescription Paper
Needell, Deanna0000-0002-8058-8638
Tropp, Joel0000-0003-1024-1791
Additional Information:© 2008 IEEE.
Record Number:CaltechAUTHORS:20180831-112109709
Persistent URL:
Official Citation:D. Needell, J. Tropp and R. Vershynin, "Greedy signal recovery review," 2008 42nd Asilomar Conference on Signals, Systems and Computers, Pacific Grove, CA, 2008, pp. 1048-1050. doi: 10.1109/ACSSC.2008.5074572
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:89330
Deposited By: George Porter
Deposited On:04 Sep 2018 15:04
Last Modified:16 Nov 2021 00:34

Repository Staff Only: item control page