Deterministic scanning and hybrid algorithms for fast decoding of IFS [iterated function system] encoded image sets

Author

Cohen, Harvey A.

Author_Institution

Dept. of Comput. Sci. & Comput. Eng., La Trobe Univ., Bundoora, Vic., Australia

Volume

3

fYear

1992

fDate

23-26 Mar 1992

Firstpage

509

Abstract

Deterministic algorithms for decoding IFS (iterated function system) sets involve determining all the IFS (dynamic) descendants of seed pixels. Realistic algorithms require pruning of previously encountered pixels on the descendant tree. Timing data are reported for the random iteration algorithm, and for three new deterministic algorithms: the scanning algorithm; the stack algorithm; and a hybrid combination. Decoded timing data indicate the superiority of the pruned hybrid algorithm

Keywords

decoding; image coding; iterative methods; trees (mathematics); descendant tree; deterministic algorithms; encoded image sets; fast decoding; hybrid algorithms; iterated function system; pruning; random iteration algorithm; scanning algorithm; seed pixels; stack algorithm; timing data; Approximation algorithms; Computer science; Data structures; Decision trees; Image coding; Image segmentation; Iterative algorithms; Iterative decoding; Pixel; Timing;

fLanguage

English

Publisher

ieee

Conference_Titel

Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference on

Conference_Location

San Francisco, CA

ISSN

1520-6149

Print_ISBN

0-7803-0532-9

Type

conf

DOI

10.1109/ICASSP.1992.226164

Filename

226164