Image Categorization: Graph Edit Distance Plus Edge Direction Histogram

Pergamon-elsevier Science Ltd
Publication Type:
Journal Article
Pattern Recognition, 2008, 41 (10), pp. 3179 - 3191
Issue Date:
Filename Description Size
Thumbnail2011001233OK.pdf1.08 MB
Adobe PDF
Full metadata record
This paper presents a novel algorithm for computing graph edit distance (GED) in image categorization. This algorithm is purely structural, i.e., it needs only connectivity structure of the graph and does not draw on node or edge attributes. There are tw
Please use this identifier to cite or link to this item: