Abstract Image-matching, the attempt to discover in a picture currently under examination an image found in an earlier picture, is a desirable part of many picture-processing and scene-analysis applications. This paper describes an algorithm consisting of two parts; the first is a steepest-descent method for finding the best match in a given locale. The second is a procedure for selecting starting points for the local search. A special analysis is made of both the reliability and speed of the steepest-descent method leading to a conclusion that its average-time performance is 0( n 2 ). This compares rather favorably with the speed of two other popular algorithms for image-matching, namely direct computation of the entire correlation matrix (0( n 2 ( n − m ))) and fast Fourier Transform (0(( n + m ) 2 log( n + m ))), where n and m are the picture- and window-sizes, respectively, measured in pixels.
[1]
Martin A. Fischler,et al.
The Representation and Matching of Pictorial Structures
,
1973,
IEEE Transactions on Computers.
[2]
L. Quam.
Computer comparison of pictures
,
1971
.
[3]
A. K. Dewdney.
A grey-level character set for the production of pictures at a printing terminal
,
1976,
COMG.
[4]
John A. Leese,et al.
The determination of cloud pattern motions from geosynchronous satellite image data
,
1970,
Pattern Recognit..
[5]
J. Tukey,et al.
An algorithm for the machine calculation of complex Fourier series
,
1965
.
[6]
Marsha Jo Hannah,et al.
Computer matching of areas in stereo images.
,
1974
.
[7]
Richard O. Duda,et al.
Pattern classification and scene analysis
,
1974,
A Wiley-Interscience publication.