Affine automata and related techniques for generation of complex images
The paper introduces two generalizations of Barnsley's Iterative Function Systems (IFS): Probabilistic Affine Automata and Mutual Recursive Function Systems. In particular, the latter turned out to be a powerful tool for image description and generation. A number of theoretical results about these systems is shown. Recently, Weighted Finite Automata (introduced in [\textit{K. Culik} II and \textit{J. Karhumäki}, Automata Computing Real Functions, SIAM J. Comput., to appear]) have proved to be an excellent tool for image compression [\textit{K. Culik} II and \textit{J. Kari}, Image Compression Using Weighted Finite Automata, Computer and Graphics vol. 17, 3, 305-313 (1993)] and [\textit{K. Culik} II and \textit{J. Kari}, Image-data Compression Using Edge-Optimizing Algorithm for WFA Inference, Journal of Information and Management, to appear]).
scientific article; zbMATH DE number 417323
scientific article