Binary tree-based precision-keeping clustering for very fast Japanese character recognition

@article{Sobu2010BinaryTP,
  title={Binary tree-based precision-keeping clustering for very fast Japanese character recognition},
  author={Yohei Sobu and Hideaki Goto and Hirotomo Aso},
  journal={2010 25th International Conference of Image and Vision Computing New Zealand},
  year={2010},
  pages={1-6}
}
Real-time character recognition in video frames has been attracting great attention from developers since scene text recognition was recognized as a new field of Optical Character Recognition (OCR) applications. Some oriental languages such as Japanese and Chinese have thousands of characters, and the character recognition takes much longer time in general… CONTINUE READING