By Topic

Run-Based Approach to Labeling Connected Components in Document Images

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Xiao Tu ; Dept. of Comput. Sci. & Technol., East China Normal Univ., Shanghai, China ; Yue Lu

A fast algorithm is proposed in this paper to label connected components in binary document images. Runs are extracted from the image row by row. The positional relations among the runs of current rows and the runs of their preceding rows are represented utilizing trees, where each tree corresponds to a connected component. Only one-pass scan is required for the proposed approach to obtain the characteristics of the connected components, such as bounding rectangle, area, number of pixels. It is thus a fast and effective algorithm. Experimental results have shown that the efficiency of the present algorithm is superior to that of the conventional algorithms in terms of computational speed.

Published in:

Education Technology and Computer Science (ETCS), 2010 Second International Workshop on  (Volume:2 )

Date of Conference:

6-7 March 2010