Compression of sequences of 3D-volume surface projections
- 1.6k Downloads
The large data sets constituting 3D-volumes of reasonable resolution inflict high costs in terms of storage space and computation time. In this paper we describe an algorithm for data compression of sequences of 3D-volume projections where the projection angle increment is small and the surfaces of the objects in the volume are rendered using depth-only shading. The algorithm is based on a ray-casting method for incremental generation of such sequences. Experiments on a specific CT-volume yielded a compression factor of 32 for an angle increment of 1 degree and grid-point accuracy in object surface localization.
KeywordsData compression visualization ray-casting
Unable to display preview. Download preview PDF.
- Farell E J, Zapulla R A (1989). Three-Dimensional Data Visualization and Biomedical Applications. CRC Critical Reviews in Biomedical Engineering, Vol. 16: 323–363.Google Scholar
- Foley J D, van Dam A, Feiner S K, Hughes J F (1990). Computer Graphics: Principles and Practice (2nd Ed.). Addison-Wesley.Google Scholar
- Gudmundsson B and Randén M (1990). Incremental Generation of Projections of CT-Volumes. Proc. First Conference on Visualization in Biomedical Computing, Atlanta, Georgia, USA.Google Scholar
- Herman, Lui (1979). Three-Dimensional Display of Human Organs from Computed Tomograms. Computer Graphics and Image Processing, Vol. 9:, 1–21.Google Scholar
- Levoy M (1990). Efficient Ray Tracing of Volume Data. ACM Transactions on Graphics, Vol. 9: 245–261.Google Scholar
- Lenz R, Gudmundsson B, Lindskog B, Danielsson P E (1986). Display of density volumes. IEEE Computer Graphics and Applications. Vol. 6(7): 20–29.Google Scholar
- Magnusson M, Lenz R, Danielsson P E (1988). Evaluation of methods for shaded surface display of CT-volumes. Proc. Ninth International Conference on Pattern Recognition, Rome, Italy.Google Scholar
- Tiede U, Hoehne K H, Bomans M, Pommert A, Riemer M, Wiebecke G (1990). Investigation of Medical 3D-Rendering Algorithms. IEEE Computer Graphics and Applications. Vol. 10(2): 41–53.Google Scholar