Name
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. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1080/00207160601168548 | Int. J. Comput. Math. |
Keywords | Field | DocType |
dynamic range distribution scheme,image portion,two-level fast search algorithm,hexagonal-based fractal image compression,search level preview,search level pick,efficient parallel algorithm,sequential algorithm,encoding time,image reconstruction,parallelized encoding algorithm,search algorithm,fractals,parallel algorithm,image compression,fractal image compression,dynamic range,parallel processing,load balance | Iterative reconstruction,Mathematical optimization,Search algorithm,Fractal compression,Parallel algorithm,Computer science,Sequential algorithm,Fractal transform,Image compression,Encoding (memory) | Journal |
Volume | Issue | ISSN |
84 | 2 | 0020-7160 |
Citations | PageRank | References |
1 | 0.48 | 4 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ghim-Hwee Ong | 1 | 14 | 3.89 |
| Lixin Fan | 2 | 1 | 0.48 |