A robust text segmentation approach in complex background based on multiple constraints

10Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

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 back-ground 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. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Fu, L., Wang, W., & Zhan, Y. (2005). A robust text segmentation approach in complex background based on multiple constraints. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3767 LNCS, pp. 594–605). https://doi.org/10.1007/11581772_52

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free