Sequential Hierarchical Scene Matching
- 1 April 1978
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-27 (4) , 359-366
- https://doi.org/10.1109/tc.1978.1675108
Abstract
The general approach to matching two scenes by a digital computer is usually costly in computations. A match is determined by selecting the position of maximum cross correlation between the window and each possible shift position of the search region. A new approach which is logarithmically efficient is presented in this paper. Its logarithmic efficiency and computational savings will be demonstrated both theoretically and in practical examples. Experimental results are presented for matching an image region corrupted by noise and for matching images from optical and radar sensors. The significance of this approach is that scene matching can be accomplished by the use of a computer even in cases which are difficult for humans or standard correlation techniques, and can be accomplished with greatly reduced computations.Keywords
This publication has 7 references indexed in Scilit:
- Sensor TransformationsIEEE Transactions on Systems, Man, and Cybernetics, 1977
- Experiments on picture representation using regular decompositionComputer Graphics and Image Processing, 1976
- A Multilevel Approach to Sequential Detection of Pictorial FeaturesIEEE Transactions on Computers, 1976
- A hierarchical data structure for picture processingComputer Graphics and Image Processing, 1975
- A Class of Algorithms for Fast Digital Image RegistrationIEEE Transactions on Computers, 1972
- Ordered search techniques in template matchingProceedings of the IEEE, 1972
- Optimum sequential detection of signals in noiseIEEE Transactions on Information Theory, 1955