vistit the homepage Vienna University of TechnologyTECHNISCHE UNIVERSITÄT WIEN
Institut für Computergraphik und Algorithmen
Arbeitsbereich Computergraphik

Home  -   People  -   Courses  -   Research  -   Events  -   Resources  -   Jobs

 

Thomas Theußl, Robert F. Tobler, Meister Eduard Gröller
The Multi-Dimensional Hartley Transform as a Basis for Volume Rendering
TR-186-2-99-21, October 1999 [ paper]
Information
  • Publication Type: Technical Report
  • Keywords: volume rendering, Fourier transform, Hartley transform

Abstract
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.

Additional Files and Images
Additional files:
paper
paper





BibTeX
Download BibTeX-Entry
@techreport\{Theussl-1999-MDH,
  title =      "The Multi-Dimensional Hartley Transform as a Basis for
               Volume
Rendering",
  author =     "Thomas Theu{\ss}l and Robert F. Tobler and Meister Eduard
               Gr{\"o}ller",
  year =       "1999",
  abstract =   "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.",
  address =    "Favoritenstrasse 9-11/186, A-1040 Vienna, Austria",
  institution = "Institute of Computer Graphics and Algorithms, Vienna
               University of Technology",
  note =       "human contact: technical-report@cg.tuwien.ac.at",
  month =      oct,
  number =     "TR-186-2-99-21",
  keywords =   "volume rendering, Fourier transform, Hartley transform",
  URL =        "http://www.cg.tuwien.ac.at/research/publications/1999/Theussl-1999-MDH/",
}

Computer Graphics Group / Research / Publications / 1999 / Theussl-1999-MDH
Maintained by webmaster.
Last update on 30. Nov 04.
Comments to webmaster (at) cg.tuwien.ac.at.
get back to the index

Favoritenstrasse 9-11 / E186, A-1040 Wien, Austria
Tel. +43 (1) 58801-18602, Fax +43 (1) 58801-18698
www.cg.tuwien.ac.at