Robust Generalized Low-Rank Decomposition of Multimatrices for Image Recovery
Authors:
- 12 December 2016
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Multimedia
- Vol. 19 (5) , 969-983
Abstract
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 l1-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.Keywords
Funding Information
- National High Technology Research and Development Program (863 Program) of China (2014AA015202)
- National Natural Science Foundation of China (61572067, 61502024, 61272028, 61602538)
- Natural Science Foundation of Beijing Municipality (4162050)
- Natural Science Foundation of Guangdong Province (2016A030313708)
- Science and Technology Plan of Beijing Municipal Education Commission (SQKM201610016009)
- Talent Program of Beijing University of Civil Engineering and Architecture
This publication has 36 references indexed in Scilit:
- Hyperspectral Image Classification via Multitask Joint Sparse Representation and Stepwise MRF OptimizationIEEE Transactions on Cybernetics, 2015
- Robust Generalized Low Rank Approximations of MatricesPLOS ONE, 2015
- Rank adaptive atomic decomposition for low-rank matrix completion and its application on image recoveryNeurocomputing, 2014
- Tree-Based Backtracking Orthogonal Matching Pursuit for Sparse Signal ReconstructionJournal of Applied Mathematics, 2013
- Robust Recovery of Subspace Structures by Low-Rank RepresentationIEEE Transactions on Pattern Analysis and Machine Intelligence, 2012
- A Matrix-Based Approach to Unsupervised Human Action CategorizationIEEE Transactions on Multimedia, 2011
- The Power of Convex Relaxation: Near-Optimal Matrix CompletionIEEE Transactions on Information Theory, 2010
- An Introduction To Compressive SamplingIEEE Signal Processing Magazine, 2008
- Generalized Low Rank Approximations of MatricesMachine Learning, 2005
- A Generalized Solution of the Orthogonal Procrustes ProblemPsychometrika, 1966