Graph Edit Distance with Node Splitting and Merging, and Its Application to Diatom Identification
- 24 June 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- Symmetry based indexing of diatoms in an image databasePublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Identification of Diatoms by Grid Graph MatchingLecture Notes in Computer Science, 2002
- Graph-Based Methods for Vision: A Yorkist ManifestoLecture Notes in Computer Science, 2002
- Using Graph Search Techniques for Contextual Colour RetrievalLecture Notes in Computer Science, 2002
- IDENTIFICATION USING CLASSICAL AND NEW FEATURES IN COMBINATION WITH DECISION TREE ENSEMBLESSeries in Machine Perception and Artificial Intelligence, 2002
- CONTOUR EXTRACTIONSeries in Machine Perception and Artificial Intelligence, 2002
- ADIAC IMAGING TECHNIQUES AND DATABASESSeries in Machine Perception and Artificial Intelligence, 2002
- Structural graph matching using the EM algorithm and singular value decompositionIeee Transactions On Pattern Analysis and Machine Intelligence, 2001
- 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