Fetching the paper…
Reading the bibliography…
Suppose that we observe noisy linear measurements of an unknown signal that can be modeled as the sum of two component signals, each of which arises from a nonlinear sub-manifold of a high dimensional ambient space.
“Extensions of Lipschitz mappings into a Hilbert space,”
W. Johnson and J. Lindenstrauss, · 1982
Earlier work this paper cites.
“Atomic decomposition by basis pursuit,”
S. Chen, D. Donoho, and M. Saunders, · 1998
Earlier work this paper cites.
“A generalized uncertainty principle and sparse representation in pairs of bases,”
M. Elad and A. Bruckstein, · 2002
Earlier work this paper cites.
“On sparse representation in pairs of bases,”
A. Feuer and A. Nemirovski, · 2003
Earlier work this paper cites.
“Sparse representations in unions of bases,”
R. Gribonval and M. Nielsen, · 2003
Earlier work this paper cites.
“Greed is good: Algorithmic results for sparse approximation,”
J. Tropp, · 2004
Earlier work this paper cites.
“An iterative thresholding algorithm for linear inverse problems with a sparsity constraint.,”
I. Daubechies, M. Defrise, and C. De Mol, · 2004
Earlier work this paper cites.
“Simultaneous cartoon and texture image inpainting using morphological component analysis,”
M. Elad, J.-L. Starck, P. Querre, and D. Donoho, · 2005
Earlier work this paper cites.
“Image manifolds which are isometric to euclidean space,”
C. Grimes and D. Donoho, · 2005
Earlier work this paper cites.
“High-resolution navigation on non-differentiable image manifolds,”
M. Wakin, D. Donoho, H. Choi, and R. Baraniuk, · 2005
Earlier work this paper cites.
“Compressive sampling,”
E. Candès, · 2006
Cited alongside, same era.
“Compressed sensing,”
D. Donoho, · 2006
Cited alongside, same era.
The Geometry of Low-Dimensional Signal Models
M. Wakin, · 2006
Cited alongside, same era.
“Compressed sensing and robust recovery of low rank matrices,”
M. Fazel, E. Candès, B. Recht, and P. Parrilo, · 2008
Cited alongside, same era.
“Sparse and low-rank matrix decompositions,”
V. Chandrasekaran, S. Sanghavi, P. Parrilo, and A. Willsky, · 2009
Cited alongside, same era.
“Iterative hard thresholding for compressive sensing,”
T. Blumensath and M. Davies, · 2009
Cited alongside, same era.
“Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property,”
“Guaranteed rank minimization via singular value projection,”
R. Meka, P. Jain, and I. Dhillon, · 2010
Later among the works it cites.
“The augmented Lagrange multiplier method for exact recovery of corrupted low-rank matrices,”
Z. Lin, M. Chen, L. Wu, and Y. Ma, · 2010
Later among the works it cites.
“Signal processing with compressive measurements,”
M. Davenport, P. Boufounos, M. Wakin, and R. Baraniuk, · 2010
Later among the works it cites.
“Robust principal component analysis?,”
E. Candès, X. Li, Y. Ma, and J. Wright, · 2011
Later among the works it cites.
“Iterative projections for signal identification on manifolds,”
P. Shah and V. Chandrasekharan, · 2011
Later among the works it cites.
“Recipes for hard thresholding methods,”
A. Kyrillidis and V. Cevher, · 2011
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
R. Garg and R. Khandekar, · 2009
Cited alongside, same era.
“Message passing algorithms for compressed sensing,”
D. Donoho, A. Maleki, and A. Montanari, · 2009
Cited alongside, same era.
“Random projections of smooth manifolds,”
R. Baraniuk and M. Wakin, · 2009
Cited alongside, same era.
Later among the works it cites.
“SpaRCS: Recovering low-rank and sparse matrices from compressive measurements,”
A. Waters, A. Sankaranarayanan, and R. Baraniuk, · 2011
Later among the works it cites.
“Sharp recovery bounds for convex deconvolution, with applications,”
M. McCoy and J. Tropp, · 2012
Closest in time.
“Recovery of sparsely corrupted signals,”
C. Studer, P. Kuppinger, G. Pope, and H. Bölcskei, · 2012
Closest in time.