Wald’s Sequential Analysis for Time-constrained Vision Problems
Type of documentpříspěvek z konference - elektronický
Rights© 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
MetadataShow full item record
In detection and matching problems in computer vision, both classification errors and time to decision characterize the quality of an algorithmic solution. We show how to formalize such problems in the framework of sequential decisionmaking and derive quasi-optimal time-constrained solutions for three vision problems. The methodology is applied to face and interest point detection and to the RANSAC robust estimator. Error rates of the face detector proposed algorithm are comparable to the state-of-the-art methods. In the interest point application, the output of the Hessian-Laplace detector  is approximated by a sequential WaldBoost classifier which is about five times faster than the original with comparable repeatability. A sequential strategy based on Wald’s SPRT for evaluation of model quality in RANSAC leads to significant speed-up in geometric matching problems.
The following license files are associated with this item: