In this paper, we exploit some previous theoretical results about decision tree pruning to derive a color segmentation algorithm which avoids some of the common drawbacks of region merging techniques. The algorithm has both statistical and computational advantages over known approaches. It authorizes the processing of 512/spl times/512 images in less than a second on conventional PC computers. Experiments are reported on thirty-five images of various origins, illustrating the quality of the segmentations obtained.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast and reliable color region merging inspired by decision tree pruning


    Contributors:
    Nock, R. (author)


    Publication date :

    2001-01-01


    Size :

    749027 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Fast and Reliable Color Region Merging Inspired by Decision Tree Pruning

    Nock, R. / IEEE | British Library Conference Proceedings | 2001


    Tree pruning robot

    CHEN YONG / ZHANG WEI | European Patent Office | 2023

    Free access

    Tree pruning method

    YE LIFANG | European Patent Office | 2020

    Free access

    Tree-climbing pruning robot

    YOU JIA / WEI YONGHONG | European Patent Office | 2021

    Free access