Magnetic resonance imaging (MRI) of the brain, followed by automated segmentation of the corpus callosum (CC) in midsagittal sections has important applications in neurology and neurocognitive research since the size ...
详细信息
ISBN:
(纸本)769501494
Magnetic resonance imaging (MRI) of the brain, followed by automated segmentation of the corpus callosum (CC) in midsagittal sections has important applications in neurology and neurocognitive research since the size and shape of the CC are shown to be correlated to sex, age, neurodegenerative diseases and various lateralized behavior in man. Moreover, whole head, multispectral 3D MRI recordings enable voxel-based tissue classification and estimation of total brain volumes, in addition to CC morphometric parameters. We propose a new algorithm that uses both multispectral MRI measurements (intensity values) and prior information about shape (CC template) to segment CC in midsagittal slices with very little user interaction. The algorithm has been successfully tested on a sample of 10 subjects scanned with multispectral 3D MRI, collected for a study of dyslexia. We conclude that the proposed method for CC segmentation is promising for clinical use when multispectral MR images are recorded.
Traditional plane alignment techniques are typically performed between pairs of frames. In this paper we present a method for extending existing two-frame planar-motion estimation techniques into a simultaneous multi-...
详细信息
ISBN:
(纸本)769501494
Traditional plane alignment techniques are typically performed between pairs of frames. In this paper we present a method for extending existing two-frame planar-motion estimation techniques into a simultaneous multi-frame estimation, by exploiting multi-frame geometric constraints of planar surfaces. The paper has three main contributions: (i) we show that when the camera calibration does not change, the collection of all parametric image motions of a planar surface in the scene across multiple frames is embedded in a low dimensional linear subspace;(ii) we show that the relative image motion of multiple planar surfaces across multiple frames is embedded in a yet lower dimensional linear subspace, even with varying camera calibration;and (iii) we show how these multi-frame constraints can be incorporated into simultaneous multi-frame estimation of planar motion, without explicitly recovering any 3D information, or camera calibration. The resulting multi-frame estimation process is more constrained than the individual two-frame estimations, leading to more accurate alignment, even when applied to small image regions.
In this paper, we propose a novel and practical stereo camera system that uses only one camera and a biprism placed in front of the camera. The equivalent of a stereo pair of images is formed as the left and right hal...
详细信息
ISBN:
(纸本)769501494
In this paper, we propose a novel and practical stereo camera system that uses only one camera and a biprism placed in front of the camera. The equivalent of a stereo pair of images is formed as the left and right halves of a single CCD image using a biprism. The system is therefore cheap and extremely easy to calibrate since it requires only one CCD camera. An additional advantage of the geometrical set-up is that corresponding features lie on the same scanline automatically. The single camera and biprism have led to a simple stereo system for which correspondence is very easy and which is accurate for nearby objects in a small field of view. Since we use only a single lens, calibration of the system is greatly simplified. This is due to the fact that we need to estimate only one focal length and one center of projection. Given the parameters in the biprism-stereo camera system, we can recover the depth of the object using only the disparity between the corresponding points.
Mixture modeling and clustering algorithms are effective, simple ways to represent images using a set of data centers. However, in situations where the images include background clutter and transformations such as tra...
详细信息
ISBN:
(纸本)769501494
Mixture modeling and clustering algorithms are effective, simple ways to represent images using a set of data centers. However, in situations where the images include background clutter and transformations such as translation, rotation, shearing and warping, these methods extract data centers that include clutter and represent different transformations of essentially the same data. Taking face images as an example, it would be more useful for the different clusters to represent different poses and expressions, instead of cluttered versions of different translations, scales and rotations. By including clutter and transformation as unobserved, latent variables in a mixture model, we obtain a new `transformed mixture of Gaussians', which is invariant to a specified set of transformations. We show how a linear-time EM algorithm can be used to fit this model by jointly estimating a mixture model for the data and inferring the transformation for each image. We show that this algorithm can jointly align images of a human head and learn different poses. We also find that the algorithm performs better than k-nearest neighbors and mixtures of Gaussians on handwritten digit recognition.
This paper addresses the problem of tracking several non-rigid objects over a sequence of frames acquired from a static observer using boundary and region-based information under a coupled geodesic active contour fram...
详细信息
ISBN:
(纸本)769501494
This paper addresses the problem of tracking several non-rigid objects over a sequence of frames acquired from a static observer using boundary and region-based information under a coupled geodesic active contour framework. Given the current frame, a statistical analysis is performed on the observed difference frame which provides a measurement that distinguishes between the static and mobile regions in terms of conditional probabilities. An objective function is defined that integrates boundary-based and region-based module by seeking curves that attract the object boundaries and maximize the a posteriori segmentation probability on the interior curve regions with respect to intensity and motion properties. This function is minimized using a gradient descent method. The associated Euler-Lagrange PDE is implemented using a Level-Set approach, where a very fast front propagation algorithm evolves the initial curve towards the final tracking result. Very promising experimental results are provided using real video sequences.
The surface-matching problem is investigated in this paper using a mathematical tool called harmonic maps. The theory of harmonic maps studies the mapping between different metric manifolds from the energy-minimizatio...
详细信息
ISBN:
(纸本)769501494
The surface-matching problem is investigated in this paper using a mathematical tool called harmonic maps. The theory of harmonic maps studies the mapping between different metric manifolds from the energy-minimization point of view. With the application of harmonic maps, a surface representation called harmonic shape images is generated to represent and match 3D freeform surfaces. The basic idea of harmonic shape images is to map a 3D surface patch with disc topology to a 2D domain and encode the shape information of the surface patch into the 2D image. This simplifies the surface-matching problem to a 2D image-matching problem. Due to the application of harmonic maps in generating harmonic shape images, harmonic shape images have the following advantages: they have sound mathematical background;they preserve both the shape and continuity of the underlying surfaces;and they are robust to occlusion and independent of any specific surface sampling scheme. The performance of surface matching using harmonic maps is evaluated using real data. Preliminary results are presented in the paper.
Since estimation of camera motion requires knowledge of independent motion, and moving object detection and localization requires knowledge about the camera motion, the two problems of motion estimation and segmentati...
详细信息
ISBN:
(纸本)769501494
Since estimation of camera motion requires knowledge of independent motion, and moving object detection and localization requires knowledge about the camera motion, the two problems of motion estimation and segmentation need to be solved together in a synergistic manner. This paper provides an approach to treating both these problems simultaneously. The technique introduced here is based on a novel concept, `scene ruggedness,' which parameterizes the variation in estimated scene depth with the error in the underlying three-dimensional (3D) motion. The idea is that incorrect 3D motion estimates cause distortions in the estimated depth map, and as a result smooth scene patches are computed as rugged surfaces. The correct 3D motion can be distinguished, as it does not cause any distortion and thus gives rise to the background patches with the least depth variation between depth discontinuities, with the locations corresponding to independent motion being rugged. The algorithm presented employs a binocular observer whose nature is exploited in the extraction of depth discontinuities, a step that facilitates the overall procedure, but the technique can be extended to a monocular observer in a variety of ways.
To navigate reliably in indoor environments, a mobile robot must know where it is. This includes both the ability of globally localizing the robot from scratch, as well as tracking the robot's position once its lo...
详细信息
ISBN:
(纸本)769501494
To navigate reliably in indoor environments, a mobile robot must know where it is. This includes both the ability of globally localizing the robot from scratch, as well as tracking the robot's position once its location is known. vision has long been advertised as providing a solution to these problems, but we still lack efficient solutions in unmodified environments. Many existing approaches require modification of the environment to function properly, and those that work within unmodified environments seldomly address the problem of global localization. In this paper we present a novel, vision-based localization method based on the CONDENSATION algorithm, a Bayesian filtering method that uses a sampling-based density representation. We show how the CONDENSATION algorithm can be used in a novel way to track the position of the camera platform rather than tracking an object in the scene. In addition, it can also be used to globally localize the camera platform, given a visual map of the environment. Based on these two observations, we present a vision-based robot localization method that provides a solution to a difficult and open problem in the mobile robotics community. As evidence for the viability of our approach, we show both global localization and tracking results in the context of a state of the art robotics application.
Although Behavior-Knowledge Space (BKS) method does not need any assumptions in combining multiple experts, it should build theoretically exponential storage spaces for storing and managing jointly observed K decision...
详细信息
ISBN:
(纸本)769501494
Although Behavior-Knowledge Space (BKS) method does not need any assumptions in combining multiple experts, it should build theoretically exponential storage spaces for storing and managing jointly observed K decisions from K experts. That is, combining K experts needs a (K+1)st-order probability distribution. However, it is well known that the distribution becomes unmanageable in storing and estimating, even for a small K. In order to overcome such weakness, it would be attractive to decompose the distribution into a number of component distributions and to approximate the distribution with a product of the component distributions. One of such previous works is to apply a conditional independence assumption to the distribution. Another work is to approximate the distribution with a product of only first-order tree dependencies or second-order distributions as shown in [1]. In this paper, a dependency-based framework is proposed to optimally approximate a probability distribution with a product set of dth-order dependencies where 1≤d≤K, and to combine multiple experts based on the product set using the Bayesian formalism. This framework was experimented and evaluated with a standardized CEN-PARMI data base.
A recursive method is presented for recovering 3D object shape and camera motion under orthography from an extended sequence of video images. This may be viewed as a natural extension of both the original and the sequ...
详细信息
ISBN:
(纸本)769501494
A recursive method is presented for recovering 3D object shape and camera motion under orthography from an extended sequence of video images. This may be viewed as a natural extension of both the original and the sequential factorization methods. A critical aspect of these factorization approaches is the estimation of the so-called shape space, and they may in part be characterized by the manner in which this subspace is computed. If P points are tracked through F frames, the recursive least-squares method proposed in this paper updates the shape space with complexity O(P) per frame. In contrast, the sequential factorization method updates the shape space with complexity, O(P2) per frame. The original factorization method is intended to be used in batch mode using points tracked across all available frames. It effectively computes the shape space with complexity O(FP2) after F frames. Unlike other methods, the recursive approach does not require the estimation or updating of a large measurement or covariance matrix. Experiments with real and synthetic image sequences confirm the recursive method's low computational complexity and good performance, and indicate that it is well suited to real-time applications.
暂无评论