A New Algorithm for Image Segmentation via Watershed Transformation
A new segmentation method is presented. The watershed transformation is initially computed starting from all seeds detected as regional minima in the gradient image and a digging cost is associated to each pair of adjacent regions. Digging is performed for each pair of adjacent regions for which the cost is under a threshold, whose value is computed automatically, so originating a reduced set of seeds. Watershed transformation and digging are repeatedly applied, until no more seeds are filtered out. Then, region merging is accomplished, based on the size of adjacent regions.
- 1.Lucchese, L., Mitra, S.K.: Color image segmentation: A State-of-the-Art Survey. Proc. of the Indian National Science Academy (INSA-A) 67A(2), 207–221 (2001)Google Scholar
- 5.Wirjadi, O.: Image and video matting: a survey. Fraunhofer Institut für Techno und Wirtschaftsmathematik ITWM 2007, ISSN 1434-9973 Bericht 123 (2007)Google Scholar
- 6.Zhang, H., Fritts, J.E., Goldman, S.A.: Image segmentation evaluation: A survey of unsupervised methods. In: CVIU, vol. 110, pp. 260–280 (2008)Google Scholar
- 8.Senthilkumaran, N., Rajesh, R.: Edge detection techniques for image segmentation: a survey of Soft Computing Approaches. Int. J. Recent Trends in Engineering 1(2), 250–254 (2009)Google Scholar
- 10.Beucher, S., Lantuéjoul, C.: Use of watersheds in contour detection. In: Proc. Int. Workshop on Image Processing, Real-time Edge and Motion Detection/Estimation, Rennes, France, pp. 12–21 (1979)Google Scholar
- 13.Frucci, M.: Oversegmentation reduction by flooding regions and digging watershed lines. IJPRAI 20(1), 15–38 (2006)Google Scholar