Page 295 -
P. 295

6.4 Structural Matching   283

                             generalized  attributed  relational graphs  has been  developed  by  Li (1992). In his
                            work, a relaxation matching algorithm invariant to translations, rotations and scale
                            changes is presented.
                               Special types of recurrent neural networks have also been developed for acyclic
                             graph matching. Their application to automatic inference in syntactic and structural
                             pattern recognition is described by Sperduti et al. (1996).



                             Bibliography

                             Biland HP, Wahl FM (1988) Hough-Space  Decomposition  for Polyhedral Scene Analysis.
                               In:  FerratC G, Pavlidis  T, Sanfeliu A,  Bunke  H  (eds) Syntactic and Structural Pattern
                               Recognition. Springer-Verlag.
                             Bunke H (1990a) String Grammars for Syntactic Pattern Recognition In: Bunke H, Sanfeliu
                               A (eds) Syntactic and Structural Pattern  Recognition. Theory  and Applications.  World
                               Scientific Pub. Co., Singapore.
                             Bunke H (1990b) String Matching for Structural Pattern Recognition.  In: Bunke H, Sanfeliu
                               A (eds) Syntactic  and Structural Pattern  Recognition. Theory  and  Applications.  World
                               Scientific Pub. Co., Singapore.
                             Bunke  H  (1990~) Hybrid  Pattern  Recognition  Methods.  In:  Bunke  H,  Sanfeliu  A  (eds)
                               Syntactic and Structural Pattern  Recognition.  Theory and Applications.  World Scientific
                               Pub. Co., Singapore.
                             Chen JW, Lee SY (1996) A Hierarchical  Representation  for the Reference Database of On-
                               line Chinese Character Recognition. In: Perner P, Wang P, Rosenfeld  A (eds) Advances
                               in Structural and Syntactical Pattern Recognition, Springer Verlag, pp. 351 -360.
                             Davis  LS  (1979)  Shape Matching  Using Relaxation  Techniques. IEEE Tr Patt  An  Mach
                               Intell, 150-72.
                             DeMori R (1977) Syntactic Recognition of Speech Signals. In: Fu KS (ed) Syntactic Pattern
                               Recognition Applications. Springer-Verlag.
                             Di Baja GS (1996) Representing Shape by Line Patterns. In: Perner P, Wang P, Rosenfeld A
                               (eds) Advances  in  Structural and Syntactical Pattern  Recognition, Springer Verlag, pp.
                               230-239.
                             Duda RO, Hart PE (1973) Pattern Classification and Scene Analysis. Wiley, New York.
                             Fu  KS  (1977)  Introduction  to  Syntactic  Pattern  Recognition.  In:  Fu  KS  (ed)  Syntactic
                               Pattern Recognition Applications.  Springer-Verlag.
                             Gdalyahu Y, Weinshall D (1999) Flexible Syntactic Matching of Curves and its Application
                               to Automatic  Hierarchical  Classification of  Silhouettes. IEEE Tr Patt  An  Mach  Intell,
                               21:1312-1328.
                             Gold  S, Rangarajan  A  (1996)  A  Graduated  Assignment  Algorithm  for Graph  Matching.
                               IEEE Tr Patt An Mach Intell, 18:377-388.
                             Horowitz  SL (1977)  Peak  Recognition  in  Waveforms.  In:  Fu  KS  (ed)  Syntactic  Pattern
                               Recognition Applications. Springer-Verlag.
                              Hummel  RA,  Zucker  SW (1983)  On  the  Foundations of  Relaxation  Labeling  Processes.
                               IEEE Tr Patt An Mach Intell, 5:267-285.
                              Kuner  P,  Ueberreiter  B  (1988)  Pattern  Recognition  by  Graph  Matching.  Combinatorial
                                Versus Continuous Optimization. Int. I. Patt. Rec. Artif. Intell., 2: 527-542.
   290   291   292   293   294   295   296   297   298   299   300