Please use this identifier to cite or link to this item:
|Title:||Constructing area Voronoi diagram in document images|
|Authors:||Lu, Y. |
|Citation:||Lu, Y.,Tan, C.L. (2005). Constructing area Voronoi diagram in document images. Proceedings of the International Conference on Document Analysis and Recognition, ICDAR 2005 : 342-346. ScholarBank@NUS Repository. https://doi.org/10.1109/ICDAR.2005.80|
|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. © 2005 IEEE.|
|Source Title:||Proceedings of the International Conference on Document Analysis and Recognition, ICDAR|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Nov 16, 2018
checked on Oct 20, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.