Title :
Mathematical formula recognition using virtual link network
Author :
Eto, Yuko ; Suzuki, Masakazu
Author_Institution :
Toshiba Corp. e-Solution Co., Tokyo, Japan
fDate :
6/23/1905 12:00:00 AM
Abstract :
We propose a new method of recognizing mathematical formulae. The method is robust against the recognition errors of characters and the variation of the printing styles of the documents. The outline is as follows: we first construct a network with vertices representing the characters (symbols), linked with each other by several edges with labels and costs representing the possible relations of the pair of characters. The network has multiple edges with different labels and costs representing the ambiguity of the decision of the relation of character pairs. Then, we output the spanning tree of the network with minimum cost which corresponds to the recognition result of the structure of the mathematical formula, using not only the local costs initially attached to the network but the costs reflecting global structure of the formula. The advantage of this method is that local errors of the recognition are recovered automatically by the total cost of the recognition tree
Keywords :
character recognition; trees (mathematics); character pairs; mathematical formula recognition; printing styles; recognition errors; recognition tree; spanning tree; vertices; virtual link network; Character recognition; Costs; Dynamic programming; Mathematics; Optical character recognition software; Printing; Robustness; Search methods;
Conference_Titel :
Document Analysis and Recognition, 2001. Proceedings. Sixth International Conference on
Conference_Location :
Seattle, WA
Print_ISBN :
0-7695-1263-1
DOI :
10.1109/ICDAR.2001.953891