Brain Tissue Evaluation Based on Skeleton Shape and Similarity Analysis between Hemispheres

Abstract

Background: The purpose of this article is to provide a new evaluation tool based on skeleton maps to assess the tumoral and non-tumoral regions of the 2D MRI in PD-weighted (proton density) and T2w (T2-weighted type) brain images. Methods: The proposed method investigated inter-hemisphere brain tissue similarity using a mask in the right hemisphere and its mirror reflection in the left one. At the hemisphere level and for each ROI (region of interest), a morphological skeleton algorithm was used to efficiently investigate the similarity between hemispheres. Two datasets with 88 T2w and PD images belonging to healthy patients and patients diagnosed with glioma were investigated: D1 contains the original raw images affected by Rician noise and D2 consists of the same images pre-processed for noise removal. Results: The investigation was based on structural similarity assessment by using the Structural Similarity Index (SSIM) and a modified Jaccard metrics. A novel S-Jaccard (Skeleton Jaccard) metric was proposed. Cluster accuracy was estimated based on the Silhouette method (SV). The Silhouette coefficient (SC) indicates the quality of the clustering process for the SSIM and S-Jaccard. To assess the overall classification accuracy an ROC curve implementation was carried out. Conclusions: Consistent results were obtained for healthy patients and for PD images of glioma. We demonstrated that the S-Jaccard metric based on skeletal similarity is an efficient tool for an inter-hemisphere brain similarity evaluation. The accuracy of the proposed skeletonization method was smaller for the original images affected by Rician noise (AUC = 0.883 (T2w) and 0.904 (PD)) but increased for denoised images (AUC = 0.951 (T2w) and 0.969 (PD)).

3D volume reconstruction of brain tissues using nonlinear filters, k-means clustering, and Bland-Altman analysis

“…For our study, k = 3 (i.e., k = 1 is for CSF, k = 2 for WM, and k = 3 for GM). The k-means is built on an expectation-maximization algorithm and it tries to minimize distances within a cluster and maximize the distance between different clusters [13,14]:…”