Related papers: A multiresolution algorithm to generate images 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…
The paper is devoted to searching algorithms which will allow to generate images of attractors of \emph{generalized iterated function systems} (GIFS in short), which are certain generalization of classical iterated function systems, defined…
We provide a new algorithm (called the grid algorithm) designed to generate the image of the attractor of a generalized iterated function system on a finite dimensional space and we compare it with the deterministic algorithm regarding…
We introduce the discrete version of the Hutchinson--Barnsley theory providing algorithms to approximate the Hutchinson measure for iterated function systems (IFS) and generalized iterated function systems (GIFS) complementing the discrete…
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…
This study develops a comprehensive theoretical and computational framework for Random Nonlinear Iterated Function Systems (RNIFS), a generalization of classical IFS models that incorporates both nonlinearity and stochasticity. We establish…
Orbital fuzzy iterated function systems are obtained as a combination of the concepts of iterated fuzzy set system and orbital iterated function system. It turns out that, for such a system, the corresponding fuzzy operator is weakly…
This preliminary paper presents initial explorations in rendering Iterated Function System (IFS) fractals using a differentiable rendering pipeline. Differentiable rendering is a recent innovation at the intersection of computer graphics…
We describe new families of random fractals, referred to as "V-variable", which are intermediate between the notions of deterministic and of standard random fractals. The parameter V describes the degree of "variability" : at each…
Fractal geometry, defined by self-similar patterns across scales, is crucial for understanding natural structures. This work addresses the fractal inverse problem, which involves extracting fractal codes from images to explain these…
An algorithm for calculating generalized fractal dimension of a time series using the general information function is presented. The algorithm is based on a strings sort technique and requires $O(N \log_2 N)$ computations. A rough estimate…
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…
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…
A simple, yet unifying method is provided for the construction of tilings by tiles obtained from the attractor of an iterated function system (IFS). Many examples appearing in the literature in ad hoc ways, as well as new examples, can be…
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.…
There has been a significant effort in recent years to generalize the traditional concept of iterated function systems (IFS).In this article, we proposed Suzuki contraction in hyperspace and finding out the fixed point for Hutchinson…
In the process of performing image super-resolution processing, the processing of complex localized information can have a significant impact on the quality of the image generated. Fractal features can capture the rich details of both micro…
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…
This paper further studies the fuzzy rough sets based on fuzzy coverings. We first present the notions of the lower and upper approximation operators based on fuzzy coverings and derive their basic properties. To facilitate the computation…
The intention of this article is to introduce a generalization of Proinov-type contraction via simulation functions. We name this generalized contraction map as Proinov-type Z-contraction. This article establishes the existence and…