首页 | 本学科首页   官方微博 | 高级检索  
   检索      


A discriminated similarity matrix construction based on sparse subspace clustering algorithm for hyperspectral imagery
Institution:1. State Key Laboratory of Information Engineering in Surveying, Mapping, and Remote Sensing, Wuhan University, Wuhan 430079, China;2. Geoinformatics Unit, RIKEN AIP, Japan;2. Statistics Departament, Universidade Federal da Paraíba, João Pessoa, Paraíba, Brazil;3. Department of Speech-Language and Hearing Sciences, Universidade Federal da Paraíba, João Pessoa, Paraíba, Brazil
Abstract:The clustering of hyperspectral images is a challenging task because of the high dimensionality of the data. Sparse subspace clustering (SSC) algorithm is one of the popularly used clustering algorithm for high dimensionality data. However, SSC has not fully used the spectral and spatial information during similarity matrix construction based on single sparse representation coefficient for hyperspectral Imagery (HSI) clustering. In this paper, two novel similarity matrix construction methods named as Cosine-Euclidean similarity matrix (abbreviated as CE) and Cosine-Euclidean dynamic weighting similarity matrix (abbreviated as CEDW) are proposed for HSI clustering. They can combine the high spectral information and rich spatial information. Firstly, CE utilizes the cosine similarity of spectral information based on overall sparse representation vectors and classical Euclidean distance of spatial information to construct a novel similarity matrix. Secondly, inheriting CE merits, dynamic weighting adjustment method is introduced to CEDW for some external influence factors to the HSI information. Several experiments on HSI demonstrated that the proposed algorithms are effective for HSI clustering.
Keywords:Hyperspectral imagery  Sparse subspace clustering  Similarity matrix  Sparse representation vector
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号