Název: | Watershed transformation: reducing the over-segmentation problem by applying noise resucer and region merger |
Autoři: | Vanderstockt, Yann Whyte, R. N. |
Citace zdrojového dokumentu: | WSCG '2002: Posters: The 10-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2002, 4.-8. February 2002 Plzeň, p. 57-60. |
Datum vydání: | 2002 |
Nakladatel: | UNION Agency |
Typ dokumentu: | konferenční příspěvek conferenceObject |
URI: | http://wscg.zcu.cz/wscg2002/Papers_2002/D51.zip http://hdl.handle.net/11025/6081 |
ISBN: | 80-903100-0-1 |
Klíčová slova: | segmentace obrazu;algoritmus záplava;transformační algoritmus |
Klíčová slova v dalším jazyce: | image segmentation;watershed algorithm;transformation algoritm |
Abstrakt: | Image segmentation is used to identify homogeneous regions in an image, it has been a subject of research for the last three decades. It is usually the first, and most difficult task for any image understanding system. Image segmentation is usually associated with pattern recognition problems and is considered the first phase of such a process. Consequently, the success of the pattern recognition process is dependent on the quality of this initial stage. Here we examine image segmentation. We describe the watershed transformation algorithm and our variation of it. We provide results for our implementation and compare then to previously published results from traditional implementations of the watershed transformation. Finally, we believe that these results substantiate the case that our modifications to the watershed provide much improved segmentation results. |
Práva: | © UNION Agency |
Vyskytuje se v kolekcích: | WSCG '2002: Posters |
Soubory připojené k záznamu:
Soubor | Popis | Velikost | Formát | |
---|---|---|---|---|
D51.pdf | Plný text | 365,47 kB | Adobe PDF | Zobrazit/otevřít |
Použijte tento identifikátor k citaci nebo jako odkaz na tento záznam:
http://hdl.handle.net/11025/6081
Všechny záznamy v DSpace jsou chráněny autorskými právy, všechna práva vyhrazena.