Professional Documents
Culture Documents
Presented by
Sushruta Pradhan
Roll # CS200118309
Dr. S.K.Meher
OVERVIEW
• Introduction
• What is fractal image compression?
• How much Compression can Fractal achieve?
• Theorem realated to fractal image compression
• Procedure for Fractal Compression
• Encoding Algorithm
INTRODUCTION
NATIONAL INSTITUTE OF SCIENCE & TECHNOLOGY
FRACTAL BASICS
NATIONAL INSTITUTE OF SCIENCE & TECHNOLOGY
• All the copies seem to converge to the same final image of small size.
•
ITERATED FUNCTION
NATIONAL INSTITUTE OF SCIENCE & TECHNOLOGY
SYSTEM
• We have seen that IFS can be used Simulate very
realistic, natural looking
pictures
• If such an IFS can be found, then we can achieve very
high compression since IFS only involve storing a few
numbers to define the affine transformations
CONT..
ENCODING ALGORITHM
• i) Image name, image size, minimum partition
exponent, maximum partition exponent (both
of which determine the size of domains and
ranges), tolerance for fidelity, e.g. xxx.img,
256x256,4(corresponding to 16x16 blocks),
(corresponding to 4x4 blocks), 0 (corresponding
to tolerance as zero).
• 1) Determine the parameters for compressing:
• 2) Read the image to be compressed.
CONT..
• 3) Process ‘domains’
• (a).Scale the image by calculating the average values
of each four-pixel group,
• then save the calculated values into an array
‘domain’
• (b).Divide the image (in ‘domain’) into overlapping
domains (16x16 or 8x8)
• (c).Divide each domain block into 4 quadrants and
calculate the varianc
• of each quadrant.
• CONT..
CONCLUSION
• So called because of the similarities between the
form of image representation and a mechanism
widely used in generating deterministic fractal
images, fractal compression represents an image by
the parameters of a set of affine transforms on
image blocks under which the image is
approximately invariant.