Groupwise non-rigid image registration is a powerful tool to automatically establish correspondences across sets of images. Such correspondences are widely used for constructing statistical models of shape and appearance. As existing techniques usually treat registration as an optimisation problem, a good initialisation is required. Although the standard initialisation---affine transformation---generally works well, it is often inadequate when registering images of complex structures. In this thesis we present a sophisticated system that uses the sparse matches of one or more parts+geometry models as the initialisation. We show that both the model/s and its/their matches can be automatically obtained, and that the matches are able to effectively initialise a groupwise non-rigid registration algorithm, leading to accurate dense correspondences. We also show that the dense mesh models constructed during the groupwise registration process can be used to accurately annotate new images. We demonstrate the efficacy of the proposed system on three datasets of increasing difficulty, and report on a detailed quantitative evaluation of its performance.

We develop efficient techniques for the non-rigid registration of medical images by using representations that adapt to the anatomy found in such images. Images of anatomical structures typically have uniform intensity interiors and smooth boundaries. We create methods to represent such regions compactly using tetrahedra. Unlike voxel-based representations, tetrahedra can accurately describe the expected smooth surfaces of medical objects. Furthermore, the interior of such objects can be represented using a small number of tetrahedra. Rather than describing a medical object using tens of thousands of voxels, our representations generally contain only a few thousand elements. Tetrahedra facilitate the creation of efficient non-rigid registration algorithms based on finite element methods (FEM). We create a fast, FEM-based method to non-rigidly register segmented anatomical structures from two subjects. Using our compact tetrahedral representations, this method generally requires less than one minute of processing time on a desktop PC. We also create a novel method for the non-rigid registration of gray scale images. To facilitate a fast method, we create a tetrahedral representation of a displacement field that automatically adapts to both the anatomy in an image and to the displacement field. The resulting algorithm has a computational cost that is dominated by the number of nodes in the mesh (about 10,000), rather than the number of voxels in an image (nearly 10,000,000). For many non-rigid registration problems, we can find a transformation from one image to another in five minutes. This speed is important as it allows use of the algorithm during surgery. We apply our algorithms to find correlations between the shape of anatomical structures and the presence of schizophrenia. We show that a study based on our representations outperforms studies based on other representations. We also use the results of our non-rigid registration algorithm as the basis of a segmentation algorithm. That algorithm also outperforms other methods in our tests, producing smoother segmentations and more accurately reproducing manual segmentations.

No description available.

Image registration is the task of aligning two or more images into the same reference frame to compare or distinguish the images. The majority of registration methods deal with registering only two images at a time. Recently, a clustering method that concurrently registers more than two multi-sensor images was proposed, dubbed ensemble clustering. In this thesis, we apply the ensemble clustering method to deformable registration scenario for the first time. Non-rigid deformation is implemented by a FFD model based on B-splines. A regularization term is added to the cost function of the method to limit the topology and degree of the allowable deformations. However, the increased degrees of freedom in the transformations caused the Newton-type optimization process to become ill-conditioned. This made the registration process unstable. We solved this problem by using the matrix approximation afforded by the singular value decomposition (SVD). Experiments showed that the method is successfully applied to non-rigid multi-sensor ensembles and overall yields better registration results than methods that register only 2 images at a time. In addition, we parallelized the ensemble clustering method to accelerate the performance of the method. The parallelization was implemented on GPUs using CUDA (Compute Unified Device Architecture) programming model. The GPU implementation greatly reduced the running time of the method.

Image registration is the task of aligning two or more images into the same reference frame to compare or distinguish the images. The majority of registration methods deal with registering only two images at a time. Recently, a clustering method that concurrently registers more than two multi-sensor images was proposed, dubbed ensemble clustering. In this thesis, we apply the ensemble clustering method to deformable registration scenario for the first time. Non-rigid deformation is implemented by a FFD model based on B-splines. A regularization term is added to the cost function of the method to limit the topology and degree of the allowable deformations. However, the increased degrees of freedom in the transformations caused the Newton-type optimization process to become ill-conditioned. This made the registration process unstable. We solved this problem by using the matrix approximation afforded by the singular value decomposition (SVD). Experiments showed that the method is successfully applied to non-rigid multi-sensor ensembles and overall yields better registration results than methods that register only 2 images at a time. In addition, we parallelized the ensemble clustering method to accelerate the performance of the method. The parallelization was implemented on GPUs using CUDA (Compute Unified Device Architecture) programming model. The GPU implementation greatly reduced the running time of the method.

Clinically it is important to combine information provided by mammographic images from multiple views or at different times. Taking regular mammographic screening and comparing corresponding mammograms are necessary for early detection of breast cancer, which is the key to successful treatment. However, mammograms taken at different times are often obtained under different compressions, orientations or body positions. A temporal pair of mammograms may vary quite significantly due to the spatial disparities caused by the variety in acquisition environments, including the 3D position of the breast, the amount of the pressure applied, etc. Such disparities can be corrected through the process of temporal registration. We have implemented and utilized finite element models for temporal registration of digital mammography. In our work, we applied the patient specific breast model, where patients have both mammograms and MRIs available, and generic model, where only patient mammograms are available. After we applied the temporal registration algorithm, the average error among the 14 patient datasets was 3.4 plus/minus 0.86 mm for Euclidean distance and 4.3 plus/minus 0.52 mm for predicted 2D lesion position. With generic model, the average error among the 14 patient datasets using the measure of Euclidean distance between the predicted lesion position in T1 and T2 was 5.0 plus/minus 0.74 mm for Euclidean distance and 5.7 plus/minus 0.83 mm for predicted 2D lesion position. Compared with the average lesion size (10mm~40mm), this error is acceptable. With lesion correspondence, our finite element method can be used to suppress technical variations (e.g., mammogram positioning or compression) and to emphasize genuine alterations in the breast.

During orthopaedic surgery, preoperative CT scans can be aligned to the patient to assist the guidance of surgical instruments and the placement of implants. Registration (i.e. alignment) can be accomplished in many ways: by registering implanted fiducial markers, by touching a probe to the bone surface, or by aligning intraoperative two dimensional flouro images with the the three dimensional CT data. These approaches have problems: They require exposure of the bone, subject the patient and surgeons to ionizing radiation, or do both. Ultrasound can also be used to register a preoperative CT scan to the patient. The ultrasound probe is tracked as it passes over the patient and the ultrasound images are aligned to the CT data. This method eliminates the problems of bone exposure and ionizing radiation, but is computationally more difficult because the ultrasound images contain incomplete and unclear bone surfaces. In this work, we compare three methods to register a set of ultrasound images to a CT scan: Iterated Closest Point, Mutual Information and a novel method Points-to-Image. The average Target Registration Error and speed of each method is presented along with a brief summary of their strengths and weaknesses. / Thesis (Master, Computing) -- Queen's University, 2009-01-22 04:21:22.569

Quasi-articulated objects, such as human beings, are among the most commonly seen objects in our daily lives. Extensive research have been dedicated to 3D shape reconstruction and motion analysis for this type of objects for decades. A major motivation is their wide applications, such as in entertainment, surveillance and health care. Most of existing studies relied on one or more regular video cameras. In recent years, commodity depth sensors have become more and more widely available. The geometric measurements delivered by the depth sensors provide significantly valuable information for these tasks. In this dissertation, we propose three algorithms for monocular pose estimation and shape reconstruction of quasi-articulated objects using a single commodity depth sensor. These three algorithms achieve shape reconstruction with increasing levels of granularity and personalization. We then further develop a method for highly detailed shape reconstruction based on our pose estimation techniques. Our first algorithm takes advantage of a motion database acquired with an active marker-based motion capture system. This method combines pose detection through nearest neighbor search with pose refinement via non-rigid point cloud registration. It is capable of accommodating different body sizes and achieves more than twice higher accuracy compared to a previous state of the art on a publicly available dataset. The above algorithm performs frame by frame estimation and therefore is less prone to tracking failure. Nonetheless, it does not guarantee temporal consistent of the both the skeletal structure and the shape and could be problematic for some applications. To address this problem, we develop a real-time model-based approach for quasi-articulated pose and 3D shape estimation based on Iterative Closest Point (ICP) principal with several novel constraints that are critical for monocular scenario. In this algorithm, we further propose a novel method for automatic body size estimation that enables its capability to accommodate different subjects. Due to the local search nature, the ICP-based method could be trapped to local minima in the case of some complex and fast motions. To address this issue, we explore the potential of using statistical model for soft point correspondences association. Towards this end, we propose a unified framework based on Gaussian Mixture Model for joint pose and shape estimation of quasi-articulated objects. This method achieves state-of-the-art performance on various publicly available datasets. Based on our pose estimation techniques, we then develop a novel framework that achieves highly detailed shape reconstruction by only requiring the user to move naturally in front of a single depth sensor. Our experiments demonstrate reconstructed shapes with rich geometric details for various subjects with different apparels. Last but not the least, we explore the applicability of our method on two real-world applications. First of all, we combine our ICP-base method with cloth simulation techniques for Virtual Try-on. Our system delivers the first promising 3D-based virtual clothing system. Secondly, we explore the possibility to extend our pose estimation algorithms to assist physical therapist to identify their patients’ movement dysfunctions that are related to injuries. Our preliminary experiments have demonstrated promising results by comparison with the gold standard active marker-based commercial system. Throughout the dissertation, we develop various state-of-the-art algorithms for pose estimation and shape reconstruction of quasi-articulated objects by leveraging the geometric information from depth sensors. We also demonstrate their great potentials for different real-world applications.

In this thesis a methodology for representing 3D subjects and their deformations in adverse situations is studied. The study is focused in providing methods based on registration techniques to improve the data in situations where the sensor is working in the limit of its sensitivity. In order to do this, it is proposed two methods to overcome the problems which can difficult the process in these conditions. First a rigid registration based on model registration is presented, where the model of 3D planar markers is used. This model is estimated using a proposed method which improves its quality by taking into account prior knowledge of the marker. To study the deformations, it is proposed a framework to combine multiple spaces in a non-rigid registration technique. This proposal improves the quality of the alignment with a more robust matching process that makes use of all available input data. Moreover, this framework allows the registration of multiple spaces simultaneously providing a more general technique. Concretely, it is instantiated using colour and location in the matching process for 3D location registration.

Cette thèse présente les travaux réalisés en vue de l’élaboration d’un modèle cardiaque associant croissance, mouvement et circulation sanguine pour permettre ensuite la construction d’un modèle patient à partir d’un modèle de population. Le premier axe de ce travail est la simulation de la croissance bi-ventriculaire. Un modèle existant de surface unique, calculé à l’aide de méthodes statistiques, a été généralisé à un modèle bi-ventriculaire puis appliqué à la tétralogie de Fallot (ToF). Le deuxième axe concerne la modélisation du mouvement cardiaque au niveau de la population. Un modèle d’ordre réduit basé sur un modèle Polyaffine et LogDemons a été proposé. Il simule la dynamique cardiaque avec peu de paramètres. Les paramètres de transformation sont analysés par des méthodes statistiques. Un modèle de mouvement moyen a été calculé pour représenter le mouvement standard de la population. Le troisième axe s'intéresse à la simulation de l’écoulement sanguin à l’échelle de la population. La complexité des simulations spécifiques à un patient a été réduite grâce à l’utilisation de méthodes d’analyse d’image, de dynamique des fluides numérique et de réduction d’ordre de modèle. La simulation du flux sanguin dans l’artère pulmonaire pour des patients ToF a permis de mieux comprendre l’impact du sang régurgité sur la pression et la vitesse. Étant donné nos contributions sur ces trois axes, nous sommes maintenant en bonne position pour élaborer le modèle couplé des contributions interdépendantes de la croissance, du mouvement et de l'écoulement sanguin. Ce modèle pourrait être utilisé afin d'aider la planification de la thérapie chez les patients atteints de maladies cardiaques. / This thesis presents work towards a coupled model of cardiac growth, motion, and blood flow to enable predictive patient-specific models to be built from a population-based model. The first axis of this work is to simulate bi-ventricular growth through aging. A previously proposed single surface model computed using statistical methods was extended to a bi-ventricular model and applied to Tetralogy of Fallot patients to model the complex evolution of the ventricles due to the pathology. The second axis concerns the development of a model to simulate cardiac motion at a population level. A reduced-order cardiac-specific motion model was proposed to simulate the motion dynamics with a small number of parameters using a Polyaffine and LogDemons based model. From the computed transformations, the parameters were analysed using statistical methods to obtain population-based measures of normality. A mean motion model was derived to represent the normal motion for a given population. The third axis is to develop a model of population-based flow dynamics. The complexity of patient-specific simulations was reduced by combining image analysis, computational fluid dynamics and model order reduction techniques. Blood flow through the pulmonary artery in Tetralogy of Fallot patients was simulated to better understand the impact of regurgitated blood on pressure and velocity. Given our contributions on these three axes, we are now in a good position to couple the models in order to capture the interrelated contributions of growth, motion and flow. Such a model could be used to aid in therapy planning and decision making for patients with heart disease.