Abstract
In this paper, we propose a cost function free algorithm to address the issue of computing graph edit distance (GED), in view of most GED algorithms rely heavily on cost functions which are difficult to be defined reasonably in a general method. This new method compares the difference of graph structures which are characterized by node distribution of graphs. Hidden Markov model (HMM) is employed to describe the distribution of nodes in each graph, and then the dissimilarity of graphs can be measured by the distance of these HMMs. As well known, Kullback-Leibler distance (KLD) is suitable for computing distance between two probability models and it is approximated by a fast algorithm to calculate the distance between HMMs efficiently. It can be demonstrated that the proposed GED algorithm can characterize the graph structure variety effectively. In addition, image classification and clustering based on this distance measurement are effective for both rigid and non-rigid objects.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
