Mathematical framework to show the existence of attractor of partitioned iterative function systems
β Scribed by Suman K. Mitra; C.A. Murthy
- Publisher
- Elsevier Science
- Year
- 2000
- Tongue
- English
- Weight
- 659 KB
- Volume
- 33
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
β¦ Synopsis
The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is Partitioned or local Iterative Function System (PIFS) for coding the gray-level images. Several techniques of PIFS-based image compression have already been proposed by many researchers. The theory of PIFS appears to be di!erent from the theory of IFS in the sense of application domain. The present article discusses some basic di!erences between IFS and PIFS and provides a separate mathematical formulation for the existence of attractor of partitioned IFS. In particular, it has been shown that the attractor exists and it is an approximation of the given target image. The experimental results have also been presented in support of the theory. The experimental results have been obtained by using a GA-based PIFS technique proposed by Mitra et al. (IEEE Trans. Image Process. 7 (4) (1998) 586}593).
π SIMILAR VOLUMES
We describe the onset of chaos in iterated function systems (IFS) with time-dependent forcing terms. It is shown that random selection of transformations in the IFS is essential for the gene&n of a chaotic attractor. Ordered selections of transformations generate closed orbits which may he used to c
## Synopsis A new way of plotting the isotherm for ligand binding to linear biopolymers is presented. In this plot the isotherm for noncooperative binding of ligands of length n (n-mers) becomes a straight line and the existence of cooperativity and anticooperativity between bound ligands is dete