Stochastic hierarchical watershed cut based on disturbed topographical surface

We propose in this paper an interactive segmentation method based on watershed and graph cuts to extract liver tumors boundaries in 3D CT images.. 3 MICCAI 2008 is the

Les dérivées partielles premières étant des fonctions de deux variables, on peut éventuellement les dériver de nouveau par rapport à la première ou deuxième variable..c.

Moving to the fully parallel implementation on the GPU, developed according to Algorithm 1, Table 2 shows that the bot- tleneck on step 1 is completely mitigated, whereas for step 2

L’archive ouverte pluridisciplinaire HAL, est destinée au dépôt et à la diffusion de documents scientifiques de niveau recherche, publiés ou non, émanant des

This article presented a hierarchical stochastic image seg- mentation approach which adds uniform random noise to the topographic surface for watershed cuts segmentation..

Defining an novel non negative global climbing energy that helps perform an optimization over the hierarchy of segmentations, that generate optimal segmentations by the classical

Intuitively, one can see that, if one starts from a minimum spanning forest (MSF) rooted in the minima of the image (or, equivalently, from a watershed cut [17]), then one builds

The main contribution of this paper is the proposal of a similarity measure based on likelihood ratio test computed from a Gaussian model distribution in the context of