Paper
5 September 2008 Dynamic mixing kernels in Gaussian mixture classifier for hyperspectral classification
Vikram Jayaram, Bryan Usevitch
Author Affiliations +
Abstract
In this paper, new Gaussian mixture classifiers are designed to deal with the case of an unknown number of mixing kernels. Not knowing the true number of mixing components is a major learning problem for a mixture classifier using expectation-maximization (EM). To overcome this problem, the training algorithm uses a combination of covariance constraints, dynamic pruning, splitting and merging of mixture kernels of the Gaussian mixture to correctly automate the learning process. This structural learning of Gaussian mixtures is employed to model and classify Hyperspectral imagery (HSI) data. The results from the HSI experiments suggested that this new methodology is a potential alternative to the traditional mixture based modeling and classification using general EM.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Vikram Jayaram and Bryan Usevitch "Dynamic mixing kernels in Gaussian mixture classifier for hyperspectral classification", Proc. SPIE 7075, Mathematics of Data/Image Pattern Recognition, Compression, and Encryption with Applications XI, 70750L (5 September 2008); https://doi.org/10.1117/12.798443
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Data modeling

Expectation maximization algorithms

Principal component analysis

Electro optical modeling

Algorithm development

Remote sensing

Hyperspectral imaging

Back to Top