DocumentCode :
3434994
Title :
Stochastic image compression using fractals
Author :
Kapoor, Aditya ; Arora, Kush ; Jain, Ajai ; Kapoor, G.P.
Author_Institution :
Dept. of Comput. Sci., Inst. of Eng. & Technol., Kanpur, India
fYear :
2003
fDate :
28-30 April 2003
Firstpage :
574
Lastpage :
579
Abstract :
Fractal objects like the Sierpinski triangle and Fern have very high visual complexity and low storage-information content. For generating computer graphic images and compression of such objects, iterated function systems (IFS) (Barnsley; Jacquin (1992)) are used. The main problem in fractal encoding using IFS is the large amount of time taken for the compression of the fractal object. Our endeavor in the present paper is to use a stochastic algorithm to improve upon the compression time as well as compression ratio obtained in Jacquin, while maintaining the image quality. Our results show that we are able to reduce time taken for compression of images by 55%-80% and the size by 60%-80% as compared to the nonstochastic algorithm.
Keywords :
computer graphics; data compression; fractals; image coding; stochastic processes; Fern; IFS; Sierpinski triangle; compression ratio; compression time; computer graphic image generation; fractal encoding; fractal object; fractals; image compression; image quality; iterated function systems; stochastic image compression; storage-information content; visual complexity; Computer graphics; Computer science; Fractals; Image coding; Image generation; Image quality; Image storage; Mathematics; Partitioning algorithms; Stochastic processes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Technology: Coding and Computing [Computers and Communications], 2003. Proceedings. ITCC 2003. International Conference on
Print_ISBN :
0-7695-1916-4
Type :
conf
DOI :
10.1109/ITCC.2003.1197593
Filename :
1197593
Link To Document :
بازگشت