On a cyclic string-to-string correction problem
Information Processing Letters
Polygonal shape recognition using string-matching techniques
Pattern Recognition
The String-to-String Correction Problem
Journal of the ACM (JACM)
Silhouette-Based Isolated Object Recognition through Curvature Scale Space
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient Techniques for a Very Accurate Measurement of Dissimilarities between Cyclic Patterns
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
Symmetry-Based Indexing of Image Databases
CBAIVL '98 Proceedings of the IEEE Workshop on Content - Based Access of Image and Video Libraries
Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance
IEEE Transactions on Pattern Analysis and Machine Intelligence
Shape retrieval based on dynamic programming
IEEE Transactions on Image Processing
The VLDB Journal — The International Journal on Very Large Data Bases
Cyclic linear hidden Markov models for shape classification
PSIVT'07 Proceedings of the 2nd Pacific Rim conference on Advances in image and video technology
Efficient and robust shape matching for model based human motion capture
DAGM'11 Proceedings of the 33rd international conference on Pattern recognition
Shape retrieval using shape contexts and cyclic dynamic time warping
ICIAR'06 Proceedings of the Third international conference on Image Analysis and Recognition - Volume Part I
Speeding up shape classification by means of a cyclic dynamic time warping lower bound
IDEAL'06 Proceedings of the 7th international conference on Intelligent Data Engineering and Automated Learning
Finding Surface Correspondences Using Symmetry Axis Curves
Computer Graphics Forum
A new geometric descriptor for symbols with affine deformations
Pattern Recognition Letters
| Hi-index | 0.00 |
Cyclic strings are strings with no starting or ending point, such as those describing a closed contour. We present a new algorithm to compute a similarity measure between two cyclic sequences based on Dynamic Time Warping. The algorithm computes the optimal alignment between both sequences and is based on the cyclic edit distance algorithm proposed by Maes. The algorithm runs in O(mnlgm) time, where m and n are the lengths of the compared strings. Experiments on a shape classification and shape retrieval with a public database are presented.