A Generic Deformable Model for Vehicle Recognition

This paper reports the development of a highly parameterised 3-D model able to adopt the shapes of a wide variety of different classes of vehicles (cars, vans, buses, etc), and its subsequent specialisation to a generic car class which accounts for most commonly encountered types of car (includng saloon, hatchback and estate cars). An interactive tool has been developed to obtain sample data for vehicles from video images. A PCA description of the manually sampled data provides a deformable model in which a single instance is described as a 6 parameter vector. Both the pose and the structure of a car can be recovered by fitting the PCA model to an image. The recovered description is sufficiently accurate to discriminate between vehicle sub-classes.

Competition in tree row agroforestry systems. 3. Soil water distribution and dynamics

The purpose of this study was to test the hypothesis that soil water content would vary spatially with distance from a tree row and that the effect would differ according to tree species. A field study was conducted on a kaolinitic Oxisol in the sub-humid highlands of western Kenya to compare soil water distribution and dynamics in a maize monoculture with that under maize (Zea mays L.) intercropped with a 3-year-old tree row of Grevillea robusta A. Cunn. Ex R. Br. (grevillea) and hedgerow of Senna spectabilis DC. (senna). Soil water content was measured at weekly intervals during one cropping season using a neutron probe. Measurements were made from 20 cm to a depth of 225 cm at distances of 75, 150, 300 and 525 cm from the tree rows. The amount of water stored was greater under the sole maize crop than the agroforestry systems, especially the grevillea-maize system. Stored soil water in the grevillea-maize system increased with increasing distance from the tree row but in the senna-maize system, it decreased between 75 and 300 cm from the hedgerow. Soil water content increased least and more slowly early in the season in the grevillea-maize system, and drying was also evident as the frequency of rain declined. Soil water content at the end of the cropping season was similar to that at the start of the season in the grevillea-maize system, but about 50 and 80 mm greater in the senna-maize and sole maize systems, respectively. The seasonal water balance showed there was 140 mm, of drainage from the sole maize system. A similar amount was lost from the agroforestry systems (about 160 mm in the grevillea-maize system and 145 mm in the senna-maize system) through drainage or tree uptake. The possible benefits of reduced soil evaporation and crop transpiration close to a tree row were not evident in the grevillea-maize system, but appeared to greatly compensate for water uptake losses in the senna-maize system. Grevillea, managed as a tree row, reduced stored soil water to a greater extent than senna, managed as a hedgerow.

Generic systolic array for genetic algorithms

The authors present a systolic design for a simple GA mechanism which provides high throughput and unidirectional pipelining by exploiting the inherent parallelism in the genetic operators. The design computes in O(N+G) time steps using O(N2) cells where N is the population size and G is the chromosome length. The area of the device is independent of the chromosome length and so can be easily scaled by replicating the arrays or by employing fine-grain migration. The array is generic in the sense that it does not rely on the fitness function and can be used as an accelerator for any GA application using uniform crossover between pairs of chromosomes. The design can also be used in hybrid systems as an add-on to complement existing designs and methods for fitness function acceleration and island-style population management

Implementing a generic systolic array for genetic algorithms

We have designed a highly parallel design for a simple genetic algorithm using a pipeline of systolic arrays. The systolic design provides high throughput and unidirectional pipelining by exploiting the implicit parallelism in the genetic operators. The design is significant because, unlike other hardware genetic algorithms, it is independent of both the fitness function and the particular chromosome length used in a problem. We have designed and simulated a version of the mutation array using Xilinix FPGA tools to investigate the feasibility of hardware implementation. A simple 5-chromosome mutation array occupies 195 CLBs and is capable of performing more than one million mutations per second. I. Introduction Genetic algorithms (GAs) are established search and optimization techniques which have been applied to a range of engineering and applied problems with considerable success [1]. They operate by maintaining a population of trial solutions encoded, using a suitable encoding scheme.