1 October 2005 Novel fractal image-encoding algorithm based on a full-binary-tree searchless iterated function system
Author Affiliations +
Optical Engineering, 44(10), 107002 (2005). doi:10.1117/1.2076828
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.
Xianwei Wu, David Jeff Jackson, Hui-Chuan Chen, "Novel fractal image-encoding algorithm based on a full-binary-tree searchless iterated function system," Optical Engineering 44(10), 107002 (1 October 2005). http://dx.doi.org/10.1117/1.2076828
JOURNAL ARTICLE
13 PAGES


SHARE
KEYWORDS
Fractal analysis

Image compression

Computer programming

Image quality

Iterated function systems

Reconstruction algorithms

Optical engineering

Back to Top