Search PubMed⌕ Search

Biomedical subjects

Hervé Delingette

Publications and source records attributed to Hervé Delingette.

9 recordsLinked to original sources

Building maps of local apparent conductivity of the epicardium with a 2-D electrophysiological model of the heart.

In this paper, we address the problem of estimating the parameters of an electrophysiological model of the heart from a set of electrical recordings. The chosen model is the reaction-diffusion model on the transmembrane potential proposed by Aliev and Panfilov. For this model of the transmembrane, we estimate a local apparent two-dimensional conductivity from a measured depolarization time distribution. First, we perform an initial adjustment including the choice of initial conditions and of a set of global parameters. We then propose a local estimation by minimizing the quadratic error between the depolarization time computed by the model and the measures. As a first step we address the problem on the epicardial surface in the case of an isotropic version of the Aliev and Panfilov model. The minimization is performed using Brent method without computing the derivative of the error. The feasibility of the approach is demonstrated on synthetic electrophysiological measurements. A proof of concept is obtained on real electrophysiological measures of normal and infarcted canine hearts.

Action Potentials↗

Hybrid formulation of the model-based non-rigid registration problem to improve accuracy and robustness.

We present a new algorithm to register 3D pre-operative Magnetic Resonance (MR) images with intra-operative MR images of the brain. This algorithm relies on a robust estimation of the deformation from a sparse set of measured displacements. We propose a new framework to compute iteratively the displacement field starting from an approximation formulation (minimizing the sum of a regularization term and a data error term) and converging toward an interpolation formulation (least square minimization of the data error term). The robustness of the algorithm is achieved through the introduction of an outliers rejection step in this gradual registration process. We ensure the validity of the deformation by the use of a biomechanical model of the brain specific to the patient, discretized with the finite element method. The algorithm has been tested on six cases of brain tumor resection, presenting a brain shift up to 13 mm.

Algorithms↗

4D deformable models with temporal constraints: application to 4D cardiac image segmentation.

Segmentation of time series of 3D cardiac images is clinically used for the assessment of the mechanical function of the left ventricle. To take into account the 4D (3D+T) nature of those images, we propose to extend the deformable surface framework by introducing time-dependent constraints. Thus, in addition to computing an internal force for enforcing the regularity of the deformable model, prior motion knowledge is introduced in the deformation process through either temporal smoothing or trajectory constraints. In this paper, deformable surfaces are represented as simplex meshes owing to their generality and their ability to compute mean curvature at each vertex. The segmentation accuracy of this 4D deformable model is estimated on synthetic SPECT image sequences for which a ground truth about the LV volume is known. Segmentation of non-synthetic SPECT and other modalities 4D images is also discussed.

Heart↗

Robust nonrigid registration to capture brain shift from intraoperative MRI.

We present a new algorithm to register 3-D preoperative magnetic resonance (MR) images to intraoperative MR images of the brain which have undergone brain shift. This algorithm relies on a robust estimation of the deformation from a sparse noisy set of measured displacements. We propose a new framework to compute the displacement field in an iterative process, allowing the solution to gradually move from an approximation formulation (minimizing the sum of a regularization term and a data error term) to an interpolation formulation (least square minimization of the data error term). An outlier rejection step is introduced in this gradual registration process using a weighted least trimmed squares approach, aiming at improving the robustness of the algorithm. We use a patient-specific model discretized with the finite element method in order to ensure a realistic mechanical behavior of the brain tissue. To meet the clinical time constraint, we parallelized the slowest step of the algorithm so that we can perform a full 3-D image registration in 35 s (including the image update time) on a heterogeneous cluster of 15 personal computers. The algorithm has been tested on six cases of brain tumor resection, presenting a brain shift of up to 14 mm. The results show a good ability to recover large displacements, and a limited decrease of accuracy near the tumor resection cavity.

Algorithms↗

Realistic simulation of the 3-D growth of brain tumors in MR images coupling diffusion with biomechanical deformation.

We propose a new model to simulate the three-dimensional (3-D) growth of glioblastomas multiforma (GBMs), the most aggressive glial tumors. The GBM speed of growth depends on the invaded tissue: faster in white than in gray matter, it is stopped by the dura or the ventricles. These different structures are introduced into the model using an atlas matching technique. The atlas includes both the segmentations of anatomical structures and diffusion information in white matter fibers. We use the finite element method (FEM) to simulate the invasion of the GBM in the brain parenchyma and its mechanical interaction with the invaded structures (mass effect). Depending on the considered tissue, the former effect is modeled with a reaction-diffusion or a Gompertz equation, while the latter is based on a linear elastic brain constitutive equation. In addition, we propose a new coupling equation taking into account the mechanical influence of the tumor cells on the invaded tissues. The tumor growth simulation is assessed by comparing the in-silico GBM growth with the real growth observed on two magnetic resonance images (MRIs) of a patient acquired with 6 mo difference. Results show the feasibility of this new conceptual approach and justifies its further evaluation.

Algorithms↗

Expert knowledge-guided segmentation system for brain MRI.

We describe an automated 3-D segmentation system for in vivo brain magnetic resonance images (MRI). Our segmentation method combines a variety of filtering, segmentation, and registration techniques and makes maximum use of the available a priori biomedical expertise, both in an implicit and an explicit form. We approach the issue of boundary finding as a process of fitting a group of deformable templates (simplex mesh surfaces) to the contours of the target structures. These templates evolve in parallel, supervised by a series of rules derived from analyzing the template's dynamics and from medical experience. The templates are also constrained by knowledge on the expected textural and shape properties of the target structures. We apply our system to segment four brain structures (corpus callosum, ventricles, hippocampus, and caudate nuclei) and discuss its robustness to imaging characteristics and acquisition noise.

Algorithms↗

Learning object correspondences with the observed transport shape measure.

We propose a learning method which introduces explicit knowledge to the object correspondence problem. Our approach uses an a priori learning set to compute a dense correspondence field between two objects, where the characteristics of the field bear close resemblance to those in the learning set. We introduce a new local shape measure we call the "observed transport measure", whose properties make it particularly amenable to the matching problem. From the values of our measure obtained at every point of the objects to be matched, we compute a distance matrix which embeds the correspondence problem in a highly expressive and redundant construct and facilitates its manipulation. We present two learning strategies that rely on the distance matrix and discuss their applications to the matching of a variety of 1-D, 2-D and 3-D objects, including the corpus callosum and ventricular surfaces.

Algorithms↗

Automatic detection and segmentation of evolving processes in 3D medical images: Application to multiple sclerosis.

The study of temporal series of medical images can be helpful for physicians to perform pertinent diagnoses and to help them in the follow-up of a patient: in some diseases, lesions, tumors or anatomical structures vary over time in size, position, composition, etc., either because of a natural pathological process or under the effect of a drug or a therapy. It is a laborious and subjective task to visually and manually analyze such images. Thus the objective of this work was to automatically detect regions with apparent local volume variation with a vector field operator applied to the local displacement field obtained after a non-rigid registration between two successive temporal images. On the other hand, quantitative measurements, such as the volume variation of lesions or segmentation of evolving lesions, are important. By studying the information of apparent shrinking areas in the direct and reverse displacement fields between images, we are able to segment evolving lesions. Then we propose a method to segment lesions in a whole temporal series of images. In this article we apply this approach to automatically detect and segment multiple sclerosis lesions that evolve in time series of MRI scans of the brain. At this stage, we have only applied the approach to a few experimental cases to demonstrate its potential. A clinical validation remains to be done, which will require important additional work.

Automation↗

[Non-linear elastic deformable models for real-time surgery simulation].

In this article, we describe the latest developments of the minimally invasive hepatic surgery simulator prototype developed at INRIA. A key problem with such a simulator is the physical modelling of soft tissues. We propose a new deformable model based on non-linear elasticity and the finite element method. This model is valid for large displacements, which means in particular that it is invariant with respect to rotations. This property improves the realism of the deformations and solves the problems related to the shortcomings of linear elasticity, which is only valid for small displacements. We also address the problem of volume variations by adding to our model incompressibility constraints. Finally, we demonstrate the relevance of this approach for the real-time simulation of laparoscopic surgical gestures on the liver.

Computer Simulation↗