Robust Generalized Low-Rank Decomposition of Multimatrices for Image Recovery

被引:35
作者
Wang, Hengyou [1 ,2 ,3 ]
Cen, Yigang [1 ,2 ,5 ]
He, Zhihai [4 ]
Zhao, Ruizhen [1 ,2 ]
Cen, Yi
Zhang, Fengzhen [1 ,2 ]
机构
[1] Beijing Jiaotong Univ, Sch Comp & Informat Technol, Beijing 100044, Peoples R China
[2] Key Lab Adv Informat Sci & Network Technol Beijin, Beijing 100044, Peoples R China
[3] Beijing Univ Civil Engn & Architecture, Sch Sci, Beijing 100044, Peoples R China
[4] Univ Missouri, Dept Elect & Comp Engn, Columbia, MO 65211 USA
[5] Minzu Univ China, Sch Informat Engn, Beijing 100081, Peoples R China
基金
中国国家自然科学基金;
关键词
Alternating direction matrices tri-factorization method (ADMTFM); dimensionality reduction; generalized low-rank approximations of matrices (GLRAM); image recovery; low-rank matrices; STRUCTURE-FROM-MOTION; MATRIX COMPLETION; JOINT SPARSE; REPRESENTATION; FACTORIZATION; RESTORATION;
D O I
10.1109/TMM.2016.2638624
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Low-rank approximation has been successfully used for dimensionality reduction, image noise removal, and image restoration. In existing work, input images are often reshaped to a matrix of vectors before low-rank decomposition. It has been observed that this procedure will destroy the inherent two-dimensional correlation within images. To address this issue, the generalized low-rank approximation of matrices (GLRAM) method has been recently developed, which is able to perform low-rank decomposition of multiple matrices directly without the need for vector reshaping. In this paper, we propose a new robust generalized low-rank matrices decomposition method, which further extends the existing GLRAM method by incorporating rank minimization into the decomposition process. Specifically, our method aims to minimize the sum of nuclear norms and l(1)-norms. We develop a new optimization method, called alternating direction matrices tri-factorization method, to solve the minimization problem. We mathematically prove the convergence of the proposed algorithm. Our extensive experimental results demonstrate that our method significantly outperforms existing GLRAM methods.
引用
收藏
页码:969 / 983
页数:15
相关论文
共 43 条
  • [1] [Anonymous], 2011, P 22 INT JOINT C ART
  • [2] Low-rank matrix completion via preconditioned optimization on the Grassmann manifold
    Boumal, Nicolas
    Absil, P. -A.
    [J]. LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 475 : 200 - 239
  • [3] Distributed optimization and statistical learning via the alternating direction method of multipliers
    Boyd S.
    Parikh N.
    Chu E.
    Peleato B.
    Eckstein J.
    [J]. Foundations and Trends in Machine Learning, 2010, 3 (01): : 1 - 122
  • [4] Exact Matrix Completion via Convex Optimization
    Candes, Emmanuel
    Recht, Benjamin
    [J]. COMMUNICATIONS OF THE ACM, 2012, 55 (06) : 111 - 119
  • [5] Candès EJ, 2008, IEEE SIGNAL PROC MAG, V25, P21, DOI 10.1109/MSP.2007.914731
  • [6] Robust Principal Component Analysis?
    Candes, Emmanuel J.
    Li, Xiaodong
    Ma, Yi
    Wright, John
    [J]. JOURNAL OF THE ACM, 2011, 58 (03)
  • [7] The Power of Convex Relaxation: Near-Optimal Matrix Completion
    Candes, Emmanuel J.
    Tao, Terence
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2010, 56 (05) : 2053 - 2080
  • [8] Tree-Based Backtracking Orthogonal Matching Pursuit for Sparse Signal Reconstruction
    Cen, Yigang
    Wang, Fangfei
    Zhao, Ruizhen
    Cui, Lihong
    Cen, Lihui
    Miao, Zhenjiang
    Cen, Yanming
    [J]. JOURNAL OF APPLIED MATHEMATICS, 2013,
  • [9] Robust Subspace Segmentation Via Low-Rank Representation
    Chen, Jinhui
    Yang, Jian
    [J]. IEEE TRANSACTIONS ON CYBERNETICS, 2014, 44 (08) : 1432 - 1445
  • [10] Low-Rank Matrix Recovery From Errors and Erasures
    Chen, Yudong
    Jalali, Ali
    Sanghavi, Sujay
    Caramanis, Constantine
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2013, 59 (07) : 4324 - 4337