TY - GEN
T1 - A Real-time Quadtree Searchless Fractal Image Compression Device
AU - Ongwattanakul, Songpol
AU - Wu, Xianwei
AU - Jackson, David Jeff
N1 - Publisher Copyright:
Copyright © (2004) by the International Society for Computers and Their Applications. All rights reserved.
PY - 2004
Y1 - 2004
N2 - Fractal image compression is known to have a very high compression rate, but the encoding time is unacceptably long due to the search for the best match pairs between domain and range blocks. In this paper, we present a searchless iterative function system (SIFS) fractal encoding method that encodes image range blocks based on fixed location domain blocks. Therefore, the location parameter of the fractal code is not required. As a result, the range block can be as small as 2x2 pixels, and still maintain a good compression rate and image quality. A multi-level quadtree implementation of the searchless method based on a pyramid structure image is used to improve the compression rate and reduce the size of the circuit. An FPGA implementation confirms that the peak signal-to-noise ratio (PSNR) and the compression rate of the reconstructed image are similar to traditional search-based methods. The experiment on a 512x512 gray-scale image shows that the encoding time requires approximately 2.7 ms. This provides the basis for real-time fractal image compression.
AB - Fractal image compression is known to have a very high compression rate, but the encoding time is unacceptably long due to the search for the best match pairs between domain and range blocks. In this paper, we present a searchless iterative function system (SIFS) fractal encoding method that encodes image range blocks based on fixed location domain blocks. Therefore, the location parameter of the fractal code is not required. As a result, the range block can be as small as 2x2 pixels, and still maintain a good compression rate and image quality. A multi-level quadtree implementation of the searchless method based on a pyramid structure image is used to improve the compression rate and reduce the size of the circuit. An FPGA implementation confirms that the peak signal-to-noise ratio (PSNR) and the compression rate of the reconstructed image are similar to traditional search-based methods. The experiment on a 512x512 gray-scale image shows that the encoding time requires approximately 2.7 ms. This provides the basis for real-time fractal image compression.
KW - image compression
KW - real-time fractal image encoding
KW - searchless algorithm
UR - https://www.scopus.com/pages/publications/34248399359
M3 - Conference contribution
AN - SCOPUS:34248399359
T3 - 19th International Conference on Computers and Their Applications 2004, CATA 2004
SP - 1
EP - 5
BT - 19th International Conference on Computers and Their Applications 2004, CATA 2004
A2 - Gupta, Bidyut
PB - The International Society for Computers and Their Applications (ISCA)
T2 - 19th International Conference on Computers and Their Applications, CATA 2004
Y2 - 18 March 2004 through 20 March 2004
ER -