TY - JOUR
T1 - Avoiding optimal mean ℓ2,1-norm maximization-based robust PCA for reconstruction
AU - Luo, Minnan
AU - Nie, Feiping
AU - Chang, Xiaojun
AU - Yang, Yi
AU - Hauptmann, Alexander G.
AU - Zheng, Qinghua
N1 - Publisher Copyright:
© 2017 Massachusetts Institute of Technology.
PY - 2017/4/1
Y1 - 2017/4/1
N2 - Robust principal component analysis (PCA) is one of the most important dimension-reduction techniques for handling high-dimensional data with outliers. However, most of the existing robust PCA presupposes that the mean of the data is zero and incorrectly utilizes the average of data as the optimal mean of robust PCA. In fact, this assumption holds only for the squared -norm-based traditional PCA. In this letter, we equivalently reformulate the objective of conventional PCA and learn the optimal projection directions by maximizing the sum of projected difference between each pair of instances based on -norm. The proposed method is robust to outliers and also invariant to rotation. More important, the reformulated objective not only automatically avoids the calculation of optimal mean and makes the assumption of centered data unnecessary, but also theoretically connects to the minimization of reconstruction error. To solve the proposed nonsmooth problem, we exploit an efficient optimization algorithm to soften the contributions from outliers by reweighting each data point iteratively. We theoretically analyze the convergence and computational complexity of the proposed algorithm. Extensive experimental results on several benchmark data sets illustrate the effectiveness and superiority of the proposed method.
AB - Robust principal component analysis (PCA) is one of the most important dimension-reduction techniques for handling high-dimensional data with outliers. However, most of the existing robust PCA presupposes that the mean of the data is zero and incorrectly utilizes the average of data as the optimal mean of robust PCA. In fact, this assumption holds only for the squared -norm-based traditional PCA. In this letter, we equivalently reformulate the objective of conventional PCA and learn the optimal projection directions by maximizing the sum of projected difference between each pair of instances based on -norm. The proposed method is robust to outliers and also invariant to rotation. More important, the reformulated objective not only automatically avoids the calculation of optimal mean and makes the assumption of centered data unnecessary, but also theoretically connects to the minimization of reconstruction error. To solve the proposed nonsmooth problem, we exploit an efficient optimization algorithm to soften the contributions from outliers by reweighting each data point iteratively. We theoretically analyze the convergence and computational complexity of the proposed algorithm. Extensive experimental results on several benchmark data sets illustrate the effectiveness and superiority of the proposed method.
UR - https://www.scopus.com/pages/publications/85016056638
U2 - 10.1162/NECO_a_00937
DO - 10.1162/NECO_a_00937
M3 - 快报
C2 - 28095203
AN - SCOPUS:85016056638
SN - 0899-7667
VL - 29
SP - 1124
EP - 1150
JO - Neural Computation
JF - Neural Computation
IS - 4
ER -