Share Email Print

Proceedings Paper

Dynamic algorithm for constructing discrete Voronoi diagrams
Author(s): Raul E. Sequeira; Francoise J. Preteux
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

The problem of image segmentation is addressed via the Voronoi diagram (VD). The set of seeds, which determine the Voronoi regions, can be modified by adding and removing seeds. These modifications can be governed by user-specified constraints, but can also be driven by 'salt-and-pepper' noise. The VD, seen as a segmentation operator, is unstable to this kind of perturbation. A dynamic algorithm for the construction of discrete VD, exploiting the local dependence of the diagram on each seed, is presented. The updates in the diagram are made inside a convex set obtained by mapping seeds to linear inequalities; the updates in the neighbor relationships are done using a version of the incremental method.

Paper Details

Date Published: 25 March 1996
PDF: 9 pages
Proc. SPIE 2662, Nonlinear Image Processing VII, (25 March 1996); doi: 10.1117/12.235832
Show Author Affiliations
Raul E. Sequeira, Institut National des Telecommunications (France)
Francoise J. Preteux, Institut National des Telecommunications (France)

Published in SPIE Proceedings Vol. 2662:
Nonlinear Image Processing VII
Edward R. Dougherty; Jaakko T. Astola; Harold G. Longbotham, Editor(s)

© SPIE. Terms of Use
Back to Top
Sign in to read the full article
Create a free SPIE account to get access to
premium articles and original research
Forgot your username?