Synthesis of function-described graphs

Abstract

Function-described graphs (FDGs) have been introduced very recently as a representation of an ensemble of attributed relational graphs (ARGs) for structural pattern recognition [1, 2]. In this paper, the relationship between FDGs and Random Graphs [3] is analysed and the synthesis process of FDGs is studied, whereas the matching process between FDGs and ARGs is discussed elsewhere [4]. Two procedures are described to synthesize an FDG from a set of commonly labelled ARGs or FDGs, respectively. Then, a general incremental method to synthesize an FDG from a sequence of unlabelled ARGs is proposed. Specific methods are obtained when an ARG-to-FDG matching algorithm is selected to find optimal morphisms.