Share Email Print
cover

Proceedings Paper

Unsupervised segmentation algorithm based on an iterative spectral dissimilarity measure for hyperspectral imagery
Author(s): Heesung Kwon; Sandor Z. Der; Nasser M. Nasrabadi
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

We present an adaptive unsupervised segmentation technique, in which spectral features are obtained and processed without a priori knowledge of the spectral characteristics. The proposed technique is based on an iterative method, in which segmentation at a given iteration depends closely on the segmentation results at the previous iteration. The hyperspectral images are first coarsely segmented and then the segmentation is successively refined via an iterative spectral dissimilarity measure. The algorithm also provides reduced computational complexity and improved segmentation performance. The algorithm consists of (1) an initial segmentation based on a fixed spectral dissimilarity measure and the k-means algorithm, and (2) subsequent adaptive segmentation based on an iterative spectral dissimilarity measure over a local region whose size is reduced progressively. The iterative use of a local spectral dissimilarity measure provided a set of values that can discriminate among different materials. The proposed unsupervised segmentation technique proved to be superior to other unsupervised algorithms, especially when a large number of different materials are mixed in complex hyperspectral scenes.

Paper Details

Date Published: 29 December 2000
PDF: 9 pages
Proc. SPIE 4310, Visual Communications and Image Processing 2001, (29 December 2000); doi: 10.1117/12.411792
Show Author Affiliations
Heesung Kwon, Army Research Lab. (United States)
Sandor Z. Der, Army Research Lab. (United States)
Nasser M. Nasrabadi, Army Research Lab. (United States)


Published in SPIE Proceedings Vol. 4310:
Visual Communications and Image Processing 2001
Bernd Girod; Charles A. Bouman; Eckehard G. Steinbach, Editor(s)

© SPIE. Terms of Use
Back to Top