Finite Algorithms for decoding recurrent iterated function systems
File(s)
Technical report
Author(s)
Edalat, Abbas
Type
Report
Abstract
We present two finite algorithms, the recurrent probabilistic domain algorithm for decoding a recurrent iterated function system (IFS) and the vector recurrent probabilistic domain algorithm for decoding a vector recurrent IFS on the digitised screen. Recurrent IFSs and vector recurrent IFSs are used for fractal image compression and our algorithms are the first finite algorithms in the state of art. They have the following advantages compared to the previous two known algorithms in the field: Our algorithms terminate in finite time on any digitised screen withoutneeding to fix a number of iterations in advance.There is a simple complexity analysis for the algorithms. The algorithms produce a good quality image up to several times faster than the other algorithms.
Date Issued
1995-01-01
Citation
Departmental Technical Report: 95/1, 1995, pp.1-21
ISSN
1469-4174
Publisher
Department of Computing, Imperial College London
Start Page
1
End Page
21
Journal / Book Title
Departmental Technical Report: 95/1
Copyright Statement
© 1995 E. Adalat. This report is available open access under a CC-BY-NC-ND licence (https://creativecommons.org/licenses/by-nc-nd/4.0/)