Geometry Processing of Conventionally Produced Mouse Brain Slice Images

Brain mapping research in most neuroanatomical laboratories relies on conventional processing techniques, which often introduce histological artifacts such as tissue tears and tissue loss. In this paper we present techniques and algorithms for automatic registration and 3D reconstruction of conventionally produced mouse brain slices in a standardized atlas space. This is achieved first by constructing a virtual 3D mouse brain model from annotated slices of Allen Reference Atlas (ARA). Virtual re-slicing of the reconstructed model generates ARA-based slice images corresponding to the microscopic images of histological brain sections. These image pairs are aligned using a geometric approach through contour images. Histological artifacts in the microscopic images are detected and removed using Constrained Delaunay Triangulation before performing global alignment. Finally, non-linear registration is performed by solving Laplace's equation with Dirichlet boundary conditions. Our methods provide significant improvements over previously reported registration techniques for the tested slices in 3D space, especially on slices with significant histological artifacts. Further, as an application we count the number of neurons in various anatomical regions using a dataset of 51 microscopic slices from a single mouse brain. This work represents a significant contribution to this subfield of neuroscience as it provides tools to neuroanatomist for analyzing and processing histological data.Comment: 14 pages, 11 figure

Graph matching with a dual-step EM algorithm

This paper describes a new approach to matching geometric structure in 2D point-sets. The novel feature is to unify the tasks of estimating transformation geometry and identifying point-correspondence matches. Unification is realized by constructing a mixture model over the bipartite graph representing the correspondence match and by affecting optimization using the EM algorithm. According to our EM framework, the probabilities of structural correspondence gate contributions to the expected likelihood function used to estimate maximum likelihood transformation parameters. These gating probabilities measure the consistency of the matched neighborhoods in the graphs. The recovery of transformational geometry and hard correspondence matches are interleaved and are realized by applying coupled update operations to the expected log-likelihood function. In this way, the two processes bootstrap one another. This provides a means of rejecting structural outliers. We evaluate the technique on two real-world problems. The first involves the matching of different perspective views of 3.5-inch floppy discs. The second example is furnished by the matching of a digital map against aerial images that are subject to severe barrel distortion due to a line-scan sampling process. We complement these experiments with a sensitivity study based on synthetic data

Part-to-whole Registration of Histology and MRI using Shape Elements

Image registration between histology and magnetic resonance imaging (MRI) is a challenging task due to differences in structural content and contrast. Too thick and wide specimens cannot be processed all at once and must be cut into smaller pieces. This dramatically increases the complexity of the problem, since each piece should be individually and manually pre-aligned. To the best of our knowledge, no automatic method can reliably locate such piece of tissue within its respective whole in the MRI slice, and align it without any prior information. We propose here a novel automatic approach to the joint problem of multimodal registration between histology and MRI, when only a fraction of tissue is available from histology. The approach relies on the representation of images using their level lines so as to reach contrast invariance. Shape elements obtained via the extraction of bitangents are encoded in a projective-invariant manner, which permits the identification of common pieces of curves between two images. We evaluated the approach on human brain histology and compared resulting alignments against manually annotated ground truths. Considering the complexity of the brain folding patterns, preliminary results are promising and suggest the use of characteristic and meaningful shape elements for improved robustness and efficiency.Comment: Paper accepted at ICCV Workshop (Bio-Image Computing

A feasible and automatic free tool for T1 and ECV mapping

Purpose: Cardiac magnetic resonance (CMR) is a useful non-invasive tool for characterizing tissues and detecting myocardial fibrosis and edema. Estimation of extracellular volume fraction (ECV) using T1 sequences is emerging as an accurate biomarker in cardiac diseases associated with diffuse fibrosis. In this study, automatic software for T1 and ECV map generation consisting of an executable file was developed and validated using phantom and human data. Methods: T1 mapping was performed in phantoms and 30 subjects (22 patients and 8 healthy subjects) on a 1.5T MR scanner using the modified Look-Locker inversion-recovery (MOLLI) sequence prototype before and 15 min after contrast agent administration. T1 maps were generated using a Fast Nonlinear Least Squares algorithm. Myocardial ECV maps were generated using both pre- and post-contrast T1 image registration and automatic extraction of blood relaxation rates. Results: Using our software, pre- and post-contrast T1 maps were obtained in phantoms and healthy subjects resulting in a robust and reliable quantification as compared to reference software. Coregistration of pre- and post-contrast images improved the quality of ECV maps. Mean ECV value in healthy subjects was 24.5% ± 2.5%. Conclusions: This study demonstrated that it is possible to obtain accurate T1 maps and informative ECV maps using our software. Pixel-wise ECV maps obtained with this automatic software made it possible to visualize and evaluate the extent and severity of ECV alterations

Diffeomorphic Metric Mapping of High Angular Resolution Diffusion Imaging based on Riemannian Structure of Orientation Distribution Functions

In this paper, we propose a novel large deformation diffeomorphic registration algorithm to align high angular resolution diffusion images (HARDI) characterized by orientation distribution functions (ODFs). Our proposed algorithm seeks an optimal diffeomorphism of large deformation between two ODF fields in a spatial volume domain and at the same time, locally reorients an ODF in a manner such that it remains consistent with the surrounding anatomical structure. To this end, we first review the Riemannian manifold of ODFs. We then define the reorientation of an ODF when an affine transformation is applied and subsequently, define the diffeomorphic group action to be applied on the ODF based on this reorientation. We incorporate the Riemannian metric of ODFs for quantifying the similarity of two HARDI images into a variational problem defined under the large deformation diffeomorphic metric mapping (LDDMM) framework. We finally derive the gradient of the cost function in both Riemannian spaces of diffeomorphisms and the ODFs, and present its numerical implementation. Both synthetic and real brain HARDI data are used to illustrate the performance of our registration algorithm

Consistent joint photometric and geometric image registration

In this paper, we derive a novel robust image alignment technique that performs joint geometric and photometric registration in the total least square sense. The main idea is to use the total least square metrics instead of the ordinary least square metrics, which is commonly used in the literature. While the OLS model indicates that the target image may contain noise and the reference image should be noise-free, this puts a severe limitation on practical registration problems. By introducing the TLS model, which allows perturbations in both images, we can obtain mutually consistent parameters. Experimental results show that our method is indeed much more consistent and accurate in presence of noise compared to existing registration algorithms

Image processing for plastic surgery planning

This thesis presents some image processing tools for plastic surgery planning. In particular, it presents a novel method that combines local and global context in a probabilistic relaxation framework to identify cephalometric landmarks used in Maxillofacial plastic surgery. It also uses a method that utilises global and local symmetry to identify abnormalities in CT frontal images of the human body. The proposed methodologies are evaluated with the help of several clinical data supplied by collaborating plastic surgeons