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
Journal ArticleDOI
A parallel graph edit distance algorithm
TL;DR: A parallel algorithm for exact GED computation is proposed based on a branch-and-bound algorithm coupled with a load balancing strategy that can drastically improve a sequential approach and a naive parallel approach and provided more precise solutions while requiring a low memory usage.
Journal ArticleDOI
Towards application of dorsal hand vein recognition under uncontrolled environment based on biometric graph matching
TL;DR: Results show that the improvement of the entire algorithms leads to high accuracy and strong robustness of the recognition system, whether under uncontrolled or controlled conditions.
Book ChapterDOI
Greedy Graph Edit Distance
TL;DR: The present paper empirically confirm the scalability of the extension with respect to the run time, and show that the quadratic approximation leads to graph dissimilarities which are sufficiently accurate for graph based pattern classification.
Journal ArticleDOI
Improved Lower Bounds for Graph Edit Distance
David Blumenthal,Johann Gamper +1 more
TL;DR: This paper demonstrates that the proposed algorithm for calculating lower and upper bounds for the edit distance between undirected, labeled graphs is incorrect and develops a speed-up version that computes an only slightly less accurate lower bound.
Proceedings ArticleDOI
Retina features based on vessel graph substructures
TL;DR: It is shown that combining nodes and edges can improve the distance and two retina graph statistics, the edge-to-node ratio and the variance of the degree distribution, that have low correlation with node match score are identified.
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