Two algorithms are introduced for the computation of discrete integral transforms with a multiscale approach operating in discrete three-dimensional (3-D) volumes while considering its real-time implementation. The first algorithm, referred to as 3-D discrete Radon transform of planes, will compute the summation set of values lying in discrete planes in a cube that imitates, in discrete data, the integrals on two-dimensional planes in a 3-D volume similar to the continuous Radon transform. The normals of these planes, equispaced in ascents, cover a quadrilateralized hemisphere and comprise 12 dodecants. The second proposed algorithm, referred to as the 3-D discrete John transform of lines, will sum elements lying on discrete 3-D lines while imitating the behavior of the John or x-ray continuous transform on 3-D volumes. These discrete integral transforms do not perform interpolation on input or intermediate data, and they can be computed using only integer arithmetic with linearithmic complexity, thus outperforming the methods based on the Fourier slice-projection theorem for real-time applications. We briefly prove that these transforms have fast inversion algorithms that are exact for discrete inputs.
You have requested a machine translation of selected content from our databases. This functionality is provided solely for your convenience and is in no way intended to replace human translation. Neither SPIE nor the owners and publishers of the content make, and they explicitly disclaim, any express or implied representations or warranties of any kind, including, without limitation, representations and warranties as to the functionality of the translation feature or the accuracy or completeness of the translations.
Translations are not retained in our system. Your use of this feature and the translations is subject to all use restrictions contained in the Terms and Conditions of Use of the SPIE website.