FRACTAL IMAGE COMPRESSION

Presented By: SARIKA RANI EC 3rd year

What is Fractal Image Compression History of Fractal Image Compression Mathematical Background How does it works ? Encoding Theory Decoding Theory Examples Iteration process in fractal image compression Advantages Disadvantages Applications References

 Fractal

compression is a lossy compression. method for digital images, based on fractals. The method is best suited for textures and natural images, relying on the fact that parts of an image often resemble other parts of the same image. Fractal algorithms convert these parts into mathematical data called "fractal codes" which are used to recreate the encoded image.

 Michael

Barnsley led development of fractal compression in 1987, and was granted several patents on the technology. The most widely known practical fractal compression algorithm was invented by Barnsley and Alan sloan. Michael Barnsley and Alan Sloan formed Iterated Systems Inc. in 1987 which was granted over 20 additional patents related to fractal compression. Barnsley's graduate student Arnaud Jacquin implemented the first automatic algorithm in software in 1992.

 Started

with Michael Barnsley, and refined by A. Jacquin Try and find a set of transforms that map an image onto itself. The key is the Collage Theorem

States that if the error difference between the target image and the transformation of that image is less than a certain value the transforms are an equivalent representation of the image.

Take a starting image and divide it into small, nonoverlapping, square blocks, typically called parent blocks. Divide each parent block into 4 each blocks, or child blocks. Compare each child block against a subset of all possible overlapping blocks of parent block size.

Need to reduce the size of the parent to allow the comparison to work.

Determine which larger block has the lowest difference, according to some measure, between it and the child block. Calculate a grayscale transform to match intensity levels between large block and child block precisely. Typically an affine transform is used (w*x = a*x + b) to match grayscale levels.

Upper left corner child block, very similar to upper right parent block. Compute affine transform. Store location of parent block (or transform block), affine transform components, and related child block into a file. Repeat for each child block. Lots of comparisons can calculations.
256x256 original image 16x16 sized parent blocks 241*241 = 58,081 block comparisons

 Read

in child block and tranform block position, transform, and size information. Use any blank starting image of same size as original image For each child block apply stored transforms against specified transform block Overwrite child block pixel values with transform block pixel values Repeat until acceptable image quality is reached.

 Original

Image

Starting

Image for Decoding

First iteration

Second Iteration

 Fifth

Iteration

Tenth

Iteration

 Different

type of compression scheme worth

exploring Takes advantage of similarities within an image Advanced detail interpolation High theoretical compression rates Fast decompression times

 Greatest

weakness is time for encoding

Possible speed ups

Order transform blocks into domains based off of average intensity and variance Only search through blocks with similar structures Do not search all possible blocks Reduce number of child blocks

Quality

through

and Compression Improvements

Quadtrees or HV Trees Rotations of Transform Blocks during comparison Improved grayscale transforms

 Able

to send out the compressed images with minimal delay. Eg: live broadcast of video over a network tele-conferencing videophone

1. Anson, L.F., "Fractal Image Compression", BYTE, Oct. 1993, p. 195-202. 2. Barnsley, M.F., Fractal Everywhere, 2nd ed., Academic Press, San Diego, 1993. 3. Barnsley, M.F., "Fractal Image Compression", Notices of the AMS, June 1996, p. 657-662. 4. Barnsley, M.F., and Demko, S., "Iterated function systems and the global construction of fractals", Proc. R. Soc. London, A 399 (1985), p. 243-275. 5. Barnsley, M.F., and Hurd, L.P., Fractal Image Compression, AK Peters, Ltd., Wellesley, Massachusetts, 1992. 6. Barnsley, M.F., and Sloan, A.D.,"A better way to compress images", BYTE, January 1988, p. 215-218. 7. Bryan, J. "Compression Scoreboard", BYTE, May 1995, p. 107-112.