Fast hyperspectral data processing methods

The need for fast hyperspectral data processing methods is discussed. Discussion includes the necessity of faster processing techniques in order to realize emerging markets for hyperspectral data. Several standard hyperspectral image processing methods are presented, including maximum likelihood classification, principal components analysis, and canonical analysis. Modifications of those methods are presented that are computationally more efficient than standard techniques. Recent technological developments enabling hardware acceleration of hyperspectral data processing methods are also presented as well as their applicability to various hyperspectral data processing algorithms.

[1]  John P. Kerekes,et al.  SAR and HSI data fusion for counter CC&D , 1999, Proceedings of the 1999 IEEE Radar Conference. Radar into the Next Millennium (Cat. No.99CH36249).

[2]  John A. Richards,et al.  Segmented principal components transformation for efficient hyperspectral remote-sensing image display and classification , 1999, IEEE Trans. Geosci. Remote. Sens..

[3]  John A. Richards,et al.  Efficient maximum likelihood classification for imaging spectrometer data sets , 1994, IEEE Trans. Geosci. Remote. Sens..

[4]  David A. Landgrebe,et al.  Fast likelihood classification , 1991, IEEE Trans. Geosci. Remote. Sens..

[5]  N. B. Venkateswarlu,et al.  Three stage ML classifier , 1991, Pattern Recognit..

[6]  Qian Du,et al.  A joint band prioritization and band-decorrelation approach to band selection for hyperspectral image classification , 1999, IEEE Trans. Geosci. Remote. Sens..

[7]  Yingbai Yan,et al.  Parallel implementation of the Karhunen-Loeve procedure for image recognition , 1999, Optics + Photonics.

[8]  Chein-I Chang,et al.  A fast two-stage classification method for high-dimensional remote sensing data , 1998, IEEE Trans. Geosci. Remote. Sens..

[9]  John A. Richards,et al.  Remote Sensing Digital Image Analysis: An Introduction , 1999 .