Fetching the paper…
Reading the bibliography…
We study the problem of corrupted sensing, a generalization of compressed sensing in which one aims to recover a signal from a collection of corrupted or unreliable measurements.
J. T. Chu, “A modified wallis product and some applications,” The American Mathematical Monthly , vol. 69, no. 5, pp. pp. 402–404, 1962
1962
Earlier work this paper cites.
A. Wyner, “An analog scrambling scheme which does not expand bandwidth, Part I: Discrete time,” IEEE Transactions on Information Theory , vol. 25, no. 3, pp. 261 – 274, may 1979
1979
Earlier work this paper cites.
——, “An analog scrambling scheme which does not expand bandwidth, Part II: Continuous time,” IEEE Transactions on Information Theory , vol. 25, no. 4, pp. 415 – 425, jul 1979
1979
Earlier work this paper cites.
1985
Earlier work this paper cites.
G. Watson, “Characterization of the subdifferential of some matrix norms,” Linear Algebra and its Applications , vol. 170, pp. 33–45, 1992
1992
Earlier work this paper cites.
M. Ledoux, “Isoperimetry and Gaussian analysis,” Lectures on probability theory and statistics , pp. 165–294, 1996
1996
Earlier work this paper cites.
J. Penot and C. Zalinescu, “Elements of quasiconvex subdifferential calculus,” Journal of Convex Analysis , vol. 7, no. 2, pp. 243–270, 2000
2000
Earlier work this paper cites.
B. Laurent and P. Massart, “Adaptive estimation of a quadratic functional by model selection,” The Annals of Statistics , vol. 28, no. 5, pp. 1302–1338, 2000
2000
Earlier work this paper cites.
K. Davidson and S. Szarek, “Local operator theory, random matrices and Banach spaces,” in Handbook on the Geometry of Banach spaces , Lindenstrauss, Ed. Elsevier Science, 2001, vol. 1, pp. 317–366
2001
Earlier work this paper cites.
M. Fazel, “Matrix rank minimization with applications,” Ph.D. dissertation, Stanford University, 2002
2002
Earlier work this paper cites.
M. Fazel, H. Hindi, and S. Boyd, “A rank minimization heuristic with application to minimum order system approximation,” in Proceedings of the 2001 American Control Conference , vol. 6. IEEE, 2002, pp. 4734–4739
2002
Earlier work this paper cites.
E. Candès and T. Tao, “Decoding by linear programming,” IEEE Transactions on Information Theory , vol. 51, no. 12, pp. 4203–4215, 2005
2005
Earlier work this paper cites.
D. Donoho, “Compressed sensing,” IEEE Transactions on Information Theory , vol. 52, no. 4, pp. 1289–1306, 2006
2006
Earlier work this paper cites.
J. Haupt, W. U. Bajwa, M. Rabbat, and R. Nowak, “Compressed sensing for networked data,” IEEE Signal Processing Magazine , vol. 25, no. 2, pp. 92–101, 2008
2008
Cited alongside, same era.
F. Parvaresh and B. Hassibi, “Explicit measurements with almost optimal thresholds for compressed sensing,” in ICASSP . IEEE, 2008, pp. 3853–3856
2008
Cited alongside, same era.
M. Grant and S. Boyd, “Graph implementations for nonsmooth convex programs,” in Recent Advances in Learning and Control , ser. Lecture Notes in Control and Information Sciences, V. Blondel, S. Boyd, and H. Kimura, Eds. Springer-Verlag Limited, 2008, pp. 95–110
2008
Cited alongside, same era.
J. Wright, A. Y. Yang, A. Ganesh, S. S. Sastry, and Y. Ma, “Robust face recognition via sparse representation,” Pattern Analysis and Machine Intelligence, IEEE Transactions on , vol. 31, no. 2, pp. 210–227, 2009
2009
Cited alongside, same era.
V. Chandrasekaran, S. Sanghavi, P. A. Parrilo, and A. S. Willsky, “Rank-sparsity incoherence for matrix decomposition,” SIAM Journal on Optimization , vol. 21, no. 2, pp. 572–596, 2011
2011
Later among the works it cites.
E. J. Candès, X. Li, Y. Ma, and J. Wright, “Robust principal component analysis?” Journal of the ACM , vol. 58, no. 3, pp. 1–37, 2011
2011
Later among the works it cites.
B. Recht, “A simpler approach to matrix completion,” Journal of Machine Learning Research , vol. 12, pp. 3413–3430, 2011
2011
Later among the works it cites.
V. Chandrasekaran, B. Recht, P. Parrilo, and A. Willsky, “The convex geometry of linear inverse problems,” Foundations of Computational Mathematics , vol. 12, no. 6, pp. 805–849, 2012
2012
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
T. Cai, G. Xu, and J. Zhang, “On recovery of sparse signals via ℓ 1 \ell_{1} minimization,” IEEE Transactions on Information Theory , vol. 55, no. 7, pp. 3388–3397, 2009
2009
Cited alongside, same era.
E. J. Candès and B. Recht, “Exact matrix completion via convex optimization,” Foundations of Computational Mathematics , vol. 9, no. 6, pp. 717–772, 2009
2009
Cited alongside, same era.
2009
Cited alongside, same era.
M. Stojnic, F. Parvaresh, and B. Hassibi, “On the reconstruction of block-sparse signals with an optimal number of measurements,” IEEE Transactions on Signal Processing , vol. 57, no. 8, pp. 3075–3085, 2009
2009
Cited alongside, same era.
J. N. Laska, M. A. Davenport, and R. G. Baraniuk, “Exact signal recovery from sparsely corrupted measurements through the pursuit of justice,” in Proceedings of the 43rd Asilomar conference on Signals, systems and computers , ser. Asilomar’09. Piscataway, NJ, USA: IEEE Press, 2009, pp. 1556–1560
2009
Cited alongside, same era.
E. Candès and T. Tao, “The power of convex relaxation: Near-optimal matrix completion,” IEEE Transactions on Information Theory , vol. 56, no. 5, pp. 2053–2080, 2010
2010
Cited alongside, same era.
Y. Eldar, P. Kuppinger, and H. Bölcskei, “Block-sparse signals: Uncertainty relations and efficient recovery,” IEEE Transactions on Signal Processing , vol. 58, no. 6, pp. 3042–3054, Jun. 2010
2010
Cited alongside, same era.
J. Wright and Y. Ma, “Dense error correction via ℓ 1 \ell_{1} -minimization,” IEEE Transactions on Information Theory , vol. 56, no. 7, pp. 3540–3560, 2010
2010
Cited alongside, same era.
2012
Later among the works it cites.
S. N. Negahban, P. Ravikumar, M. J. Wainwright, and B. Yu, “A unified framework for high-dimensional analysis of m m -estimators with decomposable regularizers,” Statistical Science , vol. 27, no. 4, pp. 538–557, 2012
2012
Later among the works it cites.
E. J. Candès and B. Recht, “Simple bounds for low-complexity model reconstruction,” Mathematical Programming Series A , 2012
2012
Later among the works it cites.
C. Hegde and R. G. Baraniuk, “Signal recovery on incoherent manifolds,” IEEE Transactions on Information Theory , vol. 58, no. 12, pp. 7204–7214, 2012
2012
Later among the works it cites.
X. Li, “Compressed sensing and matrix completion with constant proportion of corruptions,” Constructive Approximation , vol. 37, no. 1, pp. 73–99, 2013
2013
Closest in time.
2013
Closest in time.
N. Nguyen and T. Tran, “Exact recoverability from dense corrupted observations via ℓ 1 \ell_{1} minimization,” IEEE Transactions on Information Theory , vol. 59, no. 4, pp. 2017–2035, 2013
2013
Closest in time.
G. Pope, A. Bracher, and C. Studer, “Probabilistic recovery guarantees for sparsely corrupted signals,” IEEE Transactions on Information Theory , 2013
2013
Closest in time.
CVX Research Inc., “CVX: Matlab software for disciplined convex programming, version 1.22,” http://cvxr.com/cvx , Jan. 2013
2013
Closest in time.