A comparison of kernel functions for intimate mixture models
Authors:
- 1 August 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21586268,p. 1-4
Abstract
In previous work, kernel methods were introduced as a way to generalize the linear mixing model. This work led to a new set of algorithms that performed the unmixing of hyperspectral imagery in a reproducing kernel Hilbert space. By processing the imagery in this space different types of unmixing could be introduced - including an approximation of intimate mixtures. Whereas previous research focused on developing the mathematical foundation for kernel unmixing, this paper focuses on the selection of the kernel function. Experiments are conducted on real-world hyperspectral data using a linear, a radial-basis function, a polynomial, and a proposed physics-based kernel. Results show which kernels provide the best ability to perform intimate unmixing.Keywords
This publication has 9 references indexed in Scilit:
- Investigation of Nonlinearity in Hyperspectral Imagery Using Surrogate Data MethodsIEEE Transactions on Geoscience and Remote Sensing, 2008
- Remote Sensing2007
- Kernel fully constrained least squares abundance estimates2007
- A quantitative and comparative analysis of linear and nonlinear spectral mixture models using radial basis function neural networksIEEE Transactions on Geoscience and Remote Sensing, 2001
- Fully constrained least squares linear spectral mixture analysis method for material quantification in hyperspectral imageryIEEE Transactions on Geoscience and Remote Sensing, 2001
- Theory of Reflectance and Emittance Spectroscopy1993
- Green vegetation, nonphotosynthetic vegetation, and soils in AVIRIS dataRemote Sensing of Environment, 1993
- Photometric phase functions of common geologic minerals and applications to quantitative analysis of mineral mixture reflectance spectraJournal of Geophysical Research, 1989
- An algorithm for linear least squares problems with equality and nonnegativity constraintsMathematical Programming, 1981