A Box Spline Calculus for Computed Tomography

Total Page:16

File Type:pdf, Size:1020Kb

A Box Spline Calculus for Computed Tomography A BOX SPLINE CALCULUS FOR COMPUTED TOMOGRAPHY Alireza Entezari1, Michael Unser2 1: CISE Department, University of Florida, Gainesville, FL 32611-6120, USA 2: Biomedical Imaging Group, EPFL, CH-1015, Lausanne, Switzerland ABSTRACT cess on them. For a parallel projection geometry, the suitable model is the Radon transform (or the X-ray transform in 3- B-splines are attractive basis functions for the continuous- D). Current reconstruction algorithms typically use the natu- domain representation of biomedical images and volumes. In ral (square) pixel basis or some blob (or Kaiser-Bessel) func- this paper, we prove that the extended family of box splines tions which have the advantage of being circularly symmetric. are closed under the Radon transform and derive explicit for- While these particular choices simplify the derivation of the mulae for their transforms. Our results are general; they cover forward model, they are not as favorable from an approxima- all known brands of compactly-supported box splines (tensor- tion theoretic point of view. Both bases have—at best—a first product B-splines, separable or not) in any dimensions. In order of approximation which implies that the rate of decay particular, we prove that the 2-D Radon transform of an N- of the discretization error as the reconstruction grid gets finer direction box spline is generally a (non-uniform) polynomial is relatively slow [2, 3]. In principle, choosing higher-order spline of degree N − 1. The proposed framework allows for a B-spline basis functions would be more advantageous since proper discretization of a variety of 2-D and 3-D tomographic these are optimal in the sense of their support being minimal reconstruction problems in a box spline basis. It is of rele- for a given order of approximation [3]. Splines have been vance for imaging modalities such as X-ray computed tomog- found to be useful for improving the performance of FBP re- raphy and 3-D cryo-electron microscopy. construction [4, 5, 6], but have hardly been deployed in the Index Terms— Radon transform, tomography, box context of iterative algorithms, probably due to the increased splines complexity of the corresponding forward model. The contribution of this work is to provide a general char- 1. INTRODUCTION acterization of the Radon (or X-ray) transform for the ex- tended family of box splines. While bringing in this level Biomedical imaging heavily relies on tomographic algorithms of generality may look like overkill at first sight, we find for the reconstruction of 2-D and 3-D images from projec- that it actually simplifies the analysis because the family hap- tion data [1]. Prominent medical imaging examples are X- pens to be closed under the Radon/X-ray transform. Since all ray computed tomography, emission tomography (PET and commonly-used brands of B-splines are special instances of SPECT), and portal imaging for radio therapy. Tomographic box splines [7], it therefore makes sense to investigate these reconstruction is also relevant for biology; for instance, for functions in detail to obtain a complete analytical picture. small animal imaging using micro scanners and molecular structure determination from 3-D cryo-electon tomography. 2. PROJECTION GEOMETRY When the projection angles are evenly distributed, the to- mogram is usually reconstructed by filtered backprojection The X-ray transform relates a function to its projections along (FBP) [1]. When the acquisition conditions are less ideal some directions θ. The projections (or shadows) are obtained (e.g., noisy and/or missing data, non-even angular distribu- by integrating the function along a set of parallel rays. In 2-D, tion of the projections), it is better to apply iterative tech- this is equivalent to performing the Radon transform. niques such as ART (algebraic reconstruction) or the statis- To specify the geometry in the general d-dimensional set- tical OSEM method, which offer greater flexibility. ting, we introduce the unit vector θ ∈ Rd that points along the A crucial step in the design of iterative reconstruction al- direction of integration. The spatial coordinates of the input gorithms is the discretization of the forward model. This function are denoted by x = (x1,x2,...,xd); these are also is usually achieved by selecting image-domain basis func- PT expressed in a rotated coordinate system as x = tθ + θ⊥ y tions and by mathematically simulating the acquisition pro- PT where θ⊥ is a d × (d − 1) matrix specifying an orthogonal basis of the hyperplane perpendicular to θ. The correspond- This work was partially supported by the Swiss National Science Foun- P dation under Grant 200020-109415, the Center for Biomedical Imaging ing hyperplane coordinates are y = (y1,...,yd−1) = θ⊥ x; (CIBM) and the foundations Leenaards and Louis-Jeantet. they are obtained by projecting x onto the basis vectors per- ) pendicular to θ. (y f y The (d-dimensional) X-ray transform P maps a function P θ f(x), x ∈ Rd into the set of its line integrals [1]. Specifically, x2 if θ ∈ Sd−1 (e.g., θ ∈ Rd with kθk = 1), then θ θ PT P{f}(y; θ) = f(tθ + θ⊥ y)dt, (1) R Z x1 with y ∈ Rd−1. In the sequel, we will also use the short-hand notation Pθf(y) for the above map. The projection geometry for the 2-D case is illustrated in Figure 1; the direction of integration is θ = (− sin θ, cos θ) and the projection matrix Fig. 1. X-ray projection geometry for d = 2. On the right: onto the Radon coordinate system is P ⊥ = [cos θ sin θ] θ projection of a pixel (tensor-product first-order B-spline) on so that y = x cos θ + x sin θ. 1 2 various angles. The X-ray transform is a bounded linear operator that has the convenient property of pseudo-commuting with the con- volution and translation operations: this (multi-) set need not be distinct as they can appear with some multiplicity. When N = d, the box spline is simply the Pθ{f ∗ g}(y) = (Pθf ∗ Pθg)(y), (2) (normalized) indicator function of the parallelepiped formed by d vectors in Rd: P d Pθ{f(· − x0)}(y) = Pθ{f}(y − θ⊥ x0). (3) 1 |det Ξ| x = n=1 tnξn for some 0 ≤ tn ≤ 1 MΞ(x) = . These properties are essential to the present work where we (0 otherwiseP are aiming at obtaining a closed-form expression for the X- For N > d, box splines are defined recursively by a “direc- ray transform of a function that is expressed in an integer-shift tional” convolution which makes them particularly suitable invariant basis for the Radon transform: 1 f(x) = ckϕ(x − k) (4) MΞ∪ξ(x) = MΞ(x − tξ)dt. (6) k∈Zd X Z0 where the generator ϕ is a tensor-product B-spline or, more When the lower dimensional space is R (i.e., d = 1), the box generally, a box spline. The direct application of (3) yields splines coincide with univariate B-splines (basic splines). When the distinct column vectors of Ξ are orthogonal to P each other, box splines amount to tensor-product B-splines. Pθf(y) = ckPθ{ϕ}(y − θ⊥ k). (5) k∈Zd The continuity and approximation power of the spline space X formed by the linear combination of shifts of a box spline This means that we can discretize the X-ray reconstruction are determined based on properties of the matrix Ξ. The problem exactly, provided that we have an explicit formula approximation properties, along with the de Boor-Hollig’s¨ for Pθ{ϕ}(y), the X-ray (or Radon) transform of the B-spline recurrence relations for fast evaluation of box splines, are generator. It is then possible to use (5) to form the system ma- discussed in [7] which is the definitive reference on the sub- H trix that relates the line integrals pm,n = Pθm f(yn) to the ject. There are several algorithms for efficient and stable B-spline coefficients of the signal ck. Note that the approach evaluation of box splines [8, 9, 10]. is also applicable to nonparallel geometries (e.g., fan beam or Another way of constructing box splines, which is prob- cone beam), as long as the measurements correspond to pure ably more transparent to engineers, is by repeated convolu- line integrals. tion of elementary line-segment-like distributions. Specifi- cally, we have 3. BOX SPLINES REVIEW Ξ M (x) = Mξ1 ∗···∗ MξN (x) (7) Geometrically, a box spline is the shadow (i.e., X-ray im- where the elementary box splines, Mξ , are Dirac-like line RN n age) of a hypercube, in , when projected to a lower- distributions supported over x = tξn with t ∈ [0, 1]. These dimensional space, Rd (N ≥ d). A box spline is defined for a elementary box splines are in direct geometric correspon- Rd set of N vectors ξ1, ξ2,..., ξN in . Each of these vectors dence (via a rotation and a proper scaling) with the primary is the shadow of an edge of the N-hypercube adjacent to its box spline Ξ origin. The matrix of directions := [ξ1 ξ2 . ξN ] com- d x pletely specifies the box spline in R . Note that the vectors in M~e1 ( ) = box(x1)δ(x2, · · · ,xd) where δ(x2, · · · ,xd) is the (d − 1)-dimensional Dirac distri- bution and 1 0 ≤ x ≤ 1 box(x) = . ξ1 (0 otherwise 2 Moreover, they integrate to 1 which is a property that is shared ξ by all box splines (and also preserved through convolution). Based on (7), one directly infers that the box splines are ′ ′ θ ξ1 ξ2 positive, compactly-supported functions. Their support is a θ zonotope, which is the Minkowski sum of N vectors in Ξ.
Recommended publications
  • A Box Spline Calculus for Computed Tomography
    A BOX SPLINE CALCULUS FOR COMPUTED TOMOGRAPHY Alireza Entezari1, Michael Unser2 1: CISE Department, University of Florida, Gainesville, FL 32611-6120, USA 2: Biomedical Imaging Group, EPFL, CH-1015, Lausanne, Switzerland ABSTRACT cess on them. For a parallel projection geometry, the suitable model is the Radon transform (or the X-ray transform in 3- B-splines are attractive basis functions for the continuous- D). Current reconstruction algorithms typically use the natu- domain representation of biomedical images and volumes. In ral (square) pixel basis or some blob (or Kaiser-Bessel) func- this paper, we prove that the extended family of box splines tions which have the advantage of being circularly symmetric. are closed under the Radon transform and derive explicit for- While these particular choices simplify the derivation of the mulae for their transforms. Our results are general; they cover forward model, they are not as favorable from an approxima- all known brands of compactly-supported box splines (tensor- tion theoretic point of view. Both bases have—at best—a first product B-splines, separable or not) in any dimensions. In order of approximation which implies that the rate of decay particular, we prove that the 2-D Radon transform of an N- of the discretization error as the reconstruction grid gets finer direction box spline is generally a (non-uniform) polynomial is relatively slow [2, 3]. In principle, choosing higher-order spline of degree N − 1. The proposed framework allows for a B-spline basis functions would be more advantageous since proper discretization of a variety of 2-D and 3-D tomographic these are optimal in the sense of their support being minimal reconstruction problems in a box spline basis.
    [Show full text]
  • Efficient Sampling Geometries and Reconstruction Algorithms for Estimation of Diffusion Propagators
    EFFICIENT SAMPLING GEOMETRIES AND RECONSTRUCTION ALGORITHMS FOR ESTIMATION OF DIFFUSION PROPAGATORS By WENXING YE A DISSERTATION PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY UNIVERSITY OF FLORIDA 2012 c 2012 Wenxing Ye 2 To my parents 3 ACKNOWLEDGMENTS I owe a great thank you to many people who helped me finish my dissertation. First and foremost, I would like to thank Dr. Baba Vemuri, my advisor, who introduced me into the field of medical image processing and guided me through my Ph.D. study using his tireless inspiration and rich academic experience. I am also thankful that Dr. Vemuri offered me full research assistantship with which I could put all my focus on the research and not worry about financial problems. Dr. Vemuri built the example of a passionate and serious scholar for me. I would also like to appreciate Dr. Alireza Entezari, my co-advisor, who is always available for discussion when I need his technical advise. He selflessly shared his experience and knowledge so that I avoided making many mistakes. From him, I learned the importance of mathematical thinking and carefulness in solving a research problem. The memories are still clear that he worked together with me from morning to the night before the conference deadlines. It is my luck to have him as a patient friend and knowledgeable mentor. Furthermore, I would like to express my sincere appreciation to Dr. Anand Rangarajan, Dr. Jay Gopalakrishnan and Dr. Stephen Blackband for serving as my Ph.D.
    [Show full text]
  • Data Processing on the Body-Centered Cubic Lattice
    DATA PROCESSING ON THE BODY-CENTERED CUBIC LATTICE by Usman Raza Alim M.Sc., Rochester Institute of Technology, 2007 B.Sc., University of Rochester, 2001 a Thesis submitted in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the School of Computing Science Faculty of Applied Sciences c Usman Raza Alim 2012 SIMON FRASER UNIVERSITY Summer 2012 All rights reserved. However, in accordance with the Copyright Act of Canada, this work may be reproduced without authorization under the conditions for “Fair Dealing.” Therefore, limited reproduction of this work for the purposes of private study, research, criticism, review and news reporting is likely to be in accordance with the law, particularly if cited appropriately. APPROVAL Name: Usman Raza Alim Degree: Doctor of Philosophy Title of Thesis: Data Processing on the Body-Centered Cubic Lattice Examining Committee: Dr. Hao (Richard) Zhang Chair Dr. Torsten M¨oller, Senior Supervisor Professor of Computing Science Dr. Steve Ruuth, Supervisor Professor (Applied and Computational Mathematics) Dr. Ghassan Hamarneh, Internal Examiner Associate Professor of Computing Science Dr. Michael Unser, External Examiner Professor of Image Processing Ecole´ Polytechnique F´ed´erale de Lausanne (EPFL) Switzerland Date Approved: ii Partial Copyright Licence iii Abstract The body-centered cubic (BCC) lattice is the optimal three-dimensional sampling lattice. Its optimality stems from the fact that its dual, the face-centered cubic (FCC) lattice, achieves the highest sphere-packing efficiency. In order to approximate a scalar-valued function from samples that reside on a BCC lattice, spline-like compact kernels have been recently proposed. The lattice translates of an admissible BCC kernel form a shift-invariant approximation space that yields higher quality approximations as compared to similar spline- like spaces associated with the ubiquitous Cartesian cubic (CC) lattice.
    [Show full text]
  • A Box Spline Calculus for the Discretization of Computed
    1532 IEEE TRANSACTIONS ON MEDICAL IMAGING, VOL. 31, NO. 8, AUGUST 2012 A Box Spline Calculus for the Discretization of Computed Tomography Reconstruction Problems Alireza Entezari*, Member, IEEE, Masih Nilchian, Student Member, IEEE, and Michael Unser, Fellow, IEEE Abstract—B-splines are attractive basis functions for the contin- gebraic reconstruction (ART) or the statistical OSEM method, uous-domain representation of biomedical images and volumes. which offer greater flexibility. In this paper, we prove that the extended family of box splines are A crucial step in the design of iterative reconstruction algo- closed under the Radon transform and derive explicit formulae for their transforms. Our results are general; they cover all known rithms is the discretization of the forward model. This is usu- brands of compactly-supported box splines (tensor-product ally achieved by selecting image-domain basis functions and B-splines, separable or not) in any number of dimensions. The by mathematically simulating the acquisition process on them. proposed box spline approach extends to non-Cartesian lattices For a parallel projection geometry, the suitable model is the used for discretizing the image space. In particular, we prove Radon transform (or the X-ray transform in 3-D). Current re- that the 2-D Radon transform of an -direction box spline is generally a (nonuniform) polynomial spline of degree . construction algorithms typically use the natural (square) pixel The proposed framework allows for a proper discretization of a basis or some blob (or Kaiser–Bessel) functions which have the variety of tomographic reconstruction problems in a box spline advantage of being circularly symmetric.
    [Show full text]
  • A Convolutional Forward and Back-Projection Model for Fan-Beam Geometry Kai Zhang, Student Member, IEEE, Alireza Entezari, Senior Member, IEEE
    1 This work has been submitted to the IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessible. c 2019 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, including reprinting/republishing this material for advertising or promotional purposes, collecting new collected works for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. arXiv:1907.10526v1 [eess.IV] 24 Jul 2019 2 A Convolutional Forward and Back-Projection Model for Fan-Beam Geometry Kai Zhang, Student Member, IEEE, Alireza Entezari, Senior Member, IEEE, Abstract—Iterative methods for tomographic image recon- Specifically, the contribution of a basis function is computed struction have great potential for enabling high quality imaging by (1) integrating the basis function along an incident ray to from low-dose projection data. The computational burden of form its footprint and (2) integrating these footprints across iterative reconstruction algorithms, however, has been an imped- iment in their adoption in practical CT reconstruction problems. a detector cell in the projection domain (often called the We present an approach for highly efficient and accurate com- detector blur). Common choices for expansion are the pixel- putation of forward model for image reconstruction in fan-beam and voxel-basis that provide a piecewise-constant model for geometry in X-ray CT. The efficiency of computations makes image representation. Kaiser-Bessel [6] functions have also this approach suitable for large-scale optimization algorithms been considered as a smooth basis for image representation.
    [Show full text]