On boundary pixels in seeded region growing segmentation
Mingshan Zhang, Jian Cong Huang, Yudi Pawitanm · 2004
Boundary pixels can have a subtle but serious impact on the performance of the seeded region growing algorithm [R. Adams et al. (1994)], a fast semiautomatic algorithm for segmentation of intensity images. We have found, however, that as originally described the algorithm can fail if some sections of a connected segment is narrow. The failure results, for example, in a loss of details or an undue dependence of seed placement. The remedy is a careful processing of the boundary pixels. We here present an algorithm whose performance is not affected by such situation.