We use cookies to ensure that we give you the best experience on our website. By continuing to browse this repository, you give consent for essential cookies to be used. You can read more about our Privacy and Cookie Policy.

Durham e-Theses
You are in:

Iterated function systems and shape representation

Giles, Paul A. (1990) Iterated function systems and shape representation. Doctoral thesis, Durham University.



We propose the use of iterated function systems as an isomorphic shape representation scheme for use in a machine vision environment. A concise description of the basic theory and salient characteristics of iterated function systems is presented and from this we develop a formal framework within which to embed a representation scheme. Concentrating on the problem of obtaining automatically generated two-dimensional encodings we describe implementations of two solutions. The first is based on a deterministic algorithm and makes simplifying assumptions which limit its range of applicability. The second employs a novel formulation of a genetic algorithm and is intended to function with general data input. Keywords: Machine Vision, Shape Representation, Iterated Function Systems, Genetic Algorithms.

Item Type:Thesis (Doctoral)
Award:Doctor of Philosophy
Thesis Date:1990
Copyright:Copyright of this thesis is held by the author
Deposited On:18 Dec 2012 12:07

Social bookmarking: del.icio.usConnoteaBibSonomyCiteULikeFacebookTwitter