Recovering low-rank and sparse matrix based on the truncated nuclear norm

DOI10.1016/j.neunet.2016.09.005zbMath1428.68231DBLPjournals/nn/CaoCYZZ17OpenAlexW2529441728WikidataQ39214809 ScholiaQ39214809MaRDI QIDQ2281698

Jianwei Zhao, Feilong Cao, Zhenghua Zhou, Hailiang Ye, Jiaying Chen

Publication date: 6 January 2020

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2016.09.005

zbMATH Keywords

surveillance videolow-rank decompositionsparse decompositiontruncated nuclear normrecovery of matrixremoving shadows of image

Mathematics Subject Classification ID

Factor analysis and principal components; correspondence analysis (62H25) Factorization of matrices (15A23) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)

Related Items (6)

Low rank matrix recovery with impulsive noise ⋮ Robust PCA using nonconvex rank approximation and sparse regularizer ⋮ Enhancing matrix completion using a modified second-order total variation ⋮ F-norm distance metric based robust 2DPCA and face recognition ⋮ A unified framework for nonconvex nonsmooth sparse and low-rank decomposition by majorization-minimization algorithm ⋮ A smoothing proximal gradient algorithm for matrix rank minimization problem

Uses Software

• RASL

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
• An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
• Fixed point and Bregman iterative methods for matrix rank minimization
• TILT: transform invariant low-rank textures
• Exact matrix completion via convex optimization
• Robust principal component analysis?
• A Singular Value Thresholding Algorithm for Matrix Completion
• Rank-Sparsity Incoherence for Matrix Decomposition
• Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
• Decoding by Linear Programming
• Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
• Bayesian Robust Principal Component Analysis
• Sparse Approximate Solutions to Linear Systems
• The Power of Convex Relaxation: Near-Optimal Matrix Completion
• Signal Recovery by Proximal Forward-Backward Splitting

This page was built for publication: Recovering low-rank and sparse matrix based on the truncated nuclear norm