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
Individual and Collective Graph Mining: Principles, Algorithms, and Applications
Danai Koutra,Christos Faloutsos +1 more
TL;DR: This book presents scalable, principled discovery algorithms that combine globality with locality to make sense of one or more graphs.
Book ChapterDOI
Hiding the policy in cryptographic access control
TL;DR: In this paper, the idea of policy anonymity was introduced in attribute-based encryption (ABE), where the attacker can only see a large set of possible policies that might have been used to encrypt, but is not able to identify the one that was actually used.
Journal ArticleDOI
Keyword spotting in historical handwritten documents based on graph matching
TL;DR: This paper proposes a novel reliable approach for template-based keyword spotting in historical handwritten documents that makes use of different graph representations for segmented word images and a sophisticated matching procedure.
Book ChapterDOI
Combining Bipartite Graph Matching and Beam Search for Graph Edit Distance Approximation
TL;DR: The original approximation framework is combined with a fast tree search procedure to improve the overall approximation quality, and the assignment from the original approximation as a starting point for a subsequent beam search is regarded.
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