Fetching the paper…
Reading the bibliography…
Demixing refers to the challenge of identifying two structured signals given only the sum of the two signals and prior information about their structures.
Separation properties of convex cones
V. L. Klee, Jr · 1955
Earlier work this paper cites.
On the geometrical moments of skew-regular simplices in hyperspherical space, with some applications in geometry and mathematical statistics
H. Ruben · 1960
Earlier work this paper cites.
Convex polytopes
B. Grünbaum · 1967
Earlier work this paper cites.
Grassmann angles of convex polytopes
B. Grünbaum · 1968
Earlier work this paper cites.
Robust modeling with erratic data
J. F. Claerbout and F. Muir · 1973
Earlier work this paper cites.
Non-linear angle-sum relations for polyhedral cones and polytopes
P. McMullen · 1975
Earlier work this paper cites.
Deconvolution with the l1 norm
H. L. Taylor, S. C. Banks, and J. F. McCoy · 1979
Earlier work this paper cites.
An analog scrambling scheme which does not expand bandwidth, part I: Discrete time
A. D. Wyner · 1979
Earlier work this paper cites.
An analog scrambling scheme which does not expand bandwidth, part II: Continuous time
A. D. Wyner · 1979
Earlier work this paper cites.
Linear inversion of band-limited reflection seismograms
F. Santosa and W. W. Symes · 1986
Earlier work this paper cites.
An asymptotic estimate for the average number of steps in the parametric simplex method
A. M. Vershik and P. V. Sporyshev · 1986
Earlier work this paper cites.
Elliptically contoured distributions
Y. Gordon · 1987
Earlier work this paper cites.
On Milman’s inequality and random subspaces which escape through a mesh in
Y. Gordon · 1988
Earlier work this paper cites.
Uncertainty principles and signal recovery
D. L. Donoho and P. B. Stark · 1989
Earlier work this paper cites.
Random projections of regular simplices
F. Affentranger and R. Schneider · 1992
Earlier work this paper cites.
Integralgeometrie konvexer Korper im spharischen Raum
S. Glasauer · 1995
Earlier work this paper cites.
Some remarks on greedy algorithms
R. A. DeVore and V. N. Temlyakov · 1996
Earlier work this paper cites.
Integral geometry of spherically convex bodies
S. Glasauer · 1996
Earlier work this paper cites.
Convex Analysis
R. T. Rockafellar · 1997
Earlier work this paper cites.
Variational Analysis
R. T. Rockafellar and R. J.-B. Wets · 1998
Earlier work this paper cites.
Random projections of regular polytopes
K. Böröczky, Jr. and M. Henk · 1999
Earlier work this paper cites.
Atomic decomposition by basis pursuit
S. S. Chen, D. L. Donoho, and M. A. Saunders · 1999
Earlier work this paper cites.
The geometry of semidefinite programming
G. Pataki · 2000
Earlier work this paper cites.
Uncertainty principles and ideal atomic decomposition
D. L. Donoho and X. Huo · 2001
Earlier work this paper cites.
Matrix rank minimization with applications
M. Fazel · 2002
Earlier work this paper cites.
Astronomical image representation by the curvelet transform
J.-L. Starck, D. L. Donoho, and E. J. Candès · 2003
Earlier work this paper cites.
Nonlinear methods of approximation
V. N. Temlyakov · 2003
Earlier work this paper cites.
Neighborly polytopes and sparse solutions of underdetermined linear equations
D. L. Donoho · 2004
Earlier work this paper cites.
Sparse solutions to linear inverse problems with multiple measurement vectors
S. F. Cotter, B. D. Rao, K. Engan, and K. Kreutz-Delgado · 2005
Earlier work this paper cites.
Neighborliness of randomly projected simplices in high dimensions
D. L. Donoho and J. Tanner · 2005
Earlier work this paper cites.
Simultaneous cartoon and texture image inpainting using morphological component analysis (MCA)
M. Elad, J.-L. Starck, P. Querre, and D. L. Donoho · 2005
Cited alongside, same era.
Image decomposition via the combination of sparse representations and a variational approach
J.-L. Starck, M. Elad, and D. L. Donoho · 2005
Cited alongside, same era.
Morphological diversity and source separation
J. Bobin, Y. Moudden, and J.-L. Starck · 2006
Cited alongside, same era.
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
E. J. Candès, J. Romberg, and T. Tao · 2006
Cited alongside, same era.
Compressed sensing
D. L. Donoho · 2006
Cited alongside, same era.
High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension
D. L. Donoho · 2006
Guaranteed minimum-rank solutions of linear matrix equations via nuclear norm minimization
B. Recht, M. Fazel, and P. A. Parrilo · 2010
Later among the works it cites.
Dense error correction via
J. Wright and Y. Ma · 2010
Later among the works it cites.
Robust PCA via outlier pursuit
H. Xu, C. Caramanis, and S. Sanghavi · 2010
Later among the works it cites.
Breaking through the thresholds: an analysis for iterative reweighted
W. Xu, A. Khajehnejad, A. S. Avestimehr, and B. Hassibi · 2010
Later among the works it cites.
Geometric analysis of the condition of the convex feasibility problem
D. Amelunxen · 2011
Later among the works it cites.
Compressed sensing with coherent and redundant dictionaries
E. J. Candès, Y. C. Eldar, D. Needell, and P. Randall · 2011
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Sparsity and morphological diversity in blind source separation
J. Bobin, J.-L. Starck, J. Fadili, and Y. Moudden · 2007
Cited alongside, same era.
Analysis versus synthesis in signal priors
M. Elad, P. Milanfar, and R. Rubinstein · 2007
Cited alongside, same era.
How to generate random matrices from the classical compact groups
F. Mezzadri · 2007
Cited alongside, same era.
Graph implementations for nonsmooth convex programs
M. Grant and S. Boyd · 2008
Cited alongside, same era.
Stochastic and Integral Geometry
R. Schneider and W. Weil · 2008
Cited alongside, same era.
On the linear independence of spikes and sines
J. A. Tropp · 2008
Cited alongside, same era.
Robust principal component analysis?
E. J. Candès, X. Li, Y. Ma, and J. Wright · 2011
Later among the works it cites.
Rank-sparsity incoherence for matrix decomposition
V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky · 2011
Later among the works it cites.
Analyzing weighted
A. Khajehnejad, W. Xu, A. S. Avestimehr, and B. Hassibi · 2011
Later among the works it cites.
Probability of unique integer solution to a system of linear equations
O. L. Mangasarian and B. Recht · 2011
Later among the works it cites.
Two proposals for robust PCA using semidefinite programming
M. B. McCoy and J. A. Tropp · 2011
Later among the works it cites.
Precise stability phase transitions for
W. Xu and B. Hassibi · 2011
Later among the works it cites.
Audio inpainting
A. Adler, V. Emiya, M. G. Jafari, M. Elad, R. Gribonval, and M. D. Plumbley · 2012
Closest in time.
Intrinsic volumes of symmetric cones
D. Amelunxen and P. Bürgisser · 2012
Closest in time.
Universality in polytope phase transitions and message passing algorithms
M. Bayati, M. Lelarge, and A. Montanari · 2012
Closest in time.
The convex geometry of linear inverse problems
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky · 2012
Closest in time.
http://dlmf.nist.gov/, Release 1.0.5 of 2012-10-01
NIST Digital Library of Mathematical Functions · 2012
Closest in time.
Signal recovery on incoherent manifolds
C. Hegde and R. G. Baraniuk · 2012
Closest in time.
Restricted strong convexity and weighted matrix completion: optimal bounds with noise
S. Negahban and M. J. Wainwright · 2012
Closest in time.
Recovery of sparsely corrupted signals
C. Studer, P. Kuppinger, G. Pope, and H. Bölcskei · 2012
Closest in time.
Robust PCA via outlier pursuit
H. Xu, C. Caramanis, and S. Sanghavi · 2012
Closest in time.
Living on the edge: A geometric theory of phase transitions in convex optimization
D. Amelunxen, M. Lotz, M. B. McCoy, and J. A. Tropp · 2013
Closest in time.
Corrupted sensing: Novel guarantees for separating structured signals
R. Foygel and L. Mackey · 2013
Closest in time.
The achievable performance of convex demixing
M. B. McCoy and J. A. Tropp · 2013
Closest in time.
Exact recoverability from dense corrupted observations via
N. H. Nguyen and T. D. Tran · 2013
Closest in time.
Asymptotically exact denoising in relation to compressed sensing
S. Oymak and B. Hassibi · 2013
Closest in time.
Probabilistic recovery guarantees for sparsely corrupted signals
G. Pope, A. Bracher, and C. Studer · 2013
Closest in time.
A framework to characterize performance of lasso algorithms
M. Stojnic · 2013
Closest in time.
Near minimax line spectral estimation
G. Tang, B. N. Bhaskar, and B. Recht · 2013
Closest in time.
Compressive principal component pursuit
J. Wright, A. Ganesh, K. Min, and Y. Ma · 2013
Closest in time.