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
Proceedings ArticleDOI
Improving Findability of Open Data Beyond Data Catalogs
TL;DR: This paper proposes to define a formal model for representation of the datasets and their contexts, and it proposes to apply existing similarity techniques, adjust them to fit each identified dataset context type and combine them together to measure similarity of datasets in new ways, improving their findability.
Proceedings ArticleDOI
Graph Embedding for Offline Handwritten Signature Verification
TL;DR: Signature graphs are not directly matched with each other, but first compared with a set of predefined prototype graphs, in order to obtain a dissimilarity representation, and it is empirical confirmed that the learning-free graph embedding outperforms state-of-the-art methods with respect to both accuracy and runtime.
Vector space embedding of graphs via statistics of labelling information
TL;DR: The problem of reconeixement of patrons as mentioned in this paper has been studied in the context of graph embeddings, e.g. in the form of vectors of caracteristiques.
Image processing and understanding based on graph similarity testing: algorithm design and software development
TL;DR: This paper presents a meta-analysis of graph similarity testing for image processing and understanding in relation to software design and software development.
Proceedings ArticleDOI
New Researches about Dominant Color Descriptor and Graph Edit Distance
TL;DR: A new representative color extraction algorithm based on MPEG-7, and an improved graph representation method based on graph edit distance are outlined, and the experimental results showed that these improvements are effective.
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