On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
A New Algorithm for Error-Tolerant Subgraph Isomorphism Detection
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Graph Matching Using the EM Algorithm and Singular Value Decomposition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Introduction to the Special Section on Graph Algorithms in Computer Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence - Graph Algorithms and Computer Vision
Identification of Diatoms by Grid Graph Matching
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Graph-Based Methods for Vision: A Yorkist Manifesto
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Using Graph Search Techniques for Contextual Colour Retrieval
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Neural Networks - Special issue on neural networks and kernel methods for structured domains
Edit distance-based kernel functions for structural pattern classification
Pattern Recognition
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
Graph Matching Algorithms for Business Process Model Similarity Search
BPM '09 Proceedings of the 7th International Conference on Business Process Management
Self-organizing graph edit distance
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Graph-based tools for data mining and machine learning
MLDM'03 Proceedings of the 3rd international conference on Machine learning and data mining in pattern recognition
Bipartite graph matching for computing the edit distance of graphs
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
A quadratic programming approach to the graph edit distance problem
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
PCM'07 Proceedings of the multimedia 8th Pacific Rim conference on Advances in multimedia information processing
Constraint-based graph matching
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Comparing graph similarity measures for graphical recognition
GREC'09 Proceedings of the 8th international conference on Graphics recognition: achievements, challenges, and evolution
Classification of multi-structured documents: a comparison based on media image
ICISP'10 Proceedings of the 4th international conference on Image and signal processing
Many-to-many graph matching: a continuous relaxation approach
ECML PKDD'10 Proceedings of the 2010 European conference on Machine learning and knowledge discovery in databases: Part III
Improving vector space embedding of graphs through feature selection algorithms
Pattern Recognition
Speeding up graph edit distance computation through fast bipartite matching
GbRPR'11 Proceedings of the 8th international conference on Graph-based representations in pattern recognition
Inexact graph matching based on kernels for object retrieval in image databases
Image and Vision Computing
A random walk kernel derived from graph edit distance
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Ant algorithm for the graph matching problem
EvoCOP'05 Proceedings of the 5th European conference on Evolutionary Computation in Combinatorial Optimization
Graph matching – challenges and potential solutions
ICIAP'05 Proceedings of the 13th international conference on Image Analysis and Processing
Reactive tabu search for measuring graph similarity
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
Edit distance based kernel functions for attributed graph matching
GbRPR'05 Proceedings of the 5th IAPR international conference on Graph-Based Representations in Pattern Recognition
A comparative study of ant colony optimization and reactive search for graph matching problems
EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Computing gene functional similarity using combined graphs
Proceedings of the 27th Annual ACM Symposium on Applied Computing
Feature selection on node statistics based embedding of graphs
Pattern Recognition Letters
Discriminative prototype selection methods for graph embedding
Pattern Recognition
On the subgraph epimorphism problem
Discrete Applied Mathematics
| Hi-index | 0.00 |
A new graph matching scheme based on an extended set of edit operations, which include the splitting and merging of nodes, is proposed in this paper. This scheme is useful in applications where the nodes of the considered graphs represent regions extracted by some segmentation procedure from an image. To demonstrate the feasibility of the proposed method, its application to the automatic identification of diatoms (unicellular algae) is described.