A new method for gray-scale, color and multispectral image segmentation is proposed. The method is based on a morphological split-and-merge fast watershed algorithm and region adjacency graph processing. It features partly iterative processing with relatively low computational load. Two system alternatives are presented and their application to color image segmentation is discussed. First computer simulations show correctness of operation and encourage for further research.<>
Color image segmentation by a watershed algorithm and region adjacency graph processing
Proceedings of 1st International Conference on Image Processing ; 3 ; 1021-1025 vol.3
1994-01-01
497638 byte
Conference paper
Electronic Resource
English
Color Image Segmentation by a Watershed Algorithm and Region Adjacency Graph Processing
British Library Conference Proceedings | 1994
|Fast region merging algorithm for watershed transform based on adjacency list
British Library Online Contents | 2008
|British Library Conference Proceedings | 2011
|Activity driven nonlinear diffusion for color image watershed segmentation
British Library Online Contents | 1999
|Segmentation and tracking using region adjacency graphs, picture trees and prior information
British Library Conference Proceedings | 2003
|