Completing Low-Rank Matrices With Corrupted Samples From Few Coefficients in General Basis
暂无分享,去创建一个
[1] René Vidal,et al. A closed form solution to robust subspace estimation and clustering , 2011, CVPR 2011.
[2] Daniel P. Robinson,et al. Sparse Subspace Clustering with Missing Entries , 2015, ICML.
[3] Axthonv G. Oettinger,et al. IEEE Transactions on Information Theory , 1998 .
[4] Robert C. Bolles,et al. Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography , 1981, CACM.
[5] Robert H. Halstead,et al. Matrix Computations , 2011, Encyclopedia of Parallel Computing.
[6] Guangcan Liu,et al. Recovery of Coherent Data via Low-Rank Dictionary Pursuit , 2014, NIPS.
[7] Zhixun Su,et al. Fixed-rank representation for unsupervised visual learning , 2012, 2012 IEEE Conference on Computer Vision and Pattern Recognition.
[8] Emmanuel J. Candès,et al. The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.
[9] Shuicheng Yan,et al. Multi-task low-rank affinity pursuit for image segmentation , 2011, 2011 International Conference on Computer Vision.
[10] Longquan Yong,et al. Low-Rank Representation for Incomplete Data , 2014 .
[11] Yi Ma,et al. TILT: Transform Invariant Low-Rank Textures , 2010, ACCV 2010.
[12] Benjamin Recht,et al. A Simpler Approach to Matrix Completion , 2009, J. Mach. Learn. Res..
[13] B. Ripley,et al. Robust Statistics , 2018, Wiley Series in Probability and Statistics.
[14] Marc Pollefeys,et al. A General Framework for Motion Segmentation: Independent, Articulated, Rigid, Non-rigid, Degenerate and Non-degenerate , 2006, ECCV.
[15] Gilad Lerman,et al. A novel M-estimator for robust PCA , 2011, J. Mach. Learn. Res..
[16] Yi Ma,et al. Robust principal component analysis? , 2009, JACM.
[17] Junbin Gao,et al. Relations Among Some Low-Rank Subspace Recovery Models , 2014, Neural Computation.
[18] Alex Gittens,et al. TAIL BOUNDS FOR ALL EIGENVALUES OF A SUM OF RANDOM MATRICES , 2011, 1104.4513.
[19] Takeo Kanade,et al. A Multibody Factorization Method for Independently Moving Objects , 1998, International Journal of Computer Vision.
[20] Roman Vershynin,et al. Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.
[21] René Vidal,et al. Motion Segmentation with Missing Data Using PowerFactorization and GPCA , 2004, CVPR.
[22] Robert R. Bitmead,et al. Subspace system identification for training-based MIMO channel estimation , 2005, Autom..
[23] John Wright,et al. Segmentation of Multivariate Mixed Data via Lossy Data Coding and Compression , 2007, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[24] Zhouchen Lin,et al. Analysis and Improvement of Low Rank Representation for Subspace segmentation , 2010, ArXiv.
[25] Joel A. Tropp,et al. Robust Computation of Linear Models by Convex Relaxation , 2012, Foundations of Computational Mathematics.
[26] Gitta Kutyniok,et al. 1 . 2 Sparsity : A Reasonable Assumption ? , 2012 .
[27] Constantine Caramanis,et al. Robust Matrix Completion and Corrupted Columns , 2011, ICML.
[28] Bell Telephone,et al. ROBUST ESTIMATES, RESIDUALS, AND OUTLIER DETECTION WITH MULTIRESPONSE DATA , 1972 .
[29] S. Shankar Sastry,et al. Generalized principal component analysis (GPCA) , 2005, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[30] Michael J. Black,et al. A Framework for Robust Subspace Learning , 2003, International Journal of Computer Vision.
[31] David J. Kriegman,et al. Clustering appearances of objects under varying illumination conditions , 2003, 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings..
[32] Yongtian Wang,et al. Robust Photometric Stereo via Low-Rank Matrix Completion and Recovery , 2010, ACCV.
[33] Chao Zhang,et al. A Counterexample for the Validity of Using Nuclear Norm as a Convex Surrogate of Rank , 2013, ECML/PKDD.
[34] David Gross,et al. Recovering Low-Rank Matrices From Few Coefficients in Any Basis , 2009, IEEE Transactions on Information Theory.
[35] Allen Y. Yang,et al. Unsupervised segmentation of natural images via lossy data compression , 2008, Comput. Vis. Image Underst..
[36] C. W. Gear,et al. Multibody Grouping from Motion Images , 1998, International Journal of Computer Vision.
[37] John Wright,et al. Compressive principal component pursuit , 2012, 2012 IEEE International Symposium on Information Theory Proceedings.
[38] Junbin Gao,et al. Robust latent low rank representation for subspace clustering , 2014, Neurocomputing.
[39] Yong Yu,et al. Robust Recovery of Subspace Structures by Low-Rank Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[40] Emmanuel J. Candès,et al. Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information , 2004, IEEE Transactions on Information Theory.
[41] Takeo Kanade,et al. Robust L/sub 1/ norm factorization in the presence of outliers and missing data by alternative convex programming , 2005, 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05).
[42] John Wright,et al. RASL: Robust alignment by sparse and low-rank decomposition for linearly correlated images , 2010, 2010 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.
[43] Emmanuel J. Candès,et al. Exact Matrix Completion via Convex Optimization , 2008, Found. Comput. Math..
[44] Edward Y. Chang,et al. Exact Recoverability of Robust PCA via Outlier Pursuit with Tight Recovery Bounds , 2015, AAAI.
[45] Joel A. Tropp,et al. An Introduction to Matrix Concentration Inequalities , 2015, Found. Trends Mach. Learn..
[46] René Vidal,et al. Motion Segmentation in the Presence of Outlying, Incomplete, or Corrupted Trajectories , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[47] René Vidal,et al. Identification of Hybrid Systems: A Tutorial , 2007, Eur. J. Control.
[48] Ehsan Elhamifar,et al. Sparse subspace clustering , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.
[49] S. Sastry,et al. An algebraic geometric approach to the identification of a class of linear hybrid systems , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).
[50] Shuicheng Yan,et al. Latent Low-Rank Representation for subspace segmentation and feature extraction , 2011, 2011 International Conference on Computer Vision.
[51] Zhixun Su,et al. Linearized Alternating Direction Method with Adaptive Penalty for Low-Rank Representation , 2011, NIPS.
[52] J. Tropp,et al. Two proposals for robust PCA using semidefinite programming , 2010, 1012.1086.
[53] Kuldeep Kumar,et al. Robust Statistics, 2nd edn , 2011 .
[54] Ankur Moitra,et al. Algorithms and Hardness for Robust Subspace Recovery , 2012, COLT.
[55] Constantine Caramanis,et al. Robust PCA via Outlier Pursuit , 2010, IEEE Transactions on Information Theory.