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
K Hops Frequent Subgraphs Mining for Large Attribute Graph
TL;DR: The complexity of the mechanism is approximately O(2 n ), which is more efficient than existing algorithms, and real data sets are applied in experiments to demonstrate the efficiency and effectiveness of the technique.
Journal ArticleDOI
Représentation des mots manuscrits par graphe pour la recherche par similarité.
TL;DR: Dans ce papier, nous proposons une nouvelle approche de la recherche de mots par similarite reposant sur une structure de graphes integrant des informations sur the topologie, the morphologie locale des mots ainsi que des informationations contextuelles du voisinage de chaque point d’interet.
Book ChapterDOI
Alignment and morphing for the boundary curves of anatomical organs
TL;DR: A tracking method for the deformable boundary curves of biological organs using variational registration method that derives the mean of curves as the curve which minimises the total distortion of a collection of shapes.
Patent
Structured network system applicable to future internet
TL;DR: The system can construct the structured future internet on a large-scale structure-free network, adopt globally unified and simple addressing, route and inquiring mechanisms, and enable route inquiring time, network interoperability or interconnection, content distribution efficiency and service obligation to be greatly improved.
Book ChapterDOI
The mean boundary curve of anatomical objects
TL;DR: An algorithm to compute the meanshape of a collection of planar curves for the computation of the mean shape of aCollection of organs using curvatures of curves is developed.
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