Approximate RBF Kernel SVM and Its Applications in Pedestrian Classification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2008

Approximate RBF Kernel SVM and Its Applications in Pedestrian Classification

Abstract

This paper presents an efficient approximation to the nonlinear SVM with Radial Basis Function (RBF) kernel. By employing second-order polynomial approximation to RBF kernel, the derived approximate RBF-kernel SVM classifier can take a compact form by exchanging summation in conventional SVM classification formula, leading to constant low complexity that is only relevant to the dimensions of feature. Experiments on pedestrian classification show that our approximate RBF-kernel SVM achieved classification performance close to the exact implementation with significantly low time and memory.
Fichier principal
Vignette du fichier
mlvma08_submission_5.pdf (146.88 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00325810 , version 1 (30-09-2008)

Identifiers

  • HAL Id : inria-00325810 , version 1

Cite

Hui Cao, Takashi Naito, Yoshiki Ninomiya. Approximate RBF Kernel SVM and Its Applications in Pedestrian Classification. The 1st International Workshop on Machine Learning for Vision-based Motion Analysis - MLVMA'08, Oct 2008, Marseille, France. ⟨inria-00325810⟩

Collections

MLVMA08
1201 View
4029 Download

Share

Gmail Facebook X LinkedIn More