Edit distance-based kernel functions for structural pattern classification
Pattern Recognition
Longest common subsequence problem for unoriented and cyclic strings
Theoretical Computer Science
Cyclic Viterbi Score for Linear Hidden Markov Models
IbPRIA '07 Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II
2D Shape Classification Using Multifractional Brownian Motion
SSPR & SPR '08 Proceedings of the 2008 Joint IAPR International Workshop on Structural, Syntactic, and Statistical Pattern Recognition
Metamodel matching based on planar graph edit distance
ICMT'10 Proceedings of the Third international conference on Theory and practice of model transformations
Contour-Based shape retrieval using dynamic time warping
CAEPIA'05 Proceedings of the 11th Spanish association conference on Current Topics in Artificial Intelligence
Dynamic time warping of cyclic strings for shape matching
ICAPR'05 Proceedings of the Third international conference on Pattern Recognition and Image Analysis - Volume Part II
| Hi-index | 0.00 |
Cyclic edit distances are a good measure of contour shapes dissimilarity. A Branch and Bound algorithm that speeds up the computation of cyclic edit distances with arbitrary weights for the edit operations is presented. The algorithm is modified to work with an external bound thatfurther accelerates the computation when applied to classification problems.