loading...
Applying Compiler Techniques to Diagram Recognition
Quebec City, QC, Canada August 11-August 15
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICPR.2002.104781016th International Conference on Patt ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
D. Blostein, Queen's University
J. Cordy, Queen's University
R. Zanibbi, Queen's University
Compiler techniques are effective and efficient in processing textual programming languages. These techniques can be adapted to recognition and processing of two-dimensional languages (diagrams). Already, grammars and parsers have been used in a variety of diagram-recognition and diagram-processing tasks. Here we explore the use of two other compiler techniques in pattern recognition systems. The first is compiler-style use of trees and tree transformation. The second is a multi-pass control structure, with a clear separation between layout, lexical, syntactic, and semantic analysis. Our proposal is illustrated on a case study involving recognition of hand-drawn mathematics notation.
Citation:
D. Blostein, J. Cordy, R. Zanibbi, "Applying Compiler Techniques to Diagram Recognition," icpr, vol. 3, pp.30123, 16th International Conference on Pattern Recognition (ICPR'02) - Volume 3, 2002
Usage of this product signifies your acceptance of the Terms of Use.