Superpixel segmentation of hyperspectral images based on entropy and mutual information

Abstract

Superpixel segmentation (SS) methods have been proven to be feasible in improving the performance of hybrid algorithms on hyperspectral images (HSIs). In this paper, a superpixel segmentation algorithm based on the information measures with color histogram driving (IM-CHD) was proposed. First, Shannon entropy was applied to measure the image information and preliminarily select spectral bands. Mutual information (MI) is derived from the concept of entropy and measures the statistical dependence between two random variables. Also, MI can effectively identify the redundant spectral bands. Therefore, in this paper, both MI and color matching functions (CMF) were used to select the most useful spectral bands. Second, the selected spectral bands were combined into a false color image containing the main spectral information. A local optimization algorithm named "hill climbing" was used to achieve the superpixel segmentation. Finally, parameter selection experiments and comparative experiments were performed on two hyperspectral data sets. The experimental results showed that the IM-CHD method was more efficient and accurate than other state-of-the-art methods.