Watershed based region growing algorithm
Artykuł w czasopiśmie
| Status: | |
| Autorzy: | Smołka Jakub |
| Rok wydania: | 2005 |
| Wersja dokumentu: | Drukowana | Elektroniczna |
| Język: | angielski |
| Numer czasopisma: | 1 |
| Wolumen/Tom: | 3 |
| Strony: | 169 - 178 |
| Efekt badań statutowych | NIE |
| Materiał konferencyjny: | NIE |
| Publikacja OA: | NIE |
| Abstrakty: | angielski |
| This paper presents a solution to a major drawback of watershed transformation: oversegmentation. The solution utilizes one of its main advantages – very good edge extraction. It is a method that simulates pouring water onto a landscape created on a basis of a digital image. Unfortunately transformation produces a region for each local minimum so, usually, the number of watersheds (catchment basins) is too big. Watershed region growing is based on a minimum variance region growing algorithm [1-3]. It differs from the original in that it grows a homogenous region by adding and removing entire watersheds (catchment basins) and not separate pixels. The generalized watershed based region dilation and contraction are presented. Thanks to the use ofwatershed transformation, the region growing process is not able to grow a region easily outside the object boundaries. Test segmentations of two class images and a comparison between the minimum variance and the watershed based region growing are presented. |
