Robust sparse coding for subspace learning

Authors

  • Xiangguang Dai Chongqing Three Gorges University - School of Three Gorges Artificial Intelligence
  • Yingyin Tao Chongqing Three Gorges University - School of Three Gorges Artificial Intelligence
  • Jiang Xiong Chongqing Three Gorges University - School of Three Gorges Artificial Intelligence
  • Yuming Feng Chongqing Three Gorges University - School of Three Gorges Artificial Intelligence

Keywords:

sparse coding, matrix completion, robustness, dimensionality reduction

Abstract

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.

Author Biography

Yingyin Tao, Chongqing Three Gorges University - School of Three Gorges Artificial Intelligence

 

 

Downloads

Published

2020-07-31

How to Cite

Dai, X., Tao, Y., Xiong, J., & Feng, Y. (2020). Robust sparse coding for subspace learning. Italian Journal of Pure and Applied Mathematics, 44, 986–994. Retrieved from https://journals.uniurb.it/index.php/ijpam/article/view/7398

Issue

Section

Articoli - Forum Editrice

Most read articles by the same author(s)

<< < 1 2 3 > >> 

Similar Articles

1 2 3 4 5 > >> 

You may also start an advanced similarity search for this article.