A new approach for text segmentation using a stroke filter
Identifieur interne : 000284 ( PascalFrancis/Corpus ); précédent : 000283; suivant : 000285A new approach for text segmentation using a stroke filter
Auteurs : Cheolkon Jung ; QIFENG LIU ; Joongkyu KimSource :
- Signal processing [ 0165-1684 ] ; 2008.
Descripteurs français
- Pascal (Inist)
English descriptors
- KwdEn :
Abstract
We propose a new method for achieving robust text segmentation in images by using a stroke filter. It is known that to segment text accurately and robustly from a complex background is a very difficult task. Most of the existing methods are sensitive to text color, size, font, and background clutter, because they use simple segmentation methods or require prior knowledge about text shape. In this paper, we attempt to consider the intrinsic characteristics of the text by using the stroke filter and design a new and robust algorithm for text segmentation. First, we describe the stroke filter briefly based on local region analysis. Second, the determination of text color polarity and local region growing procedures are performed successively based on the response of the stroke filter. Finally, the feedback procedure by the recognition score from an optical character recognition (OCR) module is used to improve the performance of text segmentation. By means of experiments on a large database, we demonstrate that the performance of our method is quite impressive from the viewpoints of the accuracy and robustness.
Notice en format standard (ISO 2709)
Pour connaître la documentation sur le format Inist Standard.
pA |
|
---|
Format Inist (serveur)
NO : | PASCAL 08-0219729 INIST |
---|---|
ET : | A new approach for text segmentation using a stroke filter |
AU : | JUNG (Cheolkon); QIFENG LIU; KIM (Joongkyu) |
AF : | School of Information and Communication Engineering, Sungkyunkwan University, 300 Cheoncheon-dong/Suwon, Kyunggido 440-746/Corée, République de (1 aut., 3 aut.); Samsung Advanced Institute of Technology/Yongin, Kyunggido 446-712/Corée, République de (2 aut.) |
DT : | Publication en série; Niveau analytique |
SO : | Signal processing; ISSN 0165-1684; Coden SPRODR; Pays-Bas; Da. 2008; Vol. 88; No. 7; Pp. 1907-1916; Bibl. 22 ref. |
LA : | Anglais |
EA : | We propose a new method for achieving robust text segmentation in images by using a stroke filter. It is known that to segment text accurately and robustly from a complex background is a very difficult task. Most of the existing methods are sensitive to text color, size, font, and background clutter, because they use simple segmentation methods or require prior knowledge about text shape. In this paper, we attempt to consider the intrinsic characteristics of the text by using the stroke filter and design a new and robust algorithm for text segmentation. First, we describe the stroke filter briefly based on local region analysis. Second, the determination of text color polarity and local region growing procedures are performed successively based on the response of the stroke filter. Finally, the feedback procedure by the recognition score from an optical character recognition (OCR) module is used to improve the performance of text segmentation. By means of experiments on a large database, we demonstrate that the performance of our method is quite impressive from the viewpoints of the accuracy and robustness. |
CC : | 001D04A05A; 001D04A03 |
FD : | Segmentation; Fouillis écho; Algorithme; Reconnaissance optique caractère; Evaluation performance; Base de données; Précision; Robustesse; Extraction information; Reconnaissance forme; Traitement information; Arrière plan |
ED : | Segmentation; Clutter; Algorithm; Optical character recognition; Performance evaluation; Database; Accuracy; Robustness; Information extraction; Pattern recognition; Information processing; Background |
SD : | Segmentación; Confusión eco; Algoritmo; Reconocimento óptico de caracteres; Evaluación prestación; Base dato; Precisión; Robustez; Extracción información; Reconocimiento patrón; Procesamiento información |
LO : | INIST-18015.354000172656620230 |
ID : | 08-0219729 |
Links to Exploration step
Pascal:08-0219729Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en" level="a">A new approach for text segmentation using a stroke filter</title>
<author><name sortKey="Jung, Cheolkon" sort="Jung, Cheolkon" uniqKey="Jung C" first="Cheolkon" last="Jung">Cheolkon Jung</name>
<affiliation><inist:fA14 i1="01"><s1>School of Information and Communication Engineering, Sungkyunkwan University, 300 Cheoncheon-dong</s1>
<s2>Suwon, Kyunggido 440-746</s2>
<s3>KOR</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Qifeng Liu" sort="Qifeng Liu" uniqKey="Qifeng Liu" last="Qifeng Liu">QIFENG LIU</name>
<affiliation><inist:fA14 i1="02"><s1>Samsung Advanced Institute of Technology</s1>
<s2>Yongin, Kyunggido 446-712</s2>
<s3>KOR</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kim, Joongkyu" sort="Kim, Joongkyu" uniqKey="Kim J" first="Joongkyu" last="Kim">Joongkyu Kim</name>
<affiliation><inist:fA14 i1="01"><s1>School of Information and Communication Engineering, Sungkyunkwan University, 300 Cheoncheon-dong</s1>
<s2>Suwon, Kyunggido 440-746</s2>
<s3>KOR</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">INIST</idno>
<idno type="inist">08-0219729</idno>
<date when="2008">2008</date>
<idno type="stanalyst">PASCAL 08-0219729 INIST</idno>
<idno type="RBID">Pascal:08-0219729</idno>
<idno type="wicri:Area/PascalFrancis/Corpus">000284</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en" level="a">A new approach for text segmentation using a stroke filter</title>
<author><name sortKey="Jung, Cheolkon" sort="Jung, Cheolkon" uniqKey="Jung C" first="Cheolkon" last="Jung">Cheolkon Jung</name>
<affiliation><inist:fA14 i1="01"><s1>School of Information and Communication Engineering, Sungkyunkwan University, 300 Cheoncheon-dong</s1>
<s2>Suwon, Kyunggido 440-746</s2>
<s3>KOR</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Qifeng Liu" sort="Qifeng Liu" uniqKey="Qifeng Liu" last="Qifeng Liu">QIFENG LIU</name>
<affiliation><inist:fA14 i1="02"><s1>Samsung Advanced Institute of Technology</s1>
<s2>Yongin, Kyunggido 446-712</s2>
<s3>KOR</s3>
<sZ>2 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
<author><name sortKey="Kim, Joongkyu" sort="Kim, Joongkyu" uniqKey="Kim J" first="Joongkyu" last="Kim">Joongkyu Kim</name>
<affiliation><inist:fA14 i1="01"><s1>School of Information and Communication Engineering, Sungkyunkwan University, 300 Cheoncheon-dong</s1>
<s2>Suwon, Kyunggido 440-746</s2>
<s3>KOR</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</inist:fA14>
</affiliation>
</author>
</analytic>
<series><title level="j" type="main">Signal processing</title>
<title level="j" type="abbreviated">Signal process.</title>
<idno type="ISSN">0165-1684</idno>
<imprint><date when="2008">2008</date>
</imprint>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><title level="j" type="main">Signal processing</title>
<title level="j" type="abbreviated">Signal process.</title>
<idno type="ISSN">0165-1684</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>Accuracy</term>
<term>Algorithm</term>
<term>Background</term>
<term>Clutter</term>
<term>Database</term>
<term>Information extraction</term>
<term>Information processing</term>
<term>Optical character recognition</term>
<term>Pattern recognition</term>
<term>Performance evaluation</term>
<term>Robustness</term>
<term>Segmentation</term>
</keywords>
<keywords scheme="Pascal" xml:lang="fr"><term>Segmentation</term>
<term>Fouillis écho</term>
<term>Algorithme</term>
<term>Reconnaissance optique caractère</term>
<term>Evaluation performance</term>
<term>Base de données</term>
<term>Précision</term>
<term>Robustesse</term>
<term>Extraction information</term>
<term>Reconnaissance forme</term>
<term>Traitement information</term>
<term>Arrière plan</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">We propose a new method for achieving robust text segmentation in images by using a stroke filter. It is known that to segment text accurately and robustly from a complex background is a very difficult task. Most of the existing methods are sensitive to text color, size, font, and background clutter, because they use simple segmentation methods or require prior knowledge about text shape. In this paper, we attempt to consider the intrinsic characteristics of the text by using the stroke filter and design a new and robust algorithm for text segmentation. First, we describe the stroke filter briefly based on local region analysis. Second, the determination of text color polarity and local region growing procedures are performed successively based on the response of the stroke filter. Finally, the feedback procedure by the recognition score from an optical character recognition (OCR) module is used to improve the performance of text segmentation. By means of experiments on a large database, we demonstrate that the performance of our method is quite impressive from the viewpoints of the accuracy and robustness.</div>
</front>
</TEI>
<inist><standard h6="B"><pA><fA01 i1="01" i2="1"><s0>0165-1684</s0>
</fA01>
<fA02 i1="01"><s0>SPRODR</s0>
</fA02>
<fA03 i2="1"><s0>Signal process.</s0>
</fA03>
<fA05><s2>88</s2>
</fA05>
<fA06><s2>7</s2>
</fA06>
<fA08 i1="01" i2="1" l="ENG"><s1>A new approach for text segmentation using a stroke filter</s1>
</fA08>
<fA11 i1="01" i2="1"><s1>JUNG (Cheolkon)</s1>
</fA11>
<fA11 i1="02" i2="1"><s1>QIFENG LIU</s1>
</fA11>
<fA11 i1="03" i2="1"><s1>KIM (Joongkyu)</s1>
</fA11>
<fA14 i1="01"><s1>School of Information and Communication Engineering, Sungkyunkwan University, 300 Cheoncheon-dong</s1>
<s2>Suwon, Kyunggido 440-746</s2>
<s3>KOR</s3>
<sZ>1 aut.</sZ>
<sZ>3 aut.</sZ>
</fA14>
<fA14 i1="02"><s1>Samsung Advanced Institute of Technology</s1>
<s2>Yongin, Kyunggido 446-712</s2>
<s3>KOR</s3>
<sZ>2 aut.</sZ>
</fA14>
<fA20><s1>1907-1916</s1>
</fA20>
<fA21><s1>2008</s1>
</fA21>
<fA23 i1="01"><s0>ENG</s0>
</fA23>
<fA43 i1="01"><s1>INIST</s1>
<s2>18015</s2>
<s5>354000172656620230</s5>
</fA43>
<fA44><s0>0000</s0>
<s1>© 2008 INIST-CNRS. All rights reserved.</s1>
</fA44>
<fA45><s0>22 ref.</s0>
</fA45>
<fA47 i1="01" i2="1"><s0>08-0219729</s0>
</fA47>
<fA60><s1>P</s1>
</fA60>
<fA61><s0>A</s0>
</fA61>
<fA64 i1="01" i2="1"><s0>Signal processing</s0>
</fA64>
<fA66 i1="01"><s0>NLD</s0>
</fA66>
<fC01 i1="01" l="ENG"><s0>We propose a new method for achieving robust text segmentation in images by using a stroke filter. It is known that to segment text accurately and robustly from a complex background is a very difficult task. Most of the existing methods are sensitive to text color, size, font, and background clutter, because they use simple segmentation methods or require prior knowledge about text shape. In this paper, we attempt to consider the intrinsic characteristics of the text by using the stroke filter and design a new and robust algorithm for text segmentation. First, we describe the stroke filter briefly based on local region analysis. Second, the determination of text color polarity and local region growing procedures are performed successively based on the response of the stroke filter. Finally, the feedback procedure by the recognition score from an optical character recognition (OCR) module is used to improve the performance of text segmentation. By means of experiments on a large database, we demonstrate that the performance of our method is quite impressive from the viewpoints of the accuracy and robustness.</s0>
</fC01>
<fC02 i1="01" i2="X"><s0>001D04A05A</s0>
</fC02>
<fC02 i1="02" i2="X"><s0>001D04A03</s0>
</fC02>
<fC03 i1="01" i2="X" l="FRE"><s0>Segmentation</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="ENG"><s0>Segmentation</s0>
<s5>01</s5>
</fC03>
<fC03 i1="01" i2="X" l="SPA"><s0>Segmentación</s0>
<s5>01</s5>
</fC03>
<fC03 i1="02" i2="X" l="FRE"><s0>Fouillis écho</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="ENG"><s0>Clutter</s0>
<s5>02</s5>
</fC03>
<fC03 i1="02" i2="X" l="SPA"><s0>Confusión eco</s0>
<s5>02</s5>
</fC03>
<fC03 i1="03" i2="X" l="FRE"><s0>Algorithme</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="ENG"><s0>Algorithm</s0>
<s5>03</s5>
</fC03>
<fC03 i1="03" i2="X" l="SPA"><s0>Algoritmo</s0>
<s5>03</s5>
</fC03>
<fC03 i1="04" i2="X" l="FRE"><s0>Reconnaissance optique caractère</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="ENG"><s0>Optical character recognition</s0>
<s5>04</s5>
</fC03>
<fC03 i1="04" i2="X" l="SPA"><s0>Reconocimento óptico de caracteres</s0>
<s5>04</s5>
</fC03>
<fC03 i1="05" i2="X" l="FRE"><s0>Evaluation performance</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="ENG"><s0>Performance evaluation</s0>
<s5>05</s5>
</fC03>
<fC03 i1="05" i2="X" l="SPA"><s0>Evaluación prestación</s0>
<s5>05</s5>
</fC03>
<fC03 i1="06" i2="X" l="FRE"><s0>Base de données</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="ENG"><s0>Database</s0>
<s5>06</s5>
</fC03>
<fC03 i1="06" i2="X" l="SPA"><s0>Base dato</s0>
<s5>06</s5>
</fC03>
<fC03 i1="07" i2="X" l="FRE"><s0>Précision</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="ENG"><s0>Accuracy</s0>
<s5>07</s5>
</fC03>
<fC03 i1="07" i2="X" l="SPA"><s0>Precisión</s0>
<s5>07</s5>
</fC03>
<fC03 i1="08" i2="X" l="FRE"><s0>Robustesse</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="ENG"><s0>Robustness</s0>
<s5>08</s5>
</fC03>
<fC03 i1="08" i2="X" l="SPA"><s0>Robustez</s0>
<s5>08</s5>
</fC03>
<fC03 i1="09" i2="X" l="FRE"><s0>Extraction information</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="ENG"><s0>Information extraction</s0>
<s5>09</s5>
</fC03>
<fC03 i1="09" i2="X" l="SPA"><s0>Extracción información</s0>
<s5>09</s5>
</fC03>
<fC03 i1="10" i2="X" l="FRE"><s0>Reconnaissance forme</s0>
<s5>31</s5>
</fC03>
<fC03 i1="10" i2="X" l="ENG"><s0>Pattern recognition</s0>
<s5>31</s5>
</fC03>
<fC03 i1="10" i2="X" l="SPA"><s0>Reconocimiento patrón</s0>
<s5>31</s5>
</fC03>
<fC03 i1="11" i2="X" l="FRE"><s0>Traitement information</s0>
<s5>32</s5>
</fC03>
<fC03 i1="11" i2="X" l="ENG"><s0>Information processing</s0>
<s5>32</s5>
</fC03>
<fC03 i1="11" i2="X" l="SPA"><s0>Procesamiento información</s0>
<s5>32</s5>
</fC03>
<fC03 i1="12" i2="X" l="FRE"><s0>Arrière plan</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fC03 i1="12" i2="X" l="ENG"><s0>Background</s0>
<s4>CD</s4>
<s5>96</s5>
</fC03>
<fN21><s1>140</s1>
</fN21>
<fN44 i1="01"><s1>OTO</s1>
</fN44>
<fN82><s1>OTO</s1>
</fN82>
</pA>
</standard>
<server><NO>PASCAL 08-0219729 INIST</NO>
<ET>A new approach for text segmentation using a stroke filter</ET>
<AU>JUNG (Cheolkon); QIFENG LIU; KIM (Joongkyu)</AU>
<AF>School of Information and Communication Engineering, Sungkyunkwan University, 300 Cheoncheon-dong/Suwon, Kyunggido 440-746/Corée, République de (1 aut., 3 aut.); Samsung Advanced Institute of Technology/Yongin, Kyunggido 446-712/Corée, République de (2 aut.)</AF>
<DT>Publication en série; Niveau analytique</DT>
<SO>Signal processing; ISSN 0165-1684; Coden SPRODR; Pays-Bas; Da. 2008; Vol. 88; No. 7; Pp. 1907-1916; Bibl. 22 ref.</SO>
<LA>Anglais</LA>
<EA>We propose a new method for achieving robust text segmentation in images by using a stroke filter. It is known that to segment text accurately and robustly from a complex background is a very difficult task. Most of the existing methods are sensitive to text color, size, font, and background clutter, because they use simple segmentation methods or require prior knowledge about text shape. In this paper, we attempt to consider the intrinsic characteristics of the text by using the stroke filter and design a new and robust algorithm for text segmentation. First, we describe the stroke filter briefly based on local region analysis. Second, the determination of text color polarity and local region growing procedures are performed successively based on the response of the stroke filter. Finally, the feedback procedure by the recognition score from an optical character recognition (OCR) module is used to improve the performance of text segmentation. By means of experiments on a large database, we demonstrate that the performance of our method is quite impressive from the viewpoints of the accuracy and robustness.</EA>
<CC>001D04A05A; 001D04A03</CC>
<FD>Segmentation; Fouillis écho; Algorithme; Reconnaissance optique caractère; Evaluation performance; Base de données; Précision; Robustesse; Extraction information; Reconnaissance forme; Traitement information; Arrière plan</FD>
<ED>Segmentation; Clutter; Algorithm; Optical character recognition; Performance evaluation; Database; Accuracy; Robustness; Information extraction; Pattern recognition; Information processing; Background</ED>
<SD>Segmentación; Confusión eco; Algoritmo; Reconocimento óptico de caracteres; Evaluación prestación; Base dato; Precisión; Robustez; Extracción información; Reconocimiento patrón; Procesamiento información</SD>
<LO>INIST-18015.354000172656620230</LO>
<ID>08-0219729</ID>
</server>
</inist>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/PascalFrancis/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000284 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/PascalFrancis/Corpus/biblio.hfd -nk 000284 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Ticri/CIDE |area= OcrV1 |flux= PascalFrancis |étape= Corpus |type= RBID |clé= Pascal:08-0219729 |texte= A new approach for text segmentation using a stroke filter }}
This area was generated with Dilib version V0.6.32. |