Conclusions
-
1.
The recognition of a line of text containing a large number of characters without gaps in the presence of noise can be performed by a method of comparison with standard characters, in spite of the extremely large number of standard lines.
-
2.
For an exact solution of the problem of finding the standard line giving the greatest similarity (by correlation) with the patterns to be recognized, a comparatively small amount of storage and computation is required.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. I. Shlezinger, “Correlation method of recognizing sequences of patterns,” collection: Reading Automata [in Russian], Kiev, pp. 62–69, 1965.
C. W. Helstrom, Statistical Theory of Signal Detection [Russian translation], IL, Moscow, 1963.
V. S. Mikhalevich and N. Z. Shor, “Method of sequential analysis of variants for the numerical solution of optimization problems,” Works on Problems of the Application of Computers in Economics [in Russian], Gor'kii, pp. 5–9, 1964.
R. Bellman, Dynamic Programming [Russian translation], IL, Moscow, 1960.
V. A. Kovalevskii, “The correlation method of recognition,” collection: Reading Automata [in Russian], Kiev, pp. 46–61, 1965.
Author information
Authors and Affiliations
Additional information
Kioernetika, Vol. 3, No. 4, pp. 75–80, 1967
Rights and permissions
About this article
Cite this article
Kovalevskii, V.A. An optimal recognition algorithm for some sequences of patterns. Cybern Syst Anal 3, 62–66 (1967). https://doi.org/10.1007/BF01071710
Issue Date:
DOI: https://doi.org/10.1007/BF01071710