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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Learning Fast Emulators of Binary Decision Processes

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


    Emulator

    SMITH STEVEN | Europäisches Patentamt | 2023

    Freier Zugriff

    EMULATOR

    SMITH STEVEN PAUL | Europäisches Patentamt | 2023

    Freier Zugriff

    EMULATOR

    SMITH STEVEN | Europäisches Patentamt | 2023

    Freier Zugriff

    Battery emulator and method for controlling the battery emulator

    KÖNIG OLIVER | Europäisches Patentamt | 2020

    Freier Zugriff