Band selection algorithm for reverse nearest neighbor density peak clustering of hyperspectral images
The density peak clustering band selection algorithm uses the local density to describe the density information of the band.However,the existing local density is easy to ignore the global information of the band distribution and can't effectively describe the distribution characteristics of the band,resulting in the limited classification accuracy of the band subset.In order to solve the above problems,this paper proposes a density peak clustering band selection algorithm based on reverse nearest neighbor.Firstly,the K-nearest neighbor directed graph is constructed by using the band and its K-nearest neighbor to obtain the reverse nearest neighbor of the band,as well as the shared nearest neighbor and shared reverse nearest neighbor between bands.Then,the union number of shared nearest neighbors and shared reverse nearest neighbors is used as the similarity be-tween bands,and the enhanced local density is constructed by using the average Euclidean distance and similarity between bands and their reverse nearest neighbors.Finally,the product of enhanced local density,distance factor and information en-tropy is taken as the weight value,and the segment subset is selected according to the weight value.In order to improve the ef-ficiency and practicability of the experiment,an adaptive K value method is also proposed in this paper.The experimental re-sults on three hyperspectral standard data sets show that the band subset obtained by this algorithm has better classification performance than the band selected by other advanced algorithms,especially when the number of bands is small,and the calcu-lation efficiency is high.
hyperspectral imageband selectiondensity peak clusteringreverse nearest neighborlocal densityadaptive K value