Introduction to algorithms
FORMS: a flexible object recognition and modeling system
International Journal of Computer Vision
A Graduated Assignment Algorithm for Graph Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
A graph distance metric based on the maximal common subgraph
Pattern Recognition Letters
Error Correcting Graph Matching: On the Influence of the Underlying Cost Function
IEEE Transactions on Pattern Analysis and Machine Intelligence
Matching Hierarchical Structures Using Association Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
A tree-edit-distance algorithm for comparing simple, closed shapes
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Replicator equations, maximal cliques, and graph isomorphism
Neural Computation
Computer Vision
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Evolution towards the Maximum Clique
Journal of Global Optimization
Representation and Self-Similarity of Shapes
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Pattern Classification (2nd Edition)
Pattern Classification (2nd Edition)
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Recognition of Shapes by Editing Their Shock Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Payoff-Monotonic Game Dynamics and the Maximum Clique Problem
Neural Computation
The representation and matching of categorical shape
Computer Vision and Image Understanding
Region-Based Hierarchical Image Matching
International Journal of Computer Vision
Size functions for comparing 3D models
Pattern Recognition
A generalization of Haussler's convolution kernel: mapping kernel
Proceedings of the 25th international conference on Machine learning
Matching of anatomical tree structures for registration of medical images
Image and Vision Computing
On graphs with unique node labels
GbRPR'03 Proceedings of the 4th IAPR international conference on Graph based representations in pattern recognition
Self-adapting numerical software and automatic tuning of heuristics
ICCS'03 Proceedings of the 2003 international conference on Computational science
Matching of tree structures for registration of medical images
GbRPR'07 Proceedings of the 6th IAPR-TC-15 international conference on Graph-based representations in pattern recognition
From region based image representation to object discovery and recognition
SSPR&SPR'10 Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition
Graph-based quadratic optimization: A fast evolutionary approach
Computer Vision and Image Understanding
Coloring based approach for matching unrooted and/or unordered trees
Pattern Recognition Letters
| Hi-index | 0.14 |
Motivated by our recent work on rooted tree matching, in this paper we provide a solution to the problem of matching two free (i.e., unrooted) trees by constructing an association graph whose maximal cliques are in one-to-one correspondence with maximal common subtrees. We then solve the problem using simple payoff-monotonic dynamics from evolutionary game theory. We illustrate the power of the approach by matching articulated and deformed shapes described by shape-axis trees. Experiments on hundreds of larger, uniformly random trees are also presented. The results are impressive: despite the inherent inability of these simple dynamics to escape from local optima, they always returned a globally optimal solution.