Iterative cross section sequence graph for handwritten character segmentation
Identifieur interne : 000F45 ( Main/Merge ); précédent : 000F44; suivant : 000F46Iterative cross section sequence graph for handwritten character segmentation
Auteurs : Amer Dawoud [Canada]Source :
- IEEE transactions on image processing [ 1057-7149 ] ; 2007.
Descripteurs français
- Pascal (Inist)
- Méthode itérative, Caractère manuscrit, Segmentation, Algorithme, Graphe conceptuel, Détection seuil, Perte information, Image binaire, Congestion trafic, Gestion trafic, Squelette, Extraction caractéristique, Evaluation performance, Reconnaissance optique caractère, Télétrafic, Traitement signal, Reconnaissance forme.
English descriptors
- KwdEn :
- Algorithm, Binary image, Conceptual graph, Feature extraction, Information loss, Iterative method, Manuscript character, Optical character recognition, Pattern recognition, Performance evaluation, Segmentation, Signal processing, Skeleton, Teletraffic, Threshold detection, Traffic congestion, Traffic management.
Abstract
-The iterative cross section sequence graph (ICSSG) is an algorithm for handwritten character segmentation. It expands the cross section sequence graph concept by applying it iteratively at equally spaced thresholds. The iterative thresholding reduces the effect of information loss associated with image binarization. ICSSG preserves the characters' skeletal structure by preventing the interference of pixels that causes flooding of adjacent characters' segments. Improving the structural quality of the characters' skeleton facilitates better feature extraction and classification, which improves the overall performance of optical character recognition (OCR). Experimental results showed significant improvements in OCR recognition rates compared to other well-established segmentation algorithms.
Links toward previous steps (curation, corpus...)
- to stream PascalFrancis, to step Corpus: 000341
- to stream PascalFrancis, to step Curation: 000445
- to stream PascalFrancis, to step Checkpoint: 000274
Links to Exploration step
Pascal:07-0361762Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Iterative cross section sequence graph for handwritten character segmentation</title><author><name sortKey="Dawoud, Amer" sort="Dawoud, Amer" uniqKey="Dawoud A" first="Amer" last="Dawoud">Amer Dawoud</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Rotoflex International, Inc</s1><s2>Mississauga, ON L5T 2R5</s2><s3>CAN</s3><sZ>1 aut.</sZ></inist:fA14><country>Canada</country><wicri:noRegion>Mississauga, ON L5T 2R5</wicri:noRegion></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">INIST</idno><idno type="inist">07-0361762</idno><date when="2007">2007</date><idno type="stanalyst">PASCAL 07-0361762 INIST</idno><idno type="RBID">Pascal:07-0361762</idno><idno type="wicri:Area/PascalFrancis/Corpus">000341</idno><idno type="wicri:Area/PascalFrancis/Curation">000445</idno><idno type="wicri:Area/PascalFrancis/Checkpoint">000274</idno><idno type="wicri:doubleKey">1057-7149:2007:Dawoud A:iterative:cross:section</idno><idno type="wicri:Area/Main/Merge">000F45</idno></publicationStmt><sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Iterative cross section sequence graph for handwritten character segmentation</title><author><name sortKey="Dawoud, Amer" sort="Dawoud, Amer" uniqKey="Dawoud A" first="Amer" last="Dawoud">Amer Dawoud</name><affiliation wicri:level="1"><inist:fA14 i1="01"><s1>Rotoflex International, Inc</s1><s2>Mississauga, ON L5T 2R5</s2><s3>CAN</s3><sZ>1 aut.</sZ></inist:fA14><country>Canada</country><wicri:noRegion>Mississauga, ON L5T 2R5</wicri:noRegion></affiliation></author></analytic><series><title level="j" type="main">IEEE transactions on image processing</title><title level="j" type="abbreviated">IEEE trans. image process.</title><idno type="ISSN">1057-7149</idno><imprint><date when="2007">2007</date></imprint></series></biblStruct></sourceDesc><seriesStmt><title level="j" type="main">IEEE transactions on image processing</title><title level="j" type="abbreviated">IEEE trans. image process.</title><idno type="ISSN">1057-7149</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Algorithm</term><term>Binary image</term><term>Conceptual graph</term><term>Feature extraction</term><term>Information loss</term><term>Iterative method</term><term>Manuscript character</term><term>Optical character recognition</term><term>Pattern recognition</term><term>Performance evaluation</term><term>Segmentation</term><term>Signal processing</term><term>Skeleton</term><term>Teletraffic</term><term>Threshold detection</term><term>Traffic congestion</term><term>Traffic management</term></keywords><keywords scheme="Pascal" xml:lang="fr"><term>Méthode itérative</term><term>Caractère manuscrit</term><term>Segmentation</term><term>Algorithme</term><term>Graphe conceptuel</term><term>Détection seuil</term><term>Perte information</term><term>Image binaire</term><term>Congestion trafic</term><term>Gestion trafic</term><term>Squelette</term><term>Extraction caractéristique</term><term>Evaluation performance</term><term>Reconnaissance optique caractère</term><term>Télétrafic</term><term>Traitement signal</term><term>Reconnaissance forme</term></keywords></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">-The iterative cross section sequence graph (ICSSG) is an algorithm for handwritten character segmentation. It expands the cross section sequence graph concept by applying it iteratively at equally spaced thresholds. The iterative thresholding reduces the effect of information loss associated with image binarization. ICSSG preserves the characters' skeletal structure by preventing the interference of pixels that causes flooding of adjacent characters' segments. Improving the structural quality of the characters' skeleton facilitates better feature extraction and classification, which improves the overall performance of optical character recognition (OCR). Experimental results showed significant improvements in OCR recognition rates compared to other well-established segmentation algorithms.</div></front></TEI><affiliations><list><country><li>Canada</li></country></list><tree><country name="Canada"><noRegion><name sortKey="Dawoud, Amer" sort="Dawoud, Amer" uniqKey="Dawoud A" first="Amer" last="Dawoud">Amer Dawoud</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 000F45 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 000F45 | 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:07-0361762
|texte= Iterative cross section sequence graph for handwritten character segmentation
}}
| This area was generated with Dilib version V0.6.32. |  |