Abstract
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.
This work has been supported by a grant founded by the Agencia Española de Cooperación Internacional and the European ESPRIT project 30268 EUTRANS.
Chapter PDF
Similar content being viewed by others
Keywords
References
H. Bunke and U. Bühler. Applications of approximate string matching to 2D shape recognition. Pattern Recognition, 26(12):1797–1812, 1993.
H. Bunke and A. Sanfeliu, editors. Syntactic and Structural Pattern Recognition Theory and Applications, Singapore, 1990. World Scientific.
V. I. Levenshtein. Binary codes capable of correcting deletions, insertions and reversals. Cybernetics and Control Theory, 10(8):707–710, 1966.
R. A. Wagner and M. J. Fischer. The string-to-string correction problem. J. Assoc. Comput. Machinery, 21:168–173, 1974.
M. Maes. On a cyclic string-to-string correction problem. Information Processing Letters, 35(2):73–78, June 1990.
J. Gregor and M. G. Thomason. Dynamic programming alignment of sequences representing cyclic patterns. IEEE Transactions on Pattern Analysis and Machine Intelligence, 15(2):129–135, February 1993.
P. H. Sellers. The theory and computation of evolutionary distances: Pattern recognition. Journal of Algorithms, 1:359–373, 1980.
G. Andreu, A. Crespo, and J. M. Valiente. Selecting the toroidal self-organizing feature maps (TSOFM) best organized to object recognition. In Proceedings of ICNN 97, volume 2, pages 1341–1346, Houston, Texas (USA), June 1997. IEEE.
H. Freeman. Computer processing of line drawing images. Computer Surveys, 6:57–98, 1974.
R. C. Gonzalez and R. E. Woods. Digital Image Processing. Addison-Wesley, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mollineda, R.A., Vidal, E., Casacuberta, F. (2000). Efficient Techniques for a Very Accurate Measurement of Dissimilarities between Cyclic Patterns. In: Ferri, F.J., Iñesta, J.M., Amin, A., Pudil, P. (eds) Advances in Pattern Recognition. SSPR /SPR 2000. Lecture Notes in Computer Science, vol 1876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44522-6_35
Download citation
DOI: https://doi.org/10.1007/3-540-44522-6_35
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67946-2
Online ISBN: 978-3-540-44522-7
eBook Packages: Springer Book Archive