5 - Segmentation tridimentionnelle hiérarchique par triangulation de surface
1996
This article presents a new algorithm for segmenting three-dimensional images . It is based on a dynamic triangulated surface an d
on a pyramidal representation . The triangulated surface, which follows a physical modelization and which can as well modify
its geometry as its topology, segments images into their components by altering its shape according to internal and externa l
constraints . In order to speed up the whole process, an algorithm of pyramid building with any reduction factor allows us t o
transform the image into a set of images with progressive resolutions . This organization into a hierarchy, combined with a model
that can adapt its mesh refinement to the resolution of the workspace, authorizes a fast estimation of the general forms included i n
the image. After that, the model searches for finer and finer details while relying successively on the different levels of the pyramid.
Keywords:
- Correction
- Cite
- Save
- Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI