Efficient search strategy in structural analysis for handwritten mathematical expression recognition

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 349
  • Download : 4
Problems with local ambiguities in handwritten mathematical expressions (MEs) are often resolved at global level. Therefore, keeping local ambiguities is desirable for high accuracy, with a hope that they may be resolved by later global analyses. We propose a layered search framework for handwritten ME recognition. From given handwritten input strokes, ME structures are expanded by adding symbol hypotheses one by one, representing ambiguities of symbol identities and spatial relationships as numbers of branches in the expansion. We also propose a novel heuristic predicting how likely the set of remaining input strokes forms valid spatial relationships with the current partially interpreted structure. Further complexity reduction is achieved by delaying the symbol identity decision. The elegance of our approach is that the search result would be unchanged even if we prune out unpromising branches of the search. Therefore, we can examine a much larger number of local hypotheses with a limited amount of computing resource in making global level decisions. The experimental evaluation shows promising results of the efficiency of the proposed approach and the performance of our system, which results from the system's capacity to examine a large number of possibilities. (C) 2009 Elsevier Ltd. All rights reserved.
Publisher
ELSEVIER SCI LTD
Issue Date
2009-12
Language
English
Article Type
Article; Proceedings Paper
Keywords

SYNTACTIC APPROACH

Citation

PATTERN RECOGNITION, v.42, no.12, pp.3192 - 3201

ISSN
0031-3203
DOI
10.1016/j.patcog.2008.10.036
URI
http://hdl.handle.net/10203/13893
Appears in Collection
CS-Journal Papers(저널논문)
Files in This Item

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0