Development of a watershed algorithm for multiresolution multidimensional clustering of hyperspectral data

Gerard P. Jellison; Terrence H. Hemmer; Darryl G. Wilson

doi:10.1117/12.478761

2 August 2002 Development of a watershed algorithm for multiresolution multidimensional clustering of hyperspectral data

Gerard P. Jellison, Terrence H. Hemmer, Darryl G. Wilson

Author Affiliations +

Proceedings Volume 4725, Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery VIII; (2002) https://doi.org/10.1117/12.478761
Event: AeroSense 2002, 2002, Orlando, FL, United States

Abstract

The watershed-clustering algorithm was adapted for use in multi-dimentional spectral space and was used to define clusters in Hyperspectral Digital Imagery Collection Experiment (HYDICE) data. This algorithm identifies clusters as peaks in a B-dimensional topographic relief, where B is the number of wavelength bands. Image pixel spectra are represented as points in this multi-dimensional space. Analysis is done at increasing values of radiometric resolution, defined by the number of segments into which each wavelength axis is divided. Segmentation of the axes divides the multi-dimensional space into bins, and the number pixels in each bin is determined. The histogram of the bin populations defines the topography for the watershed analysis. Spectral clusters correspond to mountains or islands on this multi-dimensional surface. The algorithm is analogous to submerging this topography under water, and revealing clusters by determining when mountain peaks appear as the water surface is lowered. Testing of this algorithm reveals some surprising features. Although increasing the radiometric resolution (bins per axis) generally results in large clusters breaking up into greater numbers of small clusters., this is not always the case. Under some circumstances, the separate clusters can recombine into one large cluster when radiometric resolution is increased. This behavior is caused by the existence of single-pixel voxels, which smooths out the topography, and by the fact that the voxels retain a surprising degree of connectivity, even at high radiometric resolutions. These characteristics of the high-dimensional spectral data provide the basis for further development of the watershed algorithm.

Citation Download Citation

Gerard P. Jellison, Terrence H. Hemmer, and Darryl G. Wilson "Development of a watershed algorithm for multiresolution multidimensional clustering of hyperspectral data", Proc. SPIE 4725, Algorithms and Technologies for Multispectral, Hyperspectral, and Ultraspectral Imagery VIII, (2 August 2002); https://doi.org/10.1117/12.478761

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
12 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Radiometric resolution

Algorithm development

Image resolution

Image segmentation

Visualization

Hyperspectral imaging

Information operations

Show All Keywords

Keywords/Phrases

Search In:

Publication Years