Related papers: A multiresolution algorithm to approximate the Hut…
The study of generalized iterated function systems (GIFS) was introduced by Mihail and Miculescu in 2008. We provide a new approach to study those systems as the limit of the Hutchinson-Barnsley setting for infinite iterated function…
The notion of $\ast$-measure on a compact Hausdorff space can be defined for arbitrary continuous triangular norm $\ast$. The well-known Hutchinson-Barnsley theory deals with the iterated function systems (IFSs) of probability measures and…
We present algorithms to compute approximations of invariant measures and its attractors for IFS and GIFS, using the deterministic algorithm in a tractable way, with code optimization strategies and use of data structures and search…
We study invariant sets and measures generated by iterated function systems defined on countable discrete spaces that are uniform grids of a finite dimension. The discrete spaces of this type can be considered as models of spaces in which…
In this work we present iterated function systems with general measures(IFSm) formed by a set of maps $\tau_{\lambda}$ acting over a compact space $X$, for a compact space of indices, $\Lambda$. The Markov process $Z_k$ associated to the…
In this paper we discuss a new method to blend fractal attractors using the code map for the IFS formed by the Hutchinson--Barnsley operators of a finite family of hyperbolic IFSs. We introduce a parameter called blending coefficient to…
We provide a new algorithm to generate images of the generalized fuzzy fractal attractors described in Oliveira-2017. We also provide some important results on the approximation of fractal operators to discrete subspaces with application to…
In the paper we unify two extensions of the classical Hutchinson--Barnsley theory - the topological and the fuzzy-set approaches. We show that a fuzzy iterated function system (fuzzy IFS) on a Tychonoff space $X$ which is contracting w.r.t.…
Miculescu and Mihail in 2008 introduced a concept of a generalized iterated function system (GIFS in short), a particular extension of classical IFS. Instead of families of selfmaps of a metric space $X$, they considered families of…
Cabrelli, Forte, Molter and Vrscay in 1992 considered a {fuzzy} version of the theory of iterated function systems (IFSs in short) and their fractals%The idea was to extend the classical Hutchinson-Barnsley operator to selfmaps of a metric…
A new method for approximating fractional derivatives of the Gaussian function and Dawson's integral are presented. Unlike previous approaches, which are dominantly based on some discretization of Riemann-Liouville integral using polynomial…
We consider a class of iterated function systems (IFSs) of contracting similarities of $R^n$, introduced by Hutchinson, for which the invariant set possesses a natural H\"older continuous parameterization by the unit interval. When such an…
We consider the dimension and measure of typical attractors of random iterated function systems (RIFSs). We define a RIFS to be a finite set of (deterministic) iterated function systems (IFSs) acting on the same metric space and, for a…
In [14], the authors developed a new approach to the computation of the Hausdorff dimension of the invariant set of an iterated function system or IFS. In this paper, we extend this approach to incorporate high order approximation methods.…
Given an iterated function system (IFS) on a complete and separable metric space $Y$, there exists a unique compact subset $X \subseteq Y$ satisfying a fixed point relation with respect to the IFS. This subset is called the attractor set,…
We present an efficient deterministic hypothesis generation algorithm for robust fitting of multiple structures based on the maximum feasible subsystem (MaxFS) framework. Despite its advantage, a global optimization method such as MaxFS has…
We consider Bayesian inference problems with computationally intensive likelihood functions. We propose a Gaussian process (GP) based method to approximate the joint distribution of the unknown parameters and the data. In particular, we…
A classical theorem of Hutchinson asserts that if an iterated function system acts on $\mathbb{R}^d$ by similitudes and satisfies the open set condition then it admits a unique self-similar measure with Hausdorff dimension equal to the…
Laplace's method approximates a target density with a Gaussian distribution at its mode. It is computationally efficient and asymptotically exact for Bayesian inference due to the Bernstein-von Mises theorem, but for complex targets and…
The paper proposes a new algorithm for the high-dimensional financial data -- the Groupwise Interpretable Basis Selection (GIBS) algorithm, to estimate a new Adaptive Multi-Factor (AMF) asset pricing model, implied by the recently developed…