Robust Subspace Clustering via Half-Quadratic Minimization
Abstract
Subspace clustering has important and wide applications in computer vision and pattern recognition. It is a challenging task to learn low-dimensional subspace structures due to the possible errors (e.g., noise and corruptions) existing in high-dimensional data. Recent subspace clustering methods usually assume a sparse representation of corrupted errors and correct the errors iteratively. However large corruptions in real-world applications can not be well addressed by these methods. A novel optimization model for robust subspace clustering is proposed in this paper. The objective function of our model mainly includes two parts. The first part aims to achieve a sparse representation of each high-dimensional data point with other data points. The second part aims to maximize the correntropy between a given data point and its low-dimensional representation with other points. Correntropy is a robust measure so that the influence of large corruptions on subspace clustering can be greatly suppressed. An extension of our
Cite
Text
Zhang et al. "Robust Subspace Clustering via Half-Quadratic Minimization." International Conference on Computer Vision, 2013. doi:10.1109/ICCV.2013.384Markdown
[Zhang et al. "Robust Subspace Clustering via Half-Quadratic Minimization." International Conference on Computer Vision, 2013.](https://mlanthology.org/iccv/2013/zhang2013iccv-robust/) doi:10.1109/ICCV.2013.384BibTeX
@inproceedings{zhang2013iccv-robust,
title = {{Robust Subspace Clustering via Half-Quadratic Minimization}},
author = {Zhang, Yingya and Sun, Zhenan and He, Ran and Tan, Tieniu},
booktitle = {International Conference on Computer Vision},
year = {2013},
doi = {10.1109/ICCV.2013.384},
url = {https://mlanthology.org/iccv/2013/zhang2013iccv-robust/}
}