|
|
|
|
| LEADER |
01000caa a22002652c 4500 |
| 001 |
NLM196482372 |
| 003 |
DE-627 |
| 005 |
20250211093058.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231223s2010 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TPAMI.2009.71
|2 doi
|
| 028 |
5 |
2 |
|a pubmed25n0655.xml
|
| 035 |
|
|
|a (DE-627)NLM196482372
|
| 035 |
|
|
|a (NLM)20299715
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Cousty, Jean
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Watershed cuts
|b thinnings, shortest path forests, and topological watersheds
|
| 264 |
|
1 |
|c 2010
|
| 336 |
|
|
|a Text
|b txt
|2 rdacontent
|
| 337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
| 338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
| 500 |
|
|
|a Date Completed 23.06.2010
|
| 500 |
|
|
|a Date Revised 19.03.2010
|
| 500 |
|
|
|a published: Print
|
| 500 |
|
|
|a Citation Status MEDLINE
|
| 520 |
|
|
|a We recently introduced watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three algorithmic watershed cut strategies: The first one is well suited to parallel implementations, the second one leads to a flexible linear-time sequential implementation, whereas the third one links the watershed cuts and the popular flooding algorithms. We state that watershed cuts preserve a notion of contrast, called connection value, on which several morphological region merging methods are (implicitly) based. We also establish the links and differences between watershed cuts, minimum spanning forests, shortest path forests, and topological watersheds. Finally, we present illustrations of the proposed framework to the segmentation of artwork surfaces and diffusion tensor images
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Bertrand, Gilles
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Najman, Laurent
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Couprie, Michel
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on pattern analysis and machine intelligence
|d 1979
|g 32(2010), 5 vom: 18. Mai, Seite 925-39
|w (DE-627)NLM098212257
|x 1939-3539
|7 nnas
|
| 773 |
1 |
8 |
|g volume:32
|g year:2010
|g number:5
|g day:18
|g month:05
|g pages:925-39
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TPAMI.2009.71
|3 Volltext
|
| 912 |
|
|
|a GBV_USEFLAG_A
|
| 912 |
|
|
|a SYSFLAG_A
|
| 912 |
|
|
|a GBV_NLM
|
| 912 |
|
|
|a GBV_ILN_350
|
| 951 |
|
|
|a AR
|
| 952 |
|
|
|d 32
|j 2010
|e 5
|b 18
|c 05
|h 925-39
|