On a cyclic string-to-string correction problem
Information Processing Letters
Dynamic Programming Alignment of Sequences Representing Cyclic Patterns
IEEE Transactions on Pattern Analysis and Machine Intelligence
The String-to-String Correction Problem
Journal of the ACM (JACM)
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Digital Image Processing
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 |
Two efficient approximate techniques for measuring dissimilarities between cyclic patterns are presented. They are inspired on the quadratic time algorithm proposed by Bunke and Bühler. The first technique completes pseudoalignments built by the Bunke and Bühler algorithm (BBA), obtaining full alignments between cyclic patterns. The edit cost of the minimum-cost alignment is given as an upper-bound estimation of the exact cyclic edit distance, which results in a more accurate bound than the lower one obtained by BBA. The second technique uses both bounds to compute a weighted average, achieving even more accurate solutions. Weights come from minimizing the sum of squared relative errors with respect to exact distance values on a training set of string pairs. Experiments were conducted on both artificial and real data, to demonstrate the capabilities of new techniques in both accurateness and quadratic computing time.