Learning a Fast Emulator of a Binary Decision Process

  • Jan Šochman
  • Jiří Matas
Conference paper

DOI: 10.1007/978-3-540-76390-1_24

Part of the Lecture Notes in Computer Science book series (LNCS, volume 4844)
Cite this paper as:
Šochman J., Matas J. (2007) Learning a Fast Emulator of a Binary Decision Process. In: Yagi Y., Kang S.B., Kweon I.S., Zha H. (eds) Computer Vision – ACCV 2007. ACCV 2007. Lecture Notes in Computer Science, vol 4844. Springer, Berlin, Heidelberg

Abstract

Computation time is an important performance characteristic of computer vision algorithms. This paper shows how existing (slow) binary-valued decision algorithms can be approximated by a trained WaldBoost classifier, which minimises the decision time while guaranteeing predefined approximation precision. The core idea is to take an existing algorithm as a black box performing some useful binary decision task and to train the WaldBoost classifier as its emulator.

Two interest point detectors, Hessian-Laplace and Kadir-Brady saliency detector, are emulated to demonstrate the approach. The experiments show similar repeatability and matching score of the original and emulated algorithms while achieving a 70-fold speed-up for Kadir-Brady detector.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Jan Šochman
    • 1
  • Jiří Matas
    • 1
  1. 1.Center for Machine Perception, Dept. of Cybernetics, Faculty of Elec. Eng., Czech Technical University in Prague, Karlovo nám. 13, 121 35 Prague, Czech Rep. 

Personalised recommendations