. Noyau-cellulaire, 64 32 Sections d'un chromosome obtenues avec un CLSM :::::::::: 65 33 Chromosome, :, p.66

. Image-d-'un-point-sur-un-polygone, 80 44 DVG 2D bas e sur les el ements :::::::::::::::::::::: 83 45, DVG 2D bas e sur les objets, p.84

. 51-bissectrice-entre-un-carr-e-et-un, 91 52 Suppression des ar^ etes inutiles :::::::::::::::::::::: 94 53 Illustration du th eor eme de convergence, 95 54 Convergence de l'algorithme du calcul du DVG3D, p.96

. Architecture-d-'un-r-eseau-de-hopaeeld, :114 62 D ecimation, p.118

. Autre, :121 65 Coop eration diagramme de Voronoí -pyramides : image ëfemme, p.122

N. Bibliographie-Ë1ë, B. Ahuja, B. An, and . Schachter, Image representation using Voronoi tessellation . Computer Vision Graphics and Image processing, pp.286-295, 1985.

E. Andres, Le plan discret, Proc. du colloque de g eom etrie discr ete en imagerie, pp.45-61, 1993.

C. Arcelli and G. Sanniti-di-baja, A Width-Independent Fast Thinning Algorithm, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.7, issue.4, pp.463-474, 1985.
DOI : 10.1109/TPAMI.1985.4767685

D. Attali and A. Montanvert, Semi-continuous skeletons of 2d and 3d shapes, Analysis and Recognition, p.page Soumis, 1994.

F. Aurenhammer, Voronoi diagrams---a survey of a fundamental geometric data structure, ACM Computing Surveys, vol.23, issue.3, pp.345-405, 1991.
DOI : 10.1145/116873.116880

F. Benoit, E. Bertin, M. M. , and J. Chassery, G en eration de courbes de niveau a partir de donn ees contraintes, Proc. du 9 eme Congr es, p.page In press, 1994.

E. Bertin, Diagramme de Voronoí 3D, 1990.

E. Bertin and H. Bischof, Voronoi pyramids controlled by hopaeeld neural networks, 1993.

E. Bertin and J. Chassery, Diagramme de Voronoí 3D: Construction et applications en imagerie 3D, Proc. du 8 eme Congr es, pp.803-808, 1991.

E. Bertin and J. Chassery, 3D generalized Voronoi diagram, Proc. of the 2nd Congr es Curves and Surfaces, 1993.

E. Bertin, R. Marcelpoil, and J. Chassery, <title>Morphological algorithms based on Voronoi and Delaunay graphs: microscopic and medical applications</title>, Image Algebra and Morphological Image Processing III, pp.356-367, 1992.
DOI : 10.1117/12.60655

E. Bertin, F. Parazza, and J. Chassery, Segmentation and measurement based on 3D Voronoi diagram: Application to confocal microscopy, Computerized Medical Imaging and Graphics, vol.17, issue.3, pp.175-182, 1993.
DOI : 10.1016/0895-6111(93)90041-K

P. Bertolino, Structure pyramidale irr eguli ere pour la segmentation d'images en niveaux de gris, 1992.

P. Bertolino and A. Montanvert, Edge detection for biomedical image: a selfadaptive and randomized operator, Proc. of the 14th Annual International Conference of the IEEE Engineering in Medecine and Biology Society, pp.129-133, 1992.

J. Besag, Statistical analysis of dirty pictures*, Journal of Applied Statistics, vol.6, issue.5-6, pp.259-302, 1986.
DOI : 10.1016/0031-3203(83)90012-2

H. Bischof and W. G. Kropatsch, Hopaeeld networks for irregular decimation, 1993.

H. Bischof and W. G. Kropatsch, Neural Networks versus Image Pyramids, Dept. for Pattern Recognition and Image Processing, 1993.
DOI : 10.1007/978-3-7091-7533-0_23
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.3077

M. Bister, J. Cornelis, and A. Rosenfeld, A critical view of pyramid segmentation algorithms, Pattern Recognition Letters, vol.11, issue.9, 1990.
DOI : 10.1016/0167-8655(90)90013-R

A. Blake and A. Zisserman, Visual Reconstruction, 1987.

I. Bloch-boulanger, F. Schmitt, and H. Ma^-tre, Calcul de l'enveloppe convexe d'un objet tridimensionnel, Journ ees de g eom etrie algorithmique, pp.791-800, 1990.

H. Blum, A transformation for extracting new descriptors of shape on models for perception of speech and visual form, Proc of the symp, pp.362-380, 1964.

J. Boissonnat, Representation of objects by triangulating points in 3D space, Proc. of the ICPR 82, pp.830-832, 1982.

J. Boissonnat, Shape reconstruction from planar cross-sections, 1986.
DOI : 10.1016/0734-189x(88)90053-9
URL : https://hal.archives-ouvertes.fr/inria-00076008

J. Boissonnat and M. Devillers-teillaud, On the randomized construction of the Delaunay tree, Theoretical Computer Science, vol.112, issue.2, 1989.
DOI : 10.1016/0304-3975(93)90024-N
URL : https://hal.archives-ouvertes.fr/inria-00075419

J. Boissonnat, O. D. Faugeras, and E. Le-bras-mehlman, Representing stereo data with the Delaunay triangulation, Proceedings. 1988 IEEE International Conference on Robotics and Automation, 1988.
DOI : 10.1109/ROBOT.1988.12326
URL : https://hal.archives-ouvertes.fr/inria-00075763

J. Boissonnat and B. Geiger, <title>Three-dimensional reconstruction of complex shapes based on the Delaunay triangulation</title>, Biomedical Image Processing and Biomedical Visualization, 1992.
DOI : 10.1117/12.148710

G. Borgefors, Distance transforms in arbitrary dimensions Computer Vision, Graphics and Image Processing, pp.321-345, 1984.

C. Bouman and B. Liu, Multiple resolution of textured images, IEEE Transactions on Pattern Analysis and Machine Intelligence, p.13322, 1991.

A. Bowyer, Computing Dirichlet tessellations, The Computer Journal, vol.24, issue.2, pp.162-166, 1981.
DOI : 10.1093/comjnl/24.2.162
URL : http://comjnl.oxfordjournals.org/cgi/content/short/24/2/162

J. W. Brandt and V. R. Algazi, Continuous skeleton computation by Voronoi diagram. CVGIP, Image Understanding, pp.329-338, 1992.
DOI : 10.1016/1049-9660(92)90030-7

W. Brostow, J. P. Dussault, and B. L. Fox, Construction of Voronoi polyhedra, Journal of Computational Physics, vol.29, issue.1, pp.81-92, 1978.
DOI : 10.1016/0021-9991(78)90110-9

K. Q. Brown, Voronoi diagrams from convex hulls, Information Processing Letters, vol.9, issue.5, pp.223-228, 1979.
DOI : 10.1016/0020-0190(79)90074-7

E. Bruzzone, G. Garibotto, and F. Mangili, Three-Dimensional Surface Reconstruction Using Delaunay Triangulation in the Image Plane, Visual Form, pp.99-108, 1992.
DOI : 10.1007/978-1-4899-0715-8_11

C. E. Buckley, Split-and-merge image segmentation based on Delaunay triangulation, Lectures notes in computer science, 1988.

B. Chalmond, Image restoration using an estimated Markov model, Signal Processing, vol.15, issue.2, pp.115-129, 1988.
DOI : 10.1016/0165-1684(88)90065-5

J. Chassery, F. Davoine, and E. Bertin, Compression fractale par partitionnement de Delaunay.InProc, of the 14 eme Colloque GRETSI, Juan-les-Pins, pp.819-922, 1993.

J. Chassery and M. Melkemi, Diagramme de Voronoí appliqu e la segmentation d'images et alad etection d' ev enements en imagerie multi-source, Traitement du Signal, vol.8, pp.155-164, 1991.

X. Chen and F. Schmitt, Split-and-merge image segmentation based on Delaunay triangulation, Proc. of the 7th Scandinavian Conf. on Image Analysis, pp.910-917, 1991.

E. E. David and C. W. David, Voronoi polyhedra as a tool for studying solvation structure, The Journal of Chemical Physics, vol.76, issue.9, pp.4611-4614, 1982.
DOI : 10.1063/1.443540

F. Davoine, E. Bertin, and J. Chassery, Fractal image coding based on Delaunay tessellation, Proc. of the 17th OAGM -Meeting, 1993.

F. Davoine, E. Bertin, and J. Chassery, F rom rigidity to adaptive tessellations for fractal image compression: comparative studies, Proc. of the 8 eme Workshop on Image Multidimensional Signal Processing, pp.56-57, 1993.

H. Derin and H. Helliot, Modeling and segmentation of noisy and textured images using gibbs random aeelds, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.9911, pp.39-55, 1987.

O. Devillers, n) ALGORITHMS FOR DIFFICULT ??(n) PROBLEMS, International Journal of Computational Geometry & Applications, vol.02, issue.01, pp.97-111, 1992.
DOI : 10.1142/S021819599200007X
URL : https://hal.archives-ouvertes.fr/inria-00167206

R. L. Dobrusin, The description of a random aeeld by means of conditional probabilities and conditions of its regularity. Theory of Probability and its applications, pp.197-224, 1968.

R. A. Dwyer, Average-case analysis of algorithms for convex hulls and Voronoi diagrams, 1988.

H. Edelsbrunner, Algorithms in combinatorial geometry. Texts and Monographs in Computer Science, 1988.
DOI : 10.1007/978-3-642-61568-9

H. Edelsbrunner and W. Shi, An on log 2 h time algorithm for the threedimensionnal convex hull problem, Siam J. Comput, pp.259-269, 1979.

M. Elbaz, Sur les diagrammes de Voronoí et de Delaunay dans le plan et dans l'espace, 1992.

D. A. Field, Implementing Watson's algorithm in three dimensions, Proceedings of the second annual symposium on Computational geometry , SCG '86, pp.246-259, 1986.
DOI : 10.1145/10515.10542

J. L. Finney, A procedure for the construction of Voronoi polyhedra, Journal of Computational Physics, vol.32, issue.1, pp.137-143, 1979.
DOI : 10.1016/0021-9991(79)90146-3

Y. Fischer, E. W. Jacobs, and R. D. Boss, Fractal image compression using iterated transform 156 BIBLIOGRAPHIE ë55ë A. Gagalowictz and O. Monga. Un algorithme de segmentation hi erarchique, Image and Text Compression Proc. du 5 eme Congr es, pp.35-61, 1985.

A. E. Galashev and V. P. Skripov, Stability of Lennars-Jones crystal structures in the molecular dynamics model. Sov, J. Low Temp. Phys, vol.6, 1985.

D. Geiger and F. Girosi, Parallel and deterministic algorithms from mrf's: Surface reconstruction, IEEE Transactions on Pattern Analysis and Machine Intelligence, p.12277, 1990.
DOI : 10.1109/34.134040

S. Geman and D. Geman, Stochastic relaxation, gibbs distributions, and the bayesian restoration of images, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.6666, pp.721-741, 1984.

S. Geman and D. Geman, Relaxation and annealing with constraints, 1992.

S. Geman, D. Geman, C. Graaegne, and P. Dong, Boundary detection and the bayesian restoration of images, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.12277, pp.609-628, 1990.

I. G. Gowda, D. G. Kirkpatrick, D. Tsai-lee, and A. Naamad, Dynamic Voronoi diagrams, IEEE Transactions on Information Theory, vol.29, issue.5, pp.29955724-731, 1983.
DOI : 10.1109/TIT.1983.1056738

P. J. Green and R. Sibson, Computing Dirichlet Tessellations in the Plane, The Computer Journal, vol.21, issue.2, pp.168-173, 1978.
DOI : 10.1093/comjnl/21.2.168
URL : http://comjnl.oxfordjournals.org/cgi/content/short/21/2/168

W. I. Grosky and R. Jain, A Pyramid-Based Approach to Segmentation Applied to Region Matching, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.8, issue.5, pp.639-650, 1986.
DOI : 10.1109/TPAMI.1986.4767837

L. J. Guibas and J. Stolae, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams, Proceedings of the fifteenth annual ACM symposium on Theory of computing , STOC '83, pp.74-123, 1985.
DOI : 10.1145/800061.808751

X. Guyon, Champs al eatoire sur un r eseau, 1992.

R. M. Haralick and L. G. Shapiro, Glossary of computer vision terms, Pattern Recognition, vol.24, issue.1, pp.69-93, 1991.
DOI : 10.1016/0031-3203(91)90117-N

L. Herault, Reseaux de neurones recursifs pour l'optimisation combinatoire. Application a la theorie des graphes et a la vision par ordinateur, 1991.

H. Honda, Description of cellular patterns by Dirichlet domains: The two-dimensional case, Journal of Theoretical Biology, vol.72, issue.3, pp.523-543, 1978.
DOI : 10.1016/0022-5193(78)90315-6

J. J. Hopaeeld, Neural networks and physical systems with emergent collective computational abilities, pp.2554-2558, 1982.

J. J. Hopaeeld, Neurons with graded response have collective computational properties like those of two-state neurons, pp.3088-3092, 1984.

J. J. Hopaeeld and D. W. Tank, Neural computation of decisions in optimization problems, Biological Cybernetics, vol.52, pp.141-152, 1985.

S. L. Horowitz and T. Pavlidis, Picture segmentation by directed split-andmerge procedure, Proc. of the 2. ICPR, pp.424-433, 1974.

H. T. Hu, Diagramme de Voronoí G en eralis ep our un ensemble de Polygones, 1991.

A. E. Jacquin, Image coding based on a fractal theory of iterated contractive image transformations, IEEE Transactions on Image Processing, vol.1, issue.1, pp.18-30, 1111.
DOI : 10.1109/83.128028

J. Jolion and A. Montanvert, The adaptivepyramid, a framework for 2D image analysis, Computer Vision, Graphics, and Image Processing: Image Processing, pp.339-348, 1992.

B. Kamgar-parsi, Hopaeeld model and optimization problems, Neural Networks for Perception, pp.94-110, 1992.

R. Klein, Concrete and abstract Voronoi diagrams, Lecture Notes in Computer Science, vol.400, 1989.
DOI : 10.1007/3-540-52055-4

T. Kohonen, The self-organizing map, Proc. of the IEEE, pp.1464-1480, 1990.

W. G. Kropatsch and A. Montanvert, Irregular pyramids, Pattern Recognition and Image processing, 1992.
DOI : 10.1007/978-3-662-03039-4_38
URL : https://hal.archives-ouvertes.fr/hal-00348864

W. G. Kropatsch, C. Reither, D. Willersinn, and G. Wlaschitz, The dual irregular pyramid, Proc. of the 5th International Conference CAIP'93, pp.31-40, 1993.
DOI : 10.1007/3-540-57233-3_4

C. Lacote, J. Mailfert, and J. P. Uhry, P arallel annealing by partitioning of conaegurations: an application to optimal 3D triangulation, SimulatedA nnealing, Parallelisation Techniques, pp.187-218, 1992.

D. T. Lee, Concrete and abstract Voronoi diagrams, IEEE Trans. PAMI, vol.4444, pp.363-369, 1982.

M. E. Lewis, La segmentation d'images avec la morphologie math ematique et les diagrammes de Voronoí . Rapport, 1991.

R. Marcelpoil, M ethodologie pour l' etude de la sociologie cellulaire : application al' etude du tissu prostatique normal et pathologique, 1993.

R. Marcelpoil and E. Bertin, Cellules en soci et e, Science et Vie, vol.184, pp.68-74, 1993.

R. Marcelpoil and Y. Usson, Methods for the study of cellular sociology: Voronoi diagrams and parametrization of the spatial relationships, Journal of Theoretical Biology, vol.154, issue.3, pp.359-369, 1992.
DOI : 10.1016/S0022-5193(05)80176-6

P. Martin, R eseaux de Neurones Artiaeciels : Application alaR econnaissance Optique de Partitions Musicales, BIBLIOGRAPHIE, vol.159, 1992.

A. Mauss, Delaunay triangulation and the convex hull ofn points in expected linear time, BIT, vol.21, issue.2, p.24, 1983.
DOI : 10.1007/BF01937482

R. J. Mceliece, E. C. Posner, and E. R. Rodemich, The capacity of the Hopfield associative memory, IEEE Transactions on Information Theory, vol.33, issue.4, pp.461-482, 1987.
DOI : 10.1109/TIT.1987.1057328

P. Mcmullen, The maximum numbers of faces of a convex polytope, Mathematika, vol.16, issue.02, 1970.
DOI : 10.1007/BF02771542

N. N. Medvedev and Y. I. Naberukhin, Delaunay simplexes of a simple liquid and amorphous substances, Sov. Phys. Dokl, pp.31166465-466, 1985.

P. Meer, Stochastic image pyramids, Computer Vision, Graphics, and Image Processing, vol.455, issue.33, pp.269-294, 1989.
DOI : 10.1016/0734-189x(88)90134-x

M. Melkemi, Approches g eom etriques par mod eles de Voronoí ensegmentation d'images, 1992.

N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, Equation of State Calculations by Fast Computing Machines, The Journal of Chemical Physics, vol.21, issue.6, pp.1087-1091, 1953.
DOI : 10.1063/1.1699114

D. Milhet, Visualisation des poly edres de Voronoí, 1992.

A. Montanvert, Obtention d'une ligne m ediane par connexion de l'axe m edian, Proc. du 5 eme Congr es, pp.777-785, 1985.

A. Montanvert, Graph Environment from Medial Axis for Shape Manipulation, proc. of the 4th ICPR, pp.197-203, 1987.
DOI : 10.1007/978-1-4613-1007-5_20

A. Montanvert and P. Bertolino, Irregular pyramids for parallel image segmentation, Pattern Recognition, vol.62, pp.13-34, 1992.

P. Moreau, Partition de l'espace et t etra edrisation de Delaunay sur machines parall eles, 1991.

. Ohya and M. Iri, A fast Voronoi-diagram algorithm with quaternary tree bucketing, Information Processing Letters, vol.18, issue.4, 1984.
DOI : 10.1016/0020-0190(84)90116-9

O. Palacio-velez and B. Cuevas-renaud, A dynamic hierarchical subdivision algorithm for computing Delaunay triangulations and other closest-point problems, ACM Transactions on Mathematical Software, vol.16, issue.3, p.16, 1990.
DOI : 10.1145/79505.79512

F. Parazza, C. Humbert, and Y. Usson, Methods for 3D topographical analysis of intra-nuclear aeuorescence distribution, ComputerizedMedical Imaging and Graphics, p.17733, 1993.

J. B. Pawley, Handbook of Biological Confocal Microscopy, 1990.

P. Perez and F. Heitz, Restriction d'un champ markovien sur un graphe. Application a l'analyse d'images multir esolution, 1993.

I. Pitas and A. N. Venetsanopoulos, Morphological shape decomposition, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.12, issue.1, pp.38-45, 1990.
DOI : 10.1109/34.41382

F. P. Preparata and M. I. Shamos, Computational Geometry, an Introduction, 1988.

K. Preston and R. Siderits, New techniques for three-dimensional data analysis in histopatology, Analytical and Quantitative Cytology and Histology, vol.14455, pp.398-406, 1992.

F. Pr, L'approche markovienne en analyse d'images et en reconnaissance de formes. Cours de troisi eme ann ee, 1991.

A. Rida, Etude d'une m ethode de partitionnement d'images par l'approche markovienne, 1993.

S. Rippa, Minimal roughness property of the Delaunay triangulation, Computer Aided Geometric Design, vol.7, issue.6, pp.489-497, 1990.
DOI : 10.1016/0167-8396(90)90011-F

F. Rolland, A. Montanvert, and J. Chassery, 3D medial axis and 3D skeletons, Proc. of the 7th Scandinavian Conf. on Image Analysis, pp.395-402, 1991.
DOI : 10.1007/978-1-4899-0715-8_43

H. Rom and S. Peleg, Image representation using Voronoi tessellation: adaptive and secure, Proceedings CVPR '88: The Computer Society Conference on Computer Vision and Pattern Recognition, pp.282-285, 1988.
DOI : 10.1109/CVPR.1988.196249

A. Rosenfeld, Arc colorings, partial path groups, and parallel graph contractions, Journal of Parallel and Distributed Computing, vol.7, issue.2, 1985.
DOI : 10.1016/0743-7315(89)90024-5

A. Rosenfeld and A. Kak, Digital image processing, 1982.

J. Roux, Approximation des surfaces et triangulation sph erique, Proc. du XXIV eme congr es national d'analyse num erique, 1992.

M. Sakarovitch, Optimisation combinatoire, m ethodes math ematiques et algorithmiques . Hermann, Enseignement des sciences, 1984.

H. Samet, Region representation: Quadtrees from binary arrays, Computer Graphics and Image Processing, vol.13, issue.1, pp.88-93, 1980.
DOI : 10.1016/0146-664X(80)90118-5

H. Samet, The design and analysis of spatial data structures, 1990.

F. Schmitt and H. Borouchaki, Algorithme rapide de maillage de Delaunay dans Rd, Proc. des journ ees de g eom etrie algorithmique, pp.131-133, 1990.

M. Schmitt, Some examples of algorithms analysis in computational geometry by means of mathematical morphology techniques, Lecture Note in Computer Science, Geometry and Robotics, pp.225-246, 1989.

J. Serra, Image Analysis and Mathematical Morphology, 1982.

J. Serra, Image Analysis and Mathematical Morphology, Part II: Theoretical Advances, 1988.

Y. Shrivastava, S. Dasgupta, and S. M. Reddy, Guaranteed convergence in a class of hopaeeld networks, IEEE Trans. on Neural Networks, vol.3366, pp.951-961, 1992.

J. C. Spehner, Merging in maps and in pavings, Theoretical Computer Science, vol.86, issue.2, pp.205-232, 1991.
DOI : 10.1016/0304-3975(91)90018-W

K. Sugihara and M. Iri, Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic, Proc. of the First Canadian Conference on Computational Geometry, Montr eal, pp.1-31, 1989.
DOI : 10.1109/5.163412

J. M. Talon, G en eration et am elioration de maillage pour les el ements aenis en deux et trois dimensions, 1989.

H. L. Tan, S. B. Gelfand, and E. J. Delp, A cost minimization approach to edge detection using simulating annealing, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.14411, pp.3-18, 1991.

M. Tanemura, T. Ogawa, and N. Ogita, A new algorithm for three-dimensional voronoi tessellation, Journal of Computational Physics, vol.51, issue.2, pp.191-207, 1983.
DOI : 10.1016/0021-9991(83)90087-6

S. L. Tanimoto, Paradigms for Pyramid Machine Algorithms, Pyramidal Systems for Image Processing and Computer Vision,volume F25 of NATO ASI Series, pp.173-194, 1986.
DOI : 10.1007/978-3-642-82940-6_12

M. Teillaud, Vers des algorithmes dynamiques randomis es en g eom etrie algorithmique, 1992.

E. Thiel and A. Montanvert, Etude et am elioration des distances du chanfrein pour l'analyse d'images. TSI, 1992.

J. C. Tilton, Image segmentation by iterative parallel region growing with applications to data compression and image analysis, Proceedings., 2nd Symposium on the Frontiers of Massively Parallel Computation, pp.357-361, 1988.
DOI : 10.1109/FMPC.1988.47452

G. T. Toussaint, I. , and M. Beach, Pattern recognition and geometrical complexity.I nProc, pp.1324-1347, 1989.

M. Tuceryan and A. Jain, Texture segmentation using Voronoi polygons, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol.12, issue.2, pp.211-216, 1990.
DOI : 10.1109/34.44407

L. Vincent, Graphs and mathematical morphology, Signal Processing, vol.16, issue.4, pp.365-388, 1989.
DOI : 10.1016/0165-1684(89)90031-5

L. Vincent, Algorithmes morphologiques ab ase de aeles d'attente et de lacets. Extension aux graphes, 1990.

D. F. Watson, Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes, The Computer Journal, vol.24, issue.2, pp.167-172, 1981.
DOI : 10.1093/comjnl/24.2.167

J. Zerubia and F. Ployette, D etection de contours et lissage par deux algorithmes d eterministes de relaxation : mise en oeuvre sur la machine a connexions CM2, Traitement du Signal, vol.8833, pp.165-175, 1991.

S. W. Zucker, Region growing: Childhood and adolescence, Computer Graphics and Image Processing, vol.5, issue.3, pp.382-399, 1976.
DOI : 10.1016/S0146-664X(76)80014-7