Pattern Recognition.ppt

String Matching Disadvantages: 1.It can not uses for a hollow structure 2.Scaling 3.The color is unable to recognize Syntactic Recognition of Strings String Grammars When dealing with strings, we define a grammar as the 4-tuple is a finite set of variables called non-terminals, is a finite set of constants called terminals, is a set of rewriting rules called productions, in is called the starting symbol. Syntactic Recognition of Strings String Grammars Object represented by its skeleton primitives. structure generated by using a regular string grammar a c b Syntactic Recognition of Strings String Grammars Advantages: 1.This method may use to a more complex structure 2.It is a good method for character set Disadvantages: 1.Scaling 2.Rotation 3.The color is unable to recognize 4.Intensity 5.Mirror problem Syntactic Recognition of Tree Grammars A tree grammar is defined as the 5-tuple and are sets of non-terminals and terminals, respectively is the start symbol, which in general can be a tree is a set of productions of the form , where and are trees is a ranking function that denotes the number of direct descendants(offspring) of a node whose label is a terminal in the grammar Syntactic Recognition of Tree Grammars Of particular relevance to our discussion are expansive tree grammars having productions of the form where are not terminals and k is a terminal An object Primitives used for representing the skeleton by means of a tree grammar Syntactic Recognition of Tree Grammars a b c d e Syntactic Recognition of Tree Grammars For example a b c d e Syntactic Recognition of Tree Grammars Advantages: 1. This method may use to a more complex structure 2. It is a good method for character set 3. The Displacement question definitely m