Efficient Acquisition and Clustering of Local Histograms for Representing Voxel Neighborhoods

In the past years many interactive volume rendering techniques have been proposed, which exploit the neighboring environment of a voxel during rendering. In general on-the-fly acquisition of this environment is infeasible due to the high amount of data to be taken into account. To bypass this problem we propose a GPU preprocessing pipeline which allows to acquire and compress the neighborhood information for each voxel. Therefore, we represent the environment around each voxel by generating a local histogram (LH) of the surrounding voxel densities. By performing a vector quantization (VQ), the high number of LHs is than reduced to a few hundred cluster centroids, which are accessed through an index volume. To accelerate the required computational expensive processing steps, we take advantage of the highly parallel nature of this task and realize it using CUDA. For the LH compression we use an optimized hybrid CPU/GPU implementation of the k-means VQ algorithm. While the assignment of each LH to its nearest centroid is done on the GPU using CUDA, centroid recalculation after each iteration is done on the CPU. Our results demonstrate the applicability of the precomputed data, while the performance is increased by a factor of about 10 compared to previous approaches.

[1]  Stefan Bruckner,et al.  Volume visualization based on statistical transfer-function spaces , 2010, 2010 IEEE Pacific Visualization Symposium (PacificVis).

[2]  Meichun Hsu,et al.  Clustering billions of data points using GPUs , 2009, UCHPC-MAW '09.

[3]  Anders Ynnerman,et al.  Eurographics -ieee Vgtc Symposium on Visualization (2005) Extending and Simplifying Transfer Function Design in Medical Volume Rendering Using Local Histograms , 2022 .

[4]  He Li,et al.  K-Means on Commodity GPUs with CUDA , 2009, 2009 WRI World Congress on Computer Science and Information Engineering.

[5]  Michael Granitzer,et al.  Accelerating K-Means on the Graphics Processor via CUDA , 2009, 2009 First International Conference on Intensive Applications and Services.

[6]  Bernhard Preim,et al.  Viewpoint Selection for Intervention Planning , 2007, EuroVis.

[7]  Kevin Skadron,et al.  A performance study of general-purpose applications on graphics processors using CUDA , 2008, J. Parallel Distributed Comput..

[8]  J. MacQueen Some methods for classification and analysis of multivariate observations , 1967 .

[9]  Anders Ynnerman,et al.  Local Histograms for Design of Transfer Functions in Direct Volume Rendering , 2006, IEEE Transactions on Visualization and Computer Graphics.

[10]  Pedro Larrañaga,et al.  An empirical comparison of four initialization methods for the K-Means algorithm , 1999, Pattern Recognit. Lett..

[11]  Kwan-Liu Ma,et al.  The Occlusion Spectrum for Volume Classification and Visualization , 2009, IEEE Transactions on Visualization and Computer Graphics.

[12]  TariniMarco,et al.  Ambient Occlusion and Edge Cueing for Enhancing Real Time Molecular Visualization , 2006 .

[13]  Eduard Gröller,et al.  Moment curves , 2009, 2009 IEEE Pacific Visualization Symposium.

[14]  A. James Stewart,et al.  Vicinity shading for enhanced perception of volumetric data , 2003, IEEE Visualization, 2003. VIS 2003..

[15]  Timo Ropinski,et al.  Interactive Volume Rendering with Dynamic Ambient Occlusion and Color Bleeding , 2008, Comput. Graph. Forum.