Robust Subspace Discovery via Relaxed Rank Minimization
From MaRDI portal
Publication:5378336
DOI10.1162/NECO_A_00555zbMATH Open1443.94037WikidataQ46288980 ScholiaQ46288980MaRDI QIDQ5378336FDOQ5378336
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)
Recommendations
- A framework for robust subspace learning
- Fast, robust and non-convex subspace recovery
- Robust subspace segmentation via nonconvex low rank representation
- Robust subspace clustering
- Relations among some low-rank subspace recovery models
- Robust subspace clustering based on non-convex low-rank approximation and adaptive kernel
- Subspace Methods for Joint Sparse Recovery
- A well-tempered landscape for non-convex robust subspace recovery
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Computing methodologies for image processing (68U10)
Cites Work
- Title not available (Why is that?)
- 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
- Robust principal component analysis?
- Dense Error Correction Via $\ell^1$-Minimization
- Robust PCA via Outlier Pursuit
- TILT: transform invariant low-rank textures
- Recovering Low-Rank and Sparse Components of Matrices from Incomplete and Noisy Observations
- Computer Vision - ECCV 2004
- Solving the multiple instance problem with axis-parallel rectangles.
- Robust computation of linear models by convex relaxation
- Alternating Direction Methods for Latent Variable Gaussian Graphical Model Selection
Cited In (4)
- Variance estimation based on blocked 3×2 cross-validation in high-dimensional linear regression
- A framework for robust subspace learning
- Robust subspace segmentation via nonconvex low rank representation
- Low-distortion subspace embeddings in input-sparsity time and applications to robust linear regression
Uses Software
This page was built for publication: Robust Subspace Discovery via Relaxed Rank Minimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5378336)
