论文信息 - Optimization in Voronoi Diagrams

Optimization in Voronoi Diagrams

In this paper, we present an algorithm for optimal image segmentation using the Voronoi diagram and the Delaunay graph. The Voronoi diagram is a powerful tool for shape description and image segmentation. The Delaunay graph is used to describe the neighborhood of each Voronoi region. This graph is used to optimize the image segmentation. The validity of our approach is demonstrated by examples.

Stéphane Marchand-Maillet | Jean-Marc Chassery | Etienne Bertin

[1] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .

[2] R. Marcelpoil,et al. Methods for the study of cellular sociology: Voronoi diagrams and parametrization of the spatial relationships , 1992 .

[3] J. Chassery,et al. Segmentation and measurement based on 3D Voronoi diagram: application to confocal microscopy. , 1993, Computerized medical imaging and graphics : the official journal of the Computerized Medical Imaging Society.

[4] V. Ralph Algazi,et al. Continuous skeleton computation by Voronoi diagram , 1991, CVGIP Image Underst..

[5] L. Vincent. Graphs and mathematical morphology , 1989 .

[6] J. Chassery,et al. 2 - Diagramme de Voronoï appliqué à la segmentation d'images et à la détection d'évènements en imageris multi-sources (1) , 1991 .

[7] Adrian Bowyer,et al. Computing Dirichlet Tessellations , 1981, Comput. J..

[8] N. Metropolis,et al. Equation of State Calculations by Fast Computing Machines , 1953, Resonance.

[9] Narendra Ahuja,et al. Image representation using Voronoi tessellation , 1985, Comput. Vis. Graph. Image Process..

[10] Donald Geman,et al. Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images , 1984, IEEE Transactions on Pattern Analysis and Machine Intelligence.