Shortest-path constraints for 3D multiobject semiautomatic segmentation via clustering and Graph Cut

Abstract : We derive shortest-path constraints from graph models of structure adjacency relations and introduce them in a joint centroidal Voronoi image clustering and Graph Cut multiobject semiautomatic segmentation framework. The vicinity prior model thus defined is a piecewise-constant model incurring multiple levels of penalization capturing the spatial configuration of structures in multiobject segmentation. Qualitative and quantitative analyses and comparison with a Potts prior-based approach and our previous contribution on synthetic, simulated, and real medical images show that the vicinity prior allows for the correct segmentation of distinct structures having identical intensity profiles and improves the precision of segmentation boundary placement while being fairly robust to clustering resolution. The clustering approach we take to simplify images prior to segmentation strikes a good balance between boundary adaptivity and cluster compactness criteria furthermore allowing to control the trade-off. Compared with a direct application of segmentation on voxels, the clustering step improves the overall runtime and memory footprint of the segmentation process up to an order of magnitude without compromising the quality of the result.
Type de document :
Article dans une revue
IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2013, 22 (11), pp.4224-4236. <10.1109/TIP.2013.2271192>


https://hal.archives-ouvertes.fr/hal-00983319
Contributeur : Sébastien Valette <>
Soumis le : vendredi 25 avril 2014 - 10:30:04
Dernière modification le : jeudi 12 mai 2016 - 11:40:43
Document(s) archivé(s) le : vendredi 25 juillet 2014 - 11:01:09

Fichier

kechichian-et-al-2013-double.p...
Fichiers produits par l'(les) auteur(s)

Identifiants

Citation

Razmig Kéchichian, Sébastien Valette, Michel Desvignes, Rémy Prost. Shortest-path constraints for 3D multiobject semiautomatic segmentation via clustering and Graph Cut. IEEE Transactions on Image Processing, Institute of Electrical and Electronics Engineers, 2013, 22 (11), pp.4224-4236. <10.1109/TIP.2013.2271192>. <hal-00983319>

Exporter

Partager

Métriques

Consultations de
la notice

439

Téléchargements du document

511