Fractal decoding algorithm for fast convergence

Hyun-Soo Kang; Seong-Dae Kim

doi:10.1117/1.601058

1 November 1996 Fractal decoding algorithm for fast convergence

Hyun-Soo Kang, Seong-Dae Kim

Optical Engineering, Vol. 35, Issue 11, (November 1996). https://doi.org/10.1117/1.601058

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.

Citation Download Citation

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

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available