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

Guillaume Damiand (1) , Patrick Resch (2)

1 SIC - SIGNAL-IMAGE-COMMUNICATION
2 LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier

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.

Mots clés: topological maps; split-and-merge; image segmentation; image processing

Domaines: Mathématique discrète [cs.DM]; Traitement des images [eess.IV]

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⟩