Robust Real-Time Face Detection
International Journal of Computer Vision
WaldBoost " Learning for Time Constrained Sequential Detection
CVPR '05 Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02
Real-Time Pattern Matching Using Projection Kernels
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
The worst-case execution-time problem—overview of methods and survey of tools
ACM Transactions on Embedded Computing Systems (TECS)
Robust Real-Time Pattern Matching Using Bayesian Sequential Hypothesis Testing
IEEE Transactions on Pattern Analysis and Machine Intelligence
Full-Search-Equivalent Pattern Matching with Incremental Dissimilarity Approximations
IEEE Transactions on Pattern Analysis and Machine Intelligence
A fast globally optimal algorithm for template matching using low-resolution pruning
IEEE Transactions on Image Processing
Fast Full-Search Equivalent Template Matching by Enhanced Bounded Correlation
IEEE Transactions on Image Processing
| Hi-index | 0.01 |
The problem of finding a match for an image ('template') within a larger image is known as template matching. It is key to a variety of Computer Vision applications. Currently known template matching algorithms run in fixed time, or are guaranteed to find the best match. We present a novel algorithm which in many cases can guarantee that the best match is found. In other cases it finds a good approximation to the best match. This algorithm runs in fixed time (a.k.a. hard real time). It finds an optimal match very quickly when a good match exists.