Self-affine and piecewise self-affine IFS fractal models have been used to model several different types of discrete sequences. The parameters of such models must be determined according to an opimization criterion. However, the general optimization problem is quite complex and some constraints have to be introduced. Several different constraints have been considered in this paper, and the best tradeoff between overall performances and computational complexity has been found. The optimal estimation of the fractal models parameters has been obtained by means of Genetic Algorithms and a very good convergence to the global minimum has been obtained. A comparison with suboptimal algorithms will be reported. Several types of discrete sequences h...
In this paper we describe an algorithm to find an Iterated Function System with associated probabili...
With the increasing demand in multimedia applications through various kinds of communication channel...
Convergence properties of genetic algorithms are investigated. For them some measures are introduced...
This paper addresses the problem of compression of data sequences for transmission or storage purpos...
It is known that speech signals posses some fractal properties. A novel approach for speech modeling...
In this paper, we describe an algorithm to estimate the parameters of Iterated Function System (IFS)...
In this work, we investigate the difficult problem of the optimization of fractal functions. We firs...
We describe the basics of one-dimensional IFS type fractals including their generation, the forward ...
Abstract:- Fractal is a tool in data fitness and interpolation. It’s better to fit complex graphs. B...
Abstract:-- Graph fitness optimization is a difficult problem in data fitness. Genetic algorithms(GA...
An extended iterated-function-system (IFS) interpolation method is presented for modelling for a giv...
The study of chaotic dynamical systems has given rise to a new geometry for classifying non-integral...
Today a wide variety of images may be expressed as the attractor A of an iterated function system in...
The inverse problem of fractal compression amounts to determining a contractive operator such that t...
Abstract—Fractal image compression explores the self-similarity property of a natural image and util...
In this paper we describe an algorithm to find an Iterated Function System with associated probabili...
With the increasing demand in multimedia applications through various kinds of communication channel...
Convergence properties of genetic algorithms are investigated. For them some measures are introduced...
This paper addresses the problem of compression of data sequences for transmission or storage purpos...
It is known that speech signals posses some fractal properties. A novel approach for speech modeling...
In this paper, we describe an algorithm to estimate the parameters of Iterated Function System (IFS)...
In this work, we investigate the difficult problem of the optimization of fractal functions. We firs...
We describe the basics of one-dimensional IFS type fractals including their generation, the forward ...
Abstract:- Fractal is a tool in data fitness and interpolation. It’s better to fit complex graphs. B...
Abstract:-- Graph fitness optimization is a difficult problem in data fitness. Genetic algorithms(GA...
An extended iterated-function-system (IFS) interpolation method is presented for modelling for a giv...
The study of chaotic dynamical systems has given rise to a new geometry for classifying non-integral...
Today a wide variety of images may be expressed as the attractor A of an iterated function system in...
The inverse problem of fractal compression amounts to determining a contractive operator such that t...
Abstract—Fractal image compression explores the self-similarity property of a natural image and util...
In this paper we describe an algorithm to find an Iterated Function System with associated probabili...
With the increasing demand in multimedia applications through various kinds of communication channel...
Convergence properties of genetic algorithms are investigated. For them some measures are introduced...