Robust Subspace Discovery via Relaxed Rank Minimization

DOI10.1162/NECO_a_00555zbMath1443.94037WikidataQ46288980 ScholiaQ46288980MaRDI QIDQ5378336

Xiang Bai, Yi Ma, Xinggang Wang, Wenyu Liu, Zhuowen Tu, Zhengdong Zhang

Publication date: 12 June 2019

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

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items

Variance estimation based on blocked 3×2 cross-validation in high-dimensional linear regression

Uses Software

• LIBSVM
• PASCAL VOC
• FDDB
• RASL

Cites Work

• Unnamed Item
• Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
• A dual algorithm for the solution of nonlinear variational problems via finite element approximation
• Solving the multiple instance problem with axis-parallel rectangles.
• TILT: transform invariant low-rank textures
• Robust computation of linear models by convex relaxation
• Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
• Robust principal component analysis?
• Robust PCA via Outlier Pursuit
• Dense Error Correction Via $\ell^1$-Minimization
• Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
• Computer Vision - ECCV 2004