Segmentation of multiband imagery using minimum spanning trees

We present a new technique for the automatic segmentation of multiband imagery. Our approach is based on the computation of a minimum spanning tree over a graph derived from the image. We use a fast graph-search algorithm and a custom tree-splitting algorithm to provide a high level of performance. This approach captures some of the gestalt characteristics of human perceptual grouping and is easily adaptable to a variety of spectral and spatial criteria. We demonstrate our technique on multispectral and hyperspectral imagery of the earth's surface.

[1]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[2]  John M. Prager,et al.  Extracting and Labeling Boundary Segments in Natural Scenes , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Robert E. Tarjan,et al.  Finding Minimum Spanning Trees , 1976, SIAM J. Comput..

[4]  Charles T. Zahn,et al.  Graph-Theoretical Methods for Detecting and Describing Gestalt Clusters , 1971, IEEE Transactions on Computers.