Fractal image compression has gone through more than twenty years developments among which, IFS based compression algorithm stands out as the most promising direction for further research and development. The basic idea is to represent an image by fractals. Each fractal is then represented by a so called IFS which consists of a group of affine transformations. Therefore, an input image can virtually be represented by a group of IFS codes rather than pixels. In this way, a compression ratio as high as 10000:1 can be achieved. Since the image is represented by fractals and each IFS consist of affine transformations, the key point for this algorithm is to find the affine transformation for each fractal and to find fractals which can best describe the original image. (3 pages)


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Image compression with fractals


    Contributors:

    Publication date :

    1995-01-01


    Size :

    1 pages



    Type of media :

    Article (Journal)


    Type of material :

    Print


    Language :

    English





    Rounded Fractals

    Eisenberg, M. | British Library Online Contents | 2008


    Dual fractals

    Ozawa, K. | British Library Online Contents | 2008


    Lasers, Kaleidoscopes, and Fractals

    McDonald, G. S. / New, G. H. C. / Woerdman, J. P. | British Library Online Contents | 2000


    The power of fractals

    Online Contents | 1994