Fractal decoding algorithm for fast convergence

Cited 19 time in webofscience Cited 0 time in scopus
  • Hit : 255
  • Download : 0
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. (C) 1996 Society of Photo-Optical instrumentation Engineers.
Publisher
SOC PHOTO-OPT INSTRUM ENG
Issue Date
1996-11
Language
English
Article Type
Article
Citation

OPTICAL ENGINEERING, v.35, no.11, pp.3191 - 3198

ISSN
0091-3286
URI
http://hdl.handle.net/10203/77392
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 19 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0