Scalability and others functionalities such as the region of interest encoding become essential properties of an efficient image coding scheme. Within the framework of lossless compression techniques, S+P and CALIC represent the state-of-the-art. The proposed interleaved S+P algorithm outperforms these method while providing the desired properties. Based on the LAR (locally adaptive resolution) method, an original pyramidal decomposition combined with a DPCM scheme is elaborated. This solution uses the S-transform in such a manner that a refined prediction context is available for each estimation steps. The image coding is done in two main steps, so that the first one supplies a LAR low-resolution image of good visual quality, and the second one allows a lossless reconstruction. The method exploits an implicit context modelling, intrinsic property of our content-based quad-tree like representation.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Interleaved S+P pyramidal decomposition with refined prediction model


    Beteiligte:
    Babel, M. (Autor:in) / Deforges, O. (Autor:in) / Ronsin, J. (Autor:in)


    Erscheinungsdatum :

    01.01.2005


    Format / Umfang :

    259195 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Interleaved S+P Pyramidal Decomposition with Refined Prediction Model

    Babel, M. / Deforges, O. / Ronsin, J. | British Library Conference Proceedings | 2005


    Pyramidal wall sections

    JACQUES JONATHAN | Europäisches Patentamt | 2020

    Freier Zugriff

    PYRAMIDAL WALL SECTIONS

    JACQUES JONATHAN | Europäisches Patentamt | 2018

    Freier Zugriff

    Pyramidal Hierarchical Relaxation

    Lau, W. H. / Hancock, E. / IEEE; Hong Kong Chapter of Signal Processing | British Library Conference Proceedings | 1994


    Random pyramidal texture modelling

    Rodriguez, J.M. | Online Contents | 1997