35329802
Shape Discrimination in the Hippocampus Using an MDL Model
We extend recent work on building 3D statistical shape models, automatically, from sets of training shapes and describe an application in shape analysis. Using an existing measure of model quality, based on a minimum description length criterion, and an existing method of surface re-parameterisation, we introduce a new approach to model optimisation that is scalable, more accurate, and involves fewer parameters than previous methods. We use the new approach to build a model of the right hippocampus, using a training set of 82 shapes, manually segmented from 3D MR images of the brain. We compare the results with those obtained using another previously published method for building 3D models, and show that our approach results in a model that is significantly more specific, general, and compact. The two models are used to investigate the hypothesis that there are differences in hippocampal shape between age-matched schizophrenic and normal control subgroups within the training set. Linear discriminant analysis is used to find the combination of shape parameters that best separates the two subgroups. We perform an unbiased test that shows there is a statistically significant shape difference using either shape model, but that the difference is more significant using the model built using our approach. We show also that the difference between the two subgroups can be visualised as a mode of shape variation.
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.
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.
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.
8867506
Robust vision-based pose control
The problem of controlling the spatial position and orientation of a robotic platform based on the image data obtained from a video camera mounted on that platform is considered. More specifically, we propose control laws that will cause the robot to achieve and maintain a fixed position and orientation with respect to a set of feature points in the scene. We demonstrate analytically that the proposed control scheme is globally convergent even in the presence of large calibration errors in both the intrinsic parameters of the camera and in the extrinsic parameters which relate the frame of reference of the camera to the body frame of the robot platform which is being controlled. Furthermore, no a priori knowledge about the structure of the scene is assumed.
2609415
Modeling and rendering architecture from photographs: a hybrid geometry- and image-based approach
We present a new approach for modeling and rendering existing architectural scenes from a sparse set of still photographs. Our modeling approach, which combines both geometry-based and imagebased techniques, has two components. The first component is a photogrammetricmodeling method which facilitates the recovery of the basic geometry of the photographed scene. Our photogrammetric modeling approach is effective, convenient, and robust because it exploits the constraints that are characteristic of architectural scenes. The second component is a model-based stereo algorithm, which recovers how the real scene deviates from the basic model. By making use of the model, our stereo technique robustly recovers accurate depth from widely-spaced image pairs. Consequently, our approach can model large architectural environments with far fewer photographs than current image-based modeling approaches. For producing renderings, we present view-dependent texture mapping, a method of compositing multiple views of a scene that better simulates geometric detail on basic models. Our approach can be used to recover models for use in either geometry-based or image-based rendering systems. We present results that demonstrate our approach’s ability to create realistic renderings of architectural scenes from viewpoints far from the original photographs. CR Descriptors: I.2.10 [Artificial Intelligence]: Vision and Scene Understanding Modeling and recovery of physical attributes; I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism Color, shading, shadowing, and texture I.4.8 [Image Processing]: Scene Analysis Stereo; J.6 [Computer-Aided Engineering]: Computer-aided design (CAD).
15360768
A hardware/software reconfigurable architecture for adaptive wireless image communication
With the projected significant growth in mobile internet and multimedia services, there is a strong demand for next-generation appliances capable of wireless image communication. One of the major bottlenecks in enabling wireless image communication is the high energy requirement, which may surpass the current and future capabilities of battery technologies. Past studies have shown that the bottlenecks can be overcome by developing adaptive multimedia compression algorithms which can adapt to dynamic channel conditions and service requirements. We present an application-specific hardware/software reconfigurable architecture to support adaptive image compression algorithms. We present a design methodology which considers co-design between adaptive algorithms and architectural design leading to a reconfigurable architecture for image compression algorithms. Codesign of the proposed architecture aims not only at performance and power efficient implementation, but also towards fast and efficient run-time adaptation of an adaptive image compression algorithm.
1277199
Modeling and minimization of interconnect energy dissipation in nanometer technologies
As the technology sizes of semiconductor devices continue to decrease, the effect of nanometer technologies on interconnects, such as crosstalk glitches and timing variations, become more significant. In this paper, we study the effect of nanometer technologies on energy dissipation in interconnects. We propose a new power estimation technique which considers DSM effects, resulting in significantly more accurate energy dissipation estimates than transition-count based methods for on-chip interconnects. We also introduce an energy minimization technique which attempts to minimize large voltage swings across the cross-coupling capacitances between interconnects. Even though the number of transitions may increase, our method yields a decrease in power consumption of up to 50%.
13161464
Macroscopic traffic flow modelling and ramp metering control using Matlab/Simulink
Computer programs to simulate traffic flow offer an opportunity to evaluate new strategies for reducing delays, congestion, fuel consumption and pollution. This paper describes a Statistical Traffic Model or STM, which is based on accepted macro-modelling concepts, such as the conservation of vehicles and the fundamental traffic diagram. In this case, the model is constructed using the well known Matlab/Simulink™ software package, so providing an integrated approach for data processing, graphical presentation of data, control system design and macroscopic simulation in one straightforward to use, widely available environment. To illustrate the methodology, the STM is applied to a section of the M3/M27 Ramp Metering Pilot Scheme in the UK. This Highways Agency sponsored project, based in the Southampton area, utilises traffic lights at the on-ramp entrances to regulate access to the main carriageway of the motorway, in an attempt to maintain flow close to the capacity. The paper utilises the model to help design a locally-coordinated ramp metering algorithm, based on proportional-integral-plus (PIP) control methods. In this manner, the STM proves particularly valuable for the application of multi-objective optimisation techniques in the design of new traffic management systems.