A fast technique for recursive scene matching using pyramids

An algorithm of a fast correlation technique for scene matching using pyramidal image representation is introduced. A mathematical model of the image registration process based on the pyramidal representation of a separable Markov random field is considered in order to evaluate threshold sequence for the algorithm. Experimental results are presented for matching images, both free of noise and corrupted by noise. Theoretical and experimental results given in the paper show that computational efficiency in scene matching could be improved in three orders of magnitude comparatively to the traditional correlation technique.

[1]  Granino A. Korn,et al.  Mathematical handbook for scientists and engineers , 1961 .

[2]  William K. Pratt,et al.  Correlation Techniques of Image Registration , 1974, IEEE Transactions on Aerospace and Electronic Systems.

[3]  Ernest L. Hall,et al.  Sequential Hierarchical Scene Matching , 1978, IEEE Transactions on Computers.

[4]  Azriel Rosenfeld,et al.  Two-Stage Template Matching , 1977, IEEE Transactions on Computers.

[5]  Wei-Chung Lin,et al.  Space-Time Domain Expansion Approach to VLSI and Its Application to Hierarchical Scene Matching , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Steven L. Tanimoto,et al.  Template matching in pyramids , 1981 .

[7]  Harvey F. Silverman,et al.  A Class of Algorithms for Fast Digital Image Registration , 1972, IEEE Transactions on Computers.

[8]  V. V. Alexandrov,et al.  Recursive pyramids and their use for image coding , 1984, Pattern Recognit. Lett..