Robust generalized low rank approximations of matrices for video denoising

Low rank matrix algorithm has attracted widely attention since it was put forward. There are many algorithms proposed to improve it. Most methods take each sample as a column, but Robust Generalized Low Rank Approximations of Matrices(RGLRAM) treats each sample as a matrix, thus we can find the low rank approximations on a collection of matrices not just a single matrix. RGLRAM are not only robust to small Gaussian noise but also to large sparse noise. In these cases, we extend it to video approximation. The video can be treated as a collection of images. Each frame of the video is divided into blocks with equal size according to their coordinates. After the operation of each group, the reconstructed video could be got via splicing the blocks based on these coordinates. Experimental results show that method proposed in this paper is effective.

[1]  Jiarong Shi,et al.  Robust Generalized Low Rank Approximations of Matrices , 2015, PloS one.

[2]  Yi Ma,et al.  The Augmented Lagrange Multiplier Method for Exact Recovery of Corrupted Low-Rank Matrices , 2010, Journal of structural biology.

[3]  Jieping Ye,et al.  Generalized Low Rank Approximations of Matrices , 2005, Machine Learning.

[4]  Ali Jalali,et al.  Low-Rank Matrix Recovery From Errors and Erasures , 2013, IEEE Transactions on Information Theory.

[5]  Yong Yu,et al.  Robust Recovery of Subspace Structures by Low-Rank Representation , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Qionghai Dai,et al.  Reweighted Low-Rank Matrix Recovery and its Application in Image Restoration , 2014, IEEE Transactions on Cybernetics.

[7]  Zhi-Hua Zhou,et al.  Generalized Low-Rank Approximations of Matrices Revisited , 2010, IEEE Transactions on Neural Networks.

[8]  A. Willsky,et al.  Sparse and low-rank matrix decompositions , 2009 .

[9]  Emmanuel J. Candès,et al.  Exact Matrix Completion via Convex Optimization , 2009, Found. Comput. Math..

[10]  Samuel Cheng,et al.  Decomposition Approach for Low-Rank Matrix Completion and Its Applications , 2014, IEEE Transactions on Signal Processing.

[11]  Xiaoming Yuan,et al.  Sparse and low-rank matrix decomposition via alternating direction method , 2013 .

[12]  Yong Yu,et al.  Robust Subspace Segmentation by Low-Rank Representation , 2010, ICML.

[13]  John Wright,et al.  Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization , 2009, NIPS.

[14]  Massimo Fornasier,et al.  Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization , 2010, SIAM J. Optim..

[15]  Jieping Ye,et al.  Generalized Low Rank Approximations of Matrices , 2004, Machine Learning.

[16]  Yang Wei.  Survey on algorithms of low-rank matrix recovery , 2013 .

[17]  John Wright,et al.  Robust Principal Component Analysis: Exact Recovery of Corrupted Low-Rank Matrices via Convex Optimization , 2009, NIPS.

[18]  Emmanuel J. Candès,et al.  The Power of Convex Relaxation: Near-Optimal Matrix Completion , 2009, IEEE Transactions on Information Theory.

[19]  P. Cochat,et al.  Et al , 2008, Archives de pediatrie : organe officiel de la Societe francaise de pediatrie.

[20]  Yi Ma,et al.  Robust principal component analysis? , 2009, JACM.