Abstract
In this paper we present a model and experimental results for performing parallel fractal image compression using circulating pipeline computation and employing a new quadtree recomposition approach. A circular linear array of processors is employed and utilized in a pipelined fashion. In this approach, a modification of the scheme given by Jackson and Blom, quadtree sub-blocks of an image are iteratively recombined into larger blocks for fractal coding. For complex images, this approach exhibits superior parallel runtime performance when compared to a classical quadtree decomposition scheme for fractal image compression, while maintaining high fidelity for reconstructured images. Quantitative results include parallel runtime comparisons with the decomposition approach for several images of varying complexity, an evaluation of attained compression ratios and SNR for reconstructed images. Experimental results using an nCUBE-2 supercomputer are presented.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
