NDLI: Speeding Up Fractal Image Compression by Genetic Algorithms

Content Provider	Springer Nature Link
Author	Mohamed, Faraoun Kamel Aoued, Boukelif
Copyright Year	2005
Abstract	The main problem with all fractal compression implementation is execution time. Algorithms can spend hours to compress a single image. Most of the major variants of the standard algorithm for speeding up computation time have led to a bad-quality or a lower compression ratio. For example, the Fisher’s [7] proposed classification pattern greatly accelerated the algorithm, but image quality was poor due to the search-space reduction imposed by the classification, which eleminates a lot of good solutions.By using genetic algorithms to address the problem, we optimize the domain blocks search. We explore all domain blocks present in the image but not in exhaustive way (like a standard algorithm) and without omitting any possible block (solution) as a classification pattern does. A genetic algorithm is the unique method for satisfying these constraints. And it is a way to do be a random search because the genetic one is directed by fitness selection, which produces optimal solutions.Our goal in this work is to use a genetic algorithm to solve the IFS inverse problem and to build a fractal compression algorithm based on the genetic optimization of a domain blocks search. we have also implemented standard Barnsley algorithm, the Y. Fisher based on classification, and the genetic compression algorithm with quadtree partitioning. A population of transformations was evolved for each range block, and the result is compared with the standard Barnsely algorithm and the Fisher algorithm = based classification.We deduced an optimal set of values for the best parameters combination, and we can also specify the best combination for each desired criteria: best compression ratio, best image quality, or quick compression process. By running many test images, we experimentally found the following set of optimal values of all the algorithm parameters that ensure compromise between execution time and solutions optimality: Population size = 100, Maximum generations = 20, Crossover rate = 0.7, Mutation rate = 0.1, RMS limit = 5, Decomposition error limit = 10, Flips and isometrics count = 8.In our proposed algorithm, results were much better than those obtained both vences and Rudomin [5] and Lankhorst [4] approaches.
Starting Page	217
Ending Page	236
Page Count	20
File Format	PDF
ISSN	09236082
Journal	Multidimensional Systems and Signal Processing
Volume Number	16
Issue Number	2
e-ISSN	15730824
Language	English
Publisher	Kluwer Academic Publishers
Publisher Date	2005-01-01
Publisher Place	Dordrecht
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Artificial Intelligence (incl. Robotics) Electronic and Computer Engineering Signal, Image and Speech Processing Circuits and Systems
Content Type	Text
Resource Type	Article
Subject	Applied Mathematics Artificial Intelligence Signal Processing Information Systems Computer Science Applications Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Superresolution imaging: Theory, Algorithms and Applications

Region-based super-resolution for compression

Corresponding Authors

Multidimensional systems and signal processing editorial

Reconstruction and Decomposition Algorithms for Biorthogonal Multiwavelets

Prediction Capabilities of Boolean and Stack Filters for Lossless Image Compression

Special issue on multidimensional systems applications

Multidimensional systems and signal processing

Finite-Memory Systems

Speeding Up Fractal Image Compression by Genetic Algorithms

Similar Documents

Superresolution imaging: Theory, Algorithms and Applications

Region-based super-resolution for compression

Corresponding Authors

Multidimensional systems and signal processing editorial

Reconstruction and Decomposition Algorithms for Biorthogonal Multiwavelets

Prediction Capabilities of Boolean and Stack Filters for Lossless Image Compression

Special issue on multidimensional systems applications

Multidimensional systems and signal processing

Finite-Memory Systems

Speeding Up Fractal Image Compression by Genetic Algorithms