Paper
11 August 1995 Using the Voronoi tessellation for grouping words and multipart symbols in documents
Mark J. Burge, Gladys Monagan
Author Affiliations +
Abstract
We examine the importance of the definition of neighbors and neighborhoods for grouping in document understanding and list some previous definitions. We present a number of benefits to using the Voronoi neighborhood definition; however, we argue that definitions based upon the point Voronoi diagrams are insufficient in the general case (e.g. for grouping image elements in line drawings). We give the definition of a generalized (Euclidean distance measure, 2D Cartesian space, and an area based generator set) Voronoi tessellation and then present our algorithm for approximating this generalized tessellation. The algorithm is constructed from a normal point Voronoi tessellation algorithm. A parameterized Voronoi neighborhood graph (VNG) which can be derived from the tessellation is defined. A graph algorithm for grouping based on the VNG, its image elements, and Voronoi cell descriptors can then be easily derived. We show some results of how this algorithm was used in a map understanding system.
© (1995) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Mark J. Burge and Gladys Monagan "Using the Voronoi tessellation for grouping words and multipart symbols in documents", Proc. SPIE 2573, Vision Geometry IV, (11 August 1995); https://doi.org/10.1117/12.216407
Lens.org Logo
CITATIONS
Cited by 20 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Chemical elements

Distance measurement

Image segmentation

Image processing

Image processing algorithms and systems

Algorithm development

Computer vision technology

Back to Top