New Algorithm Speeds Up Image Matching for High-Resolution Data
Researchers have developed a faster method for template matching—a core computer vision task used in object detection and image tracking—that maintains accuracy while handling high-resolution images. The breakthrough could accelerate deployment of vision systems in applications from autonomous vehicles to medical imaging, where processing speed directly impacts operational costs.
Originaltitel: Efficient High-Resolution Template Matching with Vector Quantized Nearest Neighbour Fields
<p>Template matching is a fundamental problem in computer vision with applications in fields including object detection, image registration, and object tracking. Current methods rely on nearest-neighbour (NN) matching, where the query feature space is converted to NN space by representing each query pixel with its NN in the template. NN-based methods have been shown to perform better in occlusions, appearance changes, and non-rigid transformations; however, they scale poorly with high-resolution data and high feature dimensions. We present an NN-based method that efficiently reduces the NN computations and introduces filtering in the NN fields (NNFs). A vector quantization step is introduced before the NN calculation to represent the template with k features, and the filter response over the NNFs is used to compare the template and query distributions over the features. We show that state-of-the-art performance is achieved in low-resolution data, and our method outperforms previous methods at higher resolution.</p>