Orbit of an Image Under Iterated System II

Orbit of an Image Under Iterated System II

S. L. Singh (Pt. L. M. S. Govt. Autonomous Postgraduate College Rishikesh, India), S. N. Mishra (Walter Sisulu University, South Africa) and Sarika Jain (Amity University, India)
Copyright: © 2011 |Pages: 18
DOI: 10.4018/jalr.2011100106
OnDemand PDF Download:
List Price: $37.50


An orbital picture is a mathematical structure depicting the path of an object under Iterated Function System. Orbital and V-variable orbital pictures initially developed by Barnsley (2006) have utmost importance in computer graphics, image compression, biological modeling and other areas of fractal geometry. These pictures have been generated for linear and contractive transformations using function and superior iterative procedures. In this paper, the authors introduce the role of superior iterative procedure to find the orbital picture under an IFS consisting of non-contractive or non-expansive transformations. A mild comparison of the computed figures indicates the usefulness of study in computational mathematics and fractal image processing. A modified algorithm along with program code is given to compute a 2-variable superior orbital picture.
Article Preview

1. Introduction

Let (X, d) be a complete metric space. A map g: X → X is a Banach contraction (also called strictly contractive transformation by Barnsley (2006)) if

for all where

The map g is non-expansive if q = 1. A translation map, identity map and isometry are simple examples of non-expansive maps. Some of the properties of contractive maps do not carry over to non-expansive maps. A non-expansive map may not have a unique common fixed point. For example, the identity map on a metric space has every point fixed. Even in a compact space, the sequence of iterates of a non-expansive map sometimes does not converge to a fixed point. If Tn for some positive integer n, has a fixed point, it does not necessarily imply that T has a fixed point. For the theory of contractive and non-expansive operators in non-linear analysis, one may refer to Agarwal, Meehan, and Regan (2001) and Goebel and Kirk (1990).

Orbital pictures are ubiquitous in fractal geometry, as they are always expressed in terms of transformations of an IFS. An orbital picture of an IFS is developed by traversing a defined path, which may be referred to an orbital path. Indeed, a recursive application of an iterative procedure results in an orbital path. However, some issues are of vital concern, while computing the orbit of the picture. For example, there may be some cases when the orbit overlaps. In such cases, to determine the correct orbital picture, one may use the concept of tops union which nicely describes the union of two pictures. Indeed, tops union describes the methodology to take the union of two pictures so as to define a new picture. In other words, tops union simply means, a picture on the top will remain on the top. Moreover, certain real objects are better described by V -variability, as no two clouds are ever the same or two leaves of the same plant differ. V - variability gives a wide range of fractals to the existing deterministic and random fractals, within the framework of Iterated Function Systems. Vast families of homeomorphic objects can be generated with little variation, which may be used to model and study a wide range of phenomena across many areas of science and technology. The concept of V -variability may be used to model almost same looking objects but not exactly the same. For a descriptive knowledge of fractals, V -variable fractals, new generation of fractals and their properties, refer to Barnsley (1993, 2006, 2009), Barnsley, Hutchinson, and Stenflo (2005, 2008), Devaney (1986, 1992), Hutchinson (1981), Mandelbrot (1982), Encarnacao, Peitgen, Sakas, and Englert (1992) and Peitgen, Jürgens, and Saupe (2004).

Complete Article List

Search this Journal:
Open Access Articles: Forthcoming
Volume 7: 2 Issues (2017): 1 Released, 1 Forthcoming
Volume 6: 2 Issues (2016)
Volume 5: 1 Issue (2015)
Volume 4: 1 Issue (2014)
Volume 3: 4 Issues (2012)
Volume 2: 4 Issues (2011)
Volume 1: 4 Issues (2010)
View Complete Journal Contents Listing