Optimized Maximum Intensity Projection (MIP)
We present an improved version of the MIP algorithm that requires roughly 2%–10% of the computational effort of the brute-force, straight-forward version. The algorithm conserves the image quality and requires no pre-processing. We propose four different quality levels: a fast line-traversing nearest neighbour algorithm for previewing, two efficient approximation algorithms that are sufficient for most applications, and an analytical method for images of highest quality. Additionally we present an improved cache memory access scheme. The employed ’sub-cube’ volume data representation provides an additional speed up of at least 50% compared to the classical linear memory access. This is of particular interest for (but not restricted to) parallel volume rendering on shared memory multiprocessor systems.
KeywordsMaximum Intensity Projection Cache Coherency Trilinear Interpolation Voxel Boundary Phantom Volume
Unable to display preview. Download preview PDF.
- Rouf91.Roufchaie, V. (Edt.): Power Series Perormance Guide, Technical Report Power Series, Silicon Graphics, 1991Google Scholar
- SaGe91b.Sakas, G., Gerth, M.: Sampling and Anti-Aliasing Discrete 3D Volume Density Textures, EUROGRAPHICS’91 Award Paper, Computer and Graphics, Vol. 16, No. 1, pp. 121–134, Pergamon Press, 1992Google Scholar
- Vand91.Vandermeulen, D.: Methods for Registration, Interpolation and Inter-pretation of 3D Medical Image Data for use in 3-D Display, 3-D Modeling and Therapy Planning, Ph. D. Thesis, Katholieke Universiteit Leuven, Faculteit Toegepaste Wetenschappen, ESAT/MI2, U.D.C. 681. 3 14: 616–089, April 1991Google Scholar
- YaCK92.Yagel, R., Cohen, D., Kaufman, A.: Discrete Ray Tracing, IEEE Computer Graphics & Applications, September 1992Google Scholar