Efficient visibility-driven medical image visualisation via adaptive binned visibility histogram

'Visibility' is a fundamental optical property that represents the observable, by users, proportion of the voxels in a volume during interactive volume rendering. The manipulation of this 'visibility' improves the volume rendering processes; for instance by ensuring the visibility of regions of interest (ROIs) or by guiding the identification of an optimal rendering view-point. The construction of visibility histograms (VHs), which represent the distribution of all the visibility of all voxels in the rendered volume, enables users to explore the volume with real-time feedback about occlusion patterns among spatially related structures during volume rendering manipulations. Volume rendered medical images have been a primary beneficiary of VH given the need to ensure that specific ROIs are visible relative to the surrounding structures, e.g. the visualisation of tumours that may otherwise be occluded by neighbouring structures. VH construction and its subsequent manipulations, however, are computationally expensive due to the histogram binning of the visibilities. This limits the real-time application of VH to medical images that have large intensity ranges and volume dimensions and require a large number of histogram bins. In this study, we introduce an efficient adaptive binned visibility histogram (AB-VH) in which a smaller number of histogram bins are used to represent the visibility distribution of the full VH. We adaptively bin medical images by using a cluster analysis algorithm that groups the voxels according to their intensity similarities into a smaller subset of bins while preserving the distribution of the intensity range of the original images. We increase efficiency by exploiting the parallel computation and multiple render targets (MRT) extension of the modern graphical processing units (GPUs) and this enables efficient computation of the histogram. We show the application of our method to single-modality computed tomography (CT), magnetic resonance (MR) imaging and multi-modality positron emission tomography-CT (PET-CT). In our experiments, the AB-VH markedly improved the computational efficiency for the VH construction and thus improved the subsequent VH-driven volume manipulations. This efficiency was achieved without major degradation in the VH visually and numerical differences between the AB-VH and its full-bin counterpart. We applied several variants of the K-means clustering algorithm with varying Ks (the number of clusters) and found that higher values of K resulted in better performance at a lower computational gain. The AB-VH also had an improved performance when compared to the conventional method of down-sampling of the histogram bins (equal binning) for volume rendering visualisation.

[1]  Yuriko Takeshima,et al.  A feature-driven approach to locating optimal viewpoints for volume visualization , 2005, VIS 05. IEEE Visualization, 2005..

[2]  Kwan-Liu Ma,et al.  Visibility Histograms and Visibility-Driven Transfer Functions , 2011, IEEE Transactions on Visualization and Computer Graphics.

[3]  Mary Inaba,et al.  Applications of weighted Voronoi diagrams and randomization to variance-based k-clustering: (extended abstract) , 1994, SCG '94.

[4]  Satish Rao,et al.  Approximation schemes for Euclidean k-medians and related problems , 1998, STOC '98.

[5]  Stefan Bruckner,et al.  Instant Volume Visualization using Maximum Intensity Difference Accumulation , 2009, Comput. Graph. Forum.

[6]  Rui Li,et al.  Adaptive binning and dissimilarity measure for image retrieval and classification , 2001, Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR 2001.

[7]  Han-Wei Shen,et al.  View selection for volume rendering , 2005, VIS 05. IEEE Visualization, 2005..

[8]  Yihong Gong,et al.  Image indexing and retrieval based on human perceptual color clustering , 1998, Proceedings. 1998 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (Cat. No.98CB36231).

[9]  Russ B. Altman,et al.  CAMPAIGN: an open-source library of GPU-accelerated data clustering algorithms , 2011, Bioinform..

[10]  M. Giger,et al.  Automatic segmentation of liver structure in CT images. , 1993, Medical physics.

[11]  G. Kindlmann,et al.  Semi-automatic generation of transfer functions for direct volume rendering , 1998, IEEE Symposium on Volume Visualization (Cat. No.989EX300).

[12]  Sankar K. Pal,et al.  A review on image segmentation techniques , 1993, Pattern Recognit..

[13]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[14]  Sim Heng Ong,et al.  Automatic transfer function design for medical visualization using visibility distributions and projective color mapping , 2013, Comput. Medical Imaging Graph..

[15]  Jiming Liu,et al.  Speeding up K-Means Algorithm by GPUs , 2010, 2010 10th IEEE International Conference on Computer and Information Technology.

[16]  Bernhard Preim,et al.  Sinus Endoscopy - Application of Advanced GPU Volume Rendering for Virtual Endoscopy , 2008, IEEE Transactions on Visualization and Computer Graphics.

[17]  P. Patel,et al.  Segmentation of functional MRI by K-means clustering , 1995, 1995 IEEE Nuclear Science Symposium and Medical Imaging Conference Record.

[18]  David Dagan Feng,et al.  A fully automatic bed/linen segmentation for fused PET/CT MIP rendering , 2008 .

[19]  Roy H. Campbell,et al.  A Parallel Implementation of K-Means Clustering on GPUs , 2008, PDPTA.

[20]  Jian Zhang,et al.  Efficient opacity specification based on feature visibilities in direct volume rendering , 2011, Comput. Graph. Forum.

[21]  David Dagan Feng,et al.  Visibility-driven PET-CT visualisation with region of interest (ROI) segmentation , 2013, The Visual Computer.

[22]  Deepak Khosla,et al.  Segmentation of functional MRI by K-means clustering , 1995 .

[23]  Timo Ropinski,et al.  Voreen: A Rapid-Prototyping Environment for Ray-Casting-Based Volume Visualizations , 2009, IEEE Computer Graphics and Applications.

[24]  P. Sivakumar,et al.  A REVIEW ON IMAGE SEGMENTATION TECHNIQUES , 2016 .

[25]  M. Inaba Application of weighted Voronoi diagrams and randomization to variance-based k-clustering , 1994, SoCG 1994.

[26]  Mateu Sbert,et al.  Importance-Driven Focus of Attention , 2006, IEEE Transactions on Visualization and Computer Graphics.

[27]  J. Lee,et al.  Segmentation of positron emission tomography images: some recommendations for target delineation in radiation oncology. , 2010, Radiotherapy and oncology : journal of the European Society for Therapeutic Radiology and Oncology.

[28]  Ivan Viola,et al.  Automatic Transfer Functions Based on Informational Divergence , 2011, IEEE Transactions on Visualization and Computer Graphics.

[29]  Jerry L Prince,et al.  Current methods in medical image segmentation. , 2000, Annual review of biomedical engineering.

[30]  Ivan Viola,et al.  Importance-driven feature enhancement in volume visualization , 2005, IEEE Transactions on Visualization and Computer Graphics.

[31]  John G. Csernansky,et al.  Open Access Series of Imaging Studies (OASIS): Cross-sectional MRI Data in Young, Middle Aged, Nondemented, and Demented Older Adults , 2007, Journal of Cognitive Neuroscience.

[32]  H J Kim,et al.  Common crus aplasia: diagnosis by 3D volume rendering imaging using 3DFT-CISS sequence. , 2004, Clinical radiology.

[33]  M.X.H. Yan,et al.  Segmentation of 3D brain MR using an adaptive K-means clustering algorithm , 1994, Proceedings of 1994 IEEE Nuclear Science Symposium - NSS'94.

[34]  Han-Wei Shen,et al.  Dynamic View Selection for Time-Varying Volumes , 2006, IEEE Transactions on Visualization and Computer Graphics.

[35]  Ryoichi Komiya,et al.  Segmentation of CT Brain Images Using K-Means and EM Clustering , 2008, 2008 Fifth International Conference on Computer Graphics, Imaging and Visualisation.

[36]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.