A framework for robust subspace learning
From MaRDI portal
Publication:1410790
DOI10.1023/A:1023709501986zbMath1076.68058OpenAlexW1513013675MaRDI QIDQ1410790
Michael J. Black, Fernando De La Torre
Publication date: 15 October 2003
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1023709501986
subspace methodssingular value decompositionlearningprincipal component analysisrobust statisticsrobust PCAstructure from motioncomputer vision.robust SVD
Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies for image processing (68U10) Machine vision and scene understanding (68T45)
Related Items (37)
A novel robust principal component analysis method for image and video processing. ⋮ Component-wise robust linear fuzzy clustering for collaborative filtering ⋮ Robust low-rank tensor factorization by cyclic weighted median ⋮ Unnamed Item ⋮ Multi-object trajectory tracking ⋮ Weighted and robust learning of subspace representations ⋮ Robust L1-norm two-dimensional linear discriminant analysis ⋮ Robust principal component analysis: a factorization-based approach with linear complexity ⋮ Variational Bayesian sparse additive matrix factorization ⋮ Global and local structure preserving sparse subspace learning: an iterative approach to unsupervised feature selection ⋮ Principal component analysis: a review and recent developments ⋮ Weighted nuclear norm minimization and its applications to low level vision ⋮ Euler principal component analysis ⋮ Robust subspace recovery by Tyler's M-estimator ⋮ Two proposals for robust PCA using semidefinite programming ⋮ Improve robustness of sparse PCA by \(L_{1}\)-norm maximization ⋮ Relations Among Some Low-Rank Subspace Recovery Models ⋮ Robust missing traffic flow imputation considering nonnegativity and road capacity ⋮ Robust Hessian locally linear embedding techniques for high-dimensional data ⋮ Decomposition into low-rank plus additive matrices for background/foreground separation: a review for a comparative evaluation with a large-scale dataset ⋮ Generalized KPCA by adaptive rules in feature space ⋮ An $\ell_{\infty}$ Eigenvector Perturbation Bound and Its Application to Robust Covariance Estimation ⋮ Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering ⋮ Median filtering‐based methods for static background extraction from surveillance video ⋮ Traditional and recent approaches in background modeling for foreground detection: an overview ⋮ Robust locally linear embedding ⋮ Robust L1 Principal Component Analysis and Its Bayesian Variational Inference ⋮ A Regularized Correntropy Framework for Robust Pattern Recognition ⋮ Joint sparse principal component analysis ⋮ A combinatorial approach to \(L_1\)-matrix factorization ⋮ Robust recursive absolute value inequalities discriminant analysis with sparseness ⋮ Nonconvex Robust Low-Rank Matrix Recovery ⋮ Robust supervised topic models under label noise ⋮ Robust sparse principal component analysis ⋮ Robust computation of linear models by convex relaxation ⋮ Improved combination of RPCA and MEL for sparse representation-based face recognition ⋮ Low rank matrix recovery with adversarial sparse noise*
Uses Software
This page was built for publication: A framework for robust subspace learning
