13 research outputs found

    A Nonrigid Registration Method for Correcting Brain Deformation Induced by Tumor Resection

    Get PDF
    Purpose: This paper presents a nonrigid registration method to align preoperative MRI with intraoperative MRI to compensate for brain deformation during tumor resection. This method extends traditional point-based nonrigid registration in two aspects: (1) allow the input data to be incomplete and (2) simulate the underlying deformation with a heterogeneous biomechanical model. Methods: The method formulates the registration as a three-variable (point correspondence, deformation field, and resection region) functional minimization problem, in which point correspondence is represented by a fuzzy assign matrix; Deformation field is represented by a piecewise linear function regularized by the strain energy of a heterogeneous biomechanical model; and resection region is represented by a maximal simply connected tetrahedral mesh. A nested expectation and maximization framework is developed to simultaneously resolve these three variables. Results: To evaluate this method, the authors conducted experiments on both synthetic data and clinical MRI data. The synthetic experiment confirmed their hypothesis that the removal of additional elements from the biomechanical model can improve the accuracy of the registration. The clinical MRI experiments on 25 patients showed that the proposed method outperforms the ITK implementation of a physics-based nonrigid registration method. The proposed method improves the accuracy by 2.88 mm on average when the error is measured by a robust Hausdorff distance metric on Canny edge points, and improves the accuracy by 1.56 mm on average when the error is measured by six anatomical points. Conclusions: The proposed method can effectively correct brain deformation induced by tumor resection. (C) 2014 American Association of Physicists in Medicine

    Tetrahedral Image-to-Mesh Conversion Software for Anatomic Modeling of Arteriovenous Malformations

    Get PDF
    We describe a new implementation of an adaptive multi-tissue tetrahedral mesh generator targeting anatomic modeling of Arteriovenous Malformation (AVM) for surgical simulations. Our method, initially constructs an adaptive Body-Centered Cubic (BCC) mesh of high quality elements. Then, it deforms the mesh surfaces to their corresponding physical image boundaries, hence, improving the mesh fidelity and smoothness. Our deformation scheme, which builds upon the ITK toolkit, is based on the concept of energy minimization, and relies on a multi-material point-based registration. It uses non-connectivity patterns to implicitly control the number of the extracted feature points needed for the registration, and thus, adjusts the trade-off between the achieved mesh fidelity and the deformation speed. While many medical imaging applications require robust mesh generation, there are few codes available to the public. We compare our implementation with two similar open-source image-to-mesh conversion codes: (1) Cleaver from US, and (2) CGAL from EU. Our evaluation is based on five isotropic/anisotropic segmented images, and relies on metrics like geometric & topologic fidelity, mesh quality, gradation and smoothness. The implementation we describe is open- source and it will be available within: (i) the 3D Slicer package for visualization and image analysis from Harvard Medical School, and (ii) an interactive simulator for neurosurgical procedures involving vasculature using SOFA, a framework for real-time medical simulation developed by INRIA

    Multitissue Tetrahedral Image-to-Mesh Conversion with Guaranteed Quality and Fidelity

    Get PDF
    We present a novel algorithm for tetrahedral image-to-mesh conversion which allows for guaranteed bounds on the smallest dihedral angle and on the distance between the boundaries of the mesh and the boundaries of the tissues. The algorithm produces a small number of mesh elements that comply with these bounds. We also describe and evaluate our implementation of the proposed algorithm that is compatible in performance with a state-of-the art Delaunay code, but in addition solves the small dihedral angle problem. Read More: http://epubs.siam.org/doi/10.1137/10081525

    Comparison of Physics-Based Deformable Registration Methods for Image-Guided Neurosurgery

    Get PDF
    This paper compares three finite element-based methods used in a physics-based non-rigid registration approach and reports on the progress made over the last 15 years. Large brain shifts caused by brain tumor removal affect registration accuracy by creating point and element outliers. A combination of approximation- and geometry-based point and element outlier rejection improves the rigid registration error by 2.5 mm and meets the real-time constraints (4 min). In addition, the paper raises several questions and presents two open problems for the robust estimation and improvement of registration error in the presence of outliers due to sparse, noisy, and incomplete data. It concludes with preliminary results on leveraging Quantum Computing, a promising new technology for computationally intensive problems like Feature Detection and Block Matching in addition to finite element solver; all three account for 75% of computing time in deformable registration

    3D Representation of (Buried) Water Supply Elements using Pre-Processed GPR Images

    Full text link
    [EN] In this paper, a ground penetrating radar (GPR) is used as a non-destructive method to assess the buried elements of water supply systems (WSSs). The aim is the detection of various pipe materials (such as plastic and metallic, among others), and the identification of other important aspects (e.g. water leakage). This work seeks to use the visualization advantages of the subsoil characteristics provided by pre-processed GPR images. These features, which are represented as anomalies into the images, are extracted and merged to generate 3D models. The 3D representations obtained facilitate elucidation by personnel non-highly skilful in the interpretation of data from non-destructive techniques. The work is performed on GPR images of WSS pipes taken from strategic locations of urban environments. The goal is to promote the use of these technologies in the WSSs intended to generate relevant information that allows the adequate and dynamic technical management of these systems. The results and analyses are presented in this paper.Part of this work has been developed under the support of an FPI-UPV scholarship granted to the first author by the Programa de Ayudas de Investigación y Desarrollo (PAID) of the Universitat Politècnica de València. Additionally, we wish to thank the AQUARUM consortium for their help in field data capturing.Ayala Cabrera, D.; Ocaña Levario, SJ.; Izquierdo Sebastián, J.; Pérez García, R. (2015). 3D Representation of (Buried) Water Supply Elements using Pre-Processed GPR Images. Atiner's Conference Paper Series. WAT2015(1706):3-15. http://hdl.handle.net/10251/74270S315WAT2015170

    Advancing Intra-operative Precision: Dynamic Data-Driven Non-Rigid Registration for Enhanced Brain Tumor Resection in Image-Guided Neurosurgery

    Full text link
    During neurosurgery, medical images of the brain are used to locate tumors and critical structures, but brain tissue shifts make pre-operative images unreliable for accurate removal of tumors. Intra-operative imaging can track these deformations but is not a substitute for pre-operative data. To address this, we use Dynamic Data-Driven Non-Rigid Registration (NRR), a complex and time-consuming image processing operation that adjusts the pre-operative image data to account for intra-operative brain shift. Our review explores a specific NRR method for registering brain MRI during image-guided neurosurgery and examines various strategies for improving the accuracy and speed of the NRR method. We demonstrate that our implementation enables NRR results to be delivered within clinical time constraints while leveraging Distributed Computing and Machine Learning to enhance registration accuracy by identifying optimal parameters for the NRR method. Additionally, we highlight challenges associated with its use in the operating room

    Doctor of Philosophy

    Get PDF
    dissertationVisualizing surfaces is a fundamental technique in computer science and is frequently used across a wide range of fields such as computer graphics, biology, engineering, and scientific visualization. In many cases, visualizing an interface between boundaries can provide meaningful analysis or simplification of complex data. Some examples include physical simulation for animation, multimaterial mesh extraction in biophysiology, flow on airfoils in aeronautics, and integral surfaces. However, the quest for high-quality visualization, coupled with increasingly complex data, comes with a high computational cost. Therefore, new techniques are needed to solve surface visualization problems within a reasonable amount of time while also providing sophisticated visuals that are meaningful to scientists and engineers. In this dissertation, novel techniques are presented to facilitate surface visualization. First, a particle system for mesh extraction is parallelized on the graphics processing unit (GPU) with a red-black update scheme to achieve an order of magnitude speed-up over a central processing unit (CPU) implementation. Next, extending the red-black technique to multiple materials showed inefficiencies on the GPU. Therefore, we borrow the underlying data structure from the closest point method, the closest point embedding, and the particle system solver is switched to hierarchical octree-based approach on the GPU. Third, to demonstrate that the closest point embedding is a fast, flexible data structure for surface particles, it is adapted to unsteady surface flow visualization at near-interactive speeds. Finally, the closest point embedding is a three-dimensional dense structure that does not scale well. Therefore, we introduce a closest point sparse octree that allows the closest point embedding to scale to higher resolution. Further, we demonstrate unsteady line integral convolution using the closest point method

    Doctor of Philosophy

    Get PDF
    dissertationOne of the fundamental building blocks of many computational sciences is the construction and use of a discretized, geometric representation of a problem domain, often referred to as a mesh. Such a discretization enables an otherwise complex domain to be represented simply, and computation to be performed over that domain with a finite number of basis elements. As mesh generation techniques have become more sophisticated over the years, focus has largely shifted to quality mesh generation techniques that guarantee or empirically generate numerically well-behaved elements. In this dissertation, the two complementary meshing subproblems of vertex placement and element creation are analyzed, both separately and together. First, a dynamic particle system achieves adaptivity over domains by inferring feature size through a new information passing algorithm. Second, a new tetrahedral algorithm is constructed that carefully combines lattice-based stenciling and mesh warping to produce guaranteed quality meshes on multimaterial volumetric domains. Finally, the ideas of lattice cleaving and dynamic particle systems are merged into a unified framework for producing guaranteed quality, unstructured and adaptive meshing of multimaterial volumetric domains

    On the Real-Time Performance, Robustness and Accuracy of Medical Image Non-Rigid Registration

    Get PDF
    Three critical issues about medical image non-rigid registration are performance, robustness and accuracy. A registration method, which is capable of responding timely with an accurate alignment, robust against the variation of the image intensity and the missing data, is desirable for its clinical use. This work addresses all three of these issues. Unacceptable execution time of Non-rigid registration (NRR) often presents a major obstacle to its routine clinical use. We present a hybrid data partitioning method to parallelize a NRR method on a cooperative architecture, which enables us to get closer to the goal: accelerating using architecture rather than designing a parallel algorithm from scratch. to further accelerate the performance for the GPU part, a GPU optimization tool is provided to automatically optimize GPU execution configuration.;Missing data and variation of the intensity are two severe challenges for the robustness of the registration method. A novel point-based NRR method is presented to resolve mapping function (deformation field) with the point correspondence missing. The novelty of this method lies in incorporating a finite element biomechanical model into an Expectation and Maximization (EM) framework to resolve the correspondence and mapping function simultaneously. This method is extended to deal with the deformation induced by tumor resection, which imposes another challenge, i.e. incomplete intra-operative MRI. The registration is formulated as a three variable (Correspondence, Deformation Field, and Resection Region) functional minimization problem and resolved by a Nested Expectation and Maximization framework. The experimental results show the effectiveness of this method in correcting the deformation in the vicinity of the tumor. to deal with the variation of the intensity, two different methods are developed depending on the specific application. For the mono-modality registration on delayed enhanced cardiac MRI and cine MRI, a hybrid registration method is designed by unifying both intensity- and feature point-based metrics into one cost function. The experiment on the moving propagation of suspicious myocardial infarction shows effectiveness of this hybrid method. For the multi-modality registration on MRI and CT, a Mutual Information (MI)-based NRR is developed by modeling the underlying deformation as a Free-Form Deformation (FFD). MI is sensitive to the variation of the intensity due to equidistant bins. We overcome this disadvantage by designing a Top-to-Down K-means clustering method to naturally group similar intensities into one bin. The experiment shows this method can increase the accuracy of the MI-based registration.;In image registration, a finite element biomechanical model is usually employed to simulate the underlying movement of the soft tissue. We develop a multi-tissue mesh generation method to build a heterogeneous biomechanical model to realistically simulate the underlying movement of the brain. We focus on the following four critical mesh properties: tissue-dependent resolution, fidelity to tissue boundaries, smoothness of mesh surfaces, and element quality. Each mesh property can be controlled on a tissue level. The experiments on comparing the homogeneous model with the heterogeneous model demonstrate the effectiveness of the heterogeneous model in improving the registration accuracy
    corecore