DocumentCode
3020318
Title
Constructing area Voronoi diagram in document images
Author
Lu, Yue ; Tan, Chew Lim
Author_Institution
Dept. of Comput. Sci. & Technol., East China Normal Univ., Shanghai, China
fYear
2005
fDate
29 Aug.-1 Sept. 2005
Firstpage
342
Abstract
Voronoi diagram of image elements provides an intuitive and appealing definition of proximity, which has been suggested as an effective tool for the description of relations among the neighboring objects in a digital image. In this paper, a fast implementation algorithm is proposed for generating area Voronoi diagram of connected components in document images. A closed convex polygon is utilized to bound each connected component, and the contour is represented using Freeman chain coding, from which we can compute the corresponding Freeman chain coding of its expanded contour directly, without recourse to the operation on pixels. While the contours iteratively expand outwards, the Voronoi diagram is constructed by the intersections of the expanded contours from different connected components. The experimental results show that our proposed approach significantly improves the speed of constructing area Voronoi diagram.
Keywords
computational geometry; document image processing; image coding; image resolution; Freeman chain coding; area Voronoi diagram; closed convex polygon; digital image; document images; expanded contours; Computer science; Digital images; Image analysis; Image segmentation; Iterative algorithms; Nearest neighbor searches; Shape; Text analysis;
fLanguage
English
Publisher
ieee
Conference_Titel
Document Analysis and Recognition, 2005. Proceedings. Eighth International Conference on
ISSN
1520-5263
Print_ISBN
0-7695-2420-6
Type
conf
DOI
10.1109/ICDAR.2005.80
Filename
1575566
Link To Document