Off-line cursive handwriting recognition using hidden markov models
Identifieur interne : 001D08 ( Istex/Checkpoint ); précédent : 001D07; suivant : 001D09Off-line cursive handwriting recognition using hidden markov models
Auteurs : H. Bunke [Suisse] ; M. Roth [Suisse] ; E. G. Schukat-Talamazzini [Allemagne]Source :
- Pattern Recognition [ 0031-3203 ] ; 1994.
Abstract
A method for the off-line recognition of cursive handwriting based on hidden Markov models (HMMs) is described. The features used in the HMMs are based on the arcs of skeleton graphs of the words to be recognized. An algorithm is applied to the skeleton graph of a word that extracts the edges in a particular order. Given the sequence of edges extracted from the skeleton graph, each edge is transformed into a 10-dimensional feature vector. The features represent information about the location of an edge relative to the four reference lines, its curvature and the degree of the nodes incident to the considered edge. The linear model was adopted as basic HMM topology. Each letter of the alphabet is represented by a linear HMM. Given a dictionary of fixed size, an HMM for each dictionary word is built by sequential concatenation of the HMMs representing the individual letters of the word. Training of the HMMs is done by means of the Baum-Welch algorithm, while the Viterbi algorithm is used for recognition. An average correct recognition rate of over 98% on the word level has been achieved in experiments with cooperative writers using two dictionaries of I50 words each.
Url:
DOI: 10.1016/0031-3203(95)00013-P
Affiliations:
Links toward previous steps (curation, corpus...)
Links to Exploration step
ISTEX:2C08A6F9965E87A5FA4832C61259974CFEA9F208Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title>Off-line cursive handwriting recognition using hidden markov models</title>
<author><name sortKey="Bunke, H" sort="Bunke, H" uniqKey="Bunke H" first="H." last="Bunke">H. Bunke</name>
</author>
<author><name sortKey="Roth, M" sort="Roth, M" uniqKey="Roth M" first="M." last="Roth">M. Roth</name>
</author>
<author><name sortKey="Schukat Talamazzini, E G" sort="Schukat Talamazzini, E G" uniqKey="Schukat Talamazzini E" first="E. G." last="Schukat-Talamazzini">E. G. Schukat-Talamazzini</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:2C08A6F9965E87A5FA4832C61259974CFEA9F208</idno>
<date when="1995" year="1995">1995</date>
<idno type="doi">10.1016/0031-3203(95)00013-P</idno>
<idno type="url">https://api.istex.fr/document/2C08A6F9965E87A5FA4832C61259974CFEA9F208/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">001029</idno>
<idno type="wicri:Area/Istex/Curation">000F78</idno>
<idno type="wicri:Area/Istex/Checkpoint">001D08</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a">Off-line cursive handwriting recognition using hidden markov models</title>
<author><name sortKey="Bunke, H" sort="Bunke, H" uniqKey="Bunke H" first="H." last="Bunke">H. Bunke</name>
<affiliation wicri:level="4"><country xml:lang="fr">Suisse</country>
<wicri:regionArea>Institut für Informatik and angewandte Mathematik, Universität Bern, Länggassstrasse 5I, CH-3012 Bern</wicri:regionArea>
<orgName type="university">Université de Berne</orgName>
<placeName><settlement type="city">Berne</settlement>
<region nuts="3" type="region">Canton de Berne</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Roth, M" sort="Roth, M" uniqKey="Roth M" first="M." last="Roth">M. Roth</name>
<affiliation wicri:level="4"><country xml:lang="fr">Suisse</country>
<wicri:regionArea>Institut für Informatik and angewandte Mathematik, Universität Bern, Länggassstrasse 5I, CH-3012 Bern</wicri:regionArea>
<orgName type="university">Université de Berne</orgName>
<placeName><settlement type="city">Berne</settlement>
<region nuts="3" type="region">Canton de Berne</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Schukat Talamazzini, E G" sort="Schukat Talamazzini, E G" uniqKey="Schukat Talamazzini E" first="E. G." last="Schukat-Talamazzini">E. G. Schukat-Talamazzini</name>
<affiliation wicri:level="1"><country xml:lang="fr">Allemagne</country>
<wicri:regionArea>Lehrstuhl für Informatik 5 (Mustererkennung), Friedrich-Alexander-Universität Erlangen-Nürnberg, Martensstrasse 3, D-91056 Erlangen</wicri:regionArea>
<wicri:noRegion>91056 Erlangen</wicri:noRegion>
<wicri:noRegion>D-91056 Erlangen</wicri:noRegion>
</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="1994">1994</date>
<biblScope unit="volume">28</biblScope>
<biblScope unit="issue">9</biblScope>
<biblScope unit="page" from="1399">1399</biblScope>
<biblScope unit="page" to="1413">1413</biblScope>
</imprint>
<idno type="ISSN">0031-3203</idno>
</series>
<idno type="istex">2C08A6F9965E87A5FA4832C61259974CFEA9F208</idno>
<idno type="DOI">10.1016/0031-3203(95)00013-P</idno>
<idno type="PII">0031-3203(95)00013-P</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">A method for the off-line recognition of cursive handwriting based on hidden Markov models (HMMs) is described. The features used in the HMMs are based on the arcs of skeleton graphs of the words to be recognized. An algorithm is applied to the skeleton graph of a word that extracts the edges in a particular order. Given the sequence of edges extracted from the skeleton graph, each edge is transformed into a 10-dimensional feature vector. The features represent information about the location of an edge relative to the four reference lines, its curvature and the degree of the nodes incident to the considered edge. The linear model was adopted as basic HMM topology. Each letter of the alphabet is represented by a linear HMM. Given a dictionary of fixed size, an HMM for each dictionary word is built by sequential concatenation of the HMMs representing the individual letters of the word. Training of the HMMs is done by means of the Baum-Welch algorithm, while the Viterbi algorithm is used for recognition. An average correct recognition rate of over 98% on the word level has been achieved in experiments with cooperative writers using two dictionaries of I50 words each.</div>
</front>
</TEI>
<affiliations><list><country><li>Allemagne</li>
<li>Suisse</li>
</country>
<region><li>Canton de Berne</li>
</region>
<settlement><li>Berne</li>
</settlement>
<orgName><li>Université de Berne</li>
</orgName>
</list>
<tree><country name="Suisse"><region name="Canton de Berne"><name sortKey="Bunke, H" sort="Bunke, H" uniqKey="Bunke H" first="H." last="Bunke">H. Bunke</name>
</region>
<name sortKey="Roth, M" sort="Roth, M" uniqKey="Roth M" first="M." last="Roth">M. Roth</name>
</country>
<country name="Allemagne"><noRegion><name sortKey="Schukat Talamazzini, E G" sort="Schukat Talamazzini, E G" uniqKey="Schukat Talamazzini E" first="E. G." last="Schukat-Talamazzini">E. G. Schukat-Talamazzini</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Istex/Checkpoint
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001D08 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Checkpoint/biblio.hfd -nk 001D08 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= OcrV1 |flux= Istex |étape= Checkpoint |type= RBID |clé= ISTEX:2C08A6F9965E87A5FA4832C61259974CFEA9F208 |texte= Off-line cursive handwriting recognition using hidden markov models }}
This area was generated with Dilib version V0.6.32. |