Academic Editor: Youssef EL FOUTAYENI
Received |
Accepted |
Published |
31 January 2020 |
15 February 2020 |
10 March 2020 |
Abstract: Fractal image encoding (FIC) [1] is time consuming due to the search of the matching between range and domain blocks. In order to reduce the encoding time, many improved approaches where developed among which some genetic algorithm (GA) [2-5] schemes. In the present study, we propose a new GA scheme to reduce the computational complexity of FIC. In this scheme, we modify the GA to use only domain blocks that have the potential to be the best candidate in the search of matching. Thus, the number of comparisons will decrease resulting in reduction in computation time. In the experimental tests, we compared our scheme to the full search and previous GA schemes performed on some test images. The proposed GA scheme speed up the time encoding with preserving the image quality and with a slight decrease of the compression ratio. The quadtree partitioning used in our GA scheme gives better image quality than the square partition used in previous schemes.
