The flattened image pixels.
The raveled coordinates of the initial markers (aka seeds) for the watershed. NOTE: these should all point to nonzero entries in the output, or the algorithm will never terminate and blow up your memory!
A list of coordinate offsets to compute the raveled coordinates of each neighbor from the raveled coordinates of the current pixel.
An array of the same shape as :None:None:`image` where each pixel contains a nonzero value if it is to be considered for flooding with watershed, zero otherwise. NOTE: it is essential that the border pixels (those with neighbors falling outside the volume) are all set to zero, or segfaults could occur.
An array representing the number of steps to move along each dimension. This is used in computing the Euclidean distance between raveled indices.
A value greater than 0 implements the compact watershed algorithm (see .py file).
The output array, which must already contain nonzero entries at all the seed locations.
Parameter indicating whether the watershed line is calculated. If wsl is set to True, the watershed line is calculated.
Perform watershed algorithm using a raveled image and neighborhood.
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them
