Abstract
Unsupervised classification plays an important role in hyperspectral image(HSI) applications. However, most clustering methods used for HSI classification face the problem of tuning parameters carefully. Recently, a novel clustering algorithm named connection center evolution (CCE) has been proposed and achieved great success regarding this problem. However, for large-scale HSI data with too many pixels, CCE suffers from large memory costs for constructing the similarity matrix. In this paper, we proposed an improved version for CCE, which is inspired by the fact that the underlying data distribution can be expressed as a few weekly correlated clusters. The proposed version treats the original data as a few representative sets, then uses the clustering center of each set to construct the similarity matrix. This new version breaks, for the first time, the limitation of CCE with regards to handling large-size HSI datasets. Extensive experimental results on synthetic data and real HSI datasets show that the proposed algorithm is insensitivity to the setting of parameters, able to suggest the optimal number of clusters, and can achieve superior performance compared to state-of-the-art clustering methods.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.