Fuzzy morphisms between graphs

A generic definition of fuzzy morphism between graphs (GFM) is introduced that includes classical graph related problem definitions as sub-cases (such as graph and subgraph isomorphism). The GFM uses a pair of fuzzy relations, one on the vertices and one on the edges. Each relation is a mapping between the elements of two graphs. These two fuzzy relations are linked with constraints derived from the graph structure and the notion of association graph. The theory extends the properties of fuzzy relation to the problem of generic graph correspondence. We introduce two complementary interpretations of GFM from which we derive several interesting properties. The first interpretation is the generalization of the notion of association compatibility. The second is the new notion of edge morphism. One immediate application is the introduction of several composition laws. Each property has a theoretical and a practical interpretation in the problem of graph correspondence that is explained throughout the paper. Special attention is paid to the formulation of a non-algorithmical theory in order to propose a first step towards a unified theoretic framework for graph morphisms.

[1]  Steven Gold,et al.  A Graduated Assignment Algorithm for Graph Matching , 1996, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  Aline Deruyver,et al.  Constraint Satisfaction Problem with Bilevel Constraint: Application to Interpretation of Over-Segmented Images , 1997, Artif. Intell..

[3]  I. Bloch,et al.  A new definition for fuzzy attributed graph homomorphism with application to structural shape recognition in brain imaging , 1999, IMTC/99. Proceedings of the 16th IEEE Instrumentation and Measurement Technology Conference (Cat. No.99CH36309).

[4]  Masayuki Nakazawa,et al.  Automated detection and matching of spots in autoradiogram images of two-dimensional electrophoresis for high-speed genome scanning , 1997, Proceedings of International Conference on Image Processing.

[5]  Didier Dubois.  Fuzzy sets and systems , 1980 .

[6]  A. Kaufman,et al.  Introduction to the Theory of Fuzzy Subsets. , 1977 .

[7]  Michel Minoux,et al.  Graphes et algorithmes , 1995 .

[8]  Luc Brun,et al.  Image Segmentation with Topological Maps and Inter-pixel Representation , 1998, J. Vis. Commun. Image Represent..

[9]  Marek Skomorowski.  Use of random graph parsing for scene labelling by probabilistic relaxation , 1999, Pattern Recognit. Lett..

[10]  Edwin R. Hancock,et al.  Deterministic search for relational graph matching , 1999, Pattern Recognit..

[11]  E. K. WONG,et al.  Model matching in robot vision by subgraph isomorphism , 1992, Pattern Recognit..

[12]  Bernard Roy,et al.  Algèbre moderne et théorie des graphes orientées vers les sciences économiques et sociales , 1969 .

[13]  Celso C. Ribeiro,et al.  Model-Based Scene Recognition Using Graph Fuzzy Homomorphism Solved By Genetic Algorithm , 1999 .

[14]  Horst Bunke,et al.  A decision tree approach to graph and subgraph isomorphism detection , 1999, Pattern Recognit..

[15]  Wyllis Bandler,et al.  Tracing Chains-of-Thought: Fuzzy Methods in Cognitive Diagnosis , 2000 .

[16]  V. Novák.  Fuzzy sets and their applications , 1989 .

[17]  Edwin R. Hancock,et al.  A Bayesian compatibility model for graph matching , 1996, Pattern Recognit. Lett..

[18]  Ladislav J. Kohout,et al.  ON THE GENERAL THEORY OF RELATIONALMORPHISMS , 1986 .

[19]  BENJOE A. JULIANO.  Inference and Decision Making with Fuzzy Cognitive Structures , 2000 .

[20]  Shinji Umeyama,et al.  An Eigendecomposition Approach to Weighted Graph Matching Problems , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Edwin R. Hancock,et al.  Graph Matching With a Dual-Step EM Algorithm , 1998, IEEE Trans. Pattern Anal. Mach. Intell..

[22]  I. Turksen.  Fuzzy Sets and Systems and its Applications in Production Research , 1985 .

[23]  Santanu Chaudhury,et al.  Matching structural shape descriptions using genetic algorithms , 1997, Pattern Recognit..

[24]  Paul Y. S. Cheung,et al.  Correction to "Fuzzy-attribute graph with application to Chinese character recognition" , 1992, IEEE Trans. Syst. Man Cybern..

[25]  Horst Bunke,et al.  Error Correcting Graph Matching: On the Influence of the Underlying Cost Function , 1999, IEEE Trans. Pattern Anal. Mach. Intell..

[26]  Edwin R. Hancock,et al.  Symbolic graph matching with the EM algorithm , 1998, Pattern Recognit..

[27]  Philippe Colantoni,et al.  Color object detection using pyramidal adjacency graphs , 1996, Proceedings of 3rd IEEE International Conference on Image Processing.

[28]  L. J. Chipman,et al.  A fuzzy relaxation algorithm for matching imperfectly segmented images to models , 1992, Proceedings IEEE Southeastcon '92.

[29]  A. Bonaert.  Introduction to the theory of Fuzzy subsets , 1977, Proceedings of the IEEE.

[30]  Edwin R. Hancock,et al.  Convergence of a Hill Climbing Genetic Algorithm for Graph Matching , 1999, EMMCVPR.

[31]  Edwin R. Hancock,et al.  Inexact graph matching using genetic search , 1997, Pattern Recognit..

[32]  Ladislav J. Kohout,et al.  On new types of homomorphisms and congruences for partial algebraic structures and n-ary relations , 1986 .

[33]  Robert M. Haralick,et al.  Structural Descriptions and Inexact Matching , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[34]  Didier Dubois,et al.  Fuzzy sets and systems ' . Theory and applications , 2007 .

[35]  Dominique Barba,et al.  A Markov random field for rectilinear structure extraction in pavement distress image analysis , 1995, Proceedings., International Conference on Image Processing.

[36]  Edwin R. Hancock,et al.  Matching Delaunay Graphs , 1995, ICIAP.

[37]  Edwin R. Hancock,et al.  Structural Matching by Discrete Relaxation , 1997, IEEE Trans. Pattern Anal. Mach. Intell..