An Image Understanding System Using Attributed Symbolic Representation and Inexact Graph-Matching
IEEE Transactions on Pattern Analysis and Machine Intelligence
Simple fast algorithms for the editing distance between trees and related problems
SIAM Journal on Computing
On the editing distance between unordered labeled trees
Information Processing Letters
Active shape models—their training and application
Computer Vision and Image Understanding
International Journal of Computer Vision
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Continuous characterizations of the maximum clique problem
Mathematics of Operations Research
The Tree-to-Tree Correction Problem
Journal of the ACM (JACM)
Matching Hierarchical Structures Using Association Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shock Graphs and Shape Matching
International Journal of Computer Vision
Mean and maximum common subgraph of two graphs
Pattern Recognition Letters
Modal Matching for Correspondence and Recognition
IEEE Transactions on Pattern Analysis and Machine Intelligence
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
A Skeletal Measure of 2D Shape Similarity
IWVF-4 Proceedings of the 4th International Workshop on Visual Form
Efficiently Computing Weighted Tree Edit Distance Using Relaxation Labeling
EMMCVPR '01 Proceedings of the Third International Workshop on Energy Minimization Methods in Computer Vision and Pattern Recognition
A shock grammar for recognition
CVPR '96 Proceedings of the 1996 Conference on Computer Vision and Pattern Recognition (CVPR '96)
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Wormholes in Shape Space: Tracking through Discontinuous Changes in Shape
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Recognition of Shapes by Editing Their Shock Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Approximating the maximum weight clique using replicator dynamics
IEEE Transactions on Neural Networks
Graph-Based Methods for Vision: A Yorkist Manifesto
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Region-Based Hierarchical Image Matching
International Journal of Computer Vision
Dissimilarity between two skeletal trees in a context
Pattern Recognition
GbRPR '09 Proceedings of the 7th IAPR-TC-15 International Workshop on Graph-Based Representations in Pattern Recognition
Tree edit distance from information theory
GbRPR'03 Proceedings of the 4th IAPR 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
A theoretical analysis of alignment and edit problems for trees
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
| Hi-index | 0.00 |
This paper investigates a technique to extend the tree edit distance framework to allow the simultaneous matching of multiple tree structures. This approach extends a previous result that showed the edit distance between two trees is completely determined by the maximum tree obtained from both tree with node removal operations only. In our approach we seek the minimum structure from which we can obtain the original trees with removal operations. This structure has the added advantage that it can be extended to more than two trees and it imposes consistency on node matches throughout the matched trees. Furthermore through this structure we can get a "natural" embedding space of tree structures that can be used to analyze how tree representations vary in our problem domain.