Edge-region segmentation process based on generalized Voronoi diagram representation

2 January 2003

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 323-326
https://doi.org/10.1109/icpr.1992.201990

Abstract

Cooperative methods provide comfortable solutions to segmentation problems. Different works have been engaged in this way in order to combine edge and region based methods. The authors propose a split and merge approach to decompose the image into homogeneous Voronoi polygons. The cooperative aspect comes from the fact that some contours of Voronoi polygons are supported by frontiers issued from an edge detector. From a geometrical point of view, the originality of this work is in the use of punctual Voronoi diagrams as an approximation of generalized Voronoi diagrams based on polygonal seed.

Keywords

This publication has 4 references indexed in Scilit:

Representing stereo data with the Delaunay triangulation
Artificial Intelligence, 1990
AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments
Discrete & Computational Geometry, 1987
Using Canny's criteria to derive a recursively implemented optimal edge detector
International Journal of Computer Vision, 1987
A fast Voronoi-diagram algorithm with quaternary tree bucketing
Information Processing Letters, 1984