Share Email Print

Optical Engineering

Fractal decoding algorithm for fast convergence
Author(s): Hyun-Soo Kang; Seong-Dae Kim
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

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.

Paper Details

Date Published: 1 November 1996
PDF: 8 pages
Opt. Eng. 35(11) doi: 10.1117/1.601058
Published in: Optical Engineering Volume 35, Issue 11
Show Author Affiliations
Hyun-Soo Kang, KAIST (South Korea)
Seong-Dae Kim, Korea Advanced Institute of Science and Technology (South Korea)

© SPIE. Terms of Use
Back to Top