OcrV1, PascalFrancis, Checkpoint, bibRecord, 000191

Morphological preprocessing method to thresholding degraded word images

Identifieur interne : 000191 ( PascalFrancis/Checkpoint ); précédent : 000190; suivant : 000192

Morphological preprocessing method to thresholding degraded word images

Auteurs : Shigueo Nomura [Japon] ; Keiji Yamanaka [Brésil] ; Takayuki Shiose [Japon] ; Hiroshi Kawakami [Japon] ; Osamu Katai [Japon]

Source :

Pattern recognition letters [ 0167-8655 ] ; 2009.

RBID : Pascal:09-0265418

Descripteurs français

Pascal (Inist)
- Détection seuil, Morphologie mathématique, Ombre, Bruit fond, Image binaire, Segmentation, Localisation, Méthode adaptative, Image niveau gris, Filtre morphologique, Reconnaissance optique caractère, Complexité calcul, Appareillage essai, Imageur, Analyse qualitative, Evaluation performance, Reconnaissance forme.
Wicri :
- topic : Analyse qualitative.

English descriptors

KwdEn :
- Adaptive method, Background noise, Binary image, Computational complexity, Grey level image, Imager, Localization, Mathematical morphology, Morphological filter, Optical character recognition, Pattern recognition, Performance evaluation, Qualitative analysis, Segmentation, Shadow, Testing equipment, Threshold detection.

Abstract

This paper presents a novel preprocessing method based on mathematical morphology techniques to improve the subsequent thresholding quality of raw degraded word images. The raw degraded word images contain undesirable shapes called critical shadows on the background that cause noise in binary images. This noise constitutes obstacles to posterior segmentation of characters. Direct application of a thresholding method produces inadequate binary versions of these degraded word images. Our preprocessing method called Shadow Location and Lightening (SL^*L) adaptively, accurately and without manual fine-tuning of parameters locates these critical shadows on grayscale degraded images using morphological operations, and lightens them before applying eventual thresholding process. In this way, enhanced binary images without unpredictable and inappropriate noise can be provided to subsequent segmentation of characters. Then, adequate binary characters can be segmented and extracted as input data to optical character recognition (OCR) applications saving computational effort and increasing recognition rate. The proposed method is experimentally tested with a set of several raw degraded images extracted from real photos acquired by unsophisticated imaging systems. A qualitative analysis of experimental results led to conclusions that the thresholding result quality was significantly improved with the proposed preprocessing method. Also, a quantitative evaluation using a testing data of 1194 degraded word images showed the essentiality and effectiveness of the proposed preprocessing method to increase segmentation and recognition rates of their characters. Furthermore, an advantage of the proposed method is that Otsu's method as a simple and easily implementable global thresholding technique can be sufficient to reducing computational load.

Affiliations:

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

to stream PascalFrancis, to step Corpus: 000225
to stream PascalFrancis, to step Curation: 000555

Links to Exploration step

Pascal:09-0265418

Le document en format XML

<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">Morphological preprocessing method to thresholding degraded word images</title>
<author><name sortKey="Nomura, Shigueo" sort="Nomura, Shigueo" uniqKey="Nomura S" first="Shigueo" last="Nomura">Shigueo Nomura</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida Honmachi</s1>
<s2>Sakyo-ku, Kyoto 606-8501</s2>
<s3>JPN</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>Japon</country>
<wicri:noRegion>Sakyo-ku, Kyoto 606-8501</wicri:noRegion>
<orgName type="university">Université de Kyoto</orgName>
<placeName><settlement type="city">Kyoto</settlement>
<region type="prefecture">Région du Kansai</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Yamanaka, Keiji" sort="Yamanaka, Keiji" uniqKey="Yamanaka K" first="Keiji" last="Yamanaka">Keiji Yamanaka</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Faculty of Electrical Engineering, Federal University of Uberlândia</s1>
<s2>Uberlândia 38400-902</s2>
<s3>BRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Brésil</country>
<wicri:noRegion>Uberlândia 38400-902</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Shiose, Takayuki" sort="Shiose, Takayuki" uniqKey="Shiose T" first="Takayuki" last="Shiose">Takayuki Shiose</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida Honmachi</s1>
<s2>Sakyo-ku, Kyoto 606-8501</s2>
<s3>JPN</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>Japon</country>
<wicri:noRegion>Sakyo-ku, Kyoto 606-8501</wicri:noRegion>
<orgName type="university">Université de Kyoto</orgName>
<placeName><settlement type="city">Kyoto</settlement>
<region type="prefecture">Région du Kansai</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Kawakami, Hiroshi" sort="Kawakami, Hiroshi" uniqKey="Kawakami H" first="Hiroshi" last="Kawakami">Hiroshi Kawakami</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida Honmachi</s1>
<s2>Sakyo-ku, Kyoto 606-8501</s2>
<s3>JPN</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>Japon</country>
<wicri:noRegion>Sakyo-ku, Kyoto 606-8501</wicri:noRegion>
<orgName type="university">Université de Kyoto</orgName>
<placeName><settlement type="city">Kyoto</settlement>
<region type="prefecture">Région du Kansai</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Katai, Osamu" sort="Katai, Osamu" uniqKey="Katai O" first="Osamu" last="Katai">Osamu Katai</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida Honmachi</s1>
<s2>Sakyo-ku, Kyoto 606-8501</s2>
<s3>JPN</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>Japon</country>
<wicri:noRegion>Sakyo-ku, Kyoto 606-8501</wicri:noRegion>
<orgName type="university">Université de Kyoto</orgName>
<placeName><settlement type="city">Kyoto</settlement>
<region type="prefecture">Région du Kansai</region>
</placeName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">09-0265418</idno>
<date when="2009">2009</date>
<idno type="stanalyst">PASCAL 09-0265418 INIST</idno>
<idno type="RBID">Pascal:09-0265418</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000225</idno>
<idno type="wicri:Area/PascalFrancis/Curation">000555</idno>
<idno type="wicri:Area/PascalFrancis/Checkpoint">000191</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">Morphological preprocessing method to thresholding degraded word images</title>
<author><name sortKey="Nomura, Shigueo" sort="Nomura, Shigueo" uniqKey="Nomura S" first="Shigueo" last="Nomura">Shigueo Nomura</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida Honmachi</s1>
<s2>Sakyo-ku, Kyoto 606-8501</s2>
<s3>JPN</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>Japon</country>
<wicri:noRegion>Sakyo-ku, Kyoto 606-8501</wicri:noRegion>
<orgName type="university">Université de Kyoto</orgName>
<placeName><settlement type="city">Kyoto</settlement>
<region type="prefecture">Région du Kansai</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Yamanaka, Keiji" sort="Yamanaka, Keiji" uniqKey="Yamanaka K" first="Keiji" last="Yamanaka">Keiji Yamanaka</name>
<affiliation wicri:level="1"><inist:fA14 i1="02"><s1>Faculty of Electrical Engineering, Federal University of Uberlândia</s1>
<s2>Uberlândia 38400-902</s2>
<s3>BRA</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
<country>Brésil</country>
<wicri:noRegion>Uberlândia 38400-902</wicri:noRegion>
</affiliation>
</author>
<author><name sortKey="Shiose, Takayuki" sort="Shiose, Takayuki" uniqKey="Shiose T" first="Takayuki" last="Shiose">Takayuki Shiose</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida Honmachi</s1>
<s2>Sakyo-ku, Kyoto 606-8501</s2>
<s3>JPN</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>Japon</country>
<wicri:noRegion>Sakyo-ku, Kyoto 606-8501</wicri:noRegion>
<orgName type="university">Université de Kyoto</orgName>
<placeName><settlement type="city">Kyoto</settlement>
<region type="prefecture">Région du Kansai</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Kawakami, Hiroshi" sort="Kawakami, Hiroshi" uniqKey="Kawakami H" first="Hiroshi" last="Kawakami">Hiroshi Kawakami</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida Honmachi</s1>
<s2>Sakyo-ku, Kyoto 606-8501</s2>
<s3>JPN</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>Japon</country>
<wicri:noRegion>Sakyo-ku, Kyoto 606-8501</wicri:noRegion>
<orgName type="university">Université de Kyoto</orgName>
<placeName><settlement type="city">Kyoto</settlement>
<region type="prefecture">Région du Kansai</region>
</placeName>
</affiliation>
</author>
<author><name sortKey="Katai, Osamu" sort="Katai, Osamu" uniqKey="Katai O" first="Osamu" last="Katai">Osamu Katai</name>
<affiliation wicri:level="4"><inist:fA14 i1="01"><s1>Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida Honmachi</s1>
<s2>Sakyo-ku, Kyoto 606-8501</s2>
<s3>JPN</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</inist:fA14>
<country>Japon</country>
<wicri:noRegion>Sakyo-ku, Kyoto 606-8501</wicri:noRegion>
<orgName type="university">Université de Kyoto</orgName>
<placeName><settlement type="city">Kyoto</settlement>
<region type="prefecture">Région du Kansai</region>
</placeName>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Pattern recognition letters</title>
<title level="j" type="abbreviated">Pattern recogn. lett.</title>
<idno type="ISSN">0167-8655</idno>
<imprint><date when="2009">2009</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Pattern recognition letters</title>
<title level="j" type="abbreviated">Pattern recogn. lett.</title>
<idno type="ISSN">0167-8655</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Adaptive method</term>
<term>Background noise</term>
<term>Binary image</term>
<term>Computational complexity</term>
<term>Grey level image</term>
<term>Imager</term>
<term>Localization</term>
<term>Mathematical morphology</term>
<term>Morphological filter</term>
<term>Optical character recognition</term>
<term>Pattern recognition</term>
<term>Performance evaluation</term>
<term>Qualitative analysis</term>
<term>Segmentation</term>
<term>Shadow</term>
<term>Testing equipment</term>
<term>Threshold detection</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Détection seuil</term>
<term>Morphologie mathématique</term>
<term>Ombre</term>
<term>Bruit fond</term>
<term>Image binaire</term>
<term>Segmentation</term>
<term>Localisation</term>
<term>Méthode adaptative</term>
<term>Image niveau gris</term>
<term>Filtre morphologique</term>
<term>Reconnaissance optique caractère</term>
<term>Complexité calcul</term>
<term>Appareillage essai</term>
<term>Imageur</term>
<term>Analyse qualitative</term>
<term>Evaluation performance</term>
<term>Reconnaissance forme</term>
</keywords>
<keywords scheme="Wicri" type="topic" xml:lang="fr"><term>Analyse qualitative</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">This paper presents a novel preprocessing method based on mathematical morphology techniques to improve the subsequent thresholding quality of raw degraded word images. The raw degraded word images contain undesirable shapes called critical shadows on the background that cause noise in binary images. This noise constitutes obstacles to posterior segmentation of characters. Direct application of a thresholding method produces inadequate binary versions of these degraded word images. Our preprocessing method called Shadow Location and Lightening (SL<sup>*</sup>
L) adaptively, accurately and without manual fine-tuning of parameters locates these critical shadows on grayscale degraded images using morphological operations, and lightens them before applying eventual thresholding process. In this way, enhanced binary images without unpredictable and inappropriate noise can be provided to subsequent segmentation of characters. Then, adequate binary characters can be segmented and extracted as input data to optical character recognition (OCR) applications saving computational effort and increasing recognition rate. The proposed method is experimentally tested with a set of several raw degraded images extracted from real photos acquired by unsophisticated imaging systems. A qualitative analysis of experimental results led to conclusions that the thresholding result quality was significantly improved with the proposed preprocessing method. Also, a quantitative evaluation using a testing data of 1194 degraded word images showed the essentiality and effectiveness of the proposed preprocessing method to increase segmentation and recognition rates of their characters. Furthermore, an advantage of the proposed method is that Otsu's method as a simple and easily implementable global thresholding technique can be sufficient to reducing computational load.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0167-8655</s0>
</fA01>
<fA02 i1="01"><s0>PRLEDG</s0>
</fA02>
<fA03 i2="1"><s0>Pattern recogn. lett.</s0>
</fA03>
<fA05><s2>30</s2>
</fA05>
<fA06><s2>8</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>Morphological preprocessing method to thresholding degraded word images</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>NOMURA (Shigueo)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>YAMANAKA (Keiji)</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>SHIOSE (Takayuki)</s1>
</fA11>
<fA11 i1="04" i2="1"><s1>KAWAKAMI (Hiroshi)</s1>
</fA11>
<fA11 i1="05" i2="1"><s1>KATAI (Osamu)</s1>
</fA11>
<fA14 i1="01"><s1>Department of Systems Science, Graduate School of Informatics, Kyoto University, Yoshida Honmachi</s1>
<s2>Sakyo-ku, Kyoto 606-8501</s2>
<s3>JPN</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
<sZ>4 aut.</sZ>
<sZ>5 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Faculty of Electrical Engineering, Federal University of Uberlândia</s1>
<s2>Uberlândia 38400-902</s2>
<s3>BRA</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>729-744</s1>
</fA20>
<fA21><s1>2009</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>20222</s2>
<s5>354000187945120020</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2009 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>1/4 p.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>09-0265418</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Pattern recognition letters</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>This paper presents a novel preprocessing method based on mathematical morphology techniques to improve the subsequent thresholding quality of raw degraded word images. The raw degraded word images contain undesirable shapes called critical shadows on the background that cause noise in binary images. This noise constitutes obstacles to posterior segmentation of characters. Direct application of a thresholding method produces inadequate binary versions of these degraded word images. Our preprocessing method called Shadow Location and Lightening (SL<sup>*</sup>
L) adaptively, accurately and without manual fine-tuning of parameters locates these critical shadows on grayscale degraded images using morphological operations, and lightens them before applying eventual thresholding process. In this way, enhanced binary images without unpredictable and inappropriate noise can be provided to subsequent segmentation of characters. Then, adequate binary characters can be segmented and extracted as input data to optical character recognition (OCR) applications saving computational effort and increasing recognition rate. The proposed method is experimentally tested with a set of several raw degraded images extracted from real photos acquired by unsophisticated imaging systems. A qualitative analysis of experimental results led to conclusions that the thresholding result quality was significantly improved with the proposed preprocessing method. Also, a quantitative evaluation using a testing data of 1194 degraded word images showed the essentiality and effectiveness of the proposed preprocessing method to increase segmentation and recognition rates of their characters. Furthermore, an advantage of the proposed method is that Otsu's method as a simple and easily implementable global thresholding technique can be sufficient to reducing computational load.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D04A05A</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Détection seuil</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Threshold detection</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Detección umbral</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Morphologie mathématique</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Mathematical morphology</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Morfología matemática</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Ombre</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Shadow</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Sombra</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Bruit fond</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Background noise</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Ruido fondo</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Image binaire</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Binary image</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Imagen binaria</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Segmentation</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Segmentation</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Segmentación</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Localisation</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Localization</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Localización</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Méthode adaptative</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Adaptive method</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Método adaptativo</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Image niveau gris</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Grey level image</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Imagen nivel gris</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Filtre morphologique</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Morphological filter</s0>
<s5>10</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Filtro morfológico</s0>
<s5>10</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Reconnaissance optique caractère</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Optical character recognition</s0>
<s5>11</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Reconocimento óptico de caracteres</s0>
<s5>11</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Complexité calcul</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Computational complexity</s0>
<s5>12</s5>
</fC03>
<fC03 i1="12" i2="X" l="SPA"><s0>Complejidad computación</s0>
<s5>12</s5>
</fC03>
<fC03 i1="13" i2="X" l="FRE"><s0>Appareillage essai</s0>
<s5>13</s5>
</fC03>
<fC03 i1="13" i2="X" l="ENG"><s0>Testing equipment</s0>
<s5>13</s5>
</fC03>
<fC03 i1="13" i2="X" l="SPA"><s0>Aparato ensayo</s0>
<s5>13</s5>
</fC03>
<fC03 i1="14" i2="X" l="FRE"><s0>Imageur</s0>
<s5>14</s5>
</fC03>
<fC03 i1="14" i2="X" l="ENG"><s0>Imager</s0>
<s5>14</s5>
</fC03>
<fC03 i1="14" i2="X" l="SPA"><s0>Imager</s0>
<s5>14</s5>
</fC03>
<fC03 i1="15" i2="X" l="FRE"><s0>Analyse qualitative</s0>
<s5>15</s5>
</fC03>
<fC03 i1="15" i2="X" l="ENG"><s0>Qualitative analysis</s0>
<s5>15</s5>
</fC03>
<fC03 i1="15" i2="X" l="SPA"><s0>Análisis cualitativo</s0>
<s5>15</s5>
</fC03>
<fC03 i1="16" i2="X" l="FRE"><s0>Evaluation performance</s0>
<s5>16</s5>
</fC03>
<fC03 i1="16" i2="X" l="ENG"><s0>Performance evaluation</s0>
<s5>16</s5>
</fC03>
<fC03 i1="16" i2="X" l="SPA"><s0>Evaluación prestación</s0>
<s5>16</s5>
</fC03>
<fC03 i1="17" i2="X" l="FRE"><s0>Reconnaissance forme</s0>
<s5>31</s5>
</fC03>
<fC03 i1="17" i2="X" l="ENG"><s0>Pattern recognition</s0>
<s5>31</s5>
</fC03>
<fC03 i1="17" i2="X" l="SPA"><s0>Reconocimiento patrón</s0>
<s5>31</s5>
</fC03>
<fN21><s1>195</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
</inist>
<affiliations><list><country><li>Brésil</li>
<li>Japon</li>
</country>
<region><li>Région du Kansai</li>
</region>
<settlement><li>Kyoto</li>
</settlement>
<orgName><li>Université de Kyoto</li>
</orgName>
</list>
<tree><country name="Japon"><region name="Région du Kansai"><name sortKey="Nomura, Shigueo" sort="Nomura, Shigueo" uniqKey="Nomura S" first="Shigueo" last="Nomura">Shigueo Nomura</name>
</region>
<name sortKey="Katai, Osamu" sort="Katai, Osamu" uniqKey="Katai O" first="Osamu" last="Katai">Osamu Katai</name>
<name sortKey="Kawakami, Hiroshi" sort="Kawakami, Hiroshi" uniqKey="Kawakami H" first="Hiroshi" last="Kawakami">Hiroshi Kawakami</name>
<name sortKey="Shiose, Takayuki" sort="Shiose, Takayuki" uniqKey="Shiose T" first="Takayuki" last="Shiose">Takayuki Shiose</name>
</country>
<country name="Brésil"><noRegion><name sortKey="Yamanaka, Keiji" sort="Yamanaka, Keiji" uniqKey="Yamanaka K" first="Keiji" last="Yamanaka">Keiji Yamanaka</name>
</noRegion>
</country>
</tree>
</affiliations>
</record>

Pour manipuler ce document sous Unix (Dilib)

EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/PascalFrancis/Checkpoint

HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000191 | SxmlIndent | more

HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Checkpoint/biblio.hfd -nk 000191 | SxmlIndent | more

Pour mettre un lien sur cette page dans le réseau Wicri

{{Explor lien
   |wiki=    Ticri/CIDE
   |area=    OcrV1
   |flux=    PascalFrancis
   |étape=   Checkpoint
   |type=    RBID
   |clé=     Pascal:09-0265418
   |texte=   Morphological preprocessing method to thresholding degraded word images
}}

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

	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.

Serveur d'exploration sur l'OCR

Morphological preprocessing method to thresholding degraded word images

Morphological preprocessing method to thresholding degraded word images

Source :

Descripteurs français

English descriptors

Abstract

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

Links to Exploration step

Le document en format XML

Pour manipuler ce document sous Unix (Dilib)

Pour mettre un lien sur cette page dans le réseau Wicri