This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Class of Algorithms for Fast Digital Image Registration
February 1972 (vol. 21 no. 2)
pp. 179-186
Daniel I. Barnea, IBM T. J. Watson Research Center, Yorktown Heights, N. Y. 10598.; Eljim, Holon, Israel.
Harvey F. Silverman, IBM T. J. Watson Research Center, Yorktown Heights, N. Y. 10598.
The automatic determination of local similarity between two structured data sets is fundamental to the disciplines of pattern recognition and image processing. A class of algorithms, which may be used to determine similarity in a far more efficient manner than methods currently in use, is introduced in this paper. There may be a saving of computation time of two orders of magnitude or more by adopting this new approach. The problem of translational image registration, used for an example throughout, is discussed and the problems with the most widely used method-correlation explained. Simple implementations of the new algorithms are introduced to motivate the basic idea of their structure. Real data from ITOS-1 satellites are presented to give meaningful empirical justification for theoretical predictions.
Citation:
Daniel I. Barnea, Harvey F. Silverman, "A Class of Algorithms for Fast Digital Image Registration," IEEE Transactions on Computers, vol. 21, no. 2, pp. 179-186, Feb. 1972, doi:10.1109/TC.1972.5008923
Usage of this product signifies your acceptance of the Terms of Use.