Image categorization: Graph edit distance+edge direction histogram
- 31 October 2008
- journal article
- Published by Elsevier BV in Pattern Recognition
- Vol. 41 (10), 3179-3191
- https://doi.org/10.1016/j.patcog.2008.03.025
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- An eigenspace projection clustering method for inexact graph matchingIeee Transactions On Pattern Analysis and Machine Intelligence, 2004
- Bayesian graph edit distanceIeee Transactions On Pattern Analysis and Machine Intelligence, 2000
- Error correcting graph matching: on the influence of the underlying cost functionIeee Transactions On Pattern Analysis and Machine Intelligence, 1999
- A new algorithm for error-tolerant subgraph isomorphism detectionIeee Transactions On Pattern Analysis and Machine Intelligence, 1998
- On a relation between graph edit distance and maximum common subgraphPattern Recognition Letters, 1997
- Inexact graph matching using genetic searchPattern Recognition, 1997
- Simple Fast Algorithms for the Editing Distance between Trees and Related ProblemsSIAM Journal on Computing, 1989
- An eigendecomposition approach to weighted graph matching problemsIeee Transactions On Pattern Analysis and Machine Intelligence, 1988
- A distance measure between attributed relational graphs for pattern recognitionIEEE Transactions on Systems, Man, and Cybernetics, 1983
- The String-to-String Correction ProblemJournal of the ACM, 1974