Approximate sparse spectral clustering based on local information maintenance for hyperspectral image classification

PLoS One. 2018 Aug 17;13(8):e0202161. doi: 10.1371/journal.pone.0202161. eCollection 2018.

Abstract

Sparse spectral clustering (SSC) has become one of the most popular clustering approaches in recent years. However, its high computational complexity prevents its application to large-scale datasets such as hyperspectral images (HSIs). In this paper, we propose two efficient approximate sparse spectral clustering methods for HSIs clustering in which clustering performance is improved by utilizing local information among the data. Firstly, we construct a smaller representative dataset on which sparse spectral clustering is performed. Then the labels of ground object are extending to whole dataset based on the local information according to two extending strategies. The first one is that the local interpolation is utilized to improve the extension of the clustering result. The other one is that the label extension is turned to a problem of subspace embedding, and is fulfilled by locally linear embedding (LLE). Several experiments on HSIs demonstrated that the proposed algorithms are effective for HSIs clustering.

Publication types

  • Research Support, Non-U.S. Gov't

MeSH terms

  • Algorithms
  • Cluster Analysis*
  • Models, Theoretical*

Grants and funding

This work is supported by: 1. the National Natural Science Foundation of China, Grant No. 61602002, https://isisn.nsfc.gov.cn, Q.Y.; 2. the AnHui University Youth Skeleton Teacher Project, No. E12333010289, http://www1.ahu.edu.cn/rsc/main/index.asp, Q.Y.; 3. China Postdoctoral Science Foundation, No. 2015M582826, http://jj.chinapostdoctor.org.cn/V1/Program3/Default.aspx, L.X.; 4. Anhui University Doctoral Scientific Research Start-up Funding, J10113190084, Q.Y. The funders had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.