In syntactic pattern recognition a pattern can be described by a graph. The problem of recognition is to determine if a pattern, represented by a describing graph, belongs to a language L(G), generated by a graph grammar G. The so-called IE graphs are used for pattern description. They are generated by so-called ETPL(k) graph grammars. The purpose of this paper is to present an idea of a new approach to syntactic recognition of fuzzy patterns represented by fuzzy IE graphs, followed the example of random IE graphs. This methodology can be used in embodied multi-agent systems for a scene analysis. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Bielecka, M., & Skomorowski, M. (2007). Fuzzy-aided syntactic scene analysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4488 LNCS, pp. 970–973). Springer Verlag. https://doi.org/10.1007/978-3-540-72586-2_136
Mendeley helps you to discover research relevant for your work.