Isomorphism between Strong Fuzzy Relational Graphs Based on k-Formulae

摘要

We present a new graph matching approach based on 1D information. Each node of the graphs repre- sents a fuzzy region (fuzzy segmentation step). Each couple of nodes is linked by a relational histogram which can be assumed to the attraction of two regions following a set of directions. The attraction is computed by a continuous function, depending on the distance of the confronted objects. Each case of the histogram corresponds to a particular direction. Then, relational graph computed from strong scenes are matched.