Matching pursuit (MP) video coding has been demonstrated to attain a better coding performance than DCT-based video coding in terms of PSNR and perceptual quality at very low bit rates. However, because of its massive computational complexity, the MP algorithm is usually only approximated. By approximating a residual in a subspace, we propose a multiple blocks search and update algorithm in MP video coding to achieve a faster and better MP approximation. In this paper, we evaluate the performance and compare it to the traditional one-block search algorithms. The experimental results show that our proposed algorithm can significantly improve the coding performance and encoding time.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Multiple blocks update algorithm for matching pursuit video coding


    Beteiligte:
    Jian-Liang Lin, (Autor:in) / Wen-Liang Hwang, (Autor:in) / Soo-Chang Pei, (Autor:in)


    Erscheinungsdatum :

    2005-01-01


    Format / Umfang :

    177652 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Multiple Blocks Update Algorithm for Matching Pursuit Video Coding

    Lin, J.-L. / Hwang, W.-L. / Pei, S.-C. | British Library Conference Proceedings | 2005


    Matching Pursuit for Compression and Application to Motion Compensated Video Coding

    Vetterli, M. / Kalker, T. / IEEE; Signal Processing Society | British Library Conference Proceedings | 1994


    Rate constrained block matching algorithm for video coding

    Bayazit, U. / Pearlman, W. A. | British Library Online Contents | 1998


    Tree structure search for matching pursuit

    Shoa, A. / Shirani, S. | IEEE | 2005


    Fast full search motion estimation algorithm using various matching scans in video coding

    Kim, J.-N. / Byun, S.-C. / Ahn, B.-H. | British Library Online Contents | 2002