arXiv subjects

Xiaochuan Pan

Publications and source records attributed to Xiaochuan Pan.

At least 19 recordsLinked to original sources

arXiv2026

Improving depth-resolution, in-plane contrast, and reducing non-uniformity artifacts for wide-angle DBT

Purpose: This work aims to develop an image reconstruction algorithm for wide-angle digital breast tomosynthesis (DBT) that has improved depth resolution and in-plane contrast while reducing non-uniformity artifacts. Approach: The image reconstruction algorithm is an extension of our prior work on sparsity-regularized iterative image reconstruction. The algorithm is performed in two stages as explained in a prior work. The first stage consists of a low-resolution reconstruction that exploits sparsity for quantitative accuracy. In this work, this first stage is augmented with a formulation that includes the estimation of a "background" image, which absorbs low-frequency artifacts that cause image non-uniformity. Results: The new algorithm is demonstrated on a patient case for which the data are acquired on a wide-angle DBT system. Conclusion: The results on the shown case indicate that the algorithm design goals have been met, but additional empirical results and task-based assessment are needed to strengthen this conclusion.

math.OC↗

arXiv2026

Efficient primal-dual algorithm for imaging applications with matrix stacking, applied to DBT image reconstruction

The primal-dual hybrid gradient (PDHG) algorithm for solving convex optimization problems that arise in tomographic imaging is revisited. In particular, simplification of the selection of step-size parameters is developed for optimization problems with multiple terms, each containing a linear transform subject to splitting. This simplification maintains algorithm efficiency while avoiding massive grid searches for the optimal parameter settings. The PDHG framework is demonstrated on an image reconstruction problem for wide-angle digital breast tomosythesis (DBT); use of the proposed optimization problem is enabled by the framework and it is demonstrated to have some advantage in quantitative accuracy of the reconstructed volume and in improving DBT depth resolution.

math.OC↗

arXiv2026

Notes on the primal-dual algorithm for convex optimization applied to X-ray tomographic image reconstruction

The purpose of these notes is to provide background on understanding the primal-dual algorithm of Chambolle and Pock [1] for imaging scientists. The presentation focuses on providing intuition and an algorithmic system that is amenable to pre-conditioning. The document aims to be self-contained, providing background on the essential facts of non-smooth convex analysis.[2]

math.OC↗

arXiv2024

Non-unique water and contrast agent solutions in dual-energy CT

The goal of this work is to study occurrences of non-unique solutions in dual-energy CT (DECT) for objects containing water and a contrast agent. Previous studies of the Jacobian of nonlinear systems identified that a vanishing Jacobian determinant indicates the existence of multiple solutions to the system. Vanishing Jacobian determinants are identified for DECT setups by simulating intensity data for practical thickness ranges of water and contrast agent. Once existence is identified, non-unique solutions are found by simulating scan data and finding intensity contours with that intersect multiple times. With this process non-unique solutions are found for DECT setups scanning iodine and gadolinium, including setups using tube potentials in practical ranges. Non-unique solutions demonstrate a large range of differences and can result in significant discrepancies between recovered and true material mapping.

physics.med-ph↗

arXiv2024

A directional total variation minimization algorithm for isotropic resolution in digital breast tomosynthesis

An optimization-based image reconstruction algorithm is developed for contrast enhanced digital breast tomosynthesis (DBT) using dual-energy scanning. The algorithm minimizes directional total variation (TV) with a data discrepancy and non-negativity constraints. Iodinated contrast agent (ICA) imaging is performed by reconstructing images from dual-energy DBT data followed by weighted subtraction. Physical DBT data is acquired with a Siemens Mammomat scanner of a structured breast phantom with ICA inserts. Results are shown for both directional TV minimization and filtered back-projection for reference. It is seen that directional TV is able to substantially reduce depth blur for the ICA objects.

physics.med-ph↗

arXiv2024

Enhancing signal detectability in learning-based CT reconstruction with a model observer inspired loss function

Deep neural networks used for reconstructing sparse-view CT data are typically trained by minimizing a pixel-wise mean-squared error or similar loss function over a set of training images. However, networks trained with such pixel-wise losses are prone to wipe out small, low-contrast features that are critical for screening and diagnosis. To remedy this issue, we introduce a novel training loss inspired by the model observer framework to enhance the detectability of weak signals in the reconstructions. We evaluate our approach on the reconstruction of synthetic sparse-view breast CT data, and demonstrate an improvement in signal detectability with the proposed loss.

physics.med-ph↗

arXiv2024

Simultaneous activity and attenuation estimation in TOF-PET with TV-constrained nonconvex optimization

An alternating direction method of multipliers (ADMM) framework is developed for nonsmooth biconvex optimization for inverse problems in imaging. In particular, the simultaneous estimation of activity and attenuation (SAA) problem in time-of-flight positron emission tomography (TOF-PET) has such a structure when maximum likelihood estimation (MLE) is employed. The ADMM framework is applied to MLE for SAA in TOF-PET, resulting in the ADMM-SAA algorithm. This algorithm is extended by imposing total variation (TV) constraints on both the activity and attenuation map, resulting in the ADMM-TVSAA algorithm. The performance of this algorithm is illustrated using the penalized maximum likelihood activity and attenuation estimation (P-MLAA) algorithm as a reference. Additional results on step-size tuning and on the use of unconstrained ADMM-SAA are presented in the previous arXiv submission: arXiv:2303.17042v1.

physics.med-ph↗

arXiv2023

Optimizing dual-energy CT technique for iodine-based contrast-to-noise ratio

Purpose: This study proposes a systematic method for determining the optimal x-ray tube settings/energy windows and fluence for minimal noise and maximum CNR in material density images obtained from DECT scans by fixing the subject size and the total radiation dose. Methods: The noise propagation in the process of sinogram and image reconstruction from DECT measurements is analyzed. Analytic estimates for the sinogram and monochromatic image pixel variances and the CNR as functions of tube potentials, fluence, and virtual monochromatic image (VMI) energy are derived, and then used in a phantom experiment as an objective function for optimizing the tube settings to minimize the image noise and maximize the CNR. Results: A non-trivial example that shows the existence of singular solutions to the inversion of sinograms-to-DECT measurements map was presented. Additionally, the optimal VMI energy for maximal CNR was determined. The optimal energy VMI was found to be the least noisy monochromatic image synthesized from the iodine and water density images, and it was shown that using more general weights in combining the two images linearly does not improve image quality. When the x-ray beam filter material was fixed at 2mm of Aluminum and the photon fluence for low and high kV scans were considered equal, the tube potential pair of 60/120 kV led to the maximal CNR in the VMI formed at energy 55 KeV. Conclusions: Optimizing DECT scan parameters to maximize the CNR can be done in a systematic way. Also choosing the parameters that maximize the Jacobian determinant over the sinogram domain would lead to more stable reconstructions due to the reduced amplification of the measurement noise. Since the values of the Jacobian determinant depend strongly on the imaging task, careful consideration of all of the relevant factors is needed when implementing the proposed framework.

physics.med-ph↗

arXiv2023

Solution existence, uniqueness, and stability of discrete basis sinograms in multispectral CT

This work investigates conditions for quantitative image reconstruction in multispectral computed tomography (MSCT), which remains a topic of active research. In MSCT, one seeks to obtain from data the spatial distribution of linear attenuation coefficient, referred to as a virtual monochromatic image (VMI), at a given X-ray energy, within the subject imaged. As a VMI is decomposed often into a linear combination of basis images with known decomposition coefficients, the reconstruction of a VMI is thus tantamount to that of the basis images. An empirical, but highly effective, two-step data-domain-decomposition (DDD) method has been developed and used widely for quantitative image reconstruction in MSCT. In the two-step DDD method, step (1) estimates the so-called basis sinogram from data through solving a nonlinear transform, whereas step (2) reconstructs basis images from their basis sinograms estimated. Subsequently, a VMI can readily be obtained from the linear combination of basis images reconstructed. As step (2) involves the inversion of a straightforward linear system, step (1) is the key component of the DDD method in which a nonlinear system needs to be inverted for estimating the basis sinograms from data. In this work, we consider a {\it discrete} form of the nonlinear system in step (1), and then carry out theoretical and numerical analyses of conditions on the existence, uniqueness, and stability of a solution to the discrete nonlinear system for accurately estimating the discrete basis sinograms, leading to quantitative reconstruction of VMIs in MSCT.

math.NA↗

arXiv2023

4D-image reconstruction directly from limited-angular-range data in continuous-wave electron paramagnetic resonance imaging

Objective: We investigate and develop optimization-based algorithms for accurate reconstruction of four-dimensional (4D)-spectral-spatial (SS) images directly from data collected over limited angular ranges (LARs) in continuous-wave (CW) electron paramagnetic resonance imaging (EPRI). Methods: Basing on a discrete-to-discrete data model devised in CW EPRI employing the Zeeman-modulation (ZM) scheme for data acquisition, we first formulate the image reconstruction problem as a convex, constrained optimization program that includes a data fidelity term and also constraints on the individual directional total variations (DTVs) of the 4D-SS image. Subsequently, we develop a primal-dual-based DTV algorithm, simply referred to as the DTV algorithm, to solve the constrained optimization program for achieving image reconstruction from data collected in LAR scans in CW-ZM EPRI. Results: We evaluate the DTV algorithm in simulated- and real-data studies for a variety of LAR scans of interest in CW-ZM EPRI, and visual and quantitative results of the studies reveal that 4D-SS images can be reconstructed directly from LAR data, which are visually and quantitatively comparable to those obtained from data acquired in the standard, full-angular-range (FAR) scan in CW-ZM EPRI. Conclusion: An optimization-based DTV algorithm is developed for accurately reconstructing 4D-SS images directly from LAR data in CW-ZM EPRI. Future work includes the development and application of the optimization-based DTV algorithm for reconstructions of 4D-SS images from FAR and LAR data acquired in CW EPRI employing schemes other than the ZM scheme. Significance: The DTV algorithm developed may be exploited potentially for enabling and optimizing CW EPRI with minimized imaging time and artifacts by acquiring data in LAR scans.

physics.med-ph↗

arXiv2022

Report on the AAPM deep-learning spectral CT Grand Challenge

This Special Report summarizes the 2022 AAPM Grand Challenge on Deep-Learning spectral Computed Tomography (DL-spectral CT) image reconstruction. The purpose of the challenge is to develop the most accurate image reconstruction algorithm for solving the inverse problem associated with a fast kVp switching dual-energy CT scan using a three tissue-map decomposition. Participants could choose to use deep-learning (DL), iterative, or a hybrid approach. Test phase submission were received from 18 research groups. Both the winning and second place teams had highly accurate results where the RMSE was nearly zero to single floating point precision. Results from the top ten also achieved a high degree of accuracy; and as a result this special report outlines the methodology developed by each of these groups. The DL-spectral CT challenge successfully established a forum for developing image reconstruction algorithms based on deep-learning that address an important inverse problem relevant for spectral CT.

physics.med-ph↗

arXiv2022

Comments on "DIRECT-Net: A unified mutual-domain material decomposition network for quantitative dual-energy CT Imaging'', Med. Phys. 2022, Vol. 49, pgs. 917-934

Quantitative image reconstruction in dual-energy computed tomography (CT) remains a topic of active research. We read with interest ``DIRECT-Net: A unified mutual-domain material decomposition network for quantitative dual-energy CT imaging,'' which appears in the 2022 February Issue of Med Phys. In the paper the authors propose a deep-learning (DL) method, referred to as the Direct-Net method, to address the problem of quantitative image reconstruction directly from data in full-scan dual-energy CT (DECT). We comment on the study and conclusion in the paper. The Reply to this comment appears under Communications on medphys.org: https://www.medphys.org/Communications/Reply-Pan_Response-Su.pdf In order to have context for the Reply, we provide the full text of our Comments.

physics.med-ph↗

arXiv2022

Iterative image reconstruction for CT with unmatched projection matrices using the generalized minimal residual algorithm

The generalized minimal residual (GMRES) algorithm is applied to image reconstruction using linear computed tomography (CT) models. The GMRES algorithm iteratively solves square, non-symmetric linear systems and it has practical application to CT when using unmatched back-projector/projector pairs and when applying preconditioning. The GMRES algorithm is demonstrated on a 3D CT image reconstruction problem where it is seen that use of unmatched projection matrices does not prevent convergence, while using an unmatched pair in the related conjugate gradients for least-squares (CGLS) algorithm leads to divergent iteration. Implementation of preconditioning using GMRES is also demonstrated.

physics.med-ph↗

arXiv2022

Report on the AAPM deep-learning sparse-view CT (DL-sparse-view CT) Grand Challenge

Purpose: The purpose of the challenge is to find the deep-learning technique for sparse-view CT image reconstruction that can yield the minimum RMSE under ideal conditions, thereby addressing the question of whether or not deep learning can solve inverse problems in imaging. Methods: The challenge set-up involves a 2D breast CT simulation, where the simulated breast phantom has random fibro-glandular structure and high-contrast specks. The phantom allows for arbitrarily large training sets to be generated with perfectly known truth. The training set consists of 4000 cases where each case consists of the truth image, 128-view sinogram data, and the corresponding 128-view filtered back-projection (FBP) image. The networks are trained to predict the truth image from either the sinogram or FBP data. Geometry information is not provided. The participating algorithms are tested on a data set consisting of 100 new cases. Results: About 60 groups participated in the challenge at the validation phase, and 25 groups submitted test-phase results along with reports on their deep-learning methodology. The winning team improved reconstruction accuracy by two orders of magnitude over our previous CNN-based study on a similar test problem. Conclusions: The DL-sparse-view challenge provides a unique opportunity to examine the state-of-the-art in deep-learning techniques for solving the sparse-view CT inverse problem.

physics.med-ph↗

arXiv2021

An Extended Primal-Dual Algorithm Framework for Nonconvex Problems with Application to Nonlinear Imaging

We propose an extended primal-dual algorithm framework for solving a general nonconvex optimization model. This work is motivated by image reconstruction problems in a class of nonlinear imaging, where the forward operator can be formulated as a nonlinear convex function with respect to the reconstructed image. Using the proposed framework, we put forward six specific iterative schemes, and present their detailed mathematical explanation. We also establish the relationship to existing algorithms. Moreover, under proper assumptions, we analyze the convergence of the schemes for the general model when the optimal dual variable regarding the nonlinear operator is non-vanishing. As a representative, the image reconstruction for spectral computed tomography is used to demonstrate the effectiveness of the proposed algorithm framework. By special properties of the concrete problem, we further prove the convergence of these customized schemes when the optimal dual variable regarding the nonlinear operator is vanishing. Finally, the numerical experiments show that the proposed algorithm has good performance on image reconstruction for various data with non-standard scanning configuration.

math.OC↗

arXiv2021

How do we generalize?

Humans and animals are able to generalize or transfer information from previous experience so that they can behave appropriately in novel situations. What mechanisms--computations, representations, and neural systems--give rise to this remarkable ability? The members of this Generative Adversarial Collaboration (GAC) come from a range of academic backgrounds but are all interested in uncovering the mechanisms of generalization. We started out this GAC with the aim of arbitrating between two alternative conceptual accounts: (1) generalization stems from integration of multiple experiences into summary representations that reflect generalized knowledge, and (2) generalization is computed on-the-fly using separately stored individual memories. Across the course of this collaboration, we found that--despite using different terminology and techniques, and although some of our specific papers may provide evidence one way or the other--we in fact largely agree that both of these broad accounts (as well as several others) are likely valid. We believe that future research and theoretical synthesis across multiple lines of research is necessary to help determine the degree to which different candidate generalization mechanisms may operate simultaneously, operate on different scales, or be employed under distinct conditions. Here, as the first step, we introduce some of these candidate mechanisms and we discuss the issues currently hindering better synthesis of generalization research. Finally, we introduce some of our own research questions that have arisen over the course of this GAC, that we believe would benefit from future collaborative efforts.

q-bio.NC↗

arXiv2021

Dual-energy CT imaging with limited-angular-range data

In dual-energy computed tomography (DECT), low- and high- kVp data are collected often over a full-angular range (FAR) of $360^\circ$. While there exists strong interest in DECT with low- and high-kVp data acquired over limited-angular ranges (LARs), there remains little investigation of image reconstruction in DECT with LAR data. Objective: We investigate image reconstruction with minimized LAR artifacts from low- and high-kVp data over LARs of $\le 180^\circ$ by using a directional-total-variation (DTV) algorithm. Methods: Image reconstruction from LAR data is formulated as a convex optimization problem in which data-$\ell_2$ is minimized with constraints on image's DTVs along orthogonal axes. We then achieve image reconstruction by applying the DTV algorithm to solve the optimization problem. We conduct numerical studies from data generated over arcs of LARs, ranging from $14^\circ$ to $180^\circ$, and perform visual inspection and quantitative analysis of images reconstructed. Results: Monochromatic images of interest obtained with the DTV algorithm from LAR data show substantially reduced artifacts that are observed often in images obtained with existing algorithms. The improved image quality also leads to accurate estimation of physical quantities of interest, such as effective atomic number and iodine-contrast concentration. Conclusion: Our study reveals that from LAR data of low- and high-kVp, monochromatic images can be obtained that are visually, and physical quantities can be estimated that are quantitatively, comparable to those obtained in FAR DECT. Significance: As LAR DECT is of high practical application interest, the results acquired in the work may engender insights into the design of DECT with LAR scanning configurations of practical application significance.

physics.med-ph↗

arXiv2021

Directional-TV Algorithm for Image Reconstruction from Limited-Angular-Range Data

Investigation of image reconstruction from data collected over a limited angular range in X-ray CT remains a topic of active research because it may yield insight into the development of imaging workflow of practical significance. This reconstruction problem is well-known to be challenging, however, because it is highly ill-conditioned. In the work, we investigate optimization-based image reconstruction from data acquired over a limited-angular range that is considerably smaller than the angular range in short-scan CT. We first formulate the reconstruction problem as a convex optimization program with directional total-variation (TV) constraints applied to the image, and then develop an iterative algorithm, referred to as the directional-TV (DTV) algorithm for image reconstruction through solving the optimization program. We use the DTV algorithm to reconstruct images from data collected over a variety of limited-angular ranges for breast and bar phantoms of clinical- and industrial-application relevance. The study demonstrates that the DTV algorithm accurately recovers the phantoms from data generated over a significantly reduced angular range, and that it considerably diminishes artifacts observed otherwise in reconstructions of existing algorithms. We have also obtained empirical conditions on minimal angular ranges sufficient for numerically accurate image reconstruction with the DTV algorithm.

physics.med-ph↗