Comparison of SEM and linear unmixing approaches for classification of spectral data
暂无分享,去创建一个
In recent years a number of techniques for automated classification of terrain from spectral data have been developed and applied to multispectral and hyperspectral data. Use of these techniques for hyperspectral data has presented a number of technical and practical challenges. Here we present a comparison of two fundamentally different approaches to spectral classification of data: (1) Stochastic Expectation Maximization (SEM), and (2) linear unmixing. The underlying background clutter models for each are discussed and parallels between them are explored. Parallels are drawn between estimated parameters or statistics obtained from each type of method. The mathematical parallels are then explored through application of these clutter models to airborne hyperspectral data from the NASA AVIRIS sensor. The results show surprising similarity between some of the estimates derived from these two clutter models, despite the major differences in the underlying assumptions of each.
[1] Joseph W. Boardman,et al. Analysis, understanding, and visualization of hyperspectral data as convex sets in n space , 1995, Defense, Security, and Sensing.
[2] T. Moon. The expectation-maximization algorithm , 1996, IEEE Signal Process. Mag..
[3] John A. Antoniades,et al. Use of filter vectors in hyperspectral data analysis , 1995, Optics & Photonics.
[4] Wojciech Pieczynski,et al. SEM algorithm and unsupervised statistical segmentation of satellite images , 1993, IEEE Trans. Geosci. Remote. Sens..