Combinatorial Maps for 2D and 3D Image Segmentation - Archive ouverte HAL Access content directly
Book Sections Year : 2012

Combinatorial Maps for 2D and 3D Image Segmentation


This chapter shows how combinatorial maps can be used for 2D or 3D image segmentation. We start by introducing combinatorial maps and we show how they can be used to describe image partitions. Then, we present a generic segmentation algorithm that uses and modifies the image partition represented by a combinatorial map. One advantage of this algorithm is that one can mix different criteria and use different image features which can be associated with the cells of the partition. In particular, it is interesting that the topological properties of the image partition can be controlled through this approach. This property is illustrated by the computation of classical topological invariants, known as Betti numbers, which are then used to control the number of cavities or the number of tunnels of regions in the image partition. Finally, we present some experimental results of 2D and 3D image segmentation using different criteria detailed in this chapter.
Fichier principal
Vignette du fichier
image-segmentation-with-maps.pdf (688.06 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01353024 , version 1 (24-04-2017)



Guillaume Damiand, Alexandre Dupas. Combinatorial Maps for 2D and 3D Image Segmentation. Digital Geometry Algorithms, Springer, pp.359-393, 2012, ⟨10.1007/978-94-007-4174-4_12⟩. ⟨hal-01353024⟩
123 View
420 Download



Gmail Facebook Twitter LinkedIn More