Database-driven mathematical character recognition

  • Authors:
  • Alan Sexton;Volker Sorge

  • Affiliations:
  • School of Computer Science, University of Birmingham, UK;School of Computer Science, University of Birmingham, UK

  • Venue:
  • GREC'05 Proceedings of the 6th international conference on Graphics Recognition: ten Years Review and Future Perspectives
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an approach for recognising mathematical texts using an extensive ${\rm L\kern-.36em\raise.3ex\hbox{\sc a}\kern-.15em T\kern-.1667em\lower.7ex\hbox{E}\kern-.125emX}$symbol database and a novel recognition algorithm. The process consists essentially of three steps: Recognising the individual characters in a mathematical text by relating them to glyphs in the database of symbols, analysing the recognised glyphs to determine the closest corresponding ${\rm L\kern-.36em\raise.3ex\hbox{\sc a}\kern-.15em T\kern-.1667em\lower.7ex\hbox{E}\kern-.125emX}$symbol, and reassembling the text by putting the appropriate ${\rm L\kern-.36em\raise.3ex\hbox{\sc a}\kern-.15em T\kern-.1667em\lower.7ex\hbox{E}\kern-.125emX}$commands at their corresponding positions of the original text inside a ${\rm L\kern-.36em\raise.3ex\hbox{\sc a}\kern-.15em T\kern-.1667em\lower.7ex\hbox{E}\kern-.125emX}$picture environment. The recogniser itself is based on a novel variation on the application of geometric moment invariants. The working system is implemented in Java.