285 citations · 499 across the 55 of their papers we have counts for
3 papers · 1 filter
Quantitative recovery conditions for tree-based compressed sensing
Coralia Cartis, Andrew Thompson
As shown in [Blumensath and Davies 2009, Baraniuk et al. 2010], signals whose wavelet coefficients exhibit a rooted tree structure can be recovered using specially-adapted compress…
Compressed Sensing: How sharp is the Restricted Isometry Property
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner
Compressed Sensing (CS) seeks to recover an unknown vector with entries by making far fewer than measurements; it posits that the number of compressed sensing measurements…
Phase Transitions for Greedy Sparse Approximation Algorithms
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner +1
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, so…