Journal ArticleDOI
Approximate graph edit distance computation by means of bipartite graph matching
Kaspar Riesen,Horst Bunke +1 more
Reads0
Chats0
TLDR
A novel algorithm is introduced which allows us to approximately, or suboptimally, compute edit distance in a substantially faster way and is emprically verified that the accuracy of the suboptimal distance remains sufficiently accurate for various pattern recognition applications.About:
This article is published in Image and Vision Computing.The article was published on 2009-06-01. It has received 654 citations till now. The article focuses on the topics: Graph operations & Line graph.read more
Citations
More filters
Book ChapterDOI
Active-Learning Query Strategies Applied to Select a Graph Node Given a Graph Labelling
Xavier Cortés,Francesc Serratosa +1 more
TL;DR: This work presents different active strategies that decide the node to be queried and adapt these strategies to the graph-matching problem.
Journal ArticleDOI
Graph partitioning and graph neural network based hierarchical graph matching for graph similarity computation
Haoyan Xu,Haoyan Xu,Ziheng Duan,Ziheng Duan,Y. Wang,Jie Feng,Runjian Chen,Qianru Zhang,Zhongbin Xu +8 more
TL;DR: A graph partitioning and graph neural network based model, called PSimGNN, to effectively resolve the issue of reduced representation ability or excessive time complexity in graph similarity computation tasks.
Proceedings ArticleDOI
funcGNN: A Graph Neural Network Approach to Program Similarity
TL;DR: The graph embedding of a program proposed by the methodology could be applied to several related software engineering problems (such as code plagiarism and clone identification) thus opening multiple research directions.
Journal ArticleDOI
Correspondence consensus of two sets of correspondences through optimisation functions
TL;DR: The validity of the consensus method is shown through an experiment in ideal conditions based on palmprint identification, and subsequently two practical experiments based on image retrieval are presented.
Journal ArticleDOI
A distance measure between labeled combinatorial maps
TL;DR: Experimental results show that the proposed inexact map matching approach produces richer search results than the exact map matching technique by tolerating small difference between maps.
References
More filters
Journal ArticleDOI
The Protein Data Bank
Helen M. Berman,John D. Westbrook,Zukang Feng,Gary L. Gilliland,Talapady N. Bhat,Helge Weissig,Ilya N. Shindyalov,Philip E. Bourne +7 more
TL;DR: The goals of the PDB are described, the systems in place for data deposition and access, how to obtain further information and plans for the future development of the resource are described.
Journal ArticleDOI
The Hungarian method for the assignment problem
TL;DR: This paper has always been one of my favorite children, combining as it does elements of the duality of linear programming and combinatorial tools from graph theory, and it may be of some interest to tell the story of its origin this article.
Journal ArticleDOI
A Formal Basis for the Heuristic Determination of Minimum Cost Paths
TL;DR: How heuristic information from the problem domain can be incorporated into a formal mathematical theory of graph searching is described and an optimality property of a class of search strategies is demonstrated.
Related Papers (5)
IAM Graph Database Repository for Graph Based Pattern Recognition and Machine Learning
Kaspar Riesen,Horst Bunke +1 more
A distance measure between attributed relational graphs for pattern recognition
Alberto Sanfeliu,King-Sun Fu +1 more