Related papers: Novel method of fractal approximation
Iterated function systems (IFS) can be a surprisingly useful tool for studying structure in data. Here we present results stemming from a 2013 computational study by the author using IFS. The results include fractal patterns that reveal…
This paper sets a theoretical foundation for the applications of the fractal interpolation functions (FIFs). We construct rational cubic spline FIFs (RCSFIFs) with quadratic denominator involving two shape parameters. The elements of the…
Given a graphical model (GM), computing its partition function is the most essential inference task, but it is computationally intractable in general. To address the issue, iterative approximation algorithms exploring certain local…
We present an Expectation-Maximization algorithm for the fractal inverse problem: the problem of fitting a fractal model to data. In our setting the fractals are Iterated Function Systems (IFS), with similitudes as the family of…
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 interpolation functions (FIFs) generated using iterated function systems (IFS) provide a powerful framework for modeling self-similar and irregular data, yet traditional constructions often neglect geometric fidelity such as…
We study the problem of approximating the partition function of the ferromagnetic Ising model in graphs and hypergraphs. Our first result is a deterministic approximation scheme (an FPTAS) for the partition function in bounded degree graphs…
We consider finite approximations of a fractal generated by an iterated function system of affine transformations on $\mathbb{R}^d$ as a discrete set of data points. Considering a signal supported on this finite approximation, we propose a…
This paper presents a new approach of constructing $\alpha$-fractal interpolation functions (FIFs) using neural network operators, integrating concepts from approximation theory. Initially, we construct $\alpha$-fractals utilizing neural…
Local iterated function systems are an important generalisation of the standard (global) iterated function systems (IFSs). For a particular class of mappings, their fixed points are the graphs of local fractal functions and these functions…
Iterative Proportional Fitting (IPF), combined with EM, is commonly used as an algorithm for likelihood maximization in undirected graphical models. In this paper, we present two iterative algorithms that generalize upon IPF. The first one…
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…
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 introduce a duality for Affine Iterated Function Systems (AIFS) which is naturally motivated by group duality in the context of traditional harmonic analysis. Our affine systems yield fractals defined by iteration of contractive affine…
We provide an overview of iterated function systems (IFS), where randomly chosen state-to-state maps are applied iteratively to a state. We aim to summarize the state of art and, where possible, identify fundamental challenges and…
In this paper, we introduce a new method for calculating fractional integrals and differentials. The method involves an equation that we have obtained from infinite applied integration by parts. The equation works for special class of…
In a widely-studied class of multi-parametric optimization problems, the objective value of each solution is an affine function of real-valued parameters. Then, the goal is to provide an optimal solution set, i.e., a set containing an…
This work proposes a variable neighbourhood search (FTS) that uses a fractal-based local search primarily designed for images. Searching for specific content in images is posed as an optimisation problem, where evidence elements are…
We give fully polynomial-time approximation schemes (FPTAS) for the partition function of ferromagnetic 2-spin systems in certain parameter regimes. The threshold we obtain is almost tight up to an integrality gap. Our technique is based on…
This paper presents a description and analysis of a rational cubic spline FIF (RCSFIF) that has two shape parameters in each subinterval when it is defined implicitly. To be precise, we consider the iterated function system (IFS) with…