4.7 Article

Blind X-Ray CT Image Reconstruction From Polychromatic Poisson Measurements

Journal

IEEE TRANSACTIONS ON COMPUTATIONAL IMAGING
Volume 2, Issue 2, Pages 150-165

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCI.2016.2523431

Keywords

X-ray CT; statisticalmodel-based iterative reconstruction (MBIR); beam-hardening correction

Funding

  1. U.S. National Science Foundation [CCF-1421480]
  2. Division of Computing and Communication Foundations
  3. Direct For Computer & Info Scie & Enginr [1421480] Funding Source: National Science Foundation

Ask authors/readers for more resources

We develop a framework for reconstructing images that are sparse in an appropriate transform domain from polychromatic computed tomography (CT) measurements under the blind scenario where the material of the inspected object and incident-energy spectrum are unknown. Assuming that the object that we wish to reconstruct consists of a single material, we obtain a parsimonious measurement-model parameterization by changing the integral variable from photon energy to mass attenuation, which allows us to combine the variations brought by the unknown incident spectrum and mass attenuation into a single unknown mass-attenuation spectrum function; the resulting measurement equation has the Laplace-integral form. The mass-attenuation spectrum is then expanded into basis functions using B-splines of order one. We consider a Poisson noise model and establish conditions for biconvexity of the corresponding log-likelihood (NLL) function with respect to the densitymap and mass-attenuation spectrum parameters. We derive a block-coordinate descent algorithm for constrained minimization of a penalized NLL objective function, where penalty terms ensure non-negativity of the mass-attenuation spline coefficients and non-negativity and gradient-map sparsity of the densitymap image, imposed using a convex total-variation (TV) norm; the resulting objective function is biconvex. This algorithm alternates between a Nesterovs proximal-gradient (NPG) step and a limited-memory Broyden-Fletcher-Goldfarb-Shanno with box constraints (L-BFGSB) iteration for updating the image and mass-attenuation spectrum parameters, respectively. We prove the Kurdyka-Lojasiewicz property of the objective function, which is important for establishing local convergence of block-coordinate descent schemes in biconvex optimization problems. Our framework applies to other NLLs and signal-sparsity penalties, such as lognormal NLL and l(1) norm of 2-D discrete wavelet transform (DWT) image coefficients. Numerical experiments with simulated and real X-ray CT data demonstrate the performance of the proposed scheme.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available