A parallel implementation of a fractal image compression algorithm

Author

Stapleton, William A. ; Mahmoud, Wagdy ; Jackson, David Jeff

Author_Institution

Dept. of Electr. Eng., Alabama Univ., Tuscaloosa, AL, USA

fYear

1996

fDate

31 Mar-2 Apr 1996

Firstpage

332

Lastpage

336

Abstract

Presented in this paper are experimental results for a parallel implementation of a fractal image compression algorithm. The fractal image compression process exhibits a natural parallelism and the specific parallel implementation is shown to be beneficial for the execution speed of the algorithm. Furthermore, computational speed has been enhanced through an algorithmic modification employing a quadtree recomposition approach in which quadtree subblocks are iteratively combined into larger ranges for fractal encoding. Furthermore, classification schemes which serve to reduce the O(n⁴) algorithmic complexity are explored

Keywords

computational complexity; computer vision; data compression; fractals; iterative methods; parallel algorithms; quadtrees; algorithmic complexity; fractal encoding; fractal image compression; iterative method; mean square error; parallel algorithm; quadtree recomposition; quadtree subblocks; Compression algorithms; Decoding; Discrete cosine transforms; Fractals; Image coding; Image quality; Iterative algorithms; Parallel processing; Pipelines; Testing;

fLanguage

English

Publisher

ieee

Conference_Titel

System Theory, 1996., Proceedings of the Twenty-Eighth Southeastern Symposium on

Conference_Location

Baton Rouge, LA

ISSN

0094-2898

Print_ISBN

0-8186-7352-4

Type

conf

DOI

10.1109/SSST.1996.493524

Filename

493524