\`x^2+y_1+z_12^34\`
Advanced Search
Article Contents
Article Contents

Convergence of ray- and pixel-driven discretization frameworks in the strong operator topology

This work was supported by The Villum Foundation (Grant No.25893) and is in part based on work supported by the International Research Training Group "Optimization and Numerical Analysis for Partial Differential Equations with Nonsmooth Structures", funded by the German Research Council (DFG) and Austrian Science Fund (FWF) grant W1244.

Abstract / Introduction Full Text(HTML) Figure(14) / Table(2) Related Papers Cited by
  • Tomography is a central tool in medical applications, allowing doctors to investigate patients' internal features. The Radon transform (in two dimensions) is commonly used to model the measurement process in parallel-beam CT. Suitable discretization of the Radon transform and its adjoint (called the backprojection) is crucial. The most commonly used discretization approach combines what we refer to as the ray-driven Radon transform with what we refer to as the pixel-driven backprojection, as anecdotal reports describe these as showing the best approximation performance. However, there is little rigorous understanding of induced approximation errors. These methods involve three discretization parameters: the spatial-, detector-, and angular resolutions. Most commonly, balanced resolutions are used, i.e., the same (or similar) spatial- and detector resolutions are employed. We present an interpretation of ray- and pixel-driven discretizations as 'convolutional methods', a special class of finite-rank operators. This allows for a structured analysis that can explain observed behavior. We prove convergence in the strong operator topology of the ray-driven Radon transform and the pixel-driven backprojection under balanced resolutions, thus theoretically justifying this approach. In particular, with high enough resolutions, one can approximate the Radon transform arbitrarily well. Numerical experiments corroborate these theoretical findings.

    Mathematics Subject Classification: Primary: 44A12, 65R10, 94A08, 41A25.

    Citation:

    \begin{equation} \\ \end{equation}
  • 加载中
  • Figure 1.  On the left, an illustration of the used geometry with a straight line $ L_{\phi, s} $ in direction $ \vartheta_\phi^\perp $ with normal distance to the center $ s $ (which also corresponds to the detector offset). On the right, an illustration of the backprojection, where for fixed $ x $, we integrate values along a sine-shaped trajectory in the sinogram domain. This trajectory corresponds to all lines $ L_{\phi, s} $ passing through $ x $

    Figure 2.  On the left, the spatial domain $ \Omega $ (in fact, the larger domain $ [-1, 1]^2 $) is divided into pixels $ X_{ij} $ with width $ \delta_x\times \delta_x $. On the right, the discretization of the sinogram domain $ \mathcal{S} $ into pixels $ \Phi_q\times S_p $ with pixel centers $ (\phi_q, s_p) $ and with width $ |\Phi_q|\times \delta_s $ is shown

    Figure 3.  Depiction of the ray-driven weight function $ t\mapsto \delta_x^2 \omega^\mathrm{rd}_{\delta_\mathit{x}}(\phi, t) $ for fixed $ \phi\in \{0^\circ, 20^\circ, 45^\circ\} $ in the first three plots. For fixed $ \phi $, these are trapezoid functions (like the $ 20^\circ $ case), whose incline, height, and width depend on $ \phi $ and $ \delta_x $. In the extreme case $ \phi = 45^\circ $, the function turns into a hat function, while for $ \phi = 0^\circ $ it turns into a piecewise constant function (note the values for $ \pm \frac{\delta_x}{2} $). On the right, in the last plot, the pixel-driven weight function $ t\mapsto \delta_s^2 \omega^\mathrm{pd}_{\delta_\mathit{s}}(t) $ (a hat function) independent of $ \phi $ is shown. Note the difference in scales between the ray-driven and pixel-driven functions

    Figure 4.  Illustration of the ray-driven forward (left) and the pixel-driven backprojection (right). The ray-driven method splits integration along a straight line into the sum of values on pixels times their intersection length (colored segments). The pixel-driven backprojection approximates the angular integral (4) (along the violet curve $ x\cdot\vartheta_\phi $) by a finite sum (Riemann sum) of angular evaluations $ x\cdot\vartheta_q $ (the cyan crosses), whose values are approximated via linear interpolation in the detector dimension (using the neighboring orange pixel centers)

    Figure 5.  Depiction of the discrete $ 4096\times4096 $ pixel FORBILD head phantom placed in the $ [-12.5, 12.5]^2 $ square in a) and the corresponding $ 4096\times1800 $ analytical Radon transform in b)

    Figure 6.  Illustration of the pointwise absolute difference between the analytical Radon transform of the FORBILD phantom and the ray-driven projection (on the left) or the pixel-driven projection (on the right). For both, the balanced situation $ N_x = N_s = 4096 $ and $ N_\phi = 1800 $ is used

    Figure 7.  Illustration of the projections for $ \phi = \frac{3}{4}\pi = 135^\circ $ on the left, and for $ \phi = 135.1^\circ $ on the right. Even though the angles only differ by a tenth of a degree, the pixel-driven method reveals significant errors in the former setting that have all but disappeared in the latter one

    Figure 8.  Illustration of the relative $ L^2 $ error of the individual projections (i.e., for variable $ \phi $) $ E_{\phi_q}(g, \mathcal{R}^\mathrm{rd}_{\delta} f) $ and $ E_{\phi_q}(g, \mathcal{R}^\mathrm{pd}_{\delta} f) $. The extreme cases $ \frac{\pi}{4} $ and $ \frac{3\pi}{4} $ are far beyond the shown scale (by a factor of 10), but there are also other projections whose errors far exceed the average errors (around $ 5\ 10^{-4} $)

    Figure 9.  Illustration of the relative $ L^2 $ errors for fixed $ N_\phi = 360 $ and increasing balanced resolutions $ N_x = N_s $ between $ 256 $ and $ 8192 $ in 32 steps. On the top, the errors $ E(g, \mathcal{R}_\delta f) $ for the entire sinogram are depicted, while the figure below shows the relative error of the worst single projection $ E_\text{max}(g, \mathcal{R}_\delta f) $. As can be seen, the pixel-driven error appears stagnant

    Figure 10.  Development of relative ray-driven backprojection errors for fixed balanced resolution $ N_x = N_s = 2000 $ and increasing $ N_\phi $. The behavior is roughly $ \sqrt{\delta_\phi} $; see the red crosses for comparison

    Figure 11.  Illustration of the error $ E( \mathcal{R}^*g, \mathcal{R}^\mathrm{rd^*}_{\delta}g) $ for the fixed $ N_\phi = 90 $ and increasing $ N_x $ and three different ratios $ \frac{\delta_s}{\delta_x} = \frac{N_x}{N_s} $

    Figure 12.  The first row shows the pointwise absolute difference $ | \mathcal{R}^\mathrm{rd^*}_{\delta}g- \mathcal{R}^*g| $ for increasing balanced resolutions $ \frac{\delta_s}{\delta_x} = 1 $. The second line shows the same differences for $ \frac{\delta_s}{\delta_x} = \frac{1}{2} $. In both cases $ N_\phi = 90 $ remains fixed. Note the different colormaps between the first and second row

    Figure 13.  The evolution of relative $ L^2 $ errors $ E( \mathcal{R}^*g, \mathcal{R}^\mathrm{rd^*}_{\delta}g) $ in the ray-driven backprojection with increasing $ N_s $ while $ N_\phi = 90 $ is fixed and $ N_x = 1000 $ or $ N_x = 2000 $

    Figure 14.  Illustration supporting the proof of Lemma 2.6. In a), we depict the different cases passing through a square $ Z $ for fixed $ \phi $ (here $ 105^\circ $), where the teal lines describe the case 4 $ |s| = \underline s(\phi) $ in which the corners are precisely hit, the brown line $ |s_1|< \underline s(\phi) $ (case 1) and the red line $ |s_2| \in [\underline s(\phi), \overline s(\phi)[ $ (case 2). Moreover, the blue line is representative of case 5 (hitting exactly one corner), while the violet line representing case 3 does not hit $ Z $, and the dashed magenta line is representative of case 6 with the line intersecting with one side of $ Z $. Figures b) and c) detail the geometry of case 1 and case 2, depicting relevant right triangles.

    Algorithm 1 Convolutional Forward Projection
    Input: $N_x\times N_x$ phantom array $\overline f$, angle index $q\in [N_\phi]$ and detector index $p\in [N_s]$
    Output: $(A\overline f)[qp]$ according to (15)
    1: function Forwardprojection $ (\overline f, q, p) $
    2:   $ \text{val} \gets 0 $
    3:   for $ j\in [N_x] $ do
    4:     for $ i \in \mathcal{X}_{qp}^j: = \{i\in [N_x] \ \big| \ x_{ij}\cdot\vartheta_q-s_p \in \mathrm{supp}\left( {\omega(\phi_q, \cdot)} \right)\} $ do
    5:       $ \text{val}\gets \text{val}+\omega(\phi_q, x_{ij}\cdot \vartheta_q-s_p)\ \overline f[ij] $
    6:     end for
    7:   end for
    8:   return $ \delta_x^2\text{val} $
    9: end function
     | Show Table
    DownLoad: CSV
    Algorithm 2 Convolutional Backprojection
    Input: $N_\phi\times N_s$ sinogram array $\overline g$, spatial indices $i$ and $j$ in $[N_x]$
    Output: $(B\overline g)[ij]$ according to (16)
    1: function Backprojection $ (\overline g, i, j) $
    2:   $ \text{val} \gets 0 $
    3:   for $ q\in [N_\phi] $ do
    4:     for $ p \in \mathcal{Y}_{ij}^q: = \{p\in [N_s] \ \big| \ x_{ij}\cdot\vartheta_q-s_p \in \mathrm{supp}\left( {\omega(\phi_q, \cdot)} \right)\} $ do
    5:       $ \text{val}\gets \text{val}+|\Phi_q|\ \omega(\phi_q, x_{ij}\cdot \vartheta_q-s_p)\ \overline g[qp] $
    6:     end for
    7:   end for
    8:   return $ \delta_s\text{val} $
    9: end function
     | Show Table
    DownLoad: CSV
  • [1] H. Ammari, An Introduction to Mathematics of Emerging Biomedical Imaging, Springer, 2008.
    [2] A. H. Andersen and A. C. Kak, Simultaneous algebraic reconstruction technique (SART): A superior implementation of the ART algorithm, Ultrasonic Imaging, 6 (1984), 81-94.  doi: 10.1177/016173468400600107.
    [3] A. AverbuchR. CoifmanD. DonohoM. Israeli and J. Walden, Fast slant stack: A notion of Radon transform for data in a Cartesian grid which is rapidly computible, algebraically exact, geometrically faithful and invertible, SIAM Scientific Computing, 37 (2001), 192-206. 
    [4] M. Beckmann and A. Iske, Error estimates for filtered back projection, International Conference on Sampling Theory and Applications (SampTA), (2015), 553-557. 
    [5] K. Bredies and R. Huber, Convergence analysis of pixel-driven Radon and fanbeam transforms, SIAM Journal on Numerical Analysis, 59 (2021), 1399-1432.  doi: 10.1137/20M1326635.
    [6] K. Bredies and R. Huber, Gratopy 0.1 release candidate 1, Software, (2021). Zenodo. https://doi.org/10.5281/zenodo.5235563
    [7] A. C. CameronA. Schwope and S. Vrielmann, Astrotomography. Astronomische Nachrichten, Astronomical Notes, 325 (2004), 179-180.  doi: 10.1002/asna.200310234.
    [8] J. Conway, A Course in Functional Analysis, Springer, 2019.
    [9] B. De Man and S. Basu, Distance-driven projection and backprojection, IEEE Nuclear Science Symposium Conference Record, 3 (2002), 1477-1480.  doi: 10.1109/NSSMIC.2002.1239600.
    [10] S. R. Deans, The Radon Transform and Some of Its Applications, Krieger Publishing Company, 1993.
    [11] B. DongJ. Li and Z. Shen, X-ray CT image reconstruction via wavelet frame based regularization and Radon domain inpainting, Journal of Scientific Computing, 54 (2013), 333-349.  doi: 10.1007/s10915-012-9579-6.
    [12] Y. DongP. C. HansenM. Hochstenbach and N. Brogaard Riis, Fixing nonconvergence of algebraic iterative reconstruction with an unmatched backprojector, SIAM Journal on Scientific Computing, 41 (2019), A1822-A1839.  doi: 10.1137/18M1206448.
    [13] T. Elfving and P. C. Hansen, Unmatched projector/backprojector pairs: Perturbation and convergence analysis, SIAM Journal on Scientific Computing, 40 (2018), A573-A591.  doi: 10.1137/17M1133828.
    [14] A. Faridani, Sampling theory and parallel-beam tomography, Sampling, Wavelets and Tomography, Birkhäuser Boston, Boston, MA (2004), 225-254. doi: 10.1007/978-0-8176-8212-5_9.
    [15] H. Gao, Fast parallel algorithms for the X-ray transform and its adjoint, Medical Physics, 39 (2012), 7110-7120.  doi: 10.1118/1.4761867.
    [16] I. Gelfand and M. Graev, Integrals over hyperplanes of fundamental and generalized functions, Doklady Akademii Nauk SSSR, 135 (1960), 1307-1310. 
    [17] P. Gilbert, Iterative methods for the three-dimensional reconstruction of an object from projections, Journal of Theoretical Biology, 36 (1972), 105-117.  doi: 10.1016/0022-5193(72)90180-4.
    [18] S. Helgason, The Radon Transform, Springer, 1999.
    [19] J. Hsieh, Computed Tomography: Principles, Design, Artifacts, and Recent Advances, WA: SPIE-The International Society for Optical Engineering, 2009.
    [20] R. Huber, Pixel-Driven Projection Methods' Approximation Properties and Applications in Electron Tomography, PhD Thesis, University of Graz, Austria, 2022.
    [21] R. Huber, Github Repository with Simulations Accompanying 'Convergence of Ray- and Pixel-Driven Discretization Frameworks in the Strong Operator Topology', https://github.com/huberr92/Simulations_Convergence_Ray_Pixel_2025.git, 2025.
    [22] R. Huber, A novel interpretation of the Radon transform's ray and pixel-driven discretizations under balanced resolutions, Scale Space and Variational Methods in Computer Vision, Springer Nature Switzerland, 2025, 132-145. doi: 10.1007/978-3-031-92366-1_11.
    [23] R. HuberG. HaberfehlnerM. HollerG. Kothleitner and K. Bredies, Total generalized variation regularization for multi-modal electron tomography, Nanoscale, 11 (2019), 5617-5632.  doi: 10.1039/C8NR09058K.
    [24] A. Kingston, Orthogonal discrete Radon transform over pn$\times$pn images, Signal Process, 86 (2006), 2040-2050.  doi: 10.1016/j.sigpro.2005.09.024.
    [25] R. K. Leary and P. A. Midgley, Analytical electron tomography, MRS Bulletin, 41 (2016), 531-536.  doi: 10.1557/mrs.2016.132.
    [26] R. LiuL. FuB. De Man and H. Yu, GPU-based branchless distance-driven projection and backprojection, IEEE Transactions on Computational Imaging, 3 (2017), 617-632.  doi: 10.1109/TCI.2017.2675705.
    [27] D. Lorenz and F. Schneppe, Chambolle–Pock's primal-dual method with mismatched adjoint, Applied Mathematics & Optimization, 87 (2023).  doi: 10.1007/s00245-022-09933-5.
    [28] B. D. Man and S. Basu, Distance-driven projection and backprojection in three dimensions, Physics in Medicine & Biology, 49 (2004), 2463-2475.  doi: 10.1088/0031-9155/49/11/024.
    [29] F. Natterer, The Mathematics of Computerized Tomography, Society for Industrial and Applied Mathematics, Philadelphia, 2001.
    [30] T. M. Peters, Algorithms for fast back- and re-projection in computed tomography, IEEE Transactions on Nuclear Science, 28 (1981), 3641-3647.  doi: 10.1109/TNS.1981.4331812.
    [31] Z. QiaoG. RedlerZ. GuiY. QianB. Epel and H. Halpern, Three novel accurate pixel-driven projection methods for 2D CT and 3D EPR imaging, Journal of X-ray Science and Technology, 26 (2017), 83-102.  doi: 10.3233/XST-17284.
    [32] N. RawlinsonS. Pozgay and S. Fishwick, Seismic tomography: A window into deep earth, Physics of the Earth and Planetary Interiors, 178 (2010), 101-135.  doi: 10.1016/j.pepi.2009.10.002.
    [33] J. Scales, Tomographic inversion via the conjugate gradient method, Geophysics, 52 (1987), 179-185.  doi: 10.1190/1.1442293.
    [34] O. Scherzer, M. Grasmair, H. Grossauer, M. Haltmeier and F. Lenzen, Variational Methods in Imaging, Springer, 2008.
    [35] R. L. Siddon, Fast calculation of the exact radiological path for a three-dimensional CT array, Medical Physics, 12 (1985), 252-255.  doi: 10.1118/1.595715.
    [36] E. SundermannF. JacobsM. ChristiaensB. De Sutter and I. Lemahieu, A fast algorithm to calculate the exact radiological path through a pixel or voxel space, Journal of Computing and Information Technology, 6 (1998), 89-94. 
    [37] L. XieY. HuB. YanL. WangB. YangW. LiuL. ZhangL. LuoH. Shu and Y. Chen, An effective CUDA parallelization of projection in iterative tomography reconstruction, PloS One, 10 (2015).  doi: 10.1371/journal.pone.0142184.
    [38] Z. Yu, F. Noo, F. Dennerlein, A. Wunderlich, G. Lauritsch and J. Hornegger, Repository FORBILD Head Phantom, https://github.com/ashkarin/forbild-gen.
    [39] Z. YuF. NooF. DennerleinA. WunderlichG. Lauritsch and J. Hornegger, Simulation tools for two-dimensional experiments in X-ray computed tomography using the FORBILD head phantom, Physics in Medicine & Biology, 57 (2012). 
    [40] W. ZhuangS. S. Gopal and T. J. Hebert, Numerical evaluation of methods for computing tomographic projections, IEEE Transactions on Nuclear Science, 41 (1994), 1660-1665.  doi: 10.1109/23.322963.
  • 加载中

Figures(14)

Tables(2)

SHARE

Article Metrics

HTML views(1034) PDF downloads(179) Cited by(0)

Access History

Other Articles By Authors

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return