In this paper we describe an algorithm to find an Iterated Function System with associated probabilities (IFS) in order to generate a given coloured image. The proposed optimization algorithm, based on the gradient method combined with Simulated Annealing, is much faster than the Simulated Annealing algorithm. Actually, more than one order if magnitude improvement in computational time has been gained. The overall algorithm can be viewed as a Simulated Quenching (SQ) method, which is quite efficient for the problem under consideration. Convergence curves are reported and discussed and an example of coded image is included.
Fractal encoding of digital images with an optimization algorithm
MUMOLO, ENZO;
1994-01-01
Abstract
In this paper we describe an algorithm to find an Iterated Function System with associated probabilities (IFS) in order to generate a given coloured image. The proposed optimization algorithm, based on the gradient method combined with Simulated Annealing, is much faster than the Simulated Annealing algorithm. Actually, more than one order if magnitude improvement in computational time has been gained. The overall algorithm can be viewed as a Simulated Quenching (SQ) method, which is quite efficient for the problem under consideration. Convergence curves are reported and discussed and an example of coded image is included.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
