Minimum Communication Cost Fractal Image Compression on PVM
Proceedings of the 6th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
Fast Fractal Image Compression
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
A New Probabilistic Approach for Fractal Based Image Compression
Fundamenta Informaticae
Fractal image compression with HV an emerging technique of image compression
Proceedings of the International Conference on Advances in Computing, Communication and Control
Contrast enhancement of images using Partitioned Iterated Function Systems
Image and Vision Computing
Contrast enhancement of images using partitioned iterated function systems
ACIVS'07 Proceedings of the 9th international conference on Advanced concepts for intelligent vision systems
A New Probabilistic Approach for Fractal Based Image Compression
Fundamenta Informaticae
A Study on Partitioned Iterative Function Systems for Image Compression
Fundamenta Informaticae
| Hi-index | 0.01 |
Presents work carried out on fractal (or attractor) image compression. The approach relies on the assumption that image redundancy can be efficiently exploited through self-transformability. The algorithms described utilize a novel region-based partition of the image that greatly increases the compression ratios achieved over traditional block-based partitionings. Due to the large search spaces involved, heuristic algorithms are used to construct these region-based transformations. Results for three different heuristic algorithms are given. The results show that the region-based system achieves almost double the compression ratio of the simple block-based system at a similar decompressed image quality. For the Lena image, compression ratios of 41:1 can be achieved at a PSNR of 26.56 dB