9 November 2010 An efficient parallel processing approach to fractal image compression
Author Affiliations +
Abstract
Time complexity is one of the biggest problems for fractal image compression algorithm which can bring about high compression ratio. However, there is inherently data parallelism for fractal image compression algorithm. Naturally, parallel computation scheme would be used to deal with it. This paper uses "equal division load" balancing algorithm to design parallel fractal coding algorithm and implement the fractal image compression. "Equal division load" balancing algorithm distributes computation tasks to all processors equally. Load in every node is divided into smaller tasks based on all power of nodes on network, and then these smaller tasks are sent to corresponding nodes to balance the load among nodes. Analysis shows that the algorithm greatly reduces the component task execution time.
© (2010) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Xiaohong Xie, Rongteng Wu, "An efficient parallel processing approach to fractal image compression", Proc. SPIE 7850, Optoelectronic Imaging and Multimedia Technology, 785009 (9 November 2010); doi: 10.1117/12.871822; https://doi.org/10.1117/12.871822
PROCEEDINGS
6 PAGES


SHARE
RELATED CONTENT

TMS320C8x family architecture and future roadmap
Proceedings of SPIE (June 07 1996)
Evolutionary algorithm for compression of gray-scale images
Proceedings of SPIE (September 25 2001)
Approaching real-time processing for fractal compression
Proceedings of SPIE (January 10 1997)
New proposal for optical flip-flop using residue arithmetic
Proceedings of SPIE (November 08 2001)
Low-bit-rate fractal image coding
Proceedings of SPIE (June 24 1994)
Skeleton-chain coding for Chinese characters
Proceedings of SPIE (November 01 1992)

Back to Top