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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Learning Fast Emulators of Binary Decision Processes

    Šochman, J. / Matas, J. | British Library Online Contents | 2009


    EMULATOR

    SMITH STEVEN PAUL | European Patent Office | 2023

    Free access

    Emulator

    SMITH STEVEN | European Patent Office | 2023

    Free access

    EMULATOR

    SMITH STEVEN | European Patent Office | 2023

    Free access

    Battery Emulator And Method For Controlling The Battery Emulator

    KÖNIG OLIVER | European Patent Office | 2019

    Free access