Fetching the paper…
Reading the bibliography…
Demixing is the problem of identifying multiple structured signals from a superimposed, undersampled, and noisy observation.
Separation properties of convex cones
Victor L. Klee, Jr · 1955
Earlier work this paper cites.
Convex analysis
R. Tyrrell Rockafellar · 1970
Earlier work this paper cites.
Non-linear angle-sum relations for polyhedral cones and polytopes
Peter McMullen · 1975
Earlier work this paper cites.
Integral geometry and geometric probability
Luis A. Santaló · 1976
Earlier work this paper cites.
Deconvolution with the l1 norm
Howard L. Taylor, Stephen C. Banks, and John F. McCoy · 1979
Earlier work this paper cites.
Uncertainty principles and signal recovery
David L. Donoho and Philip B. Stark · 1989
Earlier work this paper cites.
Integralgeometrie konvexer Körper im sphärischen Raumrischen Raum
Stefan Glasauer · 1995
Earlier work this paper cites.
Some remarks on greedy algorithms
Ronald A. DeVore and Vladimir N. Temlyakov · 1996
Earlier work this paper cites.
Sparse solutions to linear inverse problems with multiple measurement vectors
Bhaskar D. Rao and Kenneth Kreutz-Delgado · 1998
Earlier work this paper cites.
Uncertainty principles and ideal atomic decomposition
David L. Donoho and Xiaoming Huo · 2001
Earlier work this paper cites.
Matrix rank minimization with applications
Maryam Fazel · 2002
Earlier work this paper cites.
Measure Theory
David H. Fremlin · 2003
Earlier work this paper cites.
Source localization by enforcing sparsity through a Laplacian prior: an SVD-based approach
Dmitry M. Malioutov, Müjdat Çetin, and Alan S. Willsky · 2003
Earlier work this paper cites.
Astronomical image representation by the curvelet transform
Jean-Luc Starck, David L. Donoho, and Emmanuel J. Candès · 2003
Earlier work this paper cites.
Nonlinear methods of approximation
Vladimir N. Temlyakov · 2003
Earlier work this paper cites.
Decoding by linear programming
Emmanuel J. Candès and Terence Tao · 2005
Earlier work this paper cites.
Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
Michael Elad, Jean-Luc Starck, Philippe Querre, and David L. Donoho · 2005
Earlier work this paper cites.
Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
Michael Elad, Jean-Luc Starck, Philippe Querre, and David L. Donoho · 2005
Earlier work this paper cites.
Morphological diversity and source separation
Jérôme Bobin, Yassir Moudden, and Jean-Luc Starck · 2006
Earlier work this paper cites.
Compressed sensing
David L. Donoho · 2006
Earlier work this paper cites.
Morphological component analysis: an adaptive thresholding strategy
Jérôme Bobin, Jean-Luc Starck, Jalal M Fadili, Yassir Moudden, and David L. Donoho · 2007
Cited alongside, same era.
Sparsity and morphological diversity in blind source separation
Jérôme Bobin, Jean-Luc Starck, Jalal Fadili, and Yassir Moudden · 2007
Cited alongside, same era.
How to generate random matrices from the classical compact groups
Francesco Mezzadri · 2007
Cited alongside, same era.
Graph implementations for nonsmooth convex programs
Michael Grant and Stephen Boyd · 2008
Cited alongside, same era.
Stochastic and Integral Geometry
Rolf Schneider and Wolfgang Weil · 2008
Cited alongside, same era.
On the linear independence of spikes and sines
Joel A. Tropp · 2008
Cited alongside, same era.
Probability of unique integer solution to a system of linear equations
Olvi L. Mangasarian and Benjamin Recht · 2011
Later among the works it cites.
Two proposals for robust PCA using semidefinite programming
Michael B. McCoy and Joel A. Tropp · 2011
Later among the works it cites.
SpaRCS: Recovering low-rank and sparse matrices from compressive measurements
Andrew E. Waters, Aswin C. Sankaranarayanan, and Richard Baraniuk · 2011
Later among the works it cites.
The LASSO risk for Gaussian matrices
Mohsen Bayati and Andrea Montanari · 2012
Later among the works it cites.
The convex geometry of linear inverse problems
Venkat Chandrasekaran, Benjamin Recht, Pablo A. Parrilo, and Alan S. Willsky · 2012
Later among the works it cites.
Sharp recovery bounds for convex deconvolution, with applications
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Sparse and low-rank matrix decompositions
Venkat Chandrasekaran, Sujay Sanghavi, Pablo A. Parrilo, and Alan S. Willsky · 2009
Cited alongside, same era.
A wavelet tour of signal processing
Stéphane G. Mallat · 2009
Cited alongside, same era.
On the reconstruction of block-sparse signals with an optimal number of measurements
Mihailo Stojnic, Farzad Parvaresh, and Babak Hassibi · 2009
Cited alongside, same era.
Dense error correction via l1-minimization
John Wright and Yi Ma · 2009
Cited alongside, same era.
Latent variable graphical model selection via convex optimization
Venkat Chandrasekaran, Pablo A. Parrilo, and Alan S. Willsky · 2010
Cited alongside, same era.
Counting the faces of randomly-projected hypercubes and orthants, with applications
David L. Donoho and Jared Tanner · 2010
Cited alongside, same era.
Michael B. McCoy and Joel A. Tropp · 2012
Later among the works it cites.
RASL: Robust alignment by sparse and low-rank decomposition for linearly correlated images
Yigang Peng, Arvind Ganesh, John Wright, Wenli Xu, and Yi Ma · 2012
Later among the works it cites.
Recovery of sparsely corrupted signals
Christoph Studer, Patrick Kuppinger, Graeme Pope, and Helmut Bölcskei · 2012
Later among the works it cites.
Robust PCA via outlier pursuit
Huan Xu, Constantine Caramanis, and Sujay Sanghavi · 2012
Later among the works it cites.
Living on the edge: A geometric theory of phase transitions in convex optimization
Dennis Amelunxen, Martin Lotz, Michael B. McCoy, and Joel A. Tropp · 2013
Closest in time.
Low-rank matrix recovery from errors and erasures
Yudong Chen, Ali Jalali, Sujay Sanghavi, and Constantine Caramanis · 2013
Closest in time.
Corrupted sensing: Novel guarantees for separating structured signals
Rina Foygel and Lester Mackey · 2013
Closest in time.
Compressed sensing and matrix completion with constant proportion of corruptions
Xiaodong Li · 2013
Closest in time.
A geometric analysis of convex demixing
Michael B. McCoy · 2013
Closest in time.
From steiner formulas for cones to concentration of intrinsic volumes
Michael B. McCoy and Joel A. Tropp · 2013
Closest in time.
Exact recoverability from dense corrupted observations via
Nam H. Nguyen and Trac D. Tran · 2013
Closest in time.
Probabilistic recovery guarantees for sparsely corrupted signals
Graeme Pope, Annina Bracher, and Christoph Studer · 2013
Closest in time.
Sparse nonnegative deconvolution for compressive calcium imaging: algorithms and phase transitions
Eftychios A. Pnevmatikakis and Liam Paninski · 2013
Closest in time.
A framework to characterize performance of lasso algorithms
Mihailo Stojnic · 2013
Closest in time.
Compressive principal component pursuit
John Wright, Arvind Ganesh, Kerui Min, and Yi Ma · 2013
Closest in time.