ENH: addressed Tony's comments (renaming of functions, doc)

This commit is contained in:
emmanuelle
2012-01-21 11:43:53 +01:00
parent b9d6090c5e
commit 528187c2b0
3 changed files with 35 additions and 20 deletions
@@ -3,20 +3,21 @@
Random walker segmentation
==========================
The random walker algorithm (*Random walks for image segmentation*, Leo Grady,
IEEE Trans Pattern Anal Mach Intell. 2006 Nov;28(11):1768-83) determines the
segmentation of an image from a set of markers labeling several phases (2 or
more). An anisotropic diffusion equation is solved with tracers initiated
at the markers' position. The local diffusivity coefficient is greater if
neighboring pixels have similar values, so that diffusion is difficult across
high gradients. The label of each unknown pixel is attributed to the label
of the known marker that has the highest probability to be reached first
during this diffusion process.
The random walker algorithm [1]_ determines the segmentation of an image from
a set of markers labeling several phases (2 or more). An anisotropic diffusion
equation is solved with tracers initiated at the markers' position. The local
diffusivity coefficient is greater if neighboring pixels have similar values,
so that diffusion is difficult across high gradients. The label of each unknown
pixel is attributed to the label of the known marker that has the highest
probability to be reached first during this diffusion process.
In this example, two phases are clearly visible, but the data are too
noisy to perform the segmentation from the histogram only. We determine
markers of the two phases from the extreme tails of the histogram of gray
values, and use the random walker for the segmentation.
.. [1] *Random walks for image segmentation*, Leo Grady, IEEE Trans. Pattern
Anal. Mach. Intell. 2006 Nov; 28(11):1768-83
"""
print __doc__