Abstract | ||
---|---|---|
Fractal image compression (FIC) is recognized as a NP-hard problem, and it suffers from a high number of mean square error (MSE) computations. In this paper, a two-phase algorithm was proposed to reduce the MSE computation of FIC. In the first phase, based on edge property, range and domains are arranged. In the second one, imperialist competitive algorithm (ICA) is used according to the classified blocks. For maintaining the quality of the retrieved image and accelerating algorithm operation, we divided the solutions into two groups: developed countries and undeveloped countries. Simulations were carried out to evaluate the performance of the developed approach. Promising results thus achieved exhibit performance better than genetic algorithm (GA)-based and Full-search algorithms in terms of decreasing the number of MSE computations. The number of MSE computations was reduced by the proposed algorithm for 463 times faster compared to the Full-search algorithm, although the retrieved image quality did not have a considerable change. |
Year | DOI | Venue |
---|---|---|
2014 | 10.1186/1687-6180-2014-112 | EURASIP J. Adv. Sig. Proc. |
Keywords | Field | DocType |
Fractal image compression, Optimization method, Image quality, Intelligent competitive algorithm, Imperialist competitive algorithm, Genetic algorithms | Fractal compression,Computer science,Fuzzy logic,Image quality,Mean squared error,Algorithm,Artificial intelligence,Imperialist competitive algorithm,Genetic algorithm,Machine learning,Computation | Journal |
Volume | Issue | ISSN |
2014 | 1 | 1687-6180 |
Citations | PageRank | References |
3 | 0.39 | 16 |
Authors | ||
6 |
Name | Order | Citations | PageRank |
---|---|---|---|
Ali Nodehi | 1 | 3 | 0.39 |
Ghazali Sulong | 2 | 40 | 8.26 |
Mznah Al-Rodhaan | 3 | 306 | 22.90 |
Amjad Rehman | 4 | 181 | 23.00 |
Abdullah Al-Dhelaan | 5 | 523 | 39.77 |
Tanzila Saba | 6 | 326 | 47.33 |