| HAL : hal-00211741, version 1 |
| DOI : 10.1016/S1524-0703(03)00009-2 |
| Fiche détaillée | Récupérer au format |
|
|
| Graphical Models 65, 1-3 (2003) 149-167 |
|
|
|
|
| Split and Merge Algorithms Defined on Topological Maps for 3D Image Segmentation |
|
|
Guillaume Damiand 1Patrick Resch 2 |
|
|
| (05/2003) |
|
|
| 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. |
|
|
|
|
|
|
|
|
|
|
| 1 : | SIGNAL-IMAGE-COMMUNICATION (SIC) |
| CNRS : FRE2731 – Université de Poitiers | |
| 2 : | Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier (LIRMM) |
| CNRS : UMR5506 – Université Montpellier II - Sciences et Techniques du Languedoc | |
|
|
|
|
|
|
|
|
| Domaine | : | Informatique/Mathématique discrète Informatique/Traitement des images |
|
|
| topological maps – split-and-merge – image segmentation – image processing |
|
|
| Liste des fichiers attachés à ce document : | |||||
|
|
|
| hal-00211741, version 1 | |
| http://hal.archives-ouvertes.fr/hal-00211741 | |
| oai:hal.archives-ouvertes.fr:hal-00211741 | |
| Contributeur : Guillaume Damiand | |
| Soumis le : Lundi 21 Janvier 2008, 22:08:50 | |
| Dernière modification le : Mardi 22 Janvier 2008, 17:37:46 | |