RAGS: region-aided geometric snake

An enhanced, region-aided, geometric active contour that is more tolerant toward weak edges and noise in images is introduced. The proposed method integrates gradient flow forces with region constraints, composed of image region vector flow forces obtained through the diffusion of the region segmentation map. We refer to this as the Region-aided Geometric Snake or RAGS. The diffused region forces can be generated from any reliable region segmentation technique, greylevel or color. This extra region force gives the snake a global complementary view of the boundary information within the image which, along with the local gradient flow, helps detect fuzzy boundaries and overcome noisy regions. The partial differential equation (PDE) resulting from this integration of image gradient flow and diffused region flow is implemented using a level set approach. We present various examples and also evaluate and compare the performance of RAGS on weak boundaries and noisy images.     

Radial basis function based level set interpolation and evolution for deformable modelling

We present a study in level set representation and evolution using radial basis functions (RBFs) for active contour and active surface models. It builds on recent works by others who introduced RBFs into level sets for structural topology optimisation. Here, we introduce the concept into deformable models and present a new level set formulation able to handle more complex topological changes, in particular perturbation away from the evolving front. In the conventional level set technique, the initial active contour/surface is implicitly represented by a signed distance function and periodically re-initialised to maintain numerical stability. We interpolate the initial distance function using RBFs on a much coarser grid, which provides great potential in modelling in high dimensional space. Its deformation is considered as an updating of the RBF interpolants, an ordinary differential equation (ODE) problem, instead of a partial differential equation (PDE) problem, and hence it becomes much easier to solve. Re-initialisation is found no longer necessary, in contrast to conventional finite difference method (FDM) based level set approaches. The proposed level set updating scheme is efficient and does not suffer from self-flattening while evolving, hence it avoids large numerical errors. Further, more complex topological changes are readily achievable and the initial contour or surface can be placed arbitrarily in the image. These properties are extensively demonstrated on both synthetic and real 2D and 3D data. We also present a novel active contour model, implemented with this level set scheme, based on multiscale learning and fusion of image primitives from vector-valued data, e.g. colour images, without channel separation or decomposition.     

A Soft Computing Approach to Road Classification

Current learning approaches to computer vision have mainly focussed on low-level image processing and object recognition, while tending to ignore high-level processing such as understanding. Here we propose an approach to object recognition that facilitates the transition from recognition to understanding. The proposed approach embraces the synergistic spirit of soft computing, exploiting the global search powers of genetic programming to determine fuzzy probabilistic models. It begins by segmenting the images into regions using standard image processing approaches, which are subsequently classified using a discovered fuzzy Cartesian granule feature classifier. Understanding is made possible through the transparent and succinct nature of the discovered models. The recognition of roads in images is taken as an illustrative problem in the vision domain. The discovered fuzzy models while providing high levels of accuracy (97%), also provide understanding of the problem domain through the transparency of the learnt models. The learning step in the proposed approach is compared with other techniques such as decision trees, naïve Bayes and neural networks using a variety of performance criteria such as accuracy, understandability and efficiency.     

Perceptual Image Indexing and Retrieval

We describe a perceptual approach to generating features for use in indexing and retrieving images from an image database. Salient regions that immediately attract the eye are large color regions that usually dominate an image. Features derived from these will allow search for images that are similar perceptually. We compute color features and Gabor color texture features on regions obtained from a multiscale representation of the image, generated by a multiband smoothing algorithm based on human psychophysical measurements of color appearance. The combined feature vector is then used for indexing all salient regions of an image. For retrieval, those images are selected that contain more similar regions to the query image by using a multipass retrieval and ranking mechanism. Matches are found using the L₂ metric. The results demonstrate that the proposed method performs very well.     

Automatic bootstrapping and tracking of object contours

A new fully automatic object tracking and segmentation framework is proposed. The framework consists of a motion-based bootstrapping algorithm concurrent to a shape-based active contour. The shape-based active contour uses finite shape memory that is automatically and continuously built from both the bootstrap process and the active-contour object tracker. A scheme is proposed to ensure that the finite shape memory is continuously updated but forgets unnecessary information. Two new ways of automatically extracting shape information from image data given a region of interest are also proposed. Results demonstrate that the bootstrapping stage provides important motion and shape information to the object tracker. This information is found to be essential for good (fully automatic) initialization of the active contour. Further results also demonstrate convergence properties of the content of the finite shape memory and similar object tracking performance in comparison with an object tracker with unlimited shape memory. Tests with an active contour using a fixed-shape prior also demonstrate superior performance for the proposed bootstrapped finite-shape-memory framework and similar performance when compared with a recently proposed active contour that uses an alternative online learning model.     

Fast perspective recovery of text in natural scenes

Cheap, ubiquitous, high-resolution digital cameras have led to opportunities that demand camera-based text understanding, such as wearable computing or assistive technology. Perspective distortion is one of the main challenges for text recognition in camera captured images since the camera may often not have a fronto-parallel view of the text. We present a method for perspective recovery of text in natural scenes, where text can appear as isolated words, short sentences or small paragraphs (as found on posters, billboards, shop and street signs etc.). It relies on the geometry of the characters themselves to estimate a rectifying homography for every line of text, irrespective of the view of the text over a large range of orientations. The horizontal perspective foreshortening is corrected by fitting two lines to the top and bottom of the text, while the vertical perspective foreshortening and shearing are estimated by performing a linear regression on the shear variation of the individual characters within the text line. The proposed method is efficient and fast. We present comparative results with improved recognition accuracy against the current state-of-the-art.     

Product label inspection using transputers

A product label inspection system implemented on a transputer network is described. Two data routing algorithms are considered, one for a general M × N array and one for a customized setup of transputers. Data transfer results for various image sizes are provided. Reliable and fast label inspection algorithms are described for rectangular, acute-angled and oval-shaped product labels, and their implementation on both the general and the customized networks are discussed. Simulated test results are provided to illustrate the present capability of the system for inspecting large numbers of labels per second.