Two-Dimensional PCA with F-Norm Minimization

Abstract

Two-dimensional principle component analysis (2DPCA) has been widely used for face image representation and recognition. But it is sensitive to the presence of outliers. To alleviate this problem, we propose a novel robust 2DPCA, namely 2DPCA with F-norm minimization (F-2DPCA), which is intuitive and directly derived from 2DPCA. In F-2DPCA, distance in spatial dimensions (attribute dimensions) is measured in F-norm, while the summation over different data points uses 1-norm. Thus it is robust to outliers and rotational invariant as well. To solve F-2DPCA, we propose a fast iterative algorithm, which has a closed-form solution in each iteration, and prove its convergence. Experimental results on face image databases illustrate its effectiveness and advantages.

Cite

Text

Wang and Gao. "Two-Dimensional PCA with F-Norm Minimization." AAAI Conference on Artificial Intelligence, 2017. doi:10.1609/AAAI.V31I1.10798

Markdown

[Wang and Gao. "Two-Dimensional PCA with F-Norm Minimization." AAAI Conference on Artificial Intelligence, 2017.](https://mlanthology.org/aaai/2017/wang2017aaai-two/) doi:10.1609/AAAI.V31I1.10798

BibTeX

@inproceedings{wang2017aaai-two,
  title     = {{Two-Dimensional PCA with F-Norm Minimization}},
  author    = {Wang, Qianqian and Gao, Quanxue},
  booktitle = {AAAI Conference on Artificial Intelligence},
  year      = {2017},
  pages     = {2718-2724},
  doi       = {10.1609/AAAI.V31I1.10798},
  url       = {https://mlanthology.org/aaai/2017/wang2017aaai-two/}
}