论文信息 - Distorted pattern analysis with the help of node label controlled graph languages

Distorted pattern analysis with the help of node label controlled graph languages

Abstract An algorithm of error-correcting parsing for analysis of distorted patterns is presented. The algorithm is based on the syntax analyser presented by Flasinski (Pattern Recognition21, 623–629, 1988) for scene analysis. The extended ETL/1-grammar is less restricted than the grammar presented previously by the author but the parser has the same time complexity as its predecessor. The notions introduced in the paper are useful for researches in error-correcting parsing of graph languages.

Mariusz Flasinski

[1] Alfred V. Aho,et al. A Minimum Distance Error-Correcting Parser for Context-Free Languages , 1972, SIAM J. Comput..

[2] Mariusz Flasiński. Parsing of edNLC-graph grammars for scene analysis , 1988, Pattern Recognit..

[3] K. S. Fu. A General (Syntactic-Semantic) Approach to Picture Analysis , 1982 .

[4] King-Sun Fu,et al. Syntactic Pattern Recognition And Applications , 1968 .

[5] Grzegorz Rozenberg,et al. On sequential and parallel node-rewriting graph grammars , 1982, Comput. Graph. Image Process..

[6] King-Sun Fu,et al. Structure-preserved error-correcting tree automata for syntactic pattern recognition , 1976 .

[7] King-Sun Fu,et al. Parsing and Translation of (Attributed) Expansive Graph Languages for Scene Analysis , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8] Vladimir I. Levenshtein,et al. Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

[9] Mariusz Flasiński. Characteristics of edNLC-graph grammar for syntactic pattern recognition , 1989, Comput. Vis. Graph. Image Process..