Robust similarity registration technique for volumetric shapes represented by characteristic functions

This paper proposes a novel similarity registration technique for volumetric shapes implicitly represented by their characteristic functions (CFs). Here, the calculation of rotation parameters is considered as a spherical crosscorrelation problem and the solution is therefore found using the standard phase correlation technique facilitated by principal components analysis (PCA).Thus, fast Fourier transform (FFT) is employed to vastly improve efficiency and robustness. Geometric moments are then used for shape scale estimation which is independent from rotation and translation parameters. It is numericallydemonstrated that our registration method is able to handle shapes with various topologies and robust to noise and initial poses. Further validation of our method is performed by registering a lung database

A framework for 3D vessel analysis using whole slide images of liver tissue sections

Three-dimensional (3D) high resolution microscopic images have high potential for improving the understanding of both normal and disease processes where structural changes or spatial relationship of disease features are significant. In this paper, we develop a complete framework applicable to 3D pathology analytical imaging, with an application to whole slide images of sequential liver slices for 3D vessel structure analysis. The analysis workflow consists of image registration, segmentation, vessel cross-section association, interpolation, and volumetric rendering. To identify biologically-meaningful correspondence across adjacent slides, we formulate a similarity function for four association cases. The optimal solution is then obtained by constrained Integer Programming. We quantitatively and qualitatively compare our vessel reconstruction results with human annotations. Validation results indicate a satisfactory concordance as measured both by region-based and distance-based metrics. These results demonstrate a promising 3D vessel analysis framework for whole slide images of liver tissue sections

Automated detection of brain abnormalities in neonatal hypoxia ischemic injury from MR images.

We compared the efficacy of three automated brain injury detection methods, namely symmetry-integrated region growing (SIRG), hierarchical region splitting (HRS) and modified watershed segmentation (MWS) in human and animal magnetic resonance imaging (MRI) datasets for the detection of hypoxic ischemic injuries (HIIs). Diffusion weighted imaging (DWI, 1.5T) data from neonatal arterial ischemic stroke (AIS) patients, as well as T2-weighted imaging (T2WI, 11.7T, 4.7T) at seven different time-points (1, 4, 7, 10, 17, 24 and 31 days post HII) in rat-pup model of hypoxic ischemic injury were used to assess the temporal efficacy of our computational approaches. Sensitivity, specificity, and similarity were used as performance metrics based on manual ('gold standard') injury detection to quantify comparisons. When compared to the manual gold standard, automated injury location results from SIRG performed the best in 62% of the data, while 29% for HRS and 9% for MWS. Injury severity detection revealed that SIRG performed the best in 67% cases while 33% for HRS. Prior information is required by HRS and MWS, but not by SIRG. However, SIRG is sensitive to parameter-tuning, while HRS and MWS are not. Among these methods, SIRG performs the best in detecting lesion volumes; HRS is the most robust, while MWS lags behind in both respects

A Solution to The Similarity Registration Problem of Volumetric Shapes

This paper provides a novel solution to the volumetric similarity registration problem usually encountered in statistical study of shapes and shape-based image segmentation. Shapes are implicitly representedby characteristic functions (CFs). By mapping shapes to a spherical coordinate system, shapes to be registered are projected to unit spheres and thus, rotation and scale parameters can be conveniently calculated.Translation parameter is computed using standard phase correlation technique. The method goes through intensive tests and is shown to be fast, robust to noise and initial poses, and suitable for a variety of similarity registration problems including shapes with complex structures and various topologies

Cube-Cut: Vertebral Body Segmentation in MRI-Data through Cubic-Shaped Divergences

In this article, we present a graph-based method using a cubic template for volumetric segmentation of vertebrae in magnetic resonance imaging (MRI) acquisitions. The user can define the degree of deviation from a regular cube via a smoothness value Delta. The Cube-Cut algorithm generates a directed graph with two terminal nodes (s-t-network), where the nodes of the graph correspond to a cubic-shaped subset of the image's voxels. The weightings of the graph's terminal edges, which connect every node with a virtual source s or a virtual sink t, represent the affinity of a voxel to the vertebra (source) and to the background (sink). Furthermore, a set of infinite weighted and non-terminal edges implements the smoothness term. After graph construction, a minimal s-t-cut is calculated within polynomial computation time, which splits the nodes into two disjoint units. Subsequently, the segmentation result is determined out of the source-set. A quantitative evaluation of a C++ implementation of the algorithm resulted in an average Dice Similarity Coefficient (DSC) of 81.33% and a running time of less than a minute.Comment: 23 figures, 2 tables, 43 references, PLoS ONE 9(4): e9338