most citedImplementation and complexity of the watershed-from-markers algorithm computed as a minimal cost forest

35 citations · 35 across the 1 of their papers we have counts for

collaborators

1 paper

cs.DS2002★ 35 cited

Implementation and complexity of the watershed-from-markers algorithm computed as a minimal cost forest

Petr Felkel, Mario Bruckwschwaiger, Rainer Wegenkittl

The watershed algorithm belongs to classical algorithms in mathematical morphology. Lotufo et al. published a principle of the watershed computation by means of an Image Foresting…