نتایج جستجو برای: linear character

تعداد نتایج: 549055  

2000
TSUYOSHI FUKUMOTO TETSUSHI WAKABAYASHI FUMITAKA KIMURA YASUJI MIYAKE

This paper deals with accuracy improvement of handwritten character recognition by the GLVQ (generalized learning vector quantization). In literature , the way of combining the FDA (Fisher discriminant analysis) and the GLVQ was investigated and evaluated to be effective for handwritten Chinese character recognition employing the minimum Euclidian distance classifier. In this paper, the project...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه قم - دانشکده فنی 1393

در این پایان نامه روشی برای تطبیق مدل زبانی ارائه شده است. این روش، برمبنای ترکیب الگوریتم کاهش بعد locally linear embedding و مدل زبانی n-gram عمل میکند. الگوریتم locally linear embedding در کاهش ابعاد ساختار داده اصلی را حفظ مینماید. لذا انتظار داریم ساختار کلی ماتریس سند-کلمه در این کاهش بعد دچار خدشه زیاد نگردد. الگوریتم ارائه شده، با استفاده از زبان c++ و بهره گیری از توابع موجود در ابزاره...

2016
G. Néron

It is well known that an electric field that is applied normally to the free surface of a conducting fluid has a destabilizing effect. Here we study the linear growth of electro-capillary

1997
Atsushi Imiya

Gaussian scale-space is considered to be a modern bottom-up tool in computer vision. The Amer-ican and European vision community, however, is unaware of the fact that Gaussian scale-space has already been axiomatically derived in 1959 in a Japanese paper by Taizo Iijima. This result formed the starting point of an entire world of linear scale-space research in Japan ranging from various axiomat...

2003
Katsuhiko Takahashi Daisuke Nishiwaki

A class-modular generalized learning vector quantization (GLVQ) ensemble method with outlier learning for handwritten digit recognition is proposed. A GLVQ classifier is one of discriminative methods. Though discriminative classifiers have remarkable ability to solve character recognition problems, they are poor at outlier resistance. To overcome this problem, a GLVQ classifier trained with bot...

1996
Ming Yu Shinji Ozawa

Gray-scale document images are binarized in order to perform optical character recognition (OCR). To perform this binarization, a variety of techniques have been proposed for performing threshold selection. Most of these are based on the intensity distribution of the image regions. However, when the spacing between two lines is very small, it is difficult to produce high quality characters usin...

Journal: :Pattern Recognition 2011
Marte A. Ramírez-Ortegón Edgar A. Duéñez-Guzmán Raúl Rojas Erik Valdemar Cuevas Jiménez

In this paper, we propose a mechanism for systematic comparison of the efficacy of unsupervised evaluation methods for parameter selection of binarization algorithms in optical character recognition (OCR). We also analyze these measures statistically and ascertain whether a measure is suitable or not to assess a binarization method. The comparison process is streamlined in several steps. Given ...

2004
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 intersectio...

2013
M. M. Kodabagi

Automatic identification of a script in a document image facilitates many important applications such as automatic archiving of multilingual documents; searching online archives of document images and for the selection of script specific OCR in a multilingual environment. In this work a technique for script identification from document images is proposed. The method uses vertical and horizontal...

2008
DAVID C. CANNATELLA KEVIN DE QUEIROZ

4). For the form of additive binary coding in which it is the branches that are coded, there must be a branch placed below the bottom-most character state, and that branch must contribute a derived code for all of the states in the tree (i.e., the minimum pathlength from each of the character states to the base of the tree passes through that branch). O'Grady and Deets (1987) remarked that alte...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید