Share Email Print
cover

Optical Engineering

Novel fractal image-encoding algorithm based on a full-binary-tree searchless iterated function system
Author(s): Xianwei Wu; David Jeff Jackson; Hui-Chuan Chen
Format Member Price Non-Member Price
PDF $20.00 $25.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We present a novel fractal encoding method, based on a full-binary-tree searchless iterated function system (FBSIFS), that encodes image range blocks based on a fixed-location domain block. This algorithm is capable of encoding much smaller range blocks than traditional fractal algorithms, extending to 2×2 and 2×1 range blocks or even single image pixels. The FBSIFS method employs a rectangular block decomposition, similar in nature to the more general horizontal-vertical partitioning scheme. However, the proposed method has a simpler structure, similar to quadtree partitioning. Experimental results show that this algorithm is capable of providing superior performance, in terms of encoding time, compression rate, and reconstructed image quality, to traditional search-based fractal methods. The searchless binary-tree partition method also has better performance than searchless quadtree partition methods. A comparison with existing search-based and searchless fractal algorithms is presented, including compression rate, peak SNR of the reconstructed image, and algorithm complexity. A JPEG comparison is also presented.

Paper Details

Date Published: 1 October 2005
PDF: 13 pages
Opt. Eng. 44(10) 107002 doi: 10.1117/1.2076828
Published in: Optical Engineering Volume 44, Issue 10
Show Author Affiliations
Xianwei Wu, The Univ. of Alabama at Tuscaloosa (United States)
David Jeff Jackson, The Univ. of Alabama at Tuscaloosa (United States)
Hui-Chuan Chen, The Univ. of Alabama at Tuscaloosa (United States)


© SPIE. Terms of Use
Back to Top