GRAPH-CUT-BASED MODEL FOR SPECTRAL-SPATIAL CLASSIFICATION OF HYPERSPECTRAL IMAGES

We propose a new spectral-spatial method for hyperspectral image classification based on a graph cut. The classification task is formulated as an energy minimization problem on the graph of image pixels, and is solved by using the graph-cut aexpansion approach. The energy to optimize is computed as a sum of data and interaction energy terms, respectively. The data energy term is computed using the outputs of the probabilistic support vector machines classification. The second energy term, which expresses the interaction between spatially adjacent pixels, is computed by using dissimilarity measures between spectral vectors, such as vector norms, spectral angle mapper and spectral information divergence. Experimental results on hyperspectral images captured by the ROSIS and the AVIRIS sensors reveal that the proposed method yields higher classification accuracies when compared to the recent state-of-the-art approaches.