Linear feature compatibility for pattern-matching relaxation

Abstract This paper extends point-pattern matching relaxation techniques to allow matching of both point-like and linear features. We define a compatibility function that relies on relative orientation information, which is translation and rotation invariant and which can be more reliably extracted from noisy images than can positional information. The function is used to generalize the matching technique of Ranade and Rosenfeld ( Pattern Recognition 12 , 269–275 (1980)), but it can also be incorporated into other relaxation algorithms. Examples are presented from the domain of object recognition in synthetic aperture radar (SAR) imagery.

[1]  M. C. Ibison,et al.  On the use of relaxation labelling in the correspondence problem , 1986, Pattern Recognit. Lett..

[2]  William B. Thompson,et al.  Disparity Analysis of Images , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Azriel Rosenfeld,et al.  Point pattern matching by relaxation , 1980, Pattern Recognit..

[4]  Ramakant Nevatia,et al.  Matching Images Using Linear Features , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[5]  Marc Berthod Global Optimization of a Consistent Labeling , 1983, IJCAI.

[6]  Keith E. Price,et al.  Relaxation Matching Techniques-A Comparison , 1985, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[7]  Rae-Hong Park,et al.  Relaxation algorithm for shape matching of two-dimensional objects , 1989, Pattern Recognit. Lett..