Performance Evaluation of Full Search Equivalent Pattern Matching Algorithms

Authors:
Wanli Ouyang;Federico Tombari;Stefano Mattoccia;Luigi Stefano;W. K. Cham
Affiliations:
The Chinese University of Hong Kong, Hong Kong;University of Bologna, Bologna;University of Bologna, Bologna;University of Bologna, Bologna;The Chinese University of Hong Kong, Hong Kong
Venue:
IEEE Transactions on Pattern Analysis and Machine Intelligence
Year:
2012

Citing 0
Cited 2

Adaptive Low Resolution Pruning for fast Full Search-equivalent pattern matching

Pattern Recognition Letters
Level-set-based motion estimation algorithm for multiple reference frame motion estimation

Journal of Visual Communication and Image Representation

Quantified Score

Hi-index	0.14

Visualization

Abstract

Pattern matching is widely used in signal processing, computer vision, and image and video processing. Full search equivalent algorithms accelerate the pattern matching process and, in the meantime, yield exactly the same result as the full search. This paper proposes an analysis and comparison of state-of-the-art algorithms for full search equivalent pattern matching. Our intention is that the data sets and tests used in our evaluation will be a benchmark for testing future pattern matching algorithms, and that the analysis concerning state-of-the-art algorithms could inspire new fast algorithms. We also propose extensions of the evaluated algorithms and show that they outperform the original formulations.