2.5k citations · 3.3k across the 61 of their papers we have counts for
Showing 2013 · cs.ITShow all
2 papers · 2 filters
cs.IT2013★ 29 cited
Parameterless Optimal Approximate Message Passing
Ali Mousavi, Arian Maleki, Richard G. Baraniuk
Iterative thresholding algorithms are well-suited for high-dimensional problems in sparse recovery and compressive sensing. The performance of this class of algorithms depends heav…
cs.IT2013★ 8 cited
Maximin Analysis of Message Passing Algorithms for Recovering Block Sparse Signals
Armeen Taeb, Arian Maleki, Christoph Studer +1
We consider the problem of recovering a block (or group) sparse signal from an underdetermined set of random linear measurements, which appear in compressed sensing applications su…