1,052 research outputs found

    Local interpolation schemes for landmark-based image registration: a comparison

    Full text link
    In this paper we focus, from a mathematical point of view, on properties and performances of some local interpolation schemes for landmark-based image registration. Precisely, we consider modified Shepard's interpolants, Wendland's functions, and Lobachevsky splines. They are quite unlike each other, but all of them are compactly supported and enjoy interesting theoretical and computational properties. In particular, we point out some unusual forms of the considered functions. Finally, detailed numerical comparisons are given, considering also Gaussians and thin plate splines, which are really globally supported but widely used in applications

    Robust Cardiac Motion Estimation using Ultrafast Ultrasound Data: A Low-Rank-Topology-Preserving Approach

    Get PDF
    Cardiac motion estimation is an important diagnostic tool to detect heart diseases and it has been explored with modalities such as MRI and conventional ultrasound (US) sequences. US cardiac motion estimation still presents challenges because of the complex motion patterns and the presence of noise. In this work, we propose a novel approach to estimate the cardiac motion using ultrafast ultrasound data. -- Our solution is based on a variational formulation characterized by the L2-regularized class. The displacement is represented by a lattice of b-splines and we ensure robustness by applying a maximum likelihood type estimator. While this is an important part of our solution, the main highlight of this paper is to combine a low-rank data representation with topology preservation. Low-rank data representation (achieved by finding the k-dominant singular values of a Casorati Matrix arranged from the data sequence) speeds up the global solution and achieves noise reduction. On the other hand, topology preservation (achieved by monitoring the Jacobian determinant) allows to radically rule out distortions while carefully controlling the size of allowed expansions and contractions. Our variational approach is carried out on a realistic dataset as well as on a simulated one. We demonstrate how our proposed variational solution deals with complex deformations through careful numerical experiments. While maintaining the accuracy of the solution, the low-rank preprocessing is shown to speed up the convergence of the variational problem. Beyond cardiac motion estimation, our approach is promising for the analysis of other organs that experience motion.Comment: 15 pages, 10 figures, Physics in Medicine and Biology, 201

    Elastic brain image registration using mutual information

    Get PDF
    Image Registration is the determination of a geometrical transformation that aligns points in one image of an object with corresponding points in another image. The source image is geometrically transformed to match the target image. The geometric transformation can be rigid or non-rigid. Rigid transformations preserve straight lines and angles between straight lines. The basic rigid transformations are rotation, scaling and translation. In this thesis non-rigid registration using B-splines is the method being used to take into account the elastic change in the brain structure. The B-spline equation is a type of curved transformation that does not preserve the straightness of lines, as is the case with rigid transformation. A similarity measure is based on similar pixel values in the image pairs. It is used as a cost function to measure the similarity between the source and target image. Mutual information is a similarity measure based on the probability density function. Optimization of both rigid and non-rigid registration techniques is performed to obtain the registration parameters that define the best geometrical transformation. The parameters are optimized based on the mutual information. Neurosurgery is an application of image registration and requires accurate surgical planning and guidance because of complex and delicate structures in the brain. Over the course of the surgery, the brain changes its shape in reaction to mechanical and physiological changes associated with the surgery such as loss of cerebrospinal fluid and gravity forces

    Symmetry-guided nonrigid registration: the case for distortion correction in multidimensional photoemission spectroscopy

    Full text link
    Image symmetrization is an effective strategy to correct symmetry distortion in experimental data for which symmetry is essential in the subsequent analysis. In the process, a coordinate transform, the symmetrization transform, is required to undo the distortion. The transform may be determined by image registration (i.e. alignment) with symmetry constraints imposed in the registration target and in the iterative parameter tuning, which we call symmetry-guided registration. An example use case of image symmetrization is found in electronic band structure mapping by multidimensional photoemission spectroscopy, which employs a 3D time-of-flight detector to measure electrons sorted into the momentum (kxk_x, kyk_y) and energy (EE) coordinates. In reality, imperfect instrument design, sample geometry and experimental settings cause distortion of the photoelectron trajectories and, therefore, the symmetry in the measured band structure, which hinders the full understanding and use of the volumetric datasets. We demonstrate that symmetry-guided registration can correct the symmetry distortion in the momentum-resolved photoemission patterns. Using proposed symmetry metrics, we show quantitatively that the iterative approach to symmetrization outperforms its non-iterative counterpart in the restored symmetry of the outcome while preserving the average shape of the photoemission pattern. Our approach is generalizable to distortion corrections in different types of symmetries and should also find applications in other experimental methods that produce images with similar features

    Fast volumetric registration method for tumor follow-up in pulmonary CT exams

    Get PDF
    An oncological patient may go through several tomographic acquisitions during a period of time, needing an appropriate registration. We propose an automatic volumetric intrapatient registration method for tumor follow-up in pulmonary CT exams. The performance of our method is evaluated and compared with other registration methods based on optimization techniques. We also compared the metrics behavior to inspect which metric is more sensitive to changes due to the presence of lung tumors

    Elastic image registration using parametric deformation models

    Get PDF
    The main topic of this thesis is elastic image registration for biomedical applications. We start with an overview and classification of existing registration techniques. We revisit the landmark interpolation which appears in the landmark-based registration techniques and add some generalizations. We develop a general elastic image registration algorithm. It uses a grid of uniform B-splines to describe the deformation. It also uses B-splines for image interpolation. Multiresolution in both image and deformation model spaces yields robustness and speed. First we describe a version of this algorithm targeted at finding unidirectional deformation in EPI magnetic resonance images. Then we present the enhanced and generalized version of this algorithm which is significantly faster and capable of treating multidimensional deformations. We apply this algorithm to the registration of SPECT data and to the motion estimation in ultrasound image sequences. A semi-automatic version of the registration algorithm is capable of accepting expert hints in the form of soft landmark constraints. Much fewer landmarks are needed and the results are far superior compared to pure landmark registration. In the second part of this thesis, we deal with the problem of generalized sampling and variational reconstruction. We explain how to reconstruct an object starting from several measurements using arbitrary linear operators. This comprises the case of traditional as well as generalized sampling. Among all possible reconstructions, we choose the one minimizing an a priori given quadratic variational criterion. We give an overview of the method and present several examples of applications. We also provide the mathematical details of the theory and discuss the choice of the variational criterion to be used
    corecore