Image Categorization: Graph Edit Distance Plus Edge Direction Histogram
- Publisher:
- Pergamon-elsevier Science Ltd
- Publication Type:
- Journal Article
- Citation:
- Pattern Recognition, 2008, 41 (10), pp. 3179 - 3191
- Issue Date:
- 2008-01
Closed Access
Filename | Description | Size | |||
---|---|---|---|---|---|
2011001233OK.pdf | 1.08 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
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: