Publication: Effectively recognizing broken characters in Historical documents
Issued Date
2012-10-09
Resource Type
Other identifier(s)
2-s2.0-84867080115
Rights
Mahidol University
Rights Holder(s)
SCOPUS
Bibliographic Citation
CSAE 2012 - Proceedings, 2012 IEEE International Conference on Computer Science and Automation Engineering. Vol.3, (2012), 104-108
Suggested Citation
Chaivatna Sumetphong, Supachai Tangwongsan Effectively recognizing broken characters in Historical documents. CSAE 2012 - Proceedings, 2012 IEEE International Conference on Computer Science and Automation Engineering. Vol.3, (2012), 104-108. doi:10.1109/CSAE.2012.6272918 Retrieved from: https://repository.li.mahidol.ac.th/handle/123456789/14031
Research Projects
Organizational Units
Authors
Journal Issue
Thesis
Title
Effectively recognizing broken characters in Historical documents
Author(s)
Other Contributor(s)
Abstract
Historical documents, after being binarized, produce images that contain abundant broken pieces. The presence of these broken pieces naturally complicates the process of OCR and drastically drops the overall recognition accuracy. We propose a highly effective approach to recognize the broken characters using a heuristic enumerative method to find the optimal set partition of the broken pieces. Each subset of the optimal partition is mapped to the best character pattern and the overall image is recognized. Results obtained after performing experiments on a Thai Historical document and an American Historical document are quite promising. Given the generality of the method, it may be applicable to different language scripts given that a properly trained classifier has been developed for that script and font. © 2012 IEEE.