Abstract
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(mnlg m) 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Marzal, A., Barrachina, S.: Speeding up the computation of the edit distance for cyclic strings. In: Int. Conference on Pattern Recognition, pp. 271–280 (2000)
Zhang, D., Lu, G.: A Comparative Study of Fourier Descriptors for Shape Representation and Retrieval. In: 5th Asian Conf. on Computer Vision (January 2002)
Milios, E., Petrakis, E.G.M.: Shape Retrieval Based on Dynamic Programming. IEEE Transaction on Image Processing 1(1), 141–147 (2000)
Peris, G., Marzal, A.: Fast Cyclic Edit Distance Computation with Weighted Edit Costs in Classification. In: Proc. Int. Conf. on Pattern Recognition, vol. 4 (2002)
Bunke, H., Bühler, H.: Applications of Approximate String Matching to 2D Shape Recognition. Pattern Recognition 26(12), 1797–1812 (1993)
Bartolini, I., Ciaccia, P.: WARP: Accurate Retrieval of Shapes Using Phase of Fourier Descriptors and Time Warping Distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 27(1), 142–147 (2005)
Maes, M.: On a Cyclic String-to-String Correction Problem. Information Processing Letters 35, 73–78 (1990)
Maes, M.: Polygonal Shape Recognition using String Matching Techniques. Pattern Recognition 24(5), 433–440 (1991)
Mokhtarian, F.: Silhouette-Based Isolated Object Recognition through Curvatute Scale Space. IEEE Transaction on Pattern Analysis and Machine Intelligence 17(5), 539–544 (1995)
Mollineda, R.A., Vidal, E., Casacuberta, F.: Efficient Techniques for a very Accurate Measurement of Dissimilarities between Cyclic Patterns. In: Amin, A., Pudil, P., Ferri, F., Iñesta, J.M. (eds.) SPR 2000 and SSPR 2000. LNCS, vol. 1876, pp. 121–126. Springer, Heidelberg (2000)
Wagner, R.A., Fischer, M.J.: The String-to-String Correction Problem. Journal of ACM 21(1), 168–173 (1974)
Sharvit, D., Chan, J., Tek, H., Kimia, B.B.: Symmetry-based Indexing of Image Databases. In: CBAIVL 1998, pp. 56–62 (1998)
Uliel, S., Fliess, A., Unger, R.: Naturally occurring circular permutations in proteins. Protein Engineering 14(8), 533–542 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Marzal, A., Palazón, V. (2005). Dynamic Time Warping of Cyclic Strings for Shape Matching. In: Singh, S., Singh, M., Apte, C., Perner, P. (eds) Pattern Recognition and Image Analysis. ICAPR 2005. Lecture Notes in Computer Science, vol 3687. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11552499_71
Download citation
DOI: https://doi.org/10.1007/11552499_71
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28833-6
Online ISBN: 978-3-540-31999-3
eBook Packages: Computer ScienceComputer Science (R0)