Graph matching by configurational relaxation

Author

Wilson, Richard C. ; Hancock, Edwin R.

Author_Institution

Dept. of Comput. Sci., York Univ., UK

Volume

2

fYear

1994

fDate

9-13 Oct 1994

Firstpage

563

Abstract

This paper describes a symbolic approach to relational matching. The novelty of the method lies in its Bayesian modelling of relational consistency through the use of an explicit constraint corruption process. In consequence of this assumed model the consistency of match is gauged by a compound exponential function of a higher-order Hamming distance between symbolic relations, providing a natural mechanism for constraint softening. Unlike many alternatives in the literature, the method is not limited to the use of binary constraints; it can accommodate N-ary relations of varying order

Keywords

image matching; Bayesian modelling; compound exponential function; configurational relaxation; constraint corruption process; constraint softening; graph matching; higher-order Hamming distance; match consistency; relational consistency; relational matching; symbolic relations; Bayesian methods; Computer science; Computer vision; Hamming distance; Image segmentation; Labeling; Relaxation methods; Robustness; Softening; Topology;

fLanguage

English

Publisher

ieee

Conference_Titel

Pattern Recognition, 1994. Vol. 2 - Conference B: Computer Vision & Image Processing., Proceedings of the 12th IAPR International. Conference on

Conference_Location

Jerusalem

Print_ISBN

0-8186-6270-0

Type

conf

DOI

10.1109/ICPR.1994.577038

Filename

577038