We take a novel approach to Non-Photorealistic Rendering by adapting genetic programming in combi... more We take a novel approach to Non-Photorealistic Rendering by adapting genetic programming in combination with computer graphics drawing techniques. As a GP tree is evaluated, upon encountering certain nodes referred to as “Draw” nodes, information contained within such nodes are sent to one of three virtual canvasses and a mark is deposited on the canvas. For two of the canvasses the user is able to define custom brushes to be applied to the canvas. Drawing functions are supplied with little localised information regarding the target image. Based on this local data, the drawing functions are enabled to apply contextualized information to the canvas. The obtained results include a “Shroud of Turin” effect, a “Decal” effect and a “Starburst” effect.
We take a novel approach to Non-Photorealistic Rendering by adapting genetic programming in combi... more We take a novel approach to Non-Photorealistic Rendering by adapting genetic programming in combination with computer graphics drawing techniques. As a GP tree is evaluated, upon encountering certain nodes referred to as “Draw” nodes, information contained within such nodes are sent to one of three virtual canvasses and a mark is deposited on the canvas. For two of the canvasses the user is able to define custom brushes to be applied to the canvas. Drawing functions are supplied with little localised information regarding the target image. Based on this local data, the drawing functions are enabled to apply contextualized information to the canvas. The obtained results include a “Shroud of Turin” effect, a “Decal” effect and a “Starburst” effect.
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), 2004
Absfraef-Program Bloat - the phenomenon of ever-increasing program size during a GP run - is a re... more Absfraef-Program Bloat - the phenomenon of ever-increasing program size during a GP run - is a recognised and widespread problem. Traditional techniques to combat program bloat are program size limitations or parsimony pressure (penalty func-tions). These techniques ...
RoboCup is a complex simulated environment in which a team of players must cooperateto overcome t... more RoboCup is a complex simulated environment in which a team of players must cooperateto overcome their opposition in a game of soccer. This paper describes two experiments in theuse of genetic programming to develop teams for robocup. Experiment 1 used just the basicactions of turn, move and dash that a player can send to the soccer simulator. Experiment2 used higher
Fuzzy logic controllers have been applied to a wide range of control problems, but are very diffi... more Fuzzy logic controllers have been applied to a wide range of control problems, but are very difficult to build for situations where the environment changes quickly and there is a lot of uncertainty. This work investigates a new method of creating fuzzy controllers, in the form of reactive agents, for such environments. The framework for this investigation is the RoboCup
Layered learning allows decomposition of the stages of learning in a problem domain and can have ... more Layered learning allows decomposition of the stages of learning in a problem domain and can have many positive effects, both on the amount of computation required for learning and for program comprehension and verification. We apply this technique to the evolution of goal scoring behavior in soccer players and show that layered learning is on average able to find solutions
Evolutionary approaches are not usually considered for real time scheduling problems due to longc... more Evolutionary approaches are not usually considered for real time scheduling problems due to longcomputation times and uncertainty about the length of the computation time. We argue that forsome kinds of problems, such as optimizing aircraft landing times, genetic algorithms have advantagesover other methods as a best solution is always available when needed, and, since the computationis inherently parallel, more processors
... One method of performing clas-sification using genetic programming is dynamic range selection... more ... One method of performing clas-sification using genetic programming is dynamic range selection [5], where the ranges for class labels over the ... The dynamic range selection method of classifier representation was shown to be capable of producing accurate results over a variety ...
We describe an algorithm animation system for artificial intelligence search algorithms. We have ... more We describe an algorithm animation system for artificial intelligence search algorithms. We have identified a number learning difficulties experienced by students studying search algorithms and designed the animation system to help students to overcome these difficulties. As well as the usual single step mode for assistance in learning the individual steps of an algorithm, the system supports an innovative burst
Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), 2002
We have investigated an approach to preventing or minimising the occurrence of premature converge... more We have investigated an approach to preventing or minimising the occurrence of premature convergence by measuring the similarity between the programs in the population and replacing the most similar ones with randomly generated programs. On a problem with known premature convergence behaviour, the MAX problem, similarity replacement significantly decreased the rate of premature convergence over the best that could be
In deceptive problems many runs lead to suboptimal solutions and it can be difficult to escape fr... more In deceptive problems many runs lead to suboptimal solutions and it can be difficult to escape from these local optima and find the global best solution. We propose a pyramid search strategy for these kinds of problems. In the pyramid strategy a number of populations are initialised and independently evolved for a number of generations at which point the worst
2007 IEEE Symposium on Computational Intelligence in Image and Signal Processing, 2007
Abstract This paper examines the feasibility of an approach to image retrieval from a heterogeneo... more Abstract This paper examines the feasibility of an approach to image retrieval from a heterogeneous collection based on texture. For each texture of interest (T), a T-vs-other classifier is evolved for small n times n windows using genetic programming. The classifier ...
International Conference on Artificial Intelligence, 2000
The focus of this paper is to determine whether a pulse coupled neural network (PCNN) can be used... more The focus of this paper is to determine whether a pulse coupled neural network (PCNN) can be used to high- light regions containing key craniofacial features from digital X-rays. The method uses an averaging filter to minimise noise followed by a PCNN to high- light the features relevant to the detection of the landmark. It is envisaged the output of
We describe a progression of solutions to a di ffi cult object detection problem, that of locatin... more We describe a progression of solutions to a di ffi cult object detection problem, that of locating landmarks in X-Rays used in orthodontic treatment planning. In our fi rst formula tion an object detector was a genetic program whose inputs were a number of attributes computed from a scanning window. We used a rich function set comprising f+; ; -; ÷ ; min; max; ifthenelseg. Experimentation with di ff erent function sets revealed that using the function set f+; g gave detectors that were almost as accurate. Such detectors are essentially a linear combination of attributes so we also implemented a parameter optimization solution with a particle swarm optimizer. Contrary to expectation, the PSO detectors are more accurate and smaller than the GP ones. Our analysis of the reasons for this reveals that (1) the PSO approach involves a considerably smaller search space than the GP approach, (2) in the PSO approach there is a 1-1 mapping between genotype and phenotype while in the GP approac...
Evolving programs with explicit loops presents ma- jor difficulties, primarily due to the massive... more Evolving programs with explicit loops presents ma- jor difficulties, primarily due to the massive increase in the size of the search space. Fitness evaluation becomes computationally expensive and a method for dealing with infinite loops must be implemented. We have investigated ways of dealing with these problems by the evolution of for-loops of increasing semantic complexity. We have chosen two problems - a modified Santa Fe ant problem and a sorting problem - which have natural looping constructs in their solution and a solution without loops is not possible unless the tree depth is very large. We have shown that by controlling the complexity of the loop structures it is possible to evolve smaller and more understandable programs for these problems.
... DOI: 10.1081/AMP-200053541 Miran Brezocnik a * , Miha Kovacic a & Leo Gusel b ... Mahanty... more ... DOI: 10.1081/AMP-200053541 Miran Brezocnik a * , Miha Kovacic a & Leo Gusel b ... Mahanty , B. ; Mohapatra , PKJ Optimization of hot rolled coil widths using a genetic algorithm . ... Gen , M. ; Cheng , R. Genetic Algorithms and Engineering Design ; John Wiley & Sons : Canada ...
We take a novel approach to Non-Photorealistic Rendering by adapting genetic programming in combi... more We take a novel approach to Non-Photorealistic Rendering by adapting genetic programming in combination with computer graphics drawing techniques. As a GP tree is evaluated, upon encountering certain nodes referred to as “Draw” nodes, information contained within such nodes are sent to one of three virtual canvasses and a mark is deposited on the canvas. For two of the canvasses the user is able to define custom brushes to be applied to the canvas. Drawing functions are supplied with little localised information regarding the target image. Based on this local data, the drawing functions are enabled to apply contextualized information to the canvas. The obtained results include a “Shroud of Turin” effect, a “Decal” effect and a “Starburst” effect.
We take a novel approach to Non-Photorealistic Rendering by adapting genetic programming in combi... more We take a novel approach to Non-Photorealistic Rendering by adapting genetic programming in combination with computer graphics drawing techniques. As a GP tree is evaluated, upon encountering certain nodes referred to as “Draw” nodes, information contained within such nodes are sent to one of three virtual canvasses and a mark is deposited on the canvas. For two of the canvasses the user is able to define custom brushes to be applied to the canvas. Drawing functions are supplied with little localised information regarding the target image. Based on this local data, the drawing functions are enabled to apply contextualized information to the canvas. The obtained results include a “Shroud of Turin” effect, a “Decal” effect and a “Starburst” effect.
Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), 2004
Absfraef-Program Bloat - the phenomenon of ever-increasing program size during a GP run - is a re... more Absfraef-Program Bloat - the phenomenon of ever-increasing program size during a GP run - is a recognised and widespread problem. Traditional techniques to combat program bloat are program size limitations or parsimony pressure (penalty func-tions). These techniques ...
RoboCup is a complex simulated environment in which a team of players must cooperateto overcome t... more RoboCup is a complex simulated environment in which a team of players must cooperateto overcome their opposition in a game of soccer. This paper describes two experiments in theuse of genetic programming to develop teams for robocup. Experiment 1 used just the basicactions of turn, move and dash that a player can send to the soccer simulator. Experiment2 used higher
Fuzzy logic controllers have been applied to a wide range of control problems, but are very diffi... more Fuzzy logic controllers have been applied to a wide range of control problems, but are very difficult to build for situations where the environment changes quickly and there is a lot of uncertainty. This work investigates a new method of creating fuzzy controllers, in the form of reactive agents, for such environments. The framework for this investigation is the RoboCup
Layered learning allows decomposition of the stages of learning in a problem domain and can have ... more Layered learning allows decomposition of the stages of learning in a problem domain and can have many positive effects, both on the amount of computation required for learning and for program comprehension and verification. We apply this technique to the evolution of goal scoring behavior in soccer players and show that layered learning is on average able to find solutions
Evolutionary approaches are not usually considered for real time scheduling problems due to longc... more Evolutionary approaches are not usually considered for real time scheduling problems due to longcomputation times and uncertainty about the length of the computation time. We argue that forsome kinds of problems, such as optimizing aircraft landing times, genetic algorithms have advantagesover other methods as a best solution is always available when needed, and, since the computationis inherently parallel, more processors
... One method of performing clas-sification using genetic programming is dynamic range selection... more ... One method of performing clas-sification using genetic programming is dynamic range selection [5], where the ranges for class labels over the ... The dynamic range selection method of classifier representation was shown to be capable of producing accurate results over a variety ...
We describe an algorithm animation system for artificial intelligence search algorithms. We have ... more We describe an algorithm animation system for artificial intelligence search algorithms. We have identified a number learning difficulties experienced by students studying search algorithms and designed the animation system to help students to overcome these difficulties. As well as the usual single step mode for assistance in learning the individual steps of an algorithm, the system supports an innovative burst
Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600), 2002
We have investigated an approach to preventing or minimising the occurrence of premature converge... more We have investigated an approach to preventing or minimising the occurrence of premature convergence by measuring the similarity between the programs in the population and replacing the most similar ones with randomly generated programs. On a problem with known premature convergence behaviour, the MAX problem, similarity replacement significantly decreased the rate of premature convergence over the best that could be
In deceptive problems many runs lead to suboptimal solutions and it can be difficult to escape fr... more In deceptive problems many runs lead to suboptimal solutions and it can be difficult to escape from these local optima and find the global best solution. We propose a pyramid search strategy for these kinds of problems. In the pyramid strategy a number of populations are initialised and independently evolved for a number of generations at which point the worst
2007 IEEE Symposium on Computational Intelligence in Image and Signal Processing, 2007
Abstract This paper examines the feasibility of an approach to image retrieval from a heterogeneo... more Abstract This paper examines the feasibility of an approach to image retrieval from a heterogeneous collection based on texture. For each texture of interest (T), a T-vs-other classifier is evolved for small n times n windows using genetic programming. The classifier ...
International Conference on Artificial Intelligence, 2000
The focus of this paper is to determine whether a pulse coupled neural network (PCNN) can be used... more The focus of this paper is to determine whether a pulse coupled neural network (PCNN) can be used to high- light regions containing key craniofacial features from digital X-rays. The method uses an averaging filter to minimise noise followed by a PCNN to high- light the features relevant to the detection of the landmark. It is envisaged the output of
We describe a progression of solutions to a di ffi cult object detection problem, that of locatin... more We describe a progression of solutions to a di ffi cult object detection problem, that of locating landmarks in X-Rays used in orthodontic treatment planning. In our fi rst formula tion an object detector was a genetic program whose inputs were a number of attributes computed from a scanning window. We used a rich function set comprising f+; ; -; ÷ ; min; max; ifthenelseg. Experimentation with di ff erent function sets revealed that using the function set f+; g gave detectors that were almost as accurate. Such detectors are essentially a linear combination of attributes so we also implemented a parameter optimization solution with a particle swarm optimizer. Contrary to expectation, the PSO detectors are more accurate and smaller than the GP ones. Our analysis of the reasons for this reveals that (1) the PSO approach involves a considerably smaller search space than the GP approach, (2) in the PSO approach there is a 1-1 mapping between genotype and phenotype while in the GP approac...
Evolving programs with explicit loops presents ma- jor difficulties, primarily due to the massive... more Evolving programs with explicit loops presents ma- jor difficulties, primarily due to the massive increase in the size of the search space. Fitness evaluation becomes computationally expensive and a method for dealing with infinite loops must be implemented. We have investigated ways of dealing with these problems by the evolution of for-loops of increasing semantic complexity. We have chosen two problems - a modified Santa Fe ant problem and a sorting problem - which have natural looping constructs in their solution and a solution without loops is not possible unless the tree depth is very large. We have shown that by controlling the complexity of the loop structures it is possible to evolve smaller and more understandable programs for these problems.
... DOI: 10.1081/AMP-200053541 Miran Brezocnik a * , Miha Kovacic a & Leo Gusel b ... Mahanty... more ... DOI: 10.1081/AMP-200053541 Miran Brezocnik a * , Miha Kovacic a & Leo Gusel b ... Mahanty , B. ; Mohapatra , PKJ Optimization of hot rolled coil widths using a genetic algorithm . ... Gen , M. ; Cheng , R. Genetic Algorithms and Engineering Design ; John Wiley & Sons : Canada ...
Uploads
Papers by Vic Ciesielski