Algorithm computes coefficients of integer cosine transforms, containing only integer coefficients approximately proportional to floating-point coefficients of discrete cosine transforms. Used in compression of image data in blocks of N x N pixels, discrete cosine transforms involve large amounts of computation, typically amounting to 80 percent of computational load in data-compression scheme. In constructing integer approximations, competing requirements are to obtain data-compression and data-decompression performances comparable to those of corresponding descrete cosine transforms while taking advantage of simplicity afforded by integer arithmetic to reduce complexity and amount of computation.


    Access

    Access via TIB

    Check availability in my library


    Export, share and cite



    Title :

    Algorithm For Integer Cosine Transforms


    Contributors:

    Published in:

    Publication date :

    1994-04-01



    Type of media :

    Miscellaneous


    Type of material :

    No indication


    Language :

    English




    Parameterized reversible integer discrete cosine transforms [5298-02]

    Bhamidipati, V. S. / Grigoryan, A. M. / Society for Imaging Science and Technology et al. | British Library Conference Proceedings | 2004


    New Algorithms for Short-Length Discrete Cosine Transforms

    Chicheva, M. A. | British Library Online Contents | 1999


    Chirp Hartley, Chirp cosine and Chirp sine transforms

    Yong, B. / Yinqing, Z. / Chunsheng, L. | British Library Online Contents | 2005


    Techniques for Processing Integer Cosine Transform Images From Galileo

    Mortensen, Helen B. / Thaller, Thomas F. | NTRS | 1997


    Fast Algorithms of Discrete Fourier and Cosine Transforms in Mixed Formats

    Pogribny, W. / Drechny, M. / IEEE | British Library Conference Proceedings | 2003