Proceedings of the Eighth Australian and New Zealand Intelligent Information Systems Conference

These are the full proceedings of the conference.

Measurement Function Design for Visual Tracking Applications

Extracting human postural information from video sequences has proved a difficult research question. The most successful approaches to date have been based on particle filtering, whereby the underlying probability distribution is approximated by a set of particles. The shape of the underlying observational probability distribution plays a significant role in determining the success, both accuracy and efficiency, of any visual tracker. In this paper we compare approaches used by other authors and present a cost path approach which is commonly used in image segmentation problems, however is currently not widely used in tracking applications.

Embedded Voxel Colouring

The reconstruction of a complex scene from multiple images is a fundamental problem in the field of computer vision. Volumetric methods have proven to be a strong alternative to traditional correspondence-based methods due to their flexible visibility models. In this paper we analyse existing methods for volumetric reconstruction and identify three key properties of voxel colouring algorithms: a water-tight surface model, a monotonic carving order, and causality. We present a new Voxel Colouring algorithm which embeds all reconstructions of a scene into a single output. While modelling exact visibility for arbitrary camera locations, Embedded Voxel Colouring removes the need for a priori threshold selection present in previous work. An efficient implementation is given along with results demonstrating the advantages of posteriori threshold selection.

Linear models of simple cells: Correspondence to real cell responses and space spanning properties

Despite their limitations, linear filter models continue to be used to simulate the receptive field properties of cortical simple cells. For theoreticians interested in large scale models of visual cortex, a family of self-similar filters represents a convenient way in which to characterise simple cells in one basic model. This paper reviews research on the suitability of such models, and goes on to advance biologically motivated reasons for adopting a particular group of models in preference to all others. In particular, the paper describes why the Gabor model, so often used in network simulations, should be dropped in favour of a Cauchy model, both on the grounds of frequency response and mutual filter orthogonality.

Perception of faces and bodies: Similar or different?

Human faces and bodies are both complex and interesting perceptual objects, and both convey important social information. Given these similarities between faces and bodies, we can ask how similar are the visual processing mechanisms used to recognize them. It has long been argued that faces are subject to dedicated and unique perceptual processes, but until recently, relatively little research has focused on how we perceive the human. body. Some recent paradigms indicate that faces and bodies are processed differently; others show similarities in face and body perception. These similarities and differences depend on the type of perceptual task and the level of processing involved. Future research should take these issues into account.

Fractal analysis of pyramidal cells in the visual cortex of the galago (Otolemur garnetti): Regional variation in dendritic branching patterns between visual areas

Previously it has been shown that the branching pattern of pyramidal cells varies markedly between different cortical areas in simian primates. These differences are thought to influence the functional complexity of the cells. In particular, there is a progressive increase in the fractal dimension of pyramidal cells with anterior progression through cortical areas in the occipitotemporal (OT) visual stream, including the primary visual area (V1), the second visual area (V2), the dorsolateral area (DL, corresponding to the fourth visual area) and inferotemporal cortex (IT). However, there are as yet no data on the fractal dimension of these neurons in prosimian primates. Here we focused on the nocturnal prosimian galago (Otolemur garnetti). The fractal dimension (D), and aspect ratio (a measure of branching symmetry), was determined for I I I layer III pyramidal cells in V1, V2, DL and IT. We found, as in simian primates, that the fractal dimension of neurons increased with anterior progression from V1 through V2, DL, and IT. Two important conclusions can be drawn from these results: (1) the trend for increasing branching complexity with anterior progression through OT areas was likely to be present in a common primate ancestor, and (2) specialization in neuron structure more likely facilitates object recognition than spectral processing.

Turning configural processing upside down: Part and whole body postures

Like faces, body postures are susceptible to an inversion effect in untrained viewers. The inversion effect may be indicative of configural processing, but what kind of configural processing is used for the recognition of body postures must be specified. The information available in the body stimulus was manipulated. The presence and magnitude of inversion effects were compared for body parts, scrambled bodies, and body halves relative to whole bodies and to corresponding conditions for faces and houses. Results suggest that configural body posture recognition relies on the structural hierarchy of body parts, not the parts themselves or a complete template match. Configural recognition of body postures based on information about the structural hierarchy of parts defines an important point on the configural processing continuum, between recognition based on first-order spatial relations and recognition based on holistic undifferentiated template matching.

Fast stereo matching by iterated dynamic programming and quadtree subregioning

The application of energy minimisation methods for stereo matching has been demonstrated to produce high quality disparity maps. However the majority of these methods are known to be computationally expensive, requiring minutes or even hours of computation. We propose a fast minimisation scheme that produces strongly competitive results for significantly reduced computation, requiring only a few seconds of computation. In this paper, we present our iterated dynamic programming algorithm along with a quadtree subregioning process for fast stereo matching.