Accelerating Fourier volume rendering by polar coordinate data representation
Volume rendering is an important tool to visualize three-dimensional data in biomedicine by projecting the data to a two-dimensional plane. The projection is done by ray casting and its complexity is proportional to the number of three-dimensional data points. To reduce complexity, Fourier volume rendering (FVR) uses slice projection theorem to facilitate the integration of voxels along the ray casting path. In this paper, we proposed a new method for FVR that stored and processed the frequency domain data in polar coordinate. By exploiting three aspects of data processing which is previously impossible in rectilinear coordinate, our new method is much faster than the previous methods. The first aspect is data regularity. When data are stored in polar coordinate, extracting a slice involves accessing data stored in adjacent memory location. This regularity makes memory access more efficient. The second aspect is to utilize the high data density near the origin in polar coordinate. We can obtain two benefits from this aspect. The first allows us to extract a slice by nearest-neighbor interpolation instead of more complex interpolation but without sacrificing image quality. The second allows us to trade off between image quality and memory storage. The third aspect is to recognize that converting from rectilinear coordinate to polar coordinate is a one-time process. Therefore, we can use a better interpolation kernel with larger support in coordinate conversion. In turn, most of the computation is shifted to the preprocessing stage and interactive rendering can be made very fast. In the experiments, we show that the speed in interactive visualization for our new method is independent of the size of the interpolation kernel, therefore, achieving comparable image quality at a faster rate than previous methods.
fourier volume rendering polar coordinate slice projection theorem volume visualization