The Community for Technology Leaders
2008 IEEE Conference on Computer Vision and Pattern Recognition (2008)
Anchorage, AK, USA
June 23, 2008 to June 28, 2008
ISBN: 978-1-4244-2242-5
pp: 1-8
Subhransu Maji , EECS Department, U.C. Berkeley, USA
Alexander C. Berg , Yahoo! Research, Chile
Jitendra Malik , EECS Department, U.C. Berkeley, USA
ABSTRACT
Straightforward classification using kernelized SVMs requires evaluating the kernel for a test vector and each of the support vectors. For a class of kernels we show that one can do this much more efficiently. In particular we show that one can build histogram intersection kernel SVMs (IKSVMs) with runtime complexity of the classifier logarithmic in the number of support vectors as opposed to linear for the standard approach. We further show that by precomputing auxiliary tables we can construct an approximate classifier with constant runtime and space requirements, independent of the number of support vectors, with negligible loss in classification accuracy on various tasks. This approximation also applies to 1 — χ<sup>2</sup> and other kernels of similar form. We also introduce novel features based on a multi-level histograms of oriented edge energy and present experiments on various detection datasets. On the INRIA pedestrian dataset an approximate IKSVM classifier based on these features has the current best performance, with a miss rate 13% lower at 10<sup>−6</sup> False Positive Per Window than the linear SVM detector of Dalal & Triggs. On the Daimler Chrysler pedestrian dataset IKSVM gives comparable accuracy to the best results (based on quadratic SVM), while being 15× faster. In these experiments our approximate IKSVM is up to 2000× faster than a standard implementation and requires 200× less memory. Finally we show that a 50× speedup is possible using approximate IKSVM based on spatial pyramid features on the Caltech 101 dataset with negligible loss of accuracy.
INDEX TERMS
CITATION

J. Malik, S. Maji and A. C. Berg, "Classification using intersection kernel support vector machines is efficient," 2008 IEEE Conference on Computer Vision and Pattern Recognition(CVPR), Anchorage, AK, USA, 2008, pp. 1-8.
doi:10.1109/CVPR.2008.4587630
92 ms
(Ver 3.3 (11022016))