Split and Merge Algorithms Defined on Topological Maps for 3D Image Segmentation - Archive ouverte HAL
Article Dans Une Revue Graphical Models Année : 2003

Split and Merge Algorithms Defined on Topological Maps for 3D Image Segmentation

Résumé

Split-and-merge algorithms define a class of image segmentation methods. Topological maps are a mathematical model that represents image subdivisions in 2D and 3D. This paper discusses a split-and-merge method for 3D image data based on the topological map model. This model allows representations of states of segmentations and of merge and split operations. Indeed, it can be used as data structure for dynamic changes of segmentation. The paper details such an algorithmic approach and analyzes its time complexity. A general introduction into combinatorial and topological maps is given to support the understanding of the proposed algorithms.
Fichier principal
Vignette du fichier
revue-gm2003.pdf (380.18 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00211741 , version 1 (21-01-2008)

Identifiants

Citer

Guillaume Damiand, Patrick Resch. Split and Merge Algorithms Defined on Topological Maps for 3D Image Segmentation. Graphical Models, 2003, 65 (1-3), pp.149-167. ⟨10.1016/S1524-0703(03)00009-2⟩. ⟨hal-00211741⟩
359 Consultations
1617 Téléchargements

Altmetric

Partager

More