Please use this identifier to cite or link to this item:
|Title:||An efficient parallel algorithm for hexagonal-based fractal image compression|
|Authors:||Ong, G.-H. |
|Citation:||Ong, G.-H., Fan, L. (2007). An efficient parallel algorithm for hexagonal-based fractal image compression. International Journal of Computer Mathematics 84 (2) : 203-218. ScholarBank@NUS Repository. https://doi.org/10.1080/00207160601168548|
|Abstract:||A two-level fast search algorithm to reduce the encoding time for hexagonal-based fractal image compression is presented. The design of the sequential algorithm is based on the distribution of matched domains in a given image. The first search level previews various portions of the image and identifies promising domains among all possible domains. The second search level picks out domain blocks in the image portion where the first level gives positive results, and compares them with a given range block for encoding. The algorithm is parallelized by a dynamic range distribution scheme to achieve load balancing. Experimental results show that by running the parallelized encoding algorithm on multiple processors, the encoding time is drastically reduced while the quality of image reconstruction is retained. A speed-up of about 9 can be obtained by using 13 processors.|
|Source Title:||International Journal of Computer Mathematics|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Mar 12, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.