Support Vector Machines for Optimal Classification and Spectral Unmixing
Brown, M., Lewis, H.G. and Gunn, S.R. (1999) Support Vector Machines for Optimal Classification and Spectral Unmixing. Ecological Modelling, 120, 167--179.
Full text not available from this repository.
Mixture modelling is becoming an increasingly important tool in the remote sensing community as researchers attempt to resolve sub-pixel, area information. This paper compares a well-established technique, Linear Spectral Mixture Models (LSMM), with a much newer idea based on data selection, Support Vector Machines (SVM). It is shown that the constrained least squares LSMM is equivalent to the linear SVM, which relies on proving that the LSMM algorithm possesses the "maximum margin" property. This in turn shows that the LSMM algorithm can be derived from the same optimality conditions as the linear SVM, which provides important insights about the role of the bias term and rank deficiency in the pure pixel matrix within the LSMM algorithm. It also highlights one of the main advantages for using the linear SVM algorithm in that it performs automatic "pure pixel" selection from a much larger database. In addition, extensions to the basic SVM algorithm allow the technique to be applied to data sets which exhibit spectral confusion (overlapping sets of pure pixels) and to data sets which have non-linear mixture regions. Several illustrative examples, based on an area-labelled Landsat TM dataset, are used to demonstrate the potential of this approach.
|Divisions:||Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Electronic & Software Systems
|Date Deposited:||27 Mar 2002|
|Last Modified:||27 Mar 2014 19:58|
|Further Information:||Google Scholar|
|ISI Citation Count:||59|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)