Related papers: Iterated function systems, Ruelle operators, and i…
We present a general theory of fractal transformations and show how it leads to a new type of method for filtering and transforming digital images. This work substantially generalizes earlier work on fractal tops. The approach involves…
We discuss the most common types of weight functions in harmonic analysis and how they occur in \tfa . As a general rule, submultiplicative weights characterize algebra properties, moderate weights characterize module properties,…
We study random independent and identically distributed iterations of functions from an iterated function system of homeomorphisms on the circle which is minimal. We show how such systems can be analyzed in terms of iterated function…
This paper aims at formulating definitions of topological stability, structural stability, and expansiveness property for an iterated function system( abbrev, IFS). It is going to show that the shadowing property is necessary condition for…
For every $k \in \mathbb{N}$ let $f_k:[\frac{1}{k+1}, \frac{1}{k}] \to [0,1]$ be decreasing, linear functions such that $f_k(\frac{1}{k+1}) = 1$ and $f_k(\frac{1}{k}) = 0$, $k = 1, 2, \dots$. We define iterated function system (IFS) $S_n$…
A featured transition system is a transition system in which the transitions are annotated with feature expressions: Boolean expressions on a finite number of given features. Depending on its feature expression, each individual transition…
Consider the set of functions $f_{\theta}(x)=|\theta -x|$ on $\mathbb{R}$. Define a Markov process that starts with a point $x_0 \in \mathbb{R}$ and continues with $x_{k+1}=f_{\theta_{k+1}}(x_{k})$ with each $\theta _{k+1}$ picked from a…
This work aims at solving the problems with intractable sparsity-inducing norms that are often encountered in various machine learning tasks, such as multi-task learning, subspace clustering, feature selection, robust principal component…
We consider a construction of recurrent fractal interpolation surfaces with function vertical scaling factors and estimation of their box-counting dimension. A recurrent fractal interpolation surface (RFIS) is an attractor of a recurrent…
The present work is concerned with the eqiucontinuity and sensitivity of iterated function systems (IFSs). Here, we consider more general case of IFSs, i.e. the IFSs generated by a family of relations. We generalize the concepts of…
We study the convergence of random function iterations for finding an invariant measure of the corresponding Markov operator. We call the problem of finding such an invariant measure the stochastic fixed point problem. This generalizes…
The attractors of iterated function systems are usually obtained as the Hausdorff limit of any non-empty compact subset under iteration. In this note we show that an iterated function system on a boundedly compact metric space has compact,…
Iterated Function Systems (IFSs) have been at the heart of fractal geometry almost from its origin, and several generalizations for the notion of IFS have been suggested. Subdivision schemes are widely used in computer graphics and attempts…
In this paper we will introduce the methodology of analysis of the convex hull of the attractors of iterated functional systems (IFS) - compact fixed sets of self-similarity mapping. The method is based on a function which for a direction,…
In this article, we study the novel concept of non-stationary iterated function systems (IFSs) introduced by Massopust in 2019. At first, using a sequence of different contractive operators, we construct non-stationary $\alpha$-fractal…
We construct a pathwise calculus for functionals of integer-valued measures and use it to derive an martingale representation formula with respect to a large class of integer-valued random measures. Using these results, we extend the…
(I.) We consider generalizations of an iterated function system and the associated Markov operators. A Markov operator, defined on the space of (deficient) topological measures on a locally compact space, is an infinite convex linear…
In this work the numerical solution of acoustic tomography problem based on the iterative and functional-analytical algorithms is considered. The mathematical properties of these algorithms were previously described in works of R.G.Novikov…
Following the work of Louisa and Michael Barnsley on results in tops of iterated function systems, we extend their work to graph-directed iterated function systems by investigating the relationship between top addresses and shift spaces.…
Let $\{S_i\}_{i\in \Lambda}$ be a finite contracting affine iterated function system (IFS) on ${\Bbb R}^d$. Let $(\Sigma,\sigma)$ denote the two-sided full shift over the alphabet $\Lambda$, and $\pi:\Sigma\to {\Bbb R}^d$ be the coding map…