6527681
The use of kernel principal component analysis to model data distributions
Abstract We describe the use of kernel principal component analysis (KPCA) to model data distributions in high-dimensional spaces. We show that a previous approach to representing non-linear data constraints using KPCA is not generally valid, and introduce a new ‘proximity to data’ measure that behaves correctly. We investigate the relation between this measure and the actual density for various low-dimensional data distributions. We demonstrate the effectiveness of the method by applying it to the higher-dimensional case of modelling an ensemble of images of handwritten digits, showing how it can be used to extract the digit information from noisy input images.
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.
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.
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.
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.
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.
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).
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.
26633307
Reconstruction of linearly parameterized models from single images with a camera of unknown focal length
This paper deals with the problem of recovering the dimensions of an object and its pose from a single image acquired with a camera of unknown focal length. It is assumed that the object in question can be modeled as a polyhedron where the coordinates of the vertices can be expressed as a linear function of a dimension vector, /spl lambda/. The reconstruction program takes as input a set of correspondences between features in the model and features in the image. From this information the program determines an appropriate projection model for the camera (scaled orthographic or perspective), the dimensions of the object, its pose relative to the camera and, in the case of perspective projection, the focal length of the camera. We demonstrate that this reconstruction task can be framed as an unconstrained optimization problem involving a small number of variables, no more than four, regardless of the number of parameters in the dimension vector.
33669607
Patient-Specific Operative Planning for Aorto-Femoral Reconstruction Procedures
Traditionally, a surgeon will select a procedure for a particular patient based on past experience for patients with a similar state of disease. The experience gained from this patient will be selectively used when treating the next patient with similar symptoms. In this work, a surgical planning system was developed enabling a vascular surgeon to create and test alternative operative plans prior to surgery for a given patient. One dimensional and three dimensional hemodynamic (i.e. blood flow) simulations were performed for rest and exercise for operative plans for two aorto-femoral bypass patients and compared with actual postoperative data. The information that can be obtained from one-dimensional (volume flow distribution and pressure losses) and three-dimensional (wall shear stress) hemodynamic simulation may be clinically relevant to vascular surgeons planning interventions.
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>>