Most of hybrid motion compensated video coding standards uses a well known discrete cosine transform (DCT) at the encoder to remove redundancy from video random processes. Due to the huge number of computations required to compute the DCT, reduction of its complexity is essential to speed up video processing. To optimize the computation of the DCT, we take into account the fact that the output of the DCT has often small values. The goal is not to compute DCT coefficients that will be quantized towards zero. This method of computing only a subset of DCT coefficients is commonly referred as pruning. In this paper we propose a method to perform the pruning of the two-dimensional (2-D) DCT based on the algorithm proposed in E. Feig and S. Winograd (1992) for any number of low-frequency components.


    Zugriff

    Zugriff prüfen

    Verfügbarkeit in meiner Bibliothek prüfen

    Bestellung bei Subito €


    Exportieren, teilen und zitieren



    Titel :

    Fast 8/spl times/8 DCT pruning algorithm


    Beteiligte:
    Silva, A. (Autor:in) / Navarro, A. (Autor:in)


    Erscheinungsdatum :

    2005-01-01


    Format / Umfang :

    115873 byte




    Medientyp :

    Aufsatz (Konferenz)


    Format :

    Elektronische Ressource


    Sprache :

    Englisch



    Fast 8x8 DCT Pruning Algorithm

    Silva, A. / Navarro, A. | British Library Conference Proceedings | 2005


    An optimized FFT pruning algorithm

    Hu, Zhong / Chakravarthi, Prakash | AIAA | 2000


    An Optimized FFT Pruning Algorithm

    Hu, Z. / Chakravarthi, P. / American Institute of Aeronautics and Astronautics | British Library Conference Proceedings | 2000


    A Pruning Algorithm for Stable Voronoi Skeletons

    Beristain, A. | British Library Online Contents | 2012


    MDL Based Algorithm for Packet-DWT Tree Pruning

    Dobrescu, R. / Dobrescu, M. / IEEE et al. | British Library Conference Proceedings | 2003