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

Computer Graphics Forum

Volumn 20, Issue 3, 2001, Pages

  Felke, Petr ^a,b   Bruckschwaiger, Mario ^a   Wegenkitt, Rainer ^a  

^a VRVIS RESEARCH CENTER   (Austria)

^b TIANI Medgraph GmbH   (Austria)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER WORKSTATIONS; IMAGE SEGMENTATION; MATHEMATICAL MORPHOLOGY; QUEUEING THEORY; THREE DIMENSIONAL; WATERSHEDS;

ITERATIVE FOREST TRANSFORM; TIME COMPLEXITY;

DIGITAL WATERMARKING;

EID: 0035801143     PISSN: 01677055     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. The ordered queue and the optimality of the watershed approaches
2. A note on two problems in connection with graphs
3. Faster algorithms for the shortest path problem
4. Algorithm 360: Shortest path forest with topological ordering
5. Three fastest shortest path algorithms on real road networks: Data structures and procedures