Paper
31 October 1997 Progress toward information-extraction methods for hyperspectral data
Author Affiliations +
Abstract
A focused research program has been under way for several years to discover optimally effective means for analysis of multispectral and hyperspectral data. The methods pursued are based upon fundamental principles of signal theory and signal processing. The basic approach revolves around viewing N spectral bands of data from a pixel as a single point in N dimensional space, thus, an important aspect of the work has been to discover unique aspects of higher dimensional spaces which can be exploited for their information-bearing aspects. Substantial progress on this problem has been made in the last several years, with several key algorithms having been defined. Among these are algorithms for transforms which define optimal case-specific features, and which improve the ability of the classifier to generalize. A more fundamental finding has been to understand the characteristics of high dimensional space and the significance of design samples and their use in defining the classifier. These results have been published in separate papers over the last several years. The purpose of this paper is to survey these results and to show how they relate to one another in achieving an effective overall analysis procedure for analyzing a hyperspectral image data set.
© (1997) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
David A. Landgrebe "Progress toward information-extraction methods for hyperspectral data", Proc. SPIE 3118, Imaging Spectrometry III, (31 October 1997); https://doi.org/10.1117/12.278934
Lens.org Logo
CITATIONS
Cited by 4 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Statistical analysis

Feature extraction

Remote sensing

Sensors

Data analysis

Distance measurement

Stochastic processes

Back to Top