Solving nonlinear svm in linear time? A nyström pproximated svm with applications to image classification∗
Journal
Proceedings of the 13th IAPR International Conference on Machine Vision Applications, MVA 2013
Pages
5-8
Date Issued
2013
Author(s)
Abstract
In this paper, we improve the efficiency of kernelized support vector machine (SVM) for image classification using linearized kernel data representation. Inspired by Nyström approximation, we propose a decomposition technique for converting the kernel data matrix into an approximated primal form. This allows us to apply the approximated kernelized data in the primal form of linear SVMs, and achieve comparable recognition performance as nonlinear SVMs do. Several benefits can be observed for our proposed method. First, we advance basis matrix selection for decomposing our proposed approximation, which can be viewed as fea-ture/instance selection with performance guarantees. More importantly, the proposed selection technique significantly reduces the computation complexity for both training and testing. Therefore, the resulting computation time is comparable to that of linear SVMs. Experiments on two benchmark image datasets will support the use of our approach for solving the tasks of image classification. © 2013; MVA Organization. All rights reserved.
Other Subjects
Classification (of information); Computer vision; Image enhancement; Matrix algebra; Support vector machines; Computation complexity; Computation time; Data representations; Decomposition technique; Image datasets; Performance guarantees; Selection techniques; Training and testing; Image classification
Type
conference paper