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

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.<>