Serveur d'exploration sur l'OCR

Attention, ce site est en cours de développement !
Attention, site généré par des moyens informatiques à partir de corpus bruts.
Les informations ne sont donc pas validées.

Slant estimation algorithm for OCR systems

Identifieur interne : 001C83 ( Main/Merge ); précédent : 001C82; suivant : 001C84

Slant estimation algorithm for OCR systems

Auteurs : E. Kavallieratou [Grèce] ; N. Fakotakis ; G. Kokkinakis

Source :

RBID : Pascal:02-0029539

Descripteurs français

English descriptors

Abstract

A slant removal algorithm is presented based on the use of the vertical projection profile of word images and the Wigner-Ville distribution. The slant correction does not affect the connectivity of the word and the resulting words are natural. The evaluation of our algorithm was equally made by subjective and objective means. The algorithm has been tested in English and Modern Greek samples of more than 500 writers, taken from the databases IAM-DB and GRUHD. The extracted results are natural, and almost always improved with respect to the original image, even in the case of variant-slanted writing. The performance of an existed character recognition system showed an increase of up to 9% for the same data, while the training time cost was significantly reduced. Due to its simplicity, this algorithm can be easily incorporated into any optical character recognition system. © 2001 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.

Links toward previous steps (curation, corpus...)


Links to Exploration step

Pascal:02-0029539

Le document en format XML

<record>
<TEI>
<teiHeader>
<fileDesc>
<titleStmt>
<title xml:lang="en" level="a">Slant estimation algorithm for OCR systems</title>
<author>
<name sortKey="Kavallieratou, E" sort="Kavallieratou, E" uniqKey="Kavallieratou E" first="E." last="Kavallieratou">E. Kavallieratou</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>Wire Communications Laboratory Electrical Computer Engineering University of Patras</s1>
<s2>Patras 26500</s2>
<s3>GRC</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Grèce</country>
<wicri:noRegion>Wire Communications Laboratory Electrical Computer Engineering University of Patras</wicri:noRegion>
</affiliation>
</author>
<author>
<name sortKey="Fakotakis, N" sort="Fakotakis, N" uniqKey="Fakotakis N" first="N." last="Fakotakis">N. Fakotakis</name>
</author>
<author>
<name sortKey="Kokkinakis, G" sort="Kokkinakis, G" uniqKey="Kokkinakis G" first="G." last="Kokkinakis">G. Kokkinakis</name>
</author>
</titleStmt>
<publicationStmt>
<idno type="wicri:source">INIST</idno>
<idno type="inist">02-0029539</idno>
<date when="2001">2001</date>
<idno type="stanalyst">PASCAL 02-0029539 EI</idno>
<idno type="RBID">Pascal:02-0029539</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000693</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000099</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000656</idno>
<idno type="wicri:doubleKey">0031-3203:2001:Kavallieratou E:slant:estimation:algorithm</idno>
<idno type="wicri:Area/Main/Merge">001C83</idno>
</publicationStmt>
<sourceDesc>
<biblStruct>
<analytic>
<title xml:lang="en" level="a">Slant estimation algorithm for OCR systems</title>
<author>
<name sortKey="Kavallieratou, E" sort="Kavallieratou, E" uniqKey="Kavallieratou E" first="E." last="Kavallieratou">E. Kavallieratou</name>
<affiliation wicri:level="1">
<inist:fA14 i1="01">
<s1>Wire Communications Laboratory Electrical Computer Engineering University of Patras</s1>
<s2>Patras 26500</s2>
<s3>GRC</s3>
<sZ>1 aut.</sZ>
</inist:fA14>
<country>Grèce</country>
<wicri:noRegion>Wire Communications Laboratory Electrical Computer Engineering University of Patras</wicri:noRegion>
</affiliation>
</author>
<author>
<name sortKey="Fakotakis, N" sort="Fakotakis, N" uniqKey="Fakotakis N" first="N." last="Fakotakis">N. Fakotakis</name>
</author>
<author>
<name sortKey="Kokkinakis, G" sort="Kokkinakis, G" uniqKey="Kokkinakis G" first="G." last="Kokkinakis">G. Kokkinakis</name>
</author>
</analytic>
<series>
<title level="j" type="main">Pattern Recognition</title>
<title level="j" type="abbreviated">Pattern Recogn.</title>
<idno type="ISSN">0031-3203</idno>
<imprint>
<date when="2001">2001</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt>
<title level="j" type="main">Pattern Recognition</title>
<title level="j" type="abbreviated">Pattern Recogn.</title>
<idno type="ISSN">0031-3203</idno>
</seriesStmt>
</fileDesc>
<profileDesc>
<textClass>
<keywords scheme="KwdEn" xml:lang="en">
<term>Algorithms</term>
<term>Database systems</term>
<term>Image processing</term>
<term>Optical character recognition</term>
<term>Slant estimation systems</term>
<term>Theory</term>
<term>Wigner-Ville distribution</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr">
<term>Théorie</term>
<term>Traitement image</term>
<term>Système base donnée</term>
<term>Algorithme</term>
<term>Reconnaissance optique caractère</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front>
<div type="abstract" xml:lang="en">A slant removal algorithm is presented based on the use of the vertical projection profile of word images and the Wigner-Ville distribution. The slant correction does not affect the connectivity of the word and the resulting words are natural. The evaluation of our algorithm was equally made by subjective and objective means. The algorithm has been tested in English and Modern Greek samples of more than 500 writers, taken from the databases IAM-DB and GRUHD. The extracted results are natural, and almost always improved with respect to the original image, even in the case of variant-slanted writing. The performance of an existed character recognition system showed an increase of up to 9% for the same data, while the training time cost was significantly reduced. Due to its simplicity, this algorithm can be easily incorporated into any optical character recognition system. © 2001 Pattern Recognition Society. Published by Elsevier Science Ltd. All rights reserved.</div>
</front>
</TEI>
<affiliations>
<list>
<country>
<li>Grèce</li>
</country>
</list>
<tree>
<noCountry>
<name sortKey="Fakotakis, N" sort="Fakotakis, N" uniqKey="Fakotakis N" first="N." last="Fakotakis">N. Fakotakis</name>
<name sortKey="Kokkinakis, G" sort="Kokkinakis, G" uniqKey="Kokkinakis G" first="G." last="Kokkinakis">G. Kokkinakis</name>
</noCountry>
<country name="Grèce">
<noRegion>
<name sortKey="Kavallieratou, E" sort="Kavallieratou, E" uniqKey="Kavallieratou E" first="E." last="Kavallieratou">E. Kavallieratou</name>
</noRegion>
</country>
</tree>
</affiliations>
</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 001C83 | SxmlIndent | more

Ou

HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001C83 | 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é=     Pascal:02-0029539
   |texte=   Slant estimation algorithm for OCR systems
}}

Wicri

This area was generated with Dilib version V0.6.32.
Data generation: Sat Nov 11 16:53:45 2017. Site generation: Mon Mar 11 23:15:16 2024