Grayscale Template-Matching Invariant to Rotation, Scale, Translation, Brightness and Contrast

In this paper, we consider the grayscale template-matching problem, invariant to rotation, scale, translation, brightness and contrast, without previous operations that discard grayscale information, like detection of edges, detection of interest points or segmentation/binarization of the images. The obvious “brute force” solution performs a series of conventional template matchings between the image to analyze and the template query shape rotated by every angle, translated to every position and scaled by every factor (within some specified range of scale factors). Clearly, this takes too long and thus is not practical. We propose a technique that substantially accelerates this searching, while obtaining the same result as the original brute force algorithm. In some experiments, our algorithm was 400 times faster than the brute force algorithm. Our algorithm consists of three cascaded filters. These filters successively exclude pixels that have no chance of matching the template fr...

• Type: Conference
• Year: 2007
• Where: PSIVT
• Authors: Hae Yong Kim, Sidnei Alves de Araújo
• Keywords: Brute Force, Brute Force Algorithm, Grayscale Template-matching Problem, PSIVT 2007