Paper
27 October 2013 Accelerated algorithms for low-rank matrix recovery
Author Affiliations +
Proceedings Volume 8920, MIPPR 2013: Parallel Processing of Images and Optimization and Medical Imaging Processing; 89200F (2013) https://doi.org/10.1117/12.2031313
Event: Eighth International Symposium on Multispectral Image Processing and Pattern Recognition, 2013, Wuhan, China
Abstract
In recent years, Low-rank matrix recovery from corrupted noise matrix has attracted interests as a very effective method in high-dimensional data. And its fast algorithm has become a research focus. This paper we first review the basic theory and typical accelerated algorithms. All these methods are proposed to mitigating the computational burden, such as the iteration count before convergence, especially the frequent large-scale Singular Value Decomposition (SVD). For better convergence, we employ the Augmented Lagrange Multipliers to solve the optimization problem. Recent the endeavors have focused on smaller-scale SVD, especially the method based on submatrix. Finally, we present numerical experiments on large-scale date.
© (2013) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Shuiping Zhang and Jinwen Tian "Accelerated algorithms for low-rank matrix recovery", Proc. SPIE 8920, MIPPR 2013: Parallel Processing of Images and Optimization and Medical Imaging Processing, 89200F (27 October 2013); https://doi.org/10.1117/12.2031313
Lens.org Logo
CITATIONS
Cited by 2 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Algorithms

Error analysis

Information technology

Linear filtering

Matrices

Principal component analysis

Data processing

Back to Top