23,454 research outputs found

    Robust point correspondence applied to two and three-dimensional image registration

    Get PDF
    Accurate and robust correspondence calculations are very important in many medical and biological applications. Often, the correspondence calculation forms part of a rigid registration algorithm, but accurate correspondences are especially important for elastic registration algorithms and for quantifying changes over time. In this paper, a new correspondence calculation algorithm, CSM (correspondence by sensitivity to movement), is described. A robust corresponding point is calculated by determining the sensitivity of a correspondence to movement of the point being matched. If the correspondence is reliable, a perturbation in the position of this point should not result in a large movement of the correspondence. A measure of reliability is also calculated. This correspondence calculation method is independent of the registration transformation and has been incorporated into both a 2D elastic registration algorithm for warping serial sections and a 3D rigid registration algorithm for registering pre and postoperative facial range scans. These applications use different methods for calculating the registration transformation and accurate rigid and elastic alignment of images has been achieved with the CSM method. It is expected that this method will be applicable to many different applications and that good results would be achieved if it were to be inserted into other methods for calculating a registration transformation from correspondence

    Cross-calibration of Time-of-flight and Colour Cameras

    Get PDF
    Time-of-flight cameras provide depth information, which is complementary to the photometric appearance of the scene in ordinary images. It is desirable to merge the depth and colour information, in order to obtain a coherent scene representation. However, the individual cameras will have different viewpoints, resolutions and fields of view, which means that they must be mutually calibrated. This paper presents a geometric framework for this multi-view and multi-modal calibration problem. It is shown that three-dimensional projective transformations can be used to align depth and parallax-based representations of the scene, with or without Euclidean reconstruction. A new evaluation procedure is also developed; this allows the reprojection error to be decomposed into calibration and sensor-dependent components. The complete approach is demonstrated on a network of three time-of-flight and six colour cameras. The applications of such a system, to a range of automatic scene-interpretation problems, are discussed.Comment: 18 pages, 12 figures, 3 table

    Medical image registration using Edgeworth-based approximation of Mutual Information

    Get PDF
    International audienceWe propose a new similarity measure for iconic medical image registration, an Edgeworth-based third order approximation of Mutual Information (MI) and named 3-EMI. Contrary to classical Edgeworth-based MI approximations, such as those proposed for inde- pendent component analysis, the 3-EMI measure is able to deal with potentially correlated variables. The performance of 3-EMI is then evaluated and compared with the Gaussian and B-Spline kernel-based estimates of MI, and the validation is leaded in three steps. First, we compare the intrinsic behavior of the measures as a function of the number of samples and the variance of an additive Gaussian noise. Then, they are evaluated in the context of multimodal rigid registration, using the RIRE data. We finally validate the use of our measure in the context of thoracic monomodal non-rigid registration, using the database proposed during the MICCAI EMPIRE10 challenge. The results show the wide range of clinical applications for which our measure can perform, including non-rigid registration which remains a challenging problem. They also demonstrate that 3-EMI outperforms classical estimates of MI for a low number of samples or a strong additive Gaussian noise. More generally, our measure gives competitive registration results, with a much lower numerical complexity compared to classical estimators such as the reference B-Spline kernel estimator, which makes 3-EMI a good candidate for fast and accurate registration tasks

    Data registration and fusion for cardiac applications

    Get PDF
    The registration and fusion of information from multiple cardiac image modalities such as magnetic resonance imaging (MRI), X-ray computed tomography (CT), positron emission tomography (PET) and single photon emission computed tomography (SPECT) has been of increasing interest to the medical community as tools for furthering physiological understanding and for diagnostic of ischemic heart diseases. Ischemic heart diseases and their consequence, myocardial infarct, are the leading cause of mortality in industrial countries. In cardiac image registration and data fusion, the combination of structural information from MR images and functional information from PET and SPECT is of special interest in the estimation of myocardial function and viability. Cardiac image registration is a more complex problem than brain image registration. The non-rigid motion of the heart and the thorax structures introduce additional difficulties in registration. In this thesis the goal was develop methods for cardiac data registration and fusion. A rigid registration method was developed to register cardiac MR and PET images. The method was based on the registration of the segmented thorax structures from MR and PET transmission images. The thorax structures were segmented from images using deformable models. A MR short axis registration with PET emission image was also derived. The rigid registration method was evaluated using simulated images and clinical MR and PET images from ten patients with multivessel coronary artery diseases. Also an elastic registration method was developed to register intra-patient cardiac MR and PET images and inter-patient head MR images. In the elastic registration method, a combination of mutual information, gradient information and smoothness of transformation was used to guide the deformation of one image towards another image. An approach for the creation of 3-D functional maps of the heart was also developed. An individualized anatomical heart model was extracted from the MR images. A rigid registration of anatomical MR images and PET metabolic images was carried out using surface based registration, and the registration of MR images with magnetocardiography (MCG) data using external markers. The method resulted in a 3-D anatomical and functional model of the heart that included structural information from the MRI and functional information from the PET and MCG. Different error sources in the registration method of the MR images and MCG data was also evaluated in this thesis. The results of the rigid MR-PET registration method were also used in the comparison of multimodality MR imaging methods to PET.reviewe

    Intersubject Regularity in the Intrinsic Shape of Human V1

    Full text link
    Previous studies have reported considerable intersubject variability in the three-dimensional geometry of the human primary visual cortex (V1). Here we demonstrate that much of this variability is due to extrinsic geometric features of the cortical folds, and that the intrinsic shape of V1 is similar across individuals. V1 was imaged in ten ex vivo human hemispheres using high-resolution (200 ÎŒm) structural magnetic resonance imaging at high field strength (7 T). Manual tracings of the stria of Gennari were used to construct a surface representation, which was computationally flattened into the plane with minimal metric distortion. The instrinsic shape of V1 was determined from the boundary of the planar representation of the stria. An ellipse provided a simple parametric shape model that was a good approximation to the boundary of flattened V1. The aspect ration of the best-fitting ellipse was found to be consistent across subject, with a mean of 1.85 and standard deviation of 0.12. Optimal rigid alignment of size-normalized V1 produced greater overlap than that achieved by previous studies using different registration methods. A shape analysis of published macaque data indicated that the intrinsic shape of macaque V1 is also stereotyped, and similar to the human V1 shape. Previoud measurements of the functional boundary of V1 in human and macaque are in close agreement with these results

    Evaluation of a fully automatic medical image registration algorithm based on mutual information

    Get PDF
    Registration is a fundamental task in image processing. Its purpose is to find a geometrical transformation that relates the points of an image to their corresponding points of another image. Many registration algorithms have been proposed in the past decade. We present a fast, fully automatic algorithm that is capable of solving rigid-body registration of 3D images of the human brain where the images are taken by different imaging devices. We joined the Retrospective Registration Evaluation Project conducted by Vanderbilt University, USA. The evaluations of our results show that our method has the potential to produce satisfactory results, but visual inspection is necessary to guard against large errors

    Chemoinformatics Research at the University of Sheffield: A History and Citation Analysis

    Get PDF
    This paper reviews the work of the Chemoinformatics Research Group in the Department of Information Studies at the University of Sheffield, focusing particularly on the work carried out in the period 1985-2002. Four major research areas are discussed, these involving the development of methods for: substructure searching in databases of three-dimensional structures, including both rigid and flexible molecules; the representation and searching of the Markush structures that occur in chemical patents; similarity searching in databases of both two-dimensional and three-dimensional structures; and compound selection and the design of combinatorial libraries. An analysis of citations to 321 publications from the Group shows that it attracted a total of 3725 residual citations during the period 1980-2002. These citations appeared in 411 different journals, and involved 910 different citing organizations from 54 different countries, thus demonstrating the widespread impact of the Group's work

    3D nonrigid medical image registration using a new information theoretic measure.

    No full text
    International audienceThis work presents a novel method for the nonrigid registration of medical images based on the Arimoto entropy, a generalization of the Shannon entropy. The proposed method employed the Jensen-Arimoto divergence measure as a similarity metric to measure the statistical dependence between medical images. Free-form deformations were adopted as the transformation model and the Parzen window estimation was applied to compute the probability distributions. A penalty term is incorporated into the objective function to smooth the nonrigid transformation. The goal of registration is to optimize an objective function consisting of a dissimilarity term and a penalty term, which would be minimal when two deformed images are perfectly aligned using the limited memory BFGS optimization method, and thus to get the optimal geometric transformation. To validate the performance of the proposed method, experiments on both simulated 3D brain MR images and real 3D thoracic CT data sets were designed and performed on the open source elastix package. For the simulated experiments, the registration errors of 3D brain MR images with various magnitudes of known deformations and different levels of noise were measured. For the real data tests, four data sets of 4D thoracic CT from four patients were selected to assess the registration performance of the method, including ten 3D CT images for each 4D CT data covering an entire respiration cycle. These results were compared with the normalized cross correlation and the mutual information methods and show a slight but true improvement in registration accuracy
    • 

    corecore