PubMed Health⌕ Search

Biomedical subjects

Xavier Pennec

Publications and source records attributed to Xavier Pennec.

14 recordsLinked to original sources

Measuring brain variability by extrapolating sparse tensor fields measured on sulcal lines.

Modeling and understanding the variability of brain structures is a fundamental problem in neurosciences. Improved mathematical representations of structural brain variation are needed to help detect and understand genetic or disease related sources of abnormality, as well as to improve statistical power when integrating functional brain mapping data across subjects. In this paper, we develop a new mathematical model of normal brain variation based on a large set of cortical sulcal landmarks (72 per brain) delineated in each of 98 healthy human subjects scanned with 3D MRI (age: 51.8+/-6.2 years). We propose an original method to compute an average representation of the sulcal curves, which constitutes the mean anatomy. After affine alignment of the individual data across subjects, the second order moment distribution of the sulcal position is modeled as a sparse field of covariance tensors (symmetric, positive definite matrices). To extrapolate this information to the full brain, one has to overcome the limitations of the standard Euclidean matrix calculus. We propose an affine-invariant Riemannian framework to perform computations with tensors. In particular, we generalize radial basis function (RBF) interpolation and harmonic diffusion partial differential equations (PDEs) to tensor fields. As a result, we obtain a dense 3D variability map that agrees well with prior results on smaller subject samples. Moreover, "leave one (sulcus) out" tests show that our model is globally able to recover the missing information on brain variation when there is a consistent neighboring pattern of variability. Finally, we propose an innovative method to analyze the asymmetry of brain variability. As expected, the greatest asymmetries are found in regions that includes the primary language areas. Interestingly, any such asymmetries in anatomical variance, if it remains after anatomical normalization, could explain why there may be greater power to detect group activation in one hemisphere versus the other in fMRI studies.

Algorithms↗

Robust mosaicing with correction of motion distortions and tissue deformations for in vivo fibered microscopy.

Real-time in vivo and in situ imaging at the cellular level can be achieved with fibered confocal microscopy. As interesting as dynamic sequences may be, there is a need for the biologist or physician to get an efficient and complete representation of the entire imaged region. For this demand, the potential of this imaging modality is enhanced by using video mosaicing techniques. Classical mosaicing algorithms do not take into account the characteristics of fibered confocal microscopy, namely motion distortions, irregularly sampled frames and non-rigid deformations of the imaged tissue. Our approach is based on a hierarchical framework that is able to recover a globally consistent alignment of the input frames, to compensate for the motion distortions and to capture the non-rigid deformations. The proposed global alignment scheme is seen as an estimation problem on a Lie group. We model the relationship between the motion and the motion distortions to correct for these distortions. An efficient scattered data approximation scheme is proposed both for the construction of the mosaic and to adapt the demons registration algorithm to our irregularly sampled inputs. Controlled experiments have been conducted to evaluate the performance of our algorithm. Results on several sequences acquired in vivo on both human and mouse tissue also demonstrate the relevance of our approach.

Algorithms↗

Log-Euclidean metrics for fast and simple calculus on diffusion tensors.

Diffusion tensor imaging (DT-MRI or DTI) is an emerging imaging modality whose importance has been growing considerably. However, the processing of this type of data (i.e., symmetric positive-definite matrices), called "tensors" here, has proved difficult in recent years. Usual Euclidean operations on matrices suffer from many defects on tensors, which have led to the use of many ad hoc methods. Recently, affine-invariant Riemannian metrics have been proposed as a rigorous and general framework in which these defects are corrected. These metrics have excellent theoretical properties and provide powerful processing tools, but also lead in practice to complex and slow algorithms. To remedy this limitation, a new family of Riemannian metrics called Log-Euclidean is proposed in this article. They also have excellent theoretical properties and yield similar results in practice, but with much simpler and faster computations. This new approach is based on a novel vector space structure for tensors. In this framework, Riemannian computations can be converted into Euclidean ones once tensors have been transformed into their matrix logarithms. Theoretical aspects are presented and the Euclidean, affine-invariant, and Log-Euclidean frameworks are compared experimentally. The comparison is carried out on interpolation and regularization tasks on synthetic and clinical 3D DTI data.

Algorithms↗

Medical image registration algorithms assesment: Bronze Standard application enactment on grids using the MOTEUR workflow engine.

Medical image registration is pre-processing needed for many medical image analysis procedures. A very large number of registration algorithms are available today, but their performance is often not known and very difficult to assess due to the lack of gold standard. The Bronze Standard algorithm is a very data and compute intensive statistical approach for quantifying registration algorithms accuracy. In this paper, we describe the Bronze Standard application and we discuss the need for grids to tackle such computations on medical image databases. We demonstrate MOTEUR, a service-based workflow engine optimized for dealing with data intensive applications. MOTEUR eases the enactment of the Bronze Standard and similar applications on the EGEE production grid infrastructure. It is a generic workflow engine, based on current standards and freely available, that can be used to instrument legacy application code at low cost.

Algorithms↗

Health-e-child: an integrated biomedical platform for grid-based paediatric applications.

There is a compelling demand for the integration and exploitation of heterogeneous biomedical information for improved clinical practice, medical research, and personalised healthcare across the EU. The Health-e-Child project aims at developing an integrated healthcare platform for European Paediatrics, providing seamless integration of traditional and emerging sources of biomedical information. The long-term goal of the project is to provide uninhibited access to universal biomedical knowledge repositories for personalised and preventive healthcare, large-scale information-based biomedical research and training, and informed policy making. The project focus will be on individualized disease prevention, screening, early diagnosis, therapy and follow-up of paediatric heart diseases, inflammatory diseases, and brain tumours. The project will build a Grid-enabled European network of leading clinical centres that will share and annotate biomedical data, validate systems clinically, and diffuse clinical excellence across Europe by setting up new technologies, clinical workflows, and standards. This paper outlines the design approach being adopted in Health-e-Child to enable the delivery of an integrated biomedical information platform.

Databases as Topic↗

A novel framework for the 3D analysis of spine deformation modes.

Three-dimensional classification of scoliosis is important. However, analyzing large databases of 3D spine models is a difficult and time consuming task. To facilitate this task a method that automatically extracts the most important deformation modes from a set of 3D spine models is proposed. The 3D spine models are first converted into vertebrae relative positions and orientations. Then, a variability model composed of the Fréchet mean and of a generalized covariance is computed. A principal component analysis is applied to that variability model and the extracted components are converted into deformation modes. Those modes are visualized by animating a 3D spine model where the deformation strength varies (for a given mode). The proposed method was applied to a group of 307 scoliotic patients and meaningful deformation modes were successfully extracted. For example, patients' growth, double curves, simple thoracic curves and lumbar lordosis were extracted in the first four deformation modes. Moreover, the obtained deformation modes are not disconnected from conventional surgical classifications since a logistic regression confirmed that there is a statistically significant relation between King's classification and the first four principal deformation modes. The proposed method successfully extracted important deformation modes from a set of 3D spine models and can be used to refine arbitrary classes (King's or Lenke's classes, for instance), thus helping the design of new clinically relevant 3D classifications.

Databases, Factual↗

Assessment of brace local action on vertebrae relative poses.

Bracing is a widely used treatment of scoliosis, but there is still no consensus about its actual effect. Previous studies were based on global descriptors of the spine shape (Cobb angle, plane of maximal deformity, etc.). We present a new method to analyze braces effects at a finer scale and to find which vertebral levels are significantly affected by this treatment. The proposed method compares a group of patients treated with a brace and a control group. The 3D spine geometry of the patients from the two groups was digitized on two separate occasions: with and without brace (first group) or two times without brace (control group). The modifications of the vertebrae relative poses (combination of relative translation and rotation between consecutive vertebrae) were then extracted from 3D reconstructions. Centrality and dispersion measures of the relative poses modifications were computed using a method that take into account the non-linearity of the rotation matrix. Then, finally, multivariate hypothesis tests were used to compare the centrality and dispersion of the two groups. The method was applied to 28 untreated scoliotic patients and 41 patients treated with a Boston brace. Significant differences (p<0.01) between the centrality and dispersion measures of the relative poses modifications were respectively found from T1 to T6 and from T8 to L1. Those significant differences concords with the back flattening effect and the spatially limited correction found in other studies; however the proposed method offers a more specific evaluation of the localization of those effects.

Braces↗

Polyrigid and polyaffine transformations: a novel geometrical tool to deal with non-rigid deformations - application to the registration of histological slices.

We describe in this paper a novel kind of geometrical transformations, named polyrigid and polyaffine. These transformations efficiently code for locally rigid or affine deformations with a small number of intuitive parameters. They can describe compactly large rigid or affine movements, unlike most free-form deformation classes. Very flexible, this tool can be readily adapted to a large variety of situations, simply by tuning the number of rigid or affine components and the number of parameters describing their regions of influence. The displacement of each spatial position is defined by a continuous trajectory that follows a differential equation which averages the influence of each rigid or affine component. We show that the resulting transformations are diffeomorphisms, smooth with respect to their parameters. We devise a new and flexible numerical scheme to allow a trade-off between computational efficiency and closeness to the ideal diffeomorphism. Our algorithms are implemented within the Insight Toolkit, whose generic programming style offers rich facilities for prototyping. In this context, we derive an effective optimization strategy of the transformations which demonstrates that this new tool is highly suitable for inference. The whole framework is exemplified successfully with the registration of histological slices. This choice is challenging, because these data often present locally rigid deformations added during their acquisition, and can also present a loss of matter, which makes their registration even more difficult. Powerful and flexible, this new tool opens up large perspectives, in non-rigid 3D rigid registration as well as in shape statistics.

Algorithms↗

Fast and simple calculus on tensors in the log-Euclidean framework.

Computations on tensors have become common with the use of DT-MRI. But the classical Euclidean framework has many defects, and affine-invariant Riemannian metrics have been proposed to correct them. These metrics have excellent theoretical properties but lead to complex and slow algorithms. To remedy this limitation, we propose new metrics called Log-Euclidean. They also have excellent theoretical properties and yield similar results in practice, but with much simpler and faster computations. Indeed, Log-Euclidean computations are Euclidean computations in the domain of matrix logarithms. Theoretical aspects are presented and experimental results for multilinear interpolation and regularization of tensor fields are shown on synthetic and real DTI data.

Algorithms↗

Mosaicing of confocal microscopic in vivo soft tissue video sequences.

Fibered confocal microscopy allows in vivo and in situ imaging with cellular resolution. The potentiality of this imaging modality is extended in this work by using video mosaicing techniques. Two novelties are introduced. A robust estimator based on statistics for Riemannian manifolds is developed to find a globally consistent mapping of the input frames to a common coordinate system. A mosaicing framework using an efficient scattered data fitting method is proposed in order to take into account the non-rigid deformations and the irregular sampling implied by in vivo fibered confocal microscopy. Results on 50 images of a live mouse colon demonstrate the effectiveness of the proposed method.

Algorithms↗

Incorporating statistical measures of anatomical variability in atlas-to-subject registration for conformal brain radiotherapy.

Deforming a digital atlas towards a patient image allows the simultaneous segmentation of several structures. Such an intersubject registration is difficult as the deformations to recover are highly inhomogeneous. A priori information about the local amount of deformation to expect is precious, since it allows to optimally balance the quality of the matching versus the regularity of the deformation. However, intersubject variability makes it hard to heuristically estimate the degree of deformation. Indeed, the sizes and shapes of various structures differ greatly and their relative positions vary in a rather complex manner. In this article, we perform a statistical study of the deformations yielded by the registration of an image database with an anatomical atlas, and we propose methods to re-inject this information into the registration. We show that this provides more accurate segmentations of brain structures.

Algorithms↗

Grid powered nonlinear image registration with locally adaptive regularization.

Multi-subject non-rigid registration algorithms using dense deformation fields often encounter cases where the transformation to be estimated has a large spatial variability. In these cases, linear stationary regularization methods are not sufficient. In this paper, we present an algorithm that uses a priori information about the nature of imaged objects in order to adapt the regularization of the deformations. We also present a robustness improvement that gives higher weight to those points in images that contain more information. Finally, a fast parallel implementation using networked personal computers is presented. In order to improve the usability of the parallel software by a clinical user, we have implemented it as a grid service that can be controlled by a graphics workstation embedded in the clinical environment. Results on inter-subject pairs of images show that our method can take into account the large variability of most brain structures. The registration time for images of size 256 x 256 x 124 is 5 min on 15 standard PCs. A comparison of our non-stationary visco-elastic smoothing versus solely elastic or fluid regularizations shows that our algorithm converges faster towards a more optimal solution in terms of accuracy and transformation regularity.

Algorithms↗

Generalized image models and their application as statistical models of images.

A generalized image model (GIM) is presented. Images are represented as sets of four-dimensional (4D) sites combining position and intensity information, as well as their associated uncertainty and joint variation. This model seamlessly allows for the representation of both images and statistical models (such as those used for classification of normal/abnormal anatomy and for inter-patient registration), as well as other representations such as landmarks or meshes. A GIM-based registration method aimed at the construction and application of statistical models of images is proposed. A procedure based on the iterative closest point (ICP) algorithm is modified to deal with features other than position and to integrate statistical information. Furthermore, we modify the ICP framework by using a Kalman filter to efficiently compute the transformation. The initialization and update of the statistical model are also described. Preliminary results show the feasibility of the approach and its potentialities.

Algorithms↗