HMM-based graph edit distance for image indexing

John Wiley & Sons Inc
Publication Type:
Journal Article
International Journal of Imaging Systems and Technology, 2008, 18 (2-3), pp. 209 - 218
Issue Date:
Full metadata record
Files in This Item:
Filename Description Size
Thumbnail2011000291OK.pdf385.98 kB
Adobe PDF
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
Please use this identifier to cite or link to this item: