- Volume 9 Issue 4
Online character recognition techniques have been applied in many new fields of PDA, Tablet PC etc. But the recognition techniques can not use such high technologies naturally yet. Hidden Markov Model (HMM) that is much used recently requires high memory space and complex computational tasks because of comparing the input data with entire standard patterns. In this paper we propose a method to recognize the online characters more efficiently. At first we create chain-codes of learning data and recognition data in preprocessing phase, and then we compress dimensions of data using Principal Component Analysis (PCA) and recognize a character compressed data in recognition phrase. Validity of proposed method .is verified. by experiment results.