EMERS: A tree matching-based performance evaluation of mathematical expression recognition systems

International Journal on Document Analysis and Recognition

Volumn 14, Issue 1, 2011, Pages 75-85

  Sain, Kunal ^a   Dasgupta, Abhishek ^b   Garain, Utpal ^c  

^a GOVERNMENT COLLEGE OF ENGINEERING AND TEXTILE TECHNOLOGY   (India)

^b BIDHAN CHANDRA KRISHI VISWAVIDYALAYA   (India)

^c INDIAN STATISTICAL INSTITUTE   (India)

Author keywords

Euler strings; Mathematical expressions; OCR; Performance evaluation; Tree matching

Indexed keywords

EULER STRINGS; MATHEMATICAL EXPRESSIONS; OCR; PERFORMANCE EVALUATION; TREE MATCHING;

ALGORITHMS;

TREES (MATHEMATICS);

EID: 79952104611     PISSN: 14332833     EISSN: 14332825     Source Type: Journal    
DOI: 10.1007/s10032-010-0121-9     Document Type: Article

References (16)

1. Blostein D., Grbavec A.: Recognition of mathematical notation. In: Bunke, H., Wang, P. S. P. (eds) Handbook of Character Recognition and Document Image Analysis, pp. 557-582. World Scientific Publishing Company, Singapore (1997).
2. Chan K. F., Yeung D. Y.: Mathematical expression recognition: a survey. Int. J. Doc. Anal. Recognit. (IJDAR) 3(1), 3-15 (2000).
3. Demaine, E. D., Mozes, S., Rossman, B., Weimann, O. (2006) An O(n3)-time algorithm for tree edit distance available at. http://www. citebase. org/abstract?id=oai: arXiv. org: cs/0604037.
4. Garain U., Chaudhuri B. B.: Recognition of online handwritten mathematical expressions. IEEE Transac. Syst. Man Cybern. Part B 34(6), 2366-2376 (2004).
5. Garain U., Chaudhuri B. B.: A corpus for OCR research on printed mathematical expressions. Int J. Doc. Anal. Recognit. (IJDAR) 7(4), 241-259 (2005).
6. Garain, U.: Recognition of printed and handwritten mathematical expressions. Ph. D. Thesis, Indian Statistical Institute, Kolkata, India (2005).
7. Garain, U., Chaudhuri, B. B.: On OCR of printed mathematical expressions, digital document processing. Chaudhuri, B. B. (ed.) Advances in Pattern Recognition. pp. 235-259. Springer-Verlag, London Ltd. (2007).
8. Klein, P.: Computing the edit-distance between unrooted ordered trees. Bilardi, G., Italiano, G. F., Pietracaprina, A., Pucci, G. (eds.) Proceedings of the 6th Annual European Symposium, No. 1461, pp. 91-102. Springer-Verlag, Berlin (1998).
9. Lapointe, A., Blostein, D. (2009) Issues in performance evaluation: a case study of math recognition. Proceedings of International Conference on Document Analysis and Recognition (ICDAR), pp. 1355-1359.
10. Mitra, J., Garain, U., Chaudhuri, B. B., Kumar Swamy, H. V., Pal, T. (2003) Automatic understanding of structures in printed mathematical expressions. Proceedings of International Conference on Document Analysis and Recognition (ICDAR), pp. 540-544.
11. Okamoto, M., Imai, H., Takagi, K. (2001) Performance evaluation of a robust method for mathematical expression recognition. Proceedings of International Conference on Document Analysis and Recognition (ICDAR), pp. 121-128.
12. Tai K. C.: The tree-to-tree correction problem. J. Assoc. Comput. Mach. 26, 422-433 (1979).
13. Uchida S., Nomura A., Suzuki M.: Quantitative analysis of mathematical documents. Int. J. Doc. Anal. Recognit. (IJDAR) 7(4), 211-218 (2005).
14. Wagner R. A., Fisher M. J.: The string-to-string correction problem. J. Assoc. Comput. Mach. 21, 168-178 (1974).
15. Zanibbi R., Blostein D., Cordy J. R.: Recognizing mathematical expressions using tree transformation. IEEE Trans. Pattern Anal. Mach. Intell. 24(11), 1455-1467 (2002).
16. Zhang K., Shasha D.: Simple fast algorithms for the editing distance between trees and related problems. SIAM J. Comput. 18(6), 1245-1262 (1989).