An unsupervised algorithm for arranging an image database as a binary tree is described. Tree nodes are associated with image subsets, maintaining the property that the similarity among the images associated with the children of a node is higher than the similarity among the images associated with the parent node. Experiments with datasets of hundreds and thousands of images show that shallow trees can produce clustering into "meaningful" classes. Visual-content search trees can be used to automate image retrieval by content, or help a human to interactively search for images.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Indexing images by trees of visual content


    Contributors:


    Publication date :

    1998-01-01


    Size :

    842272 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Indexing Images by Trees of Visual Content

    Schweitzer, H. / IEEE; Computer Society | British Library Conference Proceedings | 1998


    Content-Based Image Retrieval by Indexing Random Subwindows with Randomized Trees

    Marée, Raphaël / Geurts, Pierre / Wehenkel, Louis | Springer Verlag | 2007


    Organizing image databases as visual-content search trees

    Schweitzer, H. | British Library Online Contents | 1999


    Adapting indexing trees to data distribution in feature spaces

    Qian, X. / Tagare, H. D. | British Library Online Contents | 2010