1 November 1996 Fractal decoding algorithm for fast convergence
Hyun-Soo Kang, Seong-Dae Kim
Author Affiliations +
A fractal coding is discussed that concentrates on relieving excessive computation burden and improving image quality in encoding. But the convergence speed of the decoder is important because, in many applications, the encoding is done once, while the decoding is to be repeated many times. Because the well-known fractal coding scheme is based on the iterated function system (IFS), we cannot avoid the iterated transformation though the scheme can be done noniteratively in a special case. Such a transformation encounters difficulty in parallel processing and hence a fast decoding algorithm is necessary. An algorithm to speedup the decoding process is described. The analysis and the simulation results of the proposed method show that our algorithm is much faster than the conventional method.
Hyun-Soo Kang and Seong-Dae Kim "Fractal decoding algorithm for fast convergence," Optical Engineering 35(11), (1 November 1996). https://doi.org/10.1117/1.601058
Published: 1 November 1996
Lens.org Logo
CITATIONS
Cited by 18 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Fractal analysis

Image compression

Image processing

Computer programming

Image quality

Optical engineering

Image resolution

Back to Top