The paper is concerned with the development of linear quadtree structure for image coding with the objective of making it more compact and suitable for content addressable memory (CAM) implementation. Linear quadtree represents an image by a collection of leaf nodes which are represented by locational nodes. The author aims at reducing the number of locational codes by making use of the coherence of regions. The underlying idea is to extend the use of "dont care" state in the CAM-based linear quadtree to exploit more spatial coherence. The author proposes a new hierarchical data structure, named as quad-quadtree, which is based on the recursive subdivision of an image into 16 equal-sized sub-images until each is homogeneous or until a sufficiently fine resolution is reached. The quad-quadtree differs from other quadtree structures in that it reduces the number of codes by using rearranged labelling order and merging homogeneous regions. Experimental results obtained on real data demonstrate its space efficiency and usefulness.<>


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Compressed quadtree with content-addressable memory


    Beteiligte:
    Dekun Yang (Autor:in)


    Erscheinungsdatum :

    01.01.1994


    Format / Umfang :

    561584 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Compressed Quadtree with Content-Addressable Memory

    Yang, D. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    Compressed quadtree representations for storing similar images

    Lin, T.-W. | British Library Online Contents | 1997


    Content Addressable Memory System Concepts

    Campi, A. V. / Dunn, R. M. / Gray, B. H. | IEEE | 1965


    Block image retrieval based on a compressed linear quadtree

    Chan, Y. K. | British Library Online Contents | 2004