[1] FOYGEL R, MACKEY L. Corrupted sensing: Novel guarantees for separating structured signals[J]. IEEE Transactions on Information Theory, 2014,60(2):1223-1247.
[2] WRIGHT J, YANG A Y, GANESH A, et al. Robust face recognition via sparse representation[J]. IEEE Transactions on Pattern Recognition and Machine Intelligence, 2009,31(2):210-227.
[3] ELHAMIFAR E, VIDAL R. Sparse subspace clustering[C]// Proceedings of 2009 IEEE Conference on Computer Vision and Pattern Recognition. 2009:2790-2797.
[4] HAUPT J, BAJWA W U, RABBAT M, et al. Compressed sensing for networked data[J]. IEEE Signal Processing Magazine, 2008,25(2):92-101.
[5] 薛以梅. 基于稀疏表示和梯度先验的图像盲去模糊[J]. 计算机与现代化, 2017(12):39-42.
[6] MCCOY M B, TROPP J A. The Achievable Performance of Convex Demixing[DB/OL]. (2013-09-28)[2019-01-14]. https://arxiv.org/pdf/1309.7478.pdf.
[7] MCCOY M B, TROPP J A. Sharp recovery bounds for convex demixing, with applications[J]. Foundations of Computation Mathematics, 2014,14(3):503-567.
[8] AMELUNXEN D, LOTZ M, MCCOY M B, et al. Living on the edge: Phase transitions in convex programs with random data[J]. Information and Inference: A Journal of the IMA, 2014,3(3):224-294.
[9] OYMAK S, TROPP J A. Universality laws for randomized dimension reduction, with applications[J]. Information and Inference: A Journal of the IMA, 2018,7(3):337-446.
[10]LI X D. Compressed sensing and matrix completion with constant proportion of corruptions[J]. Constructive Approximation, 2013,37(1):73-99.
[11]WRIGHT J, MA Y. Dense error correction via 1-minimization[J]. IEEE Transactions on Information Theory, 2010,56(7):3540-3560.
[12]NGUYEN N H, TRAN T D. Exact recoverability from dense corrupted observations via 1-minimization[J]. IEEE Transactions on Information Theory, 2013,59(4):2017-2035.
[13]NGUYEN N H, TRAN T D. Robust lasso with missing and grossly corrupted observations[J]. IEEE Transactions on Information Theory, 2013,4(59):2036-2058.
[14]POPE G, BRACHER A, STUDER C. Probabilistic recovery guarantees for sparsely corrupted signals[J]. IEEE Transactions on Information Theory, 2013,59(5):3104-3116.
[15]STUDER C, KUPPINGER P, POPE G, et al. Recovery of sparsely corrupted signals[J]. IEEE Transactions on Information Theory, 2012,58(5):3115-3130.
[16]STUDER C, BARANIUK R G. Stable restoration and separation of approximately sparse signals[J]. Applied and Computational Harmonic Analysis, 2014,37(1):12-35.
[17]ZHANG H, LIU Y L, LEI H. On the phase transition of corrupted sensing[C]// Proceedings of 2017 IEEE International Symposium on Information Theory. 2017:521-525.
[18]CHEN J C, LIU Y L. Corrupted sensing with sub-Gaussian measurements[C]// Proceedings of 2017 IEEE International Symposium on Information Theory. 2017:516-520.
[19]ROCKAFELLAR R T. Convex Analysis[M]. Princeton University Press, 1970.
[20]GORDON Y. Some inequalities for Gaussian processes and applications[J]. Israel Journal of Mathematics, 1985,50(4):265-289.
[21]BOUCHERON S, LUGOSI G, MASSART P. Concentration Inequalities: A Nonasymptotic Theory of Independence[M]. Oxford University Press, 2013 |