DISTORTED PATTERN RECOGNITION AND ANALYSIS WITH THE HELP OF Hy GRAPH REPRESENTATION
DOI:
https://doi.org/10.7494/csci.2002.4.1.3597Abstract
An algorithmfor distortedpattern recognition ispresented. It's generalization ofM. Flasiń- ski results (Pattern Recognition, 27, 1-16, 1992). A new formalism allows to make both qualitative and quantitive distortion analysis. It also enlarges parser flexibility by exten- ding the set ofpatterns which may be recognized.
Downloads
References
Flasiński M.: Distorted pattern analysis with the help o f node label controlled graph langu- ages. Pattem Recognition, 23, 1990, 765-774
FlasińskiM.:Ontheparsingofdeterministicgraphlanguagesforsyntacticpatternrecogni tion. Pattem Recognition, 26, 1993, 1-16
Flasiński M.: Power properties o f NLC graph grammars with a polynomial membership pro blem. Theoretical Computer Science, 201, 1998, 189-231
Flasiński M.: Parsing o f edNLC-graph grammars fo r scene anaysis. Pattem Recognition, 21, No. 6, 1988
Ehrig FL, Kreowski H.J., Rozenberg G. (Eds): Graph Grammars and their Application to Com puter Science. Lecture Notes in Computer Science, 153, Berlin, Springer 1983
Ehrig H., Kreowski H.J., Rozenberg G. (Eds): Graph Grammars and their Application to Com puter Science. Lecture Notes in Computer Science, 291, Berlin, Springer 1987
Ehrig H., Kreowski H.J., Rozenberg G. (Eds): Graph Grammars and their Application to Com puter Science. Lecture Notes in Computer Science, 532, Berlin, Springer 1991
