16065751
Improving Appearance Model Matching Using Local Image Structure
We show how non-linear representations of local image structure can be used to improve the performance of model matching algorithms in medical image analysis tasks. Rather than represent the image structure using intensity values or gradients, we use measures that indicate the reliability of a set of local image feature detector outputs. These features are image edges, corners, and gradients. Feature detector outputs in flat, noisy regions tend to be ignored whereas those near strong structure are favoured. We demonstrate that combinations of these features give more accurate and reliable matching between models and new images than modelling image intensity alone. We also show that the approach is robust to non-linear changes in contrast, such as those found in multi-modal imaging.
18409496
Building optimal 2D statistical shape models
Statistical shape models are used widely as a basis for segmenting and interpreting images. A major drawback of the approach is the need, during training, to establish a dense correspondence across a training set of segmented shapes. We show that model construction can be treated as an optimisation problem, automating the process and guaranteeing the effectiveness of the resulting models. This is achieved by optimising an objective function with respect to the correspondence. We use an information theoretic objective function that directly promotes desirable features of the model. This is coupled with an effective method of manipulating correspondence, based on reparameterising each training shape, to build optimal statistical shape models. The method is evaluated on several training sets of shapes, showing that it constructs better models than alternative approaches. q 2003 Elsevier B.V. All rights reserved.
17273589
Developing a Measure of Similarity between Pixel Signatures
Our previous work in computer-aided mammography has used scaleorientation pixel signatures that provide a rich description of local structure. We describe work using the transportation (`earth mover') algorithm to de ne a measure of similarity between two signatures that recognises similar structures whilst remaining robust to background variability and the presence of other structures. Speci cally, we investigate an un-normalised, normalised and novel best-partialmatching (BPM) approach to measuring this transportation distance and compare it with Euclidean distance. Receiver operating characteristic (ROC) methodology is used to compare performance and an example of clinical application is given. The BPM approach outperforms the other methods.
117576
Transforming pixel signatures into an improved metric space
Abstract We address the problem of using scale-orientation pixel signatures to characterise local structure in X-ray mammograms, though the method we report is of general application. When signatures are treated as vectors for statistical analysis, the Euclidean metric is not well behaved. We have previously described a Best Partial Match (BPM) metric that measures signature similarity more naturally, but at high computational cost. We present a method for transforming signatures into a new space in which Euclidean distance approximates BPM distance, allowing BPM distance to be estimated at low computational cost. The new space is constructed using multi-dimensional scaling. The nonlinear transformation between the old and new spaces is learned using support vector regression. We present experimental results for mammographic data.
9944487
Constrained Active Appearance Models
Active Appearance Models (AAMs) have been shown to be useful for interpreting images of deformable objects. Here we place the AAM matching algorithm in a statistical framework, allowing extra constraints to be applied. This enables the models to be combined with other methods of object location. We demonstrate how user interaction can be used to guide the search and give results of experiments showing the effect of constraints on the performance of model matching.
35191926
Automatic Extraction of the Face Identity-Subspace
Facial variation divides into a number of functional subspaces, and ensemblespecific variation. An improved method of measuring these is presented, within the space defined by an Appearance Model. Initial estimates of the subspaces (lighting, pose, identity and expression) are obtained by Principal Components Analysis on appropriate groups of faces. An expectationmaximization algorithm is applied to image codings to maximise the probability of coding across these non-orthogonal subspaces. Ensemble specific variation is then removed by measuring the spatial predictability of the eigenvectors excluding those which are less predictable than the ensemble. These procedures significantly enhance identity recognition for a disjoint test set.
14456844
Exploration strategies for mobile robots
The problem of programming a robot to carry out a systematic exploration of its environment using realistic sensors is considered. The robot is modeled as a single point moving in a two-dimensional configuration space populated with visually opaque and transparent obstacles. The robot is equipped with proximity sensors, a vision-based recognition system, and a method of odometry, all of which have some uncertainty associated with their measurements. By using visually distinctive configurations of features in the world as natural landmarks, a series of local maps is constructed. The geometrical relationships between mutually visible landmarks are used to build a relational map from this collection of local maps. This representation forms the basis for a systematic exploration algorithm. The approach is implemented in simulation, and results are presented.<<ETX>>
21050185
A Framework and Architecture for Multirobot Coordination
In this paper, we present a framework and the software architecture for the deployment of multiple autonomous robots in an unstructured and unknown environment with applications ranging from scouting and reconnaissance, to search and rescue and manipulation tasks. Our software framework provides the methodology and the tools that enable robots to exhibit deliberative and reactive behaviors in autonomous operation, to be reprogrammed by a human operator at run-time, and to learn and adapt to unstructured, dynamic environments and new tasks, while providing performance guarantees. We demonstrate the algorithms and software on an experimental testbed that involves a team of car-like robots using a single omnidirectional camera as a sensor without explicit use of odometry.
2497525
Structure and Motion from Line Segments in Multiple Images
This paper presents a new method for recovering the three dimensional structure of a scene composed of straight line segments using the image data obtained from a moving camera. The recovery algorithm is formulated in terms of an objective function which measures the total squared distance in the image plane between the observed edge segments and the projections (perspective) of the reconstructed lines. This objective function is minimized with respect to the line parameters and the camera positions to obtain an estimate for the structure of the scene. The effectiveness of this approach is demonstrated quantitatively through extensive simulations and qualitatively with actual image sequences. The implementation is being made publicly available. >
16129085
Stochastic Road Shape Estimation
We describe a new system for estimating road shape ahead of a vehicle for the purpose of driver assistance. The method utilises a single on board colour camera, together with inertial and velocity information, to estimate both the position of the host car with respect to the lane it is following and also the width and curvature of the lane ahead at distances of up to 80 metres. The system’s image processing extracts a variety of different styles of lane markings from road imagery, and is able to compensate for a range of lighting conditions. Road shape and car position are estimated using a particle filter. The system, which runs at 10.5 frames per second, has been applied with some success to several hours’ worth of data captured from highways under varying imaging conditions.
17626745
Design of an Adaptive Architecture for Energy Efficient Wireless Image Communication
With the projected significant growth in mobile internet and multimedia services, there is a strong demand for next-generation wireless appliances capable of image communication. However, wireless image communication faces significant bottlenecks including high energy and bandwidth consumption. Past studies have shown that the bottlenecks to wireless image communication can be overcome by developing adaptive image compression algorithms and dynamically adapting them to current channel conditions and service requirements [1,2].In this paper, we present the design of an adaptive hardware/software architecture that enables adaptive wireless image communication. Through intelligent co-design of the proposed architecture and algorithms, we achieve an architecture which enables not only power and performance efficient implementation, but also fast and efficient run-time adaptation of image compression parameters. To achieve efficient image compression and run-time adaptation, we characterized the adaptation needs of an adaptive image compression algorithm in terms of parameters, and implemented an adaptive hardware/software architecture capable of executing JPEC image compression with different parameters. We present experimental results demonstrating that the proposed architecture enables low overhead adaptation to current wireless conditions and requirements while implementing a low cost (energy and performance) implementation of adaptive image compression algorithms.