Abstract
We investigate 2-tape weighted finite automata called weighted finite transducers (WFT) and their applications to image processing. We show that probabilistic mutually recursive function systems (PMRFS) can be simulated by iterative weighted fimite transductions. We conjecture that iterative WFT are stronger than PMRFS and give examples of WFT that support this conjecture. We also show that the family of images defined by iterative WFT is closed under continuous invertible WFT relations which include invertible affine transformations as a special case. We give examples of iterative WFT which can compute mathematical functions given by a Taylor series with “regular” coefficients which cannot be computed by WFA. We discuss the implementation of an efficient image manipulation system which includes the implementation of efficient algorithms for the application of a WFT to an image in either pixel or WFA representation and for composition of WFT. The system also includes the Culik-Kari recursive WFA inference algorithm as a conversion from pixel representation to WFA representation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M.F. Barnsley: Fractals Everywhere, Academic Press, 1988
M.F. Barnsley, L.P. Hurd: Fractal Image Compression, A.K. Peters, Ltd., 1993
K. Culik II, S. Dube: Balancing order and Chaos in Image generation, Computers & Graphics17, 465–486 (1993)
K. Culik II, S. Dube: Affine Automata and Related Techniques for Generation of Complex Images. Theoretical Computer Science116, 373–398 (1993)
K. Culik II, I. Friš: Weighted Finite Transducers in Image Processing. Discrete Applied Mathematics (to appear)
K. Culik II, J. Karhumäki: Finite Automata Computing Real Functions. SIAM Journal on Computing23, 789–814 (1994)
K. Culik II, J. Kari: Image Compression Using Weighted Finite Automata. Computers & Graphics17, 305–313 (1993)
K. Culik II, J. Kari: Inference Algorithms for WFA and Image Compression, in: Fractal Image Compression, Y. Fisher, ed., Springer Verlag, 1994, pp. 243–258
K. Culik II, J. Kari: Image-Data Compression Using Edge-Optimizing Algorithm for WFA Inference. Journal of Information Processing and Management30, 829–838 (1994)
K. Culik II, J. Kari: Finite State Transformations of Images. Technical report TR 9401, Department of Computer Science, University of South Carolina, 1994
K. Culik II, J. Kari: Computational Fractal Geometry with WFA. Technical report TR 9402, Department of Computer Science, University of South Carolina, 1994
D. Derencourt, J. Karhumäki, M. Latteux, A. Terlutte: On Computational Power of Weighted Finite Automata. In: Proceedings of Mathematical Foundations of Computer Science '92, Prague, Czechoslovakia, I.M. Havel, V. Koubek, eds., Lecture Notes in Computer Science 629, Springer-Verlag, Berlin, Germany, 1992, pp. 236–245
S. Eilenberg: Automata, Languages and Machines, vol. A, Academic Press, New York (1974)
P. Rajcani, Applications of Weighted Finite Automata and Transducers To Image Processing, Ph.D. Thesis, Department of Computer Science, University of South Carolina, 1995
Author information
Authors and Affiliations
Additional information
This work was supported by the National Science Foundation under Grant No. CCR-9202396. The work of the second author was partially supported by Grant of Slovak Academy of Sciences No. 88 and by EC Cooperative Action IC 1000 “Algorithms for Future Technologies” (Project ALTEC)
Rights and permissions
About this article
Cite this article
Culik, K., Rajčáni, P. Iterative weighted finite transductions. Acta Informatica 32, 681–703 (1995). https://doi.org/10.1007/BF01186646
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01186646