Organizing Large Structural Modelbases
IEEE Transactions on Pattern Analysis and Machine Intelligence
International Journal of Computer Vision
Structural Matching by Discrete Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Modelbase partitioning using property matrix spectra
Computer Vision and Image Understanding
Quantitative measures of change based on feature organization: eigenvalues and eigenvectors
Computer Vision and Image Understanding
Genetic operators for hierarchical graph clustering
Pattern Recognition Letters
Shock Graphs and Shape Matching
International Journal of Computer Vision
Pattern Recognition Letters - Special issue on pattern recognition in practice VI
Structural Matching in Computer Vision Using Probabilistic Relaxation
IEEE Transactions on Pattern Analysis and Machine Intelligence
Pairwise Data Clustering by Deterministic Annealing
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
ICCV '99 Proceedings of the International Conference on Computer Vision-Volume 2 - Volume 2
Relational Histograms for Shape Indexing
ICCV '98 Proceedings of the Sixth International Conference on Computer Vision
Graph-Based Methods for Vision: A Yorkist Manifesto
Proceedings of the Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Shape Learning with Function-Described Graphs
ICIAR '08 Proceedings of the 5th international conference on Image Analysis and Recognition
A Context Dependent Distance Measure for Shape Clustering
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
Hi-index | 0.00 |
This paper investigates whether meaningful shape categories can be identified in an unsupervised way by clustering shock-trees. We commence by computing weighted and unweighted edit distances between shock-trees extracted from the Hamilton-Jacobi skeleton of 2D binary shapes. Next we use an EM-like algorithm to locate pairwise clusters in the pattern of edit-distances. We show that when the tree edit distance is weighted using the geometry of the skeleton, then the clustering method returns meaningful shape categories.