Segmentation of merged characters by neural networks and shortest path
Identifieur interne : 002E76 ( Main/Curation ); précédent : 002E75; suivant : 002E77Segmentation of merged characters by neural networks and shortest path
Auteurs : JIN WANG [États-Unis] ; J. JeanSource :
- Pattern recognition [ 0031-3203 ] ; 1994.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
A major problem with a neural network-based approach to printed character recognition is the segmentation of merged characters. A hybrid method is proposed which combines a neural network-based deferred segmentation scheme with conventional immediate segmentation techniques. In the deferred segmentation, a neural network is employed to distinguish single characters from composites. To find a proper vertical cut that separates a composite, a shortest-path algorithm seeking minimal-penalty curved cuts is used. Integrating those components with a multiresolution neural network OCR and an efficient spelling checker, the resulting system significantly improves its ability to read omnifont document text
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: Pour aller vers cette notice dans l'étape Curation :000A98
- to stream PascalFrancis, to step Curation: Pour aller vers cette notice dans l'étape Curation :000902
- to stream PascalFrancis, to step Checkpoint: Pour aller vers cette notice dans l'étape Curation :000A50
- to stream Main, to step Merge: Pour aller vers cette notice dans l'étape Curation :003044
Links to Exploration step
Pascal:94-0585775Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Segmentation of merged characters by neural networks and shortest path</title><author><name sortKey="Jin Wang" sort="Jin Wang" uniqKey="Jin Wang" last="Jin Wang">JIN WANG</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Wright State univ., dep. computer sci. eng.</s1><s2>Dayton OH 45435</s2><s3>USA</s3></inist:fA14><country>États-Unis</country><wicri:noRegion>Dayton OH 45435</wicri:noRegion></affiliation></author><author><name sortKey="Jean, J" sort="Jean, J" uniqKey="Jean J" first="J." last="Jean">J. Jean</name></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">94-0585775</idno><date when="1994">1994</date><idno type="stanalyst">PASCAL 94-0585775 INIST</idno><idno type="RBID">Pascal:94-0585775</idno><idno type="wicri:Area/PascalFrancis/Corpus">000A98</idno><idno type="wicri:Area/PascalFrancis/Curation">000902</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000A50</idno><idno type="wicri:doubleKey">0031-3203:1994:Jin Wang:segmentation:of:merged</idno><idno type="wicri:Area/Main/Merge">003044</idno><idno type="wicri:Area/Main/Curation">002E76</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Segmentation of merged characters by neural networks and shortest path</title><author><name sortKey="Jin Wang" sort="Jin Wang" uniqKey="Jin Wang" last="Jin Wang">JIN WANG</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Wright State univ., dep. computer sci. eng.</s1><s2>Dayton OH 45435</s2><s3>USA</s3></inist:fA14><country>États-Unis</country><wicri:noRegion>Dayton OH 45435</wicri:noRegion></affiliation></author><author><name sortKey="Jean, J" sort="Jean, J" uniqKey="Jean J" first="J." last="Jean">J. Jean</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="1994">1994</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>Character recognition</term><term>Document processing</term><term>Neural network</term><term>Pattern recognition</term><term>Segmentation</term><term>Shortest path</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Chemin plus court</term><term>Segmentation</term><term>Réseau neuronal</term><term>Reconnaissance caractère</term><term>Reconnaissance forme</term><term>Traitement document</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">A major problem with a neural network-based approach to printed character recognition is the segmentation of merged characters. A hybrid method is proposed which combines a neural network-based deferred segmentation scheme with conventional immediate segmentation techniques. In the deferred segmentation, a neural network is employed to distinguish single characters from composites. To find a proper vertical cut that separates a composite, a shortest-path algorithm seeking minimal-penalty curved cuts is used. Integrating those components with a multiresolution neural network OCR and an efficient spelling checker, the resulting system significantly improves its ability to read omnifont document text</div></front></TEI></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Curation
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002E76 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Curation/biblio.hfd -nk 002E76 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Curation
|type= RBID
|clé= Pascal:94-0585775
|texte= Segmentation of merged characters by neural networks and shortest path
}}
| This area was generated with Dilib version V0.6.32. |  |