Character Recognition U sing Canonical

نویسنده

  • Mustafa Unel
چکیده

This paper presents a new insight into character recognition problem. Implicit polynomial (IP) curves have been used for modelling characters. A unique decomposition theorem is employed to decompose these curves into simple line primitives. For the comparison of the characters, canonical invariants have been computed using so called "related points" of the curves, which are the real intersections of the lines. Experimental results are presented to asses discrimination power of proposed invariants and their robustness under data perturbations. The method has also been compared with fourier descriptors.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Character Recognition Using Canonical Invariants

This paper presents a new insight into character recognition problem. Implicit polynomial (IP) curves have been used for modelling characters. A unique decomposition theorem is employed to decompose these curves into simple line primitives. For the comparison of the characters, canonical invariants have been computed using so called “related points” of the curves, which are the real intersectio...

متن کامل

SVM-based Multiview Face Recognition by Generalization of Discriminant Analysis

Identity verification of authentic persons by their multiview faces is a real valued problem in machine vision. Multiview faces are having difficulties due to non-linear representation in the feature space. This paper illustrates the usability of the generalization of LDA in the form of canonical covariate for face recognition to multiview faces. In the proposed work, the Gabor filter bank is u...

متن کامل

Binary Tree-based Accuracy-keeping Clustering Using CDA for Very Fast Japanese Character Recognition

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. There are thousands of characters in some oriental languages such as Japanese and Chinese, and the character recognition takes much longer time in general compared with European languag...

متن کامل

The Canonical Metric for Vector Quantization

To measure the quality of a set of vector quantization points a means of measuring the distance between two points is required. Common metrics such as the Hamming and Euclidean metrics, while mathematically simple, are inappropriate for comparing speech signals or images. In this paper it is argued that there often exists a natural environment of functions to the quantizationprocess (for exampl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004