Scalable Low-Rank Representation

DOI10.1007/978-3-319-12000-3_3zbMath1323.68530OpenAlexW5368005MaRDI QIDQ3449316

Shuicheng Yan, Guangcan Liu

Publication date: 4 November 2015

Published in: Low-Rank and Sparse Modeling for Visual Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-12000-3_3

zbMATH Keywords

Stiefel manifoldalternating direction methodmatrix factorizationactive subspacenuclear norm optimization

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Numerical optimization and variational techniques (65K10) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)

Uses Software

• LMaFit

Cites Work

• Finding structure with randomness: Probabilistic algorithms for constructing approximate matrix decompositions
• TILT: transform invariant low-rank textures
• Local minima and convergence in low-rank semidefinite programming
• Fast singular value thresholding without singular value decomposition
• Exact matrix completion via convex optimization
• Active Subspace: Toward Scalable Low-Rank Learning
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Rank-Sparsity Incoherence for Matrix Decomposition
• The Geometry of Algorithms with Orthogonality Constraints
• Augmented Lagrangian alternating direction method for matrix separation based on low-rank factorization
• Unnamed Item
• Unnamed Item

This page was built for publication: Scalable Low-Rank Representation