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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Color image segmentation by a watershed algorithm and region adjacency graph processing


    Contributors:


    Publication date :

    1994-01-01


    Size :

    497638 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Color Image Segmentation by a Watershed Algorithm and Region Adjacency Graph Processing

    Saarinen, K. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    Fast region merging algorithm for watershed transform based on adjacency list

    Suqi, L. / Guangjun, Z. | British Library Online Contents | 2008


    A color image segmentation algorithm by integrating watershed with automatic seeded region growing and merging [8200-58]

    Xu, G. / Bu, Y. / Wang, L. et al. | British Library Conference Proceedings | 2011


    Activity driven nonlinear diffusion for color image watershed segmentation

    De Smet, P. / Pires, R. L. V. P. M. / De Vleeschauwer, D. et al. | British Library Online Contents | 1999


    Segmentation and tracking using region adjacency graphs, picture trees and prior information

    Andrade, E. L. / Khan, E. / Woods, J. C. et al. | British Library Conference Proceedings | 2003