A new method for analysing image histograms is introduced. The technique decomposes a histogram into probability level sets. The relationships between these level sets are encoded using a tree. The tree has fewer nodes than the histogram and so is a compressed feature. When used in image retrieval experiments the tree is shown to have a performance that is superior to many methods and no worse than the best alternatives. The tree is efficient because it can be built using a computationally efficient algorithm known as a sieve.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Analysing and simplifying histograms using scale-trees


    Beteiligte:
    Gibson, S. (Autor:in) / Harvey, R. (Autor:in)


    Erscheinungsdatum :

    01.01.2001


    Format / Umfang :

    778679 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Analysing and Simplifying Histograms Using Scale-Trees

    Gibson, S. / Harvey, R. / IEEE | British Library Conference Proceedings | 2001


    Multidimensional histograms

    Jayroe, R. R., Jr. | NTRS | 1979


    Simplifying controls

    Ashley,S. | Kraftfahrwesen | 2001


    Simplifying simulation

    Scoltock,J. / PSA Peugeot Citroen,FR | Kraftfahrwesen | 2015


    Sports Classification Using Cross-Ratio Histograms

    Paluri, Balamanohar / Nalin Pradeep, S. / Shah, Hitesh et al. | Springer Verlag | 2007