Cargando…
Implementation and complexity of the watershed-from-markers algorithm computed as a minimal cost forest
The watershed algorithm belongs to classical algorithms in mathematical morphology. Lotufo et al. published a principle of the watershed computation by means of an iterative forest transform (IFT), which computes a shortest path forest from given markers. The algorithm itself was described for a 2D...
| Autores principales: | , , |
|---|---|
| Lenguaje: | eng |
| Publicado: |
2002
|
| Materias: | |
| Acceso en línea: | http://cds.cern.ch/record/557282 |