Robust sparse coding for subspace learning
Keywords:
sparse coding, matrix completion, robustness, dimensionality reductionAbstract
Conventional sparse coding fails to learn a robust subspace when the data is corrupted by noises or outliers. To remedy this problem, matrix completion is considered into sparse coding to recover the corrupted data by the normal data and the robust sparse representations can be learned from the recovered data and the normal data. Therefore, a robust sparse coding method, called RSC, is proposed to learn a low-dimensional subspace from the corrupted data. Experiments are carried out on the image dataset which is contaminated by noises or outliers. It is demonstrated that our proposed RSC is more effective and robust in subspace learning and image clustering than other dimensionality reduction methods.
Downloads
Published
How to Cite
Issue
Section
License
Copyright (c) 2020 Xiangguang Dai, Yingyin Tao, Jiang Xiong, Yuming Feng

This work is licensed under a Creative Commons Attribution 4.0 International License.
L'opera è pubblicata sotto Licenza Creative Commons Attribuzione 4.0 Internazionale (CC-BY)

