Image registration by matching relational structures

Pattern RecognitionPublished 1 January 1984

J. K. Cheng, Thomas S. Huang

DOI10.1016/0031-3203(84)90042-6

Source URL

Citations71

SJR quartileQ1

SJR score2.06

SNIP2.67

TL;DR

A method of image registration where relational structures are used as representations of images and two images are registered by finding a match between the two relational structures, which is better than traditional cross-correlation like techniques in several aspects.

Abstract

We present a method of image registration where we use relational structures as representations of images and we register two images by finding a match between the two relational structures. It is better than traditional cross-correlation like techniques in several aspects: it is insensitive to scaling, rotation, gray level modification and small relative motion between the two images. The matching process makes use of star structures, which have several advantages over conventional node structures.

Keywords

Computer Science

Artificial IntelligenceConsistency in networks of relations

2,430 Citations1977Alan K. Mackworth

The primary aim is to provide an accessible, unified framework, within which to present the algorithms including a new path consistency algorithm, to discuss their relationships and the may applications, both realized and potential of network consistency algorithms.

IEEE Transactions on Systems Man and CyberneticsScene Labeling by Relaxation Operations

1,401 Citations1976Azriel Rosenfeld, Robert A. Hummel +1 more

This paper formulates the ambiguity-reduction process in terms of iterated parallel operations (i.e., relaxation operations) performed on an array of object, identification data.

IEEE Transactions on ComputersA Class of Algorithms for Fast Digital Image Registration

966 Citations1972Daniel I. Barnea, Harvey F. Silverman

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 and may be a saving of computation time of two orders of magnitude or more by adopting this new approach.

Computer Graphics and Image ProcessingVelocity determination in scenes containing several moving objects

573 Citations1979Claude L. Fennema, William B. Thompson

A relationship between the time variation of intensity, the spatial gradient, and velocity has been developed which allows the determination of motion using clustering techniques, and the clustering technique is described.

IEEE transactions on geoscience electronicsSpatial Registration of Multispectral and Multitemporal Digital Imagery Using Fast Fourier Transform Techniques

338 Citations1970P. E. Anuta

The fast Fourier transform (FFT) technique for cross correlation of misregistered imagery to determine spatial distances is discussed in detail and a method of achieving translational, rotational, and scaling corrections between images is described.

IEEE Transactions on ComputersTwo-Stage Template Matching

196 Citations1977Vanderbrug, Rosenfeld

The computational cost of template matching can be reduced by using only a subtemplate, and applying the rest of the template only when the subtemplate's degree of match exceeds a threshold.

Lecture notes in computer scienceComputer Vision Systems

169 Citations2013

Information SciencesReduction operations for constraint satisfaction

51 Citations1978Robert M. Haralick, Larry S. Davis +2 more

The problem of labeling a set of units in such a way as to satisfy an order-N compatibility relation is discussed and shown to be NP-complete.

Purdue e-Pubs (Purdue University)Algorithms for matching relational structures and their applications to image processing

15 Citations1980Jong-Keung Cheng