The Multi-Dimensional Hartley Transform as a Basis for Volume Rendering

The Fast Hartley Transform (FHT), a discrete version of the Hartley Transform (HT), has been studied in various papers and shown to be faster and more convenient to implement and handle than the corresponding Fast Fourier Transform (FFT). As the HT is not as nicely separable as the FT, a multidimensional version of the HT needs to perform a final correction step to convert the result of separate HTs for each dimension into the final multi-dimensional transform. Although there exist algorithms for two and three dimensions, no generalization to arbitrary dimensions can be found in the literature. We demonstrate an easily comprehensible and efficient implementation of the fast HT and its multi-dimensional extension. By adapting this algorithm to volume rendering by the projection-slice theorem and by the use for filter analysis in frequency domain we further demonstrate the importance of the HT in this application area.

[1]  Ronald N. Bracewell.  Assessing the Hartley transform , 1990, IEEE Trans. Acoust. Speech Signal Process..

[2]  Steve Marschner,et al.  An evaluation of reconstruction filters for volume rendering , 1994, Proceedings Visualization '94.

[3]  Stephen A. Dyer,et al.  Digital signal processing , 2018, 8th International Multitopic Conference, 2004. Proceedings of INMIC 2004..

[4]  J. Davenport.  Editor , 1960 .

[5]  J. A. Parker,et al.  Comparison of Interpolating Methods for Image Resampling , 1983, IEEE Transactions on Medical Imaging.

[6]  L. Rabiner,et al.  A digital signal processing approach to interpolation , 1973 .

[7]  James F. Blinn.  Jim Blinn's corner-return of the Jaggy (high frequency filtering) , 1989, IEEE Computer Graphics and Applications.

[8]  C.E. Shannon,et al.  Communication in the Presence of Noise , 1949, Proceedings of the IRE.

[9]  Brian K. Rutt,et al.  Fast reprojection of volume data , 1990, [1990] Proceedings of the First Conference on Visualization in Biomedical Computing.

[10]  Arun N. Netravali,et al.  Reconstruction filters in computer-graphics , 1988, SIGGRAPH.

[11]  R. Bracewell,et al.  Fast two-dimensional Hartley transform , 1986, Proceedings of the IEEE.

[12]  Marc Levoy,et al.  Frequency domain volume rendering , 1993, SIGGRAPH.

[13]  Marc Levoy,et al.  Volume rendering using the Fourier projection-slice theorem , 1992 .

[14]  David Salesin,et al.  Wavelets for computer graphics: theory and applications , 1996 .

[15]  R. Bracewell.  The Fourier transform. , 1989, Scientific American.

[16]  R. Hartley.  A More Symmetrical Fourier Analysis Applied to Transmission Problems , 1942, Proceedings of the IRE.

[17]  James F. Blinn.  What we need around here is more aliasing (computer graphics) , 1989, IEEE Computer Graphics and Applications.

[18]  Ronald N. Bracewell.  The Hartley transform , 1986 .

[19]  Emmanuel Ifeachor,et al.  Digital Signal Processing: A Practical Approach , 1993 .

[20]  C. Shannon,et al.  Communication In The Presence Of Noise , 1998, Proceedings of the IEEE.

[21]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[22]  Hong Hao,et al.  A three-dimensional DFT algorithm using the fast Hartley transform , 1987, Proceedings of the IEEE.

[23]  Michael E. Goss,et al.  An adjustable gradient filter for volume visualization image enhancement , 1994 .

[24]  Thomas Malzbender,et al.  Fourier volume rendering , 1993, TOGS.

[25]  Thomas Malzbender,et al.  Frequency Analysis of Gradient Estimators in Volume Rendering , 1996, IEEE Trans. Vis. Comput. Graph..