Authors
Richard Zanibbi, Dorothea Blostein, James R. Cordy
Publication date
2002/11
Journal
IEEE Transactions on pattern analysis and machine intelligence
Volume
24
Issue
11
Pages
1455-1467
Publisher
IEEE
Description
We describe a robust and efficient system for recognizing typeset and handwritten mathematical notation. From a list of symbols with bounding boxes the system analyzes an expression in three successive passes. The Layout Pass constructs a Baseline Structure Tree (BST) describing the two-dimensional arrangement of input symbols. Reading order and operator dominance are used to allow efficient recognition of symbol layout even when symbols deviate greatly from their ideal positions. Next, the Lexical Pass produces a Lexed BST from the initial BST by grouping tokens comprised of multiple input symbols; these include decimal numbers, function names, and symbols comprised of nonoverlapping primitives such as "=". The Lexical Pass also labels vertical structures such as fractions and accents. The Lexed BST is translated into L/sup A/T/sub E/X. Additional processing, necessary for producing output for …
Total citations
Scholar articles
R Zanibbi, D Blostein, JR Cordy - IEEE Transactions on pattern analysis and machine …, 2002
R Zanibbi - IEEE Trans. Pattern Anal. Machine Intell., 2002