An efficient clustering method for fast rendering of time-varying volumetric medical data
- 121 Downloads
Visualization and exploration of time-varying volumetric medical data help clinicians for better diagnosis and treatment. However, it is a challenge to render these data in an interactive manner because of their complexity and large size. We propose an efficient clustering method for fast compression and rendering of these large dynamic data. We divide the volumes into a set of blocks and use a BIRCH (Balanced Iterative Reducing and Clustering using Hierarchies) based algorithm to cluster them, which can usually find a high quality clustering with a single scan of the blocks. In addition, the granularity of clusters can be adaptively adjusted by dynamically configuring threshold values. In each cluster of blocks, a KeyBlock is generated to represent the cluster, and therefore the storage space of the volumes is reduced greatly. In addition, we assign a lifetime to every KeyBlock and implement a dynamic memory management scheme to further reduce the storage space. During the rendering, each KeyBlock is rendered as a KeyImage, which can be reused if the view transformation and transfer function are not changed. This reuse can help to increase the rendering speed significantly. Experimental results showed that the proposed method can achieve good performance in terms of both speed optimization and space reduction.
KeywordsTime-varying volume rendering BIRCH Clustering 4-D medical images
Unable to display preview. Download preview PDF.
- 3.Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: An efficient data clustering method for very large databases. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 103–114. ACM, New York (1996) Google Scholar
- 8.Lalgudi, H., Bilgin, A., Marcellin, M., Nadar, M.: Compression of fMRI and ultrasound images using 4D SPIHT. In: Proceedings of the IEEE International Conference on Image Processing 2005 (ICIP 2005), vol. 2, pp. 746–749 (2005) Google Scholar
- 9.Chrysafis, C., Said, A., Drukarev, A., Islam, A., Pearlman, W.: SBHP—A low complexity wavelet coder. In: Proceedings of the IEEE International Conference on Acoustics, Speech, and Signal Processing 2000 (ICASSP’00), vol. 4, pp. 2035–2038 (2000) Google Scholar
- 10.Liu, Y., Pearlman, W.: Four-dimensional wavelet compression of 4-D medical images using scalable 4-D SBHP. In: Proceedings of the Data Compression Conference 2007 (DCC’07), pp. 233–242 (2007) Google Scholar
- 11.Shen, H.W., Chiang, L.J., Ma, K.L.: A fast volume rendering algorithm for time-varying fields using a time-space partitioning (TSP) tree. In: Proceedings of the IEEE International Conference on Visualization 1999 (VIS’99), pp. 371–545 (1999) Google Scholar
- 13.Shen, H.W., Johnson, C.: Differential volume rendering: A fast volume visualization technique for flow animation. In: Proceedings of the IEEE International Conference on Visualization 1994 (VIS’94), pp. 180–187 (1994) Google Scholar
- 17.Schneider, J., Westermann, R.: Compression domain volume rendering. In: Proceedings of the IEEE International Conference on Visualization 2003 (VIS’03), pp. 293–300 (2003) Google Scholar
- 22.Schroeder, W., Martin, K.M., Lorensen, W.E.: The Visualization Toolkit: An Object-Oriented Approach to 3D Graphics, 2nd edn. Prentice-Hall, Upper Saddle River (1998) Google Scholar