Fractal compression using random encoding algorithm

• Autorzy: Świdzińska B.
• Języki publikacji: EN

Abstrakty

EN

Fractal image compression is a promising brand new compression method. In the paper several algorithms are compared. A majority of those algorithms accelerate the encoding process by reduction of the size of the domain pool. I show in the paper that unlike assumed in many algorithms, the optimal domain block need not be located in the close neighborhood of the range block. I suggest two techniques of solving this problem: (1) domain blocks are searched in the whole image, but they do not cover it, (2) the positions of domain blocks are random. The other algorithm looks particularly promising: it is fast and the quality of reconstruction is acceptable in most cases. The numerical results for both methods are given.

Słowa kluczowe

EN

digital image compression; fractals; fast fractal algorithm; encoding; iterated function system

• Wydawca: Polska Akademia Nauk, Wydział IV Nauk Technicznych
• Czasopismo: Bulletin of the Polish Academy of Sciences. Technical Sciences
• Rocznik: 1998
• Tom: Vol. 46, nr 4
• Strony: 525--532
• Opis fizyczny: Bibliogr. 5 poz., 6 rys., 1 tab.

Twórcy

autor

Świdzińska B.

• Institute of Electronics Fundamentals, Warsaw University of Technology, Nowowiejska 15/19, 00-665, Warsaw, Poland.

Bibliografia

• [1] M. F. Barnsley, Fractals everywhere, Academic Press, San Diego 1998.
• [2] A. Jacquin, Fractal image coding: A Review, Proc. IEEE, 81 (1993) 1451-1465.
• [3] Y. Fisher Fractal image compression theory and application to digital images, Springer-Verlag, 1995.
• [4] M. F. Barnsley, L. Hurd, Fractal Image Compression, Wellesley: AK Peters LTD, 1993.
• [5] B. Świdzińska, Improved fractal encoding algorithm, Proc. of the Polish-Czech-Hungarian Workshop on Circuit Theory, Signal Processing and Applications, Budapest, 3-7.09.1997, (1997) 34-39.