ECEric Clarkson

Eric Clarkson

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Eric Clarkson has a total of 33 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Approximating the idea observer on list mode data with comparison to CNN methods

    by Dan Li, Eric W. Clarkson

    The ideal observer(IO) sets an upper bound for all other classification observers by employing the full statistics of the imaging system and the random object ensemble.1 This upper bound can be used for the optimization of the imaging system and as a performance measure for other observers. Without binning the data and losing information in the process, the list mode data format has the potential of eliminating null functions2 and supporting better performance for clinical tasks. However, it is not easy to track the performance of the ideal observer. A Monte Carlo Markov Chain (MCMC) method3 was proposed for binned data. Here in this work, we present an example of approximating the ideal observer for list mode data given a background known statistically signal known exactly model (BKS/SKE). The receiver operating characteristic (ROC) curve of the IO on list mode data is compared to the corresponding approximation by use of supervised learning methods proposed for binned data,4 where convolutional neural networks (CNN)5 are used to approximate the probability of the signal present hypothesis given the image, which is a monotone transformation of the IO statistic. The results show the superior performance of IO on list mode data.

  • Performing tomographic reconstructions from a satellite looking toward Earth. Part 2: analysis of image quality

    by Garrett W. Hinton, Harri Latvakoski, Michael Taylor, Eric Clarkson, Matthew A. Kupinski, Jed Hancock

    This paper is part 2 of two papers that explore performing tomographic reconstructions from a space platform. A simplified model of short-wave infrared emissions in the atmosphere is given. Simulations were performed that tested the effectiveness of reconstructions given signal amplitude, frequency, signal-to-noise ratio, number of iterations run, and others. Maximum likelihood expectation maximization is shown to be effective for reconstructing low signal cases. (C) 2022 Optica Publishing Group


  • Performing tomographic reconstructions from a satellite looking toward Earth. Part 1: implementation and limitations

    by Garrett W. Hinton, Harri Latvakoski, Michael Taylor, Eric Clarkson, Matthew A. Kupinski, Jed Hancock

    For imaging instruments that are in space looking toward the Earth, there are a variety of nuisance signals that can get in the way of performing certain imaging tasks, such as reflections from clouds, reflections from the ground, and emissions from the OH-airglow layer. A method for separating these signals is to perform tomographic reconstructions from the collected data. A lingering struggle for this method is altitude-axis resolution and different methods for helping with it are discussed. An implementation of the maximum likelihood expectation maximization algorithm is given and analyzed. (C) 2022 Optica Publishing Group

  • Effect on null spaces of list-mode imaging systems due to increasing the number of attributes

    by Eric Clarkson, Meredith Kupinski

    There are two types of uncertainty in image reconstructions from list-mode data: statistical and deterministic. One source of statistical uncertainty is the finite number of attributes of the detected particles, which are sampled from a probability distribution on the attribute space. A deterministic source of uncertainty is the effect that null functions of the imaging operator have on reconstructed pixel or voxel values. Quantifying the reduction in this deterministic source of uncertainty when more attributes are measured for each detected particle is the subject of this work. Specifically, upper bounds on an error metric are derived to quantify the error introduced in the reconstruction by the presence of null functions, and these upper bounds are shown to be reduced when the number of attributes is increased. These bounds are illustrated with an example of a two-dimensional single photon emission computed tomography (SPECT) system where the depth of interaction in the scintillation crystal is added to the attribute vector.

  • Open Access

    Invertibility of Multi-Energy X-ray Transform

    by Yijun Ding, Eric W. Clarkson, Amit Ashok

    Purpose: The goal is to provide a sufficient condition on the invertibility of a multi-energy (ME) X-ray transform. The energy-dependent X-ray attenuation profiles can be represented by a set of coefficients using the Alvarez-Macovski (AM) method. An ME X-ray transform is a mapping from $N$ AM coefficients to $N$ noise-free energy-weighted measurements, where $N\geq2$. Methods: We apply a general invertibility theorem which tests whether the Jacobian of the mapping $J(\mathbf A)$ has zero values over the support of the mapping. The Jacobian of an arbitrary ME X-ray transform is an integration over all spectral measurements. A sufficient condition of $J(\mathbf A)\neq0$ for all $\mathbf A$ is that the integrand of $J(\mathbf A)$ is $\geq0$ (or $\leq0$) everywhere. Note that the trivial case of the integrand equals to zero everywhere is ignored. With symmetry, we simplified the integrand of the Jacobian into three factors that are determined by the total attenuation, the basis functions, and the energy-weighting functions, respectively. The factor related to total attenuation is always positive, hence the invertibility of the X-ray transform can be determined by testing the signs of the other two factors. Furthermore, we use the Cramer-Rao lower bound (CRLB) to characterize the noise-induced estimation uncertainty and provide a maximum-likelihood (ML) estimator. Conclusions: We have provided a framework to study the invertibility of an arbitrary ME X-ray transform and proved the global invertibility for four types of systems.

  • Effect on null spaces of list-mode imaging systems due to increasing the size of attribute space

    by Eric Clarkson, Meredith Kupinski

    An upper bound is derived for a figure of merit that quantifies the error in reconstructed pixel or voxel values induced by the presence of null functions for any list-mode system. It is shown that this upper bound decreases as the region in attribute space occupied by the allowable attribute vectors expands. This upper bound allows quantification of the reduction in this error when this type of expansion is implemented. Of course, reconstruction error is also caused by system noise in the data, which has to be treated statistically, but we will not be addressing that problem here. This method is not restricted to pixelized or voxelized reconstructions and can in fact be applied to any region of interest. The upper bound for pixelized reconstructions is demonstrated on a list-mode 2D Radon transform example. The expansion in the attribute space is implemented by doubling the number of views. The results show how the pixel size and number of views both affect the upper bound on reconstruction error from null functions. This reconstruction error can be averaged over all pixels to give a single number or can be plotted as a function on the pixel grid. Both approaches are demonstrated for the example system. In conclusion, this method can be applied to any list-mode system for which the system operator is known and could be used in the design of the systems and reconstruction algorithms.


  • Quantifying the loss of information from binning list-mode data

    by Eric Clarkson, Meredith Kupinski

    List-mode data are increasingly being used in single photon emission computed tomography (SPECT) and positron emission tomography (PET) imaging, among other imaging modalities. However, there are still many imaging designs that effectively bin list-mode data before image reconstruction or other estimation tasks are performed. Intuitively, the binning operation should result in a loss of information. In this work, we show that this is true for Fisher information and provide a computational method for quantifying the information loss. In the end, we find that the information loss depends on three factors. The first factor is related to the smoothness of the mean data function for the list-mode data. The second factor is the actual object being imaged. Finally, the third factor is the binning scheme in relation to the other two factors.


  • Probability of error for detecting a change in a parameter and Bayesian Fisher information

    by Eric Clarkson

    The van Trees inequality relates the ensemble mean squared error of an estimator to a Bayesian version of the Fisher information. The Ziv-Zakai inequality relates the ensemble mean squared error of an estimator to the minimum probability of error for the task of detecting a change in the parameter. In this work we complete this circle by deriving an inequality that relates this minimum probability of error to the Bayesian version of the Fisher information. We discuss this result for both scalar and vector parameters. In the process we discover that an important intermediary in the calculation is the total variation of the posterior probability distribution function for the parameter given the data. This total variation is of interest in its own right since it may be easier to compute than the other figures of merit discussed here.


  • Relation between Bayesian Fisher information and Shannon information for detecting a change in a parameter

    by Eric Clarkson

    We derive a connection between the performance of statistical estimators and the performance of the ideal observer on related detection tasks. Specifically, we show how the task-specific Shannon information for the task of detecting a change in a parameter is related to the Fisher information and to the Bayesian Fisher information. We have previously shown that this Shannon information is related via an integral transform to the minimum probability of error on the same task. We then outline a circle of relations starting with this minimum probability of error and ensemble mean squared error for an estimator via the Ziv–Zakai inequality, then the ensemble mean squared error and the Bayesian Fisher information via the van Trees inequality, and finally the Bayesian Fisher information and the Shannon information for a detection task via the work presented here.


  • Risk analysis, ideal observers, and receiver operating characteristic curves for tasks that combine detection and estimation

    by Eric Clarkson

    Previously published work on joint estimation/detection tasks has focused on the area under the estimation receiver operating characteristic (EROC) curve as a figure of merit (FOM) for these tasks in imaging. Another FOM for these joint tasks is the Bayesian risk, where a cost is assigned to all detection outcomes and to the estimation errors, and then averaged over all sources of randomness in the object ensemble and the imaging system. Important elements of the cost function, which are not included in standard EROC analysis, are that the cost for a false positive depends on the estimate produced for the parameter vector, and the cost for a false negative depends on the true value of the parameter vector. The ideal observer in this setting, which minimizes the risk, is derived for two applications. In the first application, a parameter vector is estimated only in the case of a signal present classification. For the second application, parameter vectors are estimated for either classification, and these vectors may have different dimensions. In both applications, a risk-based estimation receiver operating characteristic curve is defined and an expression for the area under this curve is given. It is also shown that, for some observers, this area may be estimated from a two alternative forced choice test. Finally, if the classifier is optimized for a given estimator, then it is shown that the slope of the risk-based estimation receiver operating characteristic curve at each point is the negative of the ratio of the prior probabilities for the two classes.