Mathematics – Numerical Analysis
Scientific paper
2008-12-11
Proc. Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA Oct. 2008
Mathematics
Numerical Analysis
Scientific paper
The two major approaches to sparse recovery are L1-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(NlogN), where N is the ambient dimension of the signal. This review summarizes these major advances.
Needell Deanna
Tropp Joel A.
Vershynin Roman
No associations
LandOfFree
Greedy Signal Recovery Review does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Greedy Signal Recovery Review, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Greedy Signal Recovery Review will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-61125