We develop a sparse image reconstruction method for Poissondistributed polychromatic Xray computed tomography (CT) measurements under the blind scenario where the material of the inspected object and the incident energy spectrum are unknown. We employ our massattenuation spectrum parameterization of the noiseless measurements for singlematerial objects and express the massattenuation spectrum as a linear combination of Bspline basis functions of order one. A block coordinatedescent algorithm is developed for constrained minimization of a penalized Poisson negative loglikelihood (NLL) cost function, where constraints and penalty terms ensure nonnegativity of the spline coefficients and nonnegativity and sparsity of the densitymap image; themore »
Blind Xray CT Image Reconstruction from Polychromatic Poisson Measurements
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 incidentenergy spectrum are unknown. Assuming that the object that we wish to reconstruct consists of a single material, we obtain a parsimonious measurementmodel 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 massattenuation spectrum function; the resulting measurement equation has the Laplaceintegral form. The massattenuation 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 negative loglikelihood (NLL) function with respect to the densitymap and massattenuation spectrum parameters. We derive a blockcoordinate descent algorithm for constrained minimization of a penalized NLL objective function, where penalty terms ensure nonnegativity of the massattenuation spline coefficients and nonnegativity and gradientmap sparsity of the densitymap image, imposed using a convex totalvariation (TV) norm; the resulting objective function is biconvex. This algorithm alternates between a Nesterov’s proximalgradient (NPG) step and a limitedmemory more »
 Award ID(s):
 1421480
 Publication Date:
 NSFPAR ID:
 10013990
 Journal Name:
 IEEE Transactions on Computational Imaging
 Page Range or eLocationID:
 1 to 1
 ISSN:
 23340118
 Sponsoring Org:
 National Science Foundation
More Like this


We develop a sparse image reconstruction method for polychromatic tomography (CT) measurements under the blind scenario where the material of the inspected object and the incident energy spectrum are unknown. To obtain a parsimonious measurement model parameterization, we first rewrite the measurement equation using our mass attenuation parameterization, which has the Laplace integral form. The unknown massattenuation spectrum is expanded into basis functions using a Bspline basis of order one. We develop a block coordinatedescent algorithm for constrained minimization of a penalized negative loglikelihood function, where constraints and penalty terms ensure nonnegativity of the spline coefficients and sparsity of themore »

We develop a projected Nesterov’s proximalgradient (PNPG) approach for sparse signal reconstruction that combines adaptive step size with Nesterov’s momentum acceleration. The objective function that we wish to minimize is the sum of a convex differentiable datafidelity (negative loglikelihood (NLL)) term and a convex regularization term. We apply sparse signal regularization where the signal belongs to a closed convex set within the closure of the domain of the NLL; the convexset constraint facilitates flexible NLL domains and accurate signal recovery. Signal sparsity is imposed using the ℓ₁norm penalty on the signal’s linear transform coefficients. The PNPG approach employs a projectedmore »

Abstract The goal of this study is to develop a new computed tomography (CT) image reconstruction method, aiming at improving the quality of the reconstructed images of existing methods while reducing computational costs. Existing CT reconstruction is modeled by pixelbased piecewise constant approximations of the integral equation that describes the CT projection data acquisition process. Using these approximations imposes a bottleneck model error and results in a discrete system of a large size. We propose to develop a contentadaptive unstructured grid (CAUG) based regularized CT reconstruction method to address these issues. Specifically, we design a CAUG of the image domainmore »

We study the problem of localizing multiple sources of forced oscillations (FOs) and estimating their characteristics, such as frequency, phase, and amplitude, using noisy PMU measurements. For each source location, we model the input oscillation as a sum of unknown sinusoidal terms. This allows us to obtain a linear relationship between measurements and the inputs at the unknown sinusoids’ frequencies in the frequency domain. We determine these frequencies by thresholding the em pirical spectrum of the noisy measurements. Assuming sparsity in the number of FOs’ locations and the number of sinusoids at each location, we cast the location recovery problemmore »