Robust Principal Component Analysis Based on Maximum Correntropy Criterion

DOI10.1109/TIP.2010.2103949zbMath1372.94369WikidataQ43563886 ScholiaQ43563886MaRDI QIDQ5370081

Xiangwei Kong, Ran He, Bao-Gang Hu, Wei-Shi Zheng

Publication date: 19 October 2017

Published in: IEEE Transactions on Image Processing (Search for Journal in Brave)

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Related Items (20)

A Statistical Learning Approach to Modal Regression ⋮ Maximum correntropy criterion based sparse adaptive filtering algorithms for robust channel estimation under non-Gaussian environments ⋮ Autoencoders reloaded ⋮ Testing for principal component directions under weak identifiability ⋮ Principal component analysis with drop rank covariance matrix ⋮ Principal component analysis based on nuclear norm minimization ⋮ Maximum correntropy unscented filter ⋮ A new robust fixed-point algorithm and its convergence analysis ⋮ Discriminant sparse neighborhood preserving embedding for face recognition ⋮ Euler principal component analysis ⋮ Robust fitting of ellipsoids by separating interior and exterior points during optimization ⋮ A robust classification framework with mixture correntropy ⋮ Avoiding Optimal Mean ℓ_2,1-Norm Maximization-Based Robust PCA for Reconstruction ⋮ Maximum correntropy Kalman filter ⋮ Traditional and recent approaches in background modeling for foreground detection: an overview ⋮ Learning with correntropy-induced losses for regression with mixture of symmetric stable noise ⋮ Comparison of the convergence rates of the new correntropy-based Levenberg-Marquardt (CLM) method and the fixed-point maximum correntropy (FP-MCC) algorithm ⋮ Hierarchical Dynamical Model for Multiple Cortical Neural Decoding ⋮ Optimal learning with Gaussians and correntropy loss ⋮ Cauchy kernel-based maximum correntropy Kalman filter

This page was built for publication: Robust Principal Component Analysis Based on Maximum Correntropy Criterion