Textual image compression is a method of both lossy and lossless image compression that is particularly effective for images containing repeated sub-images, notably pages of text (Mohiuddin et al., 1984; Witten et al., 1992). The process comprises three main steps: Extracting all the characters from an image; Building a library that contains one representative for each character class; Compress...

We consider the problem of locating a template as a subimage of a larger image. Computing the maxima of the correlation function solves this problem classically. Since the correlation can be calculated with the Fourier transform this problem is a good candidate for a superior quantum algorithmic solution. We outline how such an algorithm would work.

By exploiting an analogy with averaging procedures in fluid dynamics, we present a set of averaged template matching equations. These equations are analogs of the exact template matching equations that retain all the geometric properties associated with the diffeomorphism group, and which are expected to average out small scale features and so should, as in hydrodynamics, be more computationall...

This paper introduces variations on the template matching theme that extend its usefulness by providing invariance to mean intensity-level variations, certain geometric transformations and partial obscura-tions of the target object in the image. First order statistics of the pixel by pixel diierences between the template and the image are used as a match measure in order to provide invariance t...

Data-driven object tracking is very important for many vision based applications, because it does not require any previous knowledge about the object to be tracked. In the literature, template matching techniques have successfully been used to solve this task. One promising descendant of these techniques is the hyperplane approach, which is both fast and robust. Unfortunately, like other templa...

In the last decade, consumer graphics cards have increased their power because of the computer games industry. These cards are now programmable and capable of processing huge amounts of data in a SIMD fashion. In this work, we propose an alternative implementation of a very intuitive and well known 2D template matching, where the most computationally expensive task is accomplished by the graphi...

In image matching applications such as tracking and stereo matching, it is common to use the sum-of-squareddi erences (SSD) measure to determine the best match for an image template. However, this measure is sensitive to outliers and is not robust to template variations. We describe a robust measure and eÆcient search strategy for template matching with a binary or greyscale template using a ma...

, doi: 10.1098/rstb.2005.1662 36