332 research outputs found

    Distributed-memory large deformation diffeomorphic 3D image registration

    Full text link
    We present a parallel distributed-memory algorithm for large deformation diffeomorphic registration of volumetric images that produces large isochoric deformations (locally volume preserving). Image registration is a key technology in medical image analysis. Our algorithm uses a partial differential equation constrained optimal control formulation. Finding the optimal deformation map requires the solution of a highly nonlinear problem that involves pseudo-differential operators, biharmonic operators, and pure advection operators both forward and back- ward in time. A key issue is the time to solution, which poses the demand for efficient optimization methods as well as an effective utilization of high performance computing resources. To address this problem we use a preconditioned, inexact, Gauss-Newton- Krylov solver. Our algorithm integrates several components: a spectral discretization in space, a semi-Lagrangian formulation in time, analytic adjoints, different regularization functionals (including volume-preserving ones), a spectral preconditioner, a highly optimized distributed Fast Fourier Transform, and a cubic interpolation scheme for the semi-Lagrangian time-stepping. We demonstrate the scalability of our algorithm on images with resolution of up to 102431024^3 on the "Maverick" and "Stampede" systems at the Texas Advanced Computing Center (TACC). The critical problem in the medical imaging application domain is strong scaling, that is, solving registration problems of a moderate size of 2563256^3---a typical resolution for medical images. We are able to solve the registration problem for images of this size in less than five seconds on 64 x86 nodes of TACC's "Maverick" system.Comment: accepted for publication at SC16 in Salt Lake City, Utah, USA; November 201

    4D-CT Lung Registration and its Application for Lung Radiation Therapy

    Get PDF
    Radiation therapy has been successful in treating lung cancer patients, but its efficacy is limited by the inability to account for the respiratory motion during treatment planning and radiation dose delivery. Physics-based lung deformation models facilitate the motion computation of both tumor and local lung tissue during radiation therapy. In this dissertation, a novel method is discussed to accurately register 3D lungs across the respiratory phases from 4D-CT datasets, which facilitates the estimation of the volumetric lung deformation models. This method uses multi-level and multi-resolution optical flow registration coupled with thin plate splines (TPS), to address registration issue of inconsistent intensity across respiratory phases. It achieves higher accuracy as compared to multi-resolution optical flow registration and other commonly used registration methods. Results of validation show that the lung registration is computed with 3 mm Target Registration Error (TRE) and approximately 3 mm Inverse Consistency Error (ICE). This registration method is further implemented in GPU based real time dose delivery simulation to assist radiation therapy planning

    Planning and Evaluation of Radio-Therapeutic Treatment of Head-and-Neck Cancer Using PET/CT scanning

    Get PDF

    Deep learning cardiac motion analysis for human survival prediction

    Get PDF
    Motion analysis is used in computer vision to understand the behaviour of moving objects in sequences of images. Optimising the interpretation of dynamic biological systems requires accurate and precise motion tracking as well as efficient representations of high-dimensional motion trajectories so that these can be used for prediction tasks. Here we use image sequences of the heart, acquired using cardiac magnetic resonance imaging, to create time-resolved three-dimensional segmentations using a fully convolutional network trained on anatomical shape priors. This dense motion model formed the input to a supervised denoising autoencoder (4Dsurvival), which is a hybrid network consisting of an autoencoder that learns a task-specific latent code representation trained on observed outcome data, yielding a latent representation optimised for survival prediction. To handle right-censored survival outcomes, our network used a Cox partial likelihood loss function. In a study of 302 patients the predictive accuracy (quantified by Harrell's C-index) was significantly higher (p < .0001) for our model C=0.73 (95%\% CI: 0.68 - 0.78) than the human benchmark of C=0.59 (95%\% CI: 0.53 - 0.65). This work demonstrates how a complex computer vision task using high-dimensional medical image data can efficiently predict human survival
    • …
    corecore