Learning a Fast Emulator of a Binary Decision Process

 

 

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. [via]
ftp://cmp.felk.cvut.cz/pub/cmp/articles/sochm...

Rating: 0/10

 

 

 

Related Files

 

 
Sponsored Links
Free Download D-Link Manual, Guide, Instructions, available in PDF ebooks format.

Rate this Document

ADS

 

Tag Clouds

 

Last Download

 

BookShelf