Hyperspectral band selection based on graph clustering

Abstract

In this paper we present a new method for hyperspectral band selection problem. The principle is to create a band adjacency graph (BAG) where the nodes represent the bands and the edges represent the similarity weights between the bands. The Markov Clustering Process (abbreviated MCL process) defines a sequence of stochastic matrices by alternation of two operators on the associated affinity matrix to form distinct clusters of high correlated bands. Each cluster is represented by one band and the representative bands will form the new data cube to be used in subsequent processing. The proposed algorithm is tested on a real dataset and compared against state-of-art. The results are promising.