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
Neural Graph Similarity Computation with Contrastive Learning
TL;DR: This work puts forward a contrastive neural graph similarity learning framework, Conga, which utilizes vanilla graph convolutional networks to generate the graph representations and capture the cross-graph interactions via a simple multilayer perceptron.
Book ChapterDOI
Secure Error-Tolerant Graph Matching Protocols
TL;DR: This paper develops several new sub-protocols such as private maximum computation and optimal assignment protocols to construct the main protocol and shows that the protocols are secure against semi-honest adversaries.
Proceedings ArticleDOI
Graph-Graph Context Dependency Attention for Graph Edit Distance
TL;DR: Wang et al. as discussed by the authors proposed a deep network architecture GED-CDA by introducing a graph-graph context dependency attention module to enhance embeddings, which can both learn the interactions between graph pairs and capture the connections within graphs.
Matching Graphs with Enriched Node Labels using Weisfeiler-Lehmann Hashes
TL;DR: In this paper , the potential of graph node label enrichment using Weisfeiler-Lehman hashes was explored and the impact on the classification performance was evaluated using a k Nearest Neighbor (kNN) classifications.
Journal ArticleDOI
A General Framework for Partial to Full Image Registration
TL;DR: A rotation invariant registration method that explicitly considers that the image to be matched is a small piece of a larger image, which is related to the number of points to be considered as outliers.
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