Off-line recognition of large-set handwritten characters with multiple hidden Markov models
Identifieur interne : 002784 ( Main/Merge ); précédent : 002783; suivant : 002785Off-line recognition of large-set handwritten characters with multiple hidden Markov models
Auteurs : Hee-Seon Park [Corée du Sud] ; Seong-Whan Lee [Corée du Sud]Source :
- Pattern Recognition [ 0031-3203 ] ; 1995.
Abstract
There are many uncertainties in handwritten character recognition. Stochastic modeling is a flexible and general method for modeling such problems and entails the use of probabilistic models to deal with uncertain or incomplete information. This paper presents an efficient scheme for off-line recognition of large-set handwritten characters in the framework of stochastic models, the first-order hidden Markov models (HMMs). To facilitate the processing of unconnected patterns and patterns with isolated noises, four types of feature vectors based on the regional projection contour transformation (RPCT) are employed. The recognition system consists of two phases. For each character, in the training phase, multiple HMMs corresponding to different feature types of RPCT are built. In the classification phase, the results of individual classifiers to produce the final recognition result for an input character are integrated, where each individual HMM classifier produces one score that is the probability of generating the test observation sequence for each character model. In this paper, several methods for integrating the results of different classifiers are considered so that a better result could be obtained. In order to verify the effectiveness of the proposed scheme, the most frequently used 520 types of Hangul characters in Korea have been considered in the experiments. Experimental results indicate that the proposed scheme is very promising for the recognition of large-set handwritten characters with numerous variations.
Url:
DOI: 10.1016/0031-3203(95)00081-X
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000277
- to stream Istex, to step Curation: 000272
- to stream Istex, to step Checkpoint: 001A51
Links to Exploration step
ISTEX:8E045F704F29A3201C16BE8170BBA4B102B87276Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Off-line recognition of large-set handwritten characters with multiple hidden Markov models</title><author><name sortKey="Park, Hee Seon" sort="Park, Hee Seon" uniqKey="Park H" first="Hee-Seon" last="Park">Hee-Seon Park</name></author><author><name sortKey="Lee, Seong Whan" sort="Lee, Seong Whan" uniqKey="Lee S" first="Seong-Whan" last="Lee">Seong-Whan Lee</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:8E045F704F29A3201C16BE8170BBA4B102B87276</idno><date when="1996" year="1996">1996</date><idno type="doi">10.1016/0031-3203(95)00081-X</idno><idno type="url">https://api.istex.fr/document/8E045F704F29A3201C16BE8170BBA4B102B87276/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000277</idno><idno type="wicri:Area/Istex/Curation">000272</idno><idno type="wicri:Area/Istex/Checkpoint">001A51</idno><idno type="wicri:doubleKey">0031-3203:1996:Park H:off:line:recognition</idno><idno type="wicri:Area/Main/Merge">002784</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a">Off-line recognition of large-set handwritten characters with multiple hidden Markov models</title><author><name sortKey="Park, Hee Seon" sort="Park, Hee Seon" uniqKey="Park H" first="Hee-Seon" last="Park">Hee-Seon Park</name><affiliation wicri:level="1"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Department of Computer Science, Chungbuk National University, San 48 Gaeshin-dong, Cheongju, Chungbuk 360-763</wicri:regionArea><wicri:noRegion>Chungbuk 360-763</wicri:noRegion></affiliation></author><author><name sortKey="Lee, Seong Whan" sort="Lee, Seong Whan" uniqKey="Lee S" first="Seong-Whan" last="Lee">Seong-Whan Lee</name><affiliation><wicri:noCountry code="no comma">Author to whom correspondence should be addressed.</wicri:noCountry></affiliation><affiliation wicri:level="1"><country xml:lang="fr">Corée du Sud</country><wicri:regionArea>Department of Computer Science, Korea University, Anam-dong, Seongbuk-ku, Seoul 136-701</wicri:regionArea><placeName><settlement type="city">Séoul</settlement></placeName></affiliation></author></analytic><monogr></monogr><series><title level="j">Pattern Recognition</title><title level="j" type="abbrev">PR</title><idno type="ISSN">0031-3203</idno><imprint><publisher>ELSEVIER</publisher><date type="published" when="1995">1995</date><biblScope unit="volume">29</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="231">231</biblScope><biblScope unit="page" to="244">244</biblScope></imprint><idno type="ISSN">0031-3203</idno></series><idno type="istex">8E045F704F29A3201C16BE8170BBA4B102B87276</idno><idno type="DOI">10.1016/0031-3203(95)00081-X</idno><idno type="PII">0031-3203(95)00081-X</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0031-3203</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">There are many uncertainties in handwritten character recognition. Stochastic modeling is a flexible and general method for modeling such problems and entails the use of probabilistic models to deal with uncertain or incomplete information. This paper presents an efficient scheme for off-line recognition of large-set handwritten characters in the framework of stochastic models, the first-order hidden Markov models (HMMs). To facilitate the processing of unconnected patterns and patterns with isolated noises, four types of feature vectors based on the regional projection contour transformation (RPCT) are employed. The recognition system consists of two phases. For each character, in the training phase, multiple HMMs corresponding to different feature types of RPCT are built. In the classification phase, the results of individual classifiers to produce the final recognition result for an input character are integrated, where each individual HMM classifier produces one score that is the probability of generating the test observation sequence for each character model. In this paper, several methods for integrating the results of different classifiers are considered so that a better result could be obtained. In order to verify the effectiveness of the proposed scheme, the most frequently used 520 types of Hangul characters in Korea have been considered in the experiments. Experimental results indicate that the proposed scheme is very promising for the recognition of large-set handwritten characters with numerous variations.</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002784 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 002784 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Merge
|type= RBID
|clé= ISTEX:8E045F704F29A3201C16BE8170BBA4B102B87276
|texte= Off-line recognition of large-set handwritten characters with multiple hidden Markov models
}}
| This area was generated with Dilib version V0.6.32. |  |