Here is what I received in my mailbox recently. The author wants to remain anonymous:
Since your blog has become the go-to place for all information related to CS, it would help if you could maintain a up-to-date comparison of all the recovery algorithms (OMP family/Basis Pursuit/ ???) that are being proposed. This could take the form of a table that includes error bounds, time and space complexity, a chart showing the phase transitions for these algorithms, links to papers, source code etc.
The chart could compare algorithm performance for standard matrices (eg Gaussian or Bernoulli) with respect to a single set of parameters (sparsity, undersampling ratio, signal type etc).
This would be a great help to anyone who wants to compare their work with the state-of-the-art, which is rapidly changing. Also, someone might just want to pick the best algorithm for a particular application, without being aware of all the work done in the field.
I am aware that individual papers do include such comparisons, but they go out of date quickly, or are not comprehensive enough.
Two throughts come to my mind:
- One of you had something along the lines of what is being described running on the cloud. It has for the moment remained private.
- If this is just for greedy algorithm, there is a way to not have to rely on Matlab, so my question is really, how much are people willing to pay to have the convenience of finding out these results ? I can set up a cloud based solution for this problem, but are there customers ?
- CS: Precise Undersampling Theorems (updated)
- CS: More Benchmarks, A fast algorithm for solutions to underdetermined systems, Adaptive compressed image sensing, Sparse Online Learning and a talk
- CS: Promoting a Larger Set of Compressive Sensing Benchmarks
- CS: Let us define the Current State of the Art, shall we ?
- CS: OPIs and Playing Dumb, Number of Measurements in Sparse Signal Recovery, Wyner-Ziv Image Coding, CfP