A Robust Text Segmentation Approach in Complex Background Based on Multiple Constraints
Identifieur interne : 001386 ( Main/Merge ); précédent : 001385; suivant : 001387A Robust Text Segmentation Approach in Complex Background Based on Multiple Constraints
Auteurs : Libo Fu [République populaire de Chine] ; Weiqiang Wang [République populaire de Chine] ; Yaowen Zhan [République populaire de Chine]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.
Abstract
Abstract: In this paper we propose a robust text segmentation method in complex background. The proposed method first utilizes the K-means algorithm to decompose a detected text block into different binary image layers. Then an effective post-processing is followed to eliminate background residues in each layer. In this step we develop a group of robust constraints to characterize general text regions based on color, edge and stroke thickness. We also propose the components relation constraint (CRC) designed specifically for Chinese characters. Finally the text image layer is identified based on the periodical and symmetrical layout of text lines. The experimental results show that our method can effectively eliminate a wide range of background residues, and has a better performance than the K-means method, as well as a high speed.
Url:
DOI: 10.1007/11581772_52
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 000529
- to stream Istex, to step Curation: 000522
- to stream Istex, to step Checkpoint: 000C59
Links to Exploration step
ISTEX:B881485CF62D0BD9DE10D066F5CB5CE9BA45B483Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">A Robust Text Segmentation Approach in Complex Background Based on Multiple Constraints</title>
<author><name sortKey="Fu, Libo" sort="Fu, Libo" uniqKey="Fu L" first="Libo" last="Fu">Libo Fu</name>
</author>
<author><name sortKey="Wang, Weiqiang" sort="Wang, Weiqiang" uniqKey="Wang W" first="Weiqiang" last="Wang">Weiqiang Wang</name>
</author>
<author><name sortKey="Zhan, Yaowen" sort="Zhan, Yaowen" uniqKey="Zhan Y" first="Yaowen" last="Zhan">Yaowen Zhan</name>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:B881485CF62D0BD9DE10D066F5CB5CE9BA45B483</idno>
<date when="2005" year="2005">2005</date>
<idno type="doi">10.1007/11581772_52</idno>
<idno type="url">https://api.istex.fr/document/B881485CF62D0BD9DE10D066F5CB5CE9BA45B483/fulltext/pdf</idno>
<idno type="wicri:Area/Istex/Corpus">000529</idno>
<idno type="wicri:Area/Istex/Curation">000522</idno>
<idno type="wicri:Area/Istex/Checkpoint">000C59</idno>
<idno type="wicri:doubleKey">0302-9743:2005:Fu L:a:robust:text</idno>
<idno type="wicri:Area/Main/Merge">001386</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">A Robust Text Segmentation Approach in Complex Background Based on Multiple Constraints</title>
<author><name sortKey="Fu, Libo" sort="Fu, Libo" uniqKey="Fu L" first="Libo" last="Fu">Libo Fu</name>
<affiliation wicri:level="3"><country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Institute of Computing Technology, Chinese Academy of Sciences, 100080, Beijing</wicri:regionArea>
<placeName><settlement type="city">Pékin</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="3"><country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Graduate School of Chinese Academy of Sciences, 100039, Beijing</wicri:regionArea>
<placeName><settlement type="city">Pékin</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">République populaire de Chine</country>
</affiliation>
</author>
<author><name sortKey="Wang, Weiqiang" sort="Wang, Weiqiang" uniqKey="Wang W" first="Weiqiang" last="Wang">Weiqiang Wang</name>
<affiliation wicri:level="3"><country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Institute of Computing Technology, Chinese Academy of Sciences, 100080, Beijing</wicri:regionArea>
<placeName><settlement type="city">Pékin</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="3"><country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Graduate School of Chinese Academy of Sciences, 100039, Beijing</wicri:regionArea>
<placeName><settlement type="city">Pékin</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">République populaire de Chine</country>
</affiliation>
</author>
<author><name sortKey="Zhan, Yaowen" sort="Zhan, Yaowen" uniqKey="Zhan Y" first="Yaowen" last="Zhan">Yaowen Zhan</name>
<affiliation wicri:level="3"><country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Institute of Computing Technology, Chinese Academy of Sciences, 100080, Beijing</wicri:regionArea>
<placeName><settlement type="city">Pékin</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="3"><country xml:lang="fr">République populaire de Chine</country>
<wicri:regionArea>Graduate School of Chinese Academy of Sciences, 100039, Beijing</wicri:regionArea>
<placeName><settlement type="city">Pékin</settlement>
</placeName>
</affiliation>
<affiliation wicri:level="1"><country wicri:rule="url">République populaire de Chine</country>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s">Lecture Notes in Computer Science</title>
<imprint><date>2005</date>
</imprint>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
<idno type="istex">B881485CF62D0BD9DE10D066F5CB5CE9BA45B483</idno>
<idno type="DOI">10.1007/11581772_52</idno>
<idno type="ChapterID">52</idno>
<idno type="ChapterID">Chap52</idno>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
<langUsage><language ident="en">en</language>
</langUsage>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: In this paper we propose a robust text segmentation method in complex background. The proposed method first utilizes the K-means algorithm to decompose a detected text block into different binary image layers. Then an effective post-processing is followed to eliminate background residues in each layer. In this step we develop a group of robust constraints to characterize general text regions based on color, edge and stroke thickness. We also propose the components relation constraint (CRC) designed specifically for Chinese characters. Finally the text image layer is identified based on the periodical and symmetrical layout of text lines. The experimental results show that our method can effectively eliminate a wide range of background residues, and has a better performance than the K-means method, as well as a high speed.</div>
</front>
</TEI>
</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 001386 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 001386 | 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é= ISTEX:B881485CF62D0BD9DE10D066F5CB5CE9BA45B483 |texte= A Robust Text Segmentation Approach in Complex Background Based on Multiple Constraints }}
This area was generated with Dilib version V0.6.32. |