A novel robust principal component analysis method for image and video processing

被引:6
作者
Huan, Guoqiang [1 ,2 ]
Li, Ying [3 ]
Song, Zhanjie [1 ,2 ]
机构
[1] Tianjin Univ, Sch Sci, Tianjin 300072, Peoples R China
[2] Tianjin Univ, Ctr Appl Math, Tianjin 300072, Peoples R China
[3] State Key Lab Hydreul Engn Simulat & Safety, Tianjin 300072, Peoples R China
基金
中国国家自然科学基金;
关键词
robust principal component analysis; sparse Bayesian learning; Markov random fields; matrix factorization; contiguity prior;
D O I
10.1007/s10492-016-0128-8
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The research on the robust principal component analysis has been attracting much attention recently. Generally, the model assumes sparse noise and characterizes the error term by the lambda(1)-norm. However, the sparse noise has clustering effect in practice so using a certain lambda (p) -norm simply is not appropriate for modeling. In this paper, we propose a novel method based on sparse Bayesian learning principles and Markov random fields. The method is proved to be very effective for low-rank matrix recovery and contiguous outliers detection, by enforcing the low-rank constraint in a matrix factorization formulation and incorporating the contiguity prior as a sparsity constraint. The experiments on both synthetic data and some practical computer vision applications show that the novel method proposed in this paper is competitive when compared with other state-of-the-art methods.
引用
收藏
页码:197 / 214
页数:18
相关论文
共 25 条
[1]  
[Anonymous], 2009, COMPUTATIONAL ADV MU
[2]  
[Anonymous], COMP VIS 2013 IEEE I
[3]   Sparse Bayesian Methods for Low-Rank Matrix Estimation [J].
Babacan, S. Derin ;
Luessi, Martin ;
Molina, Rafael ;
Katsaggelos, Aggelos K. .
IEEE TRANSACTIONS ON SIGNAL PROCESSING, 2012, 60 (08) :3964-3977
[4]  
Bishop C., 2006, Pattern recognition and machine learning, P423
[5]   Fast approximate energy minimization via graph cuts [J].
Boykov, Y ;
Veksler, O ;
Zabih, R .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2001, 23 (11) :1222-1239
[6]   Robust Principal Component Analysis? [J].
Candes, Emmanuel J. ;
Li, Xiaodong ;
Ma, Yi ;
Wright, John .
JOURNAL OF THE ACM, 2011, 58 (03)
[7]   The Power of Convex Relaxation: Near-Optimal Matrix Completion [J].
Candes, Emmanuel J. ;
Tao, Terence .
IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (05) :2053-2080
[8]   Exact Matrix Completion via Convex Optimization [J].
Candes, Emmanuel J. ;
Recht, Benjamin .
FOUNDATIONS OF COMPUTATIONAL MATHEMATICS, 2009, 9 (06) :717-772
[9]   A Framework for Robust Subspace Learning [J].
Fernando De la Torre ;
Michael J. Black .
International Journal of Computer Vision, 2003, 54 (1-3) :117-142
[10]  
Ding C, 2006, P 23 INT C MACH LEAR, P281, DOI DOI 10.1145/1143844.1143880