Graph fuzzy homomorphism interpreted as fuzzy association graphs
Authors:
- I. BlochIBI. Bloch
- 11 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2 (10514651) , 1042-1045
Abstract
A new generic definition of graph fuzzy morphism is introduced that includes classical graph related problem definitions as sub-cases. Two practical interpretations as well as some properties are discussed. This definition is a first attempt towards a unified theoretic framework for graph morphism.Keywords
This publication has 9 references indexed in Scilit:
- A decision tree approach to graph and subgraph isomorphism detectionPattern Recognition, 1999
- SYMBOLIC GRAPH MATCHING WITH THE EM ALGORITHMPattern Recognition, 1998
- Graph matching with a dual-step EM algorithmIEEE Transactions on Pattern Analysis and Machine Intelligence, 1998
- Constraint satisfaction problem with bilevel constraint: application to interpretation of over-segmented imagesArtificial Intelligence, 1997
- Knowledge-based interpretation of MR brain imagesIEEE Transactions on Medical Imaging, 1996
- Model matching in robot vision by subgraph isomorphismPattern Recognition, 1992
- Correction to "Fuzzy-attribute graph with application to Chinese character recognition"IEEE Transactions on Systems, Man, and Cybernetics, 1992
- Matching oversegmented 3D images to models using association graphsImage and Vision Computing, 1989
- FUZZY GRAPHS††The support of the Office of Computing Activities, National Science Foundation, under Grant GJ-32258X, is gratefully acknowledged, as is the help of Shelly Rowe in preparing this paper.1975