An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Tree System Approach for Fingerprint Pattern Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special memorial issue for Professor King-Sun Fu
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Algorithms for clustering data
Algorithms for clustering data
Structural Stereopsis for 3-D Vision
IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
3-D Shape Recovery Using Distributed Aspect Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
On the editing distance between unordered labeled trees
Information Processing Letters
A Metric Between Unrooted and Unordered Trees and its Bottom-Up Computing Method
IEEE Transactions on Pattern Analysis and Machine Intelligence
International Journal of Computer Vision
FORMS: a flexible object recognition and modeling system
International Journal of Computer Vision
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
On a relation between graph edit distance and maximum common subgraph
Pattern Recognition Letters
A graph distance metric based on the maximal common subgraph
Pattern Recognition Letters
Matching Hierarchical Structures Using Association Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shock Graphs and Shape Matching
International Journal of Computer Vision
Normalized Cuts and Image Segmentation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Graph distances using graph union
Pattern Recognition Letters
A graph distance metric combining maximum common subgraph and minimum common supergraph
Pattern Recognition Letters
Algorithms on Trees and Graphs
Algorithms on Trees and Graphs
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Attribute Trees in Image Analysis ¾ Heuristic Matching and Learning Techniques
ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
Recognition of Shapes by Editing Their Shock Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Four Metrics for Efficiently Comparing Attributed Trees
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 2 - Volume 02
A new graph-theoretic approach to clustering and segmentation
CVPR'03 Proceedings of the 2003 IEEE computer society conference on Computer vision and pattern recognition
Modeling and implementing software architecture with acme and archJava
Proceedings of the 27th international conference on Software engineering
Learning Shape-Classes Using a Mixture of Tree-Unions
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Binary Linear Programming Formulation of the Graph Edit Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
International Journal of Computer Vision
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Theoretical Computer Science
Graph embedding using tree edit-union
Pattern Recognition
Region-Based Hierarchical Image Matching
International Journal of Computer Vision
Approximate graph edit distance computation by means of bipartite graph matching
Image and Vision Computing
On the similarity metric and the distance metric
Theoretical Computer Science
Coined quantum walks lift the cospectrality of graphs and trees
Pattern Recognition
Comparing sets of 3D digital shapes through topological structures
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
Homeomorphic alignment of weighted trees
Pattern Recognition
An automatic HTTP cookie management system
Computer Networks: The International Journal of Computer and Telecommunications Networking
Information Sciences: an International Journal
Supervised learning of graph structure
SIMBAD'11 Proceedings of the First international conference on Similarity-based pattern recognition
Fast suboptimal algorithms for the computation of graph edit distance
SSPR'06/SPR'06 Proceedings of the 2006 joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
Coloring based approach for matching unrooted and/or unordered trees
Pattern Recognition Letters
Layered analysis of irregular facades via symmetry maximization
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
Co-hierarchical analysis of shape structures
ACM Transactions on Graphics (TOG) - SIGGRAPH 2013 Conference Proceedings
| Hi-index | 0.15 |
We address the problem of comparing attributed trees and propose four novel distance measures centered around the notion of a maximal similarity common subtree. The proposed measures are general and defined on trees endowed with either symbolic or continuous-valued attributes and can be applied to rooted as well as unrooted trees. We prove that our measures satisfy the metric constraints and provide a polynomial-time algorithm to compute them. This is a remarkable and attractive property, since the computation of traditional edit-distance-based metrics is, in general, NP-complete, at least in the unordered case. We experimentally validate the usefulness of our metrics on shape matching tasks and compare them with (an approximation of) edit-distance.