Dynamic algorithm for constructing discrete Voronoi diagrams

Raul E. Sequeira; Francoise J. Preteux

doi:10.1117/12.235832

25 March 1996 Dynamic algorithm for constructing discrete Voronoi diagrams

Raul E. Sequeira, Francoise J. Preteux

Proceedings Volume 2662, Nonlinear Image Processing VII; (1996) https://doi.org/10.1117/12.235832
Event: Electronic Imaging: Science and Technology, 1996, San Jose, CA, United States

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.

Citation Download Citation

Raul E. Sequeira and Francoise J. Preteux "Dynamic algorithm for constructing discrete Voronoi diagrams", Proc. SPIE 2662, Nonlinear Image Processing VII, (25 March 1996); https://doi.org/10.1117/12.235832

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available