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.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Fast and reliable color region merging inspired by decision tree pruning


    Beteiligte:
    Nock, R. (Autor:in)


    Erscheinungsdatum :

    01.01.2001


    Format / Umfang :

    749027 byte





    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    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 | Europäisches Patentamt | 2023

    Freier Zugriff

    Tree pruning method

    YE LIFANG | Europäisches Patentamt | 2020

    Freier Zugriff

    Tree-climbing pruning robot

    YOU JIA / WEI YONGHONG | Europäisches Patentamt | 2021

    Freier Zugriff

    Street tree a pruning vehicles and way of dealing pruning ramous

    Europäisches Patentamt | 2019

    Freier Zugriff