Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/30441
Title: HMM-based graph edit distance for image indexing
Authors: Xiao, B
Gao, X
Tao, D
Li, X
Keywords: Graph edit distance
Hidden Markov model
Inexact graph matching
Kullback-leibler distance
Issue Date: 2008
Publisher: John Wiley & Sons Inc
Source: International journal of imaging systems and technology, 2008, v. 18, no. 2-3, p. 209-218 How to cite?
Journal: International Journal of Imaging Systems and Technology 
Abstract: Most of the existing graph edit distance (GED) algorithms require cost functions which are difficult to be defined exactly. In this article, we propose a cost function free algorithm for computing GED. It only depends on the distribution of nodes rather than node or edge attributes in graphs. Hidden Markov model (HMM) is employed to model the distribution of feature points and thus dissimilarity measure of graphs can be posed as distance of HMMs. A fast algorithm of Kullback-Leibler Distance, suitable for computing the distance between two probability models, is adopted to compute the distance of HMMs. Experimental results demonstrate that the proposed GED algorithm can characterize the structure variety of graphs effectively and is available for clustering and indexing images of both rigid and nonrigid bodies.
URI: http://hdl.handle.net/10397/30441
DOI: 10.1002/ima.20146
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

9
Last Week
0
Last month
0
Citations as of Oct 11, 2017

WEB OF SCIENCETM
Citations

9
Last Week
0
Last month
0
Citations as of Sep 30, 2017

Page view(s)

72
Last Week
1
Last month
Checked on Oct 16, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.