Iterative weighted finite transductions
Weighted finite transducers (WFT) and their application to image processing are investigated. It is shown that probabilistic mutually recursive function systems (PMRFS) can be simulated by iterative weighted finite transductions. It is conjectured that iterative WFT are stronger than PMRFS and examples of WFT that support this conjecture are given. Examples of iterative WFT, which compute mathematical functions given by a Taylor series with ``regular coefficients which cannot be computed by WFA, are given. An implementation of an efficient image manipulation system based on WFT is discussed. The system includes efficient algorithms for an application of a WFT transformation to an image in either pixel or WFA representation and for composition of WFT.
- scientific article; zbMATH DE number 2050927
- Iteration of invertible transductions
- Invertible transductions and iteration
- Iteration of rational transductions
- scientific article; zbMATH DE number 2143011
- Weighted finite transducers in image processing
- Weighted extended tree transducers
- ON THE GENERATIVE POWER OF ITERATED TRANSDUCTION
- Iterating invertible binary transducers
- N-WAY COMPOSITION OF WEIGHTED FINITE-STATE TRANSDUCERS
- Affine automata and related techniques for generation of complex images
- Computational fractal geometry with WFA
- Finite Automata Computing Real Functions
- scientific article; zbMATH DE number 194082 (Why is no real title available?)
- scientific article; zbMATH DE number 3497806 (Why is no real title available?)
- On the power of L-systems in image generation
- Weighted finite transducers in image processing
This page was built for publication: Iterative weighted finite transductions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1902304)