Robust Adaptive Sparse Learning Method for Graph Clustering

Mulin Chen, Qi Wang, Xuelong Li

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

Graph clustering aims to group the data into clusters according to a similarity graph, and has received sufficient attention in computer vision. As the basis of clustering, the quality of graph affects the results directly. In this paper, a Robust Adaptive Sparse Learning (RASL) method is proposed to improve the graph quality. The contributions made in this paper are three fold: (1) the sparse representation technique is employed to enforce the graph sparsity, and the ell-2,1 norm is introduced to improve the robustness; (2) the intrinsic manifold structure is captured by investigating the local relationship of data points; (3) an efficient optimization algorithm is designed to solve the proposed problem. Experimental results on various real-world benchmark datasets demonstrate the promising results of the proposed graph-based clustering method.

Original languageEnglish
Title of host publication2018 IEEE International Conference on Image Processing, ICIP 2018 - Proceedings
PublisherIEEE Computer Society
Pages1618-1622
Number of pages5
ISBN (Electronic)9781479970612
DOIs
StatePublished - 29 Aug 2018
Event25th IEEE International Conference on Image Processing, ICIP 2018 - Athens, Greece
Duration: 7 Oct 201810 Oct 2018

Publication series

NameProceedings - International Conference on Image Processing, ICIP
ISSN (Print)1522-4880

Conference

Conference25th IEEE International Conference on Image Processing, ICIP 2018
Country/TerritoryGreece
CityAthens
Period7/10/1810/10/18

Keywords

  • Clustering
  • Graph Construction
  • Manifold Structure
  • Sparse Learning

Fingerprint

Dive into the research topics of 'Robust Adaptive Sparse Learning Method for Graph Clustering'. Together they form a unique fingerprint.

Cite this