Speeding up Support Vector Machine (SVM) image classification by a kernel series expansion
- 1 October 2008
- conference paper
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE) in 2008 15th IEEE International Conference on Image Processing
Abstract
Due to their flexibility, and capacity to handle high dimensional vectorial data, support vector machines (SVMs) have become the reference for remote sensing imagery classification. However when processing large amounts of data the SVM classification could be a time consuming process. In this paper a new decomposition scheme of the SVM decision function is proposed. The decomposition is based on using the Taylor series expansion to approximate the kernel function. Then, using the results of the optimization problem of the SVM after the learning phase, this expansion is used to obtain an approximate decision function that provides a trade-off between the classification accuracy and the processing time. This speeds-up the SVM classification if limited processing time is available and favors accuracy if sufficient processing time is available.Keywords
This publication has 5 references indexed in Scilit:
- Customizing Kernel Functions for SVM-Based Hyperspectral Image ClassificationIEEE Transactions on Image Processing, 2008
- An Introduction to Support Vector Machines and Other Kernel-based Learning MethodsPublished by Cambridge University Press (CUP) ,2000
- An overview of statistical learning theoryIEEE Transactions on Neural Networks, 1999
- Support-vector networksMachine Learning, 1995
- The Nature of Statistical Learning TheoryPublished by Springer Science and Business Media LLC ,1995