Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing

Details Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing

2009-09-03

arxiv.org/abs/0909.0777v1

Computer Science

Numerical Analysis

12 pages, 14 figures

Scientific paper

We conducted an extensive computational experiment, lasting multiple CPU-years, to optimally select parameters for two important classes of algorithms for finding sparse solutions of underdetermined systems of linear equations. We make the optimally tuned implementations available at {\tt sparselab.stanford.edu}; they run `out of the box' with no user tuning: it is not necessary to select thresholds or know the likely degree of sparsity. Our class of algorithms includes iterative hard and soft thresholding with or without relaxation, as well as CoSaMP, subspace pursuit and some natural extensions. As a result, our optimally tuned algorithms dominate such proposals. Our notion of optimality is defined in terms of phase transitions, i.e. we maximize the number of nonzeros at which the algorithm can successfully operate. We show that the phase transition is a well-defined quantity with our suite of random underdetermined linear systems. Our tuning gives the highest transition possible within each class of algorithms.

Affiliated with

Also associated with

No associations

Rating

Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing 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 Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimally Tuned Iterative Reconstruction Algorithms for Compressed Sensing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-35305