Approximate Pattern Matching Algorithm

We propose a fast algorithm of image pattern (instance) matching which is based on an efficient encoding of the pattern and database images. For each image, the encoding produces a matrix of the F-transform components. The matching is then realized by comparing the F-transform components of the pattern and the database images. The optimal setting of the algorithm parameters is discussed, the success rate and the run time are exhibited.