Analysis of a steepest-descent image-matching algorithm

https://doi.org/10.1016/0031-3203(78)90046-8Get rights and content

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(n2). This compares rather favorably with the speed of two other popular algorithms for image-matching, namely direct computation of the entire correlation matrix (0(n2(nm))) and fast Fourier Transform (0((n + m)2log(n + m))), where n and m are the picture- and window-sizes, respectively, measured in pixels.

References (8)

There are more references available in the full text version of this article.

Cited by (4)

  • Volume image registration by template matching

    2001, Image and Vision Computing
  • An automatic visual inspection system for integrated circuit chips

    1980, Computer Graphics and Image Processing
  • 2-D and 3-D Image Registration: For Medical, Remote Sensing, and Industrial Applications

    2005, 2-D and 3-D Image Registration: For Medical, Remote Sensing, and Industrial Applications
  • Registration of multi-modal brain images using the rigidity constraint

    2001, Proceedings - 2nd Annual IEEE International Symposium on Bioinformatics and Bioengineering, BIBE 2001

Research supported by N.R.C. Grant No. A9271 and by D.O.C. Contract No. OSU5-0081.

View full text