Abstract
To recognize a character using a pattern matching method, it is necessary to prepare sufficiently many sample patterns for a template pattern. However, it is difficult to collect a sufficient number of samples of some characters because they do not appear often. This paper proposes a new method of estimating a template pattern using the transfer function in a frequency range which is considered generally to be useful in such a case. The effectiveness of the method is demonstrated experimentally by using the printed Devanagari characters (in Buddhist literature) as an example.
Original language | English |
---|---|
Pages (from-to) | 25-32 |
Number of pages | 8 |
Journal | Systems and Computers in Japan |
Volume | 21 |
Issue number | 12 |
DOIs | |
Publication status | Published - 1990 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Information Systems
- Hardware and Architecture
- Computational Theory and Mathematics