Fast and accurate tree-based clustering for Japanese/Chinese character recognition

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

Recognizing text in natural scene images is very important to develop various systems such as an assistant device for visually-impaired people. Multilingual scene text recognition is also becoming important for wearable camera devices with language translation feature. Since computational resources are limited on such mobile devices, fast and accurate Optical Character Recognition (OCR) algorithm is needed. Nearest Neighbor (NN) search is quite popular in feature vector-based OCR systems, and its speed improvement is required. In this paper, we develop an OCR scheme with tree-based clustering technique with LDA (Linear Discriminant Analysis) aiming at real-time Japanese/Chinese character recognition. The experimental results using ETL9B dataset show that our proposed method is 94.6% faster than our previous method, also beating other techniques, at mere 0.24% accuracy drop from the full linear search. © 2013 Springer-Verlag.

Cite

CITATION STYLE

APA

Abe, Y., Sasaki, T., & Goto, H. (2013). Fast and accurate tree-based clustering for Japanese/Chinese character recognition. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8157 LNCS, pp. 459–468). https://doi.org/10.1007/978-3-642-41184-7_47

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free