arXiv subjects

Chenguang Li

Publications and source records attributed to Chenguang Li.

11 recordsLinked to original sources

arXiv2024

Uncertainty Propagation from Projections to Region Counts in Tomographic Imaging: Application to Radiopharmaceutical Dosimetry

Radiopharmaceutical therapies (RPTs) present a major opportunity to improve cancer therapy. Although many current RPTs use the same injected activity for all patients, there is interest in using absorbed dose measurements to enable personalized prescriptions. Image-based absorbed dose calculations incur uncertainties from calibration factors, partial volume effects and segmentation methods. While previously published dose estimation protocols incorporate these uncertainties, they do not account for uncertainty originating from the reconstruction process itself with the propagation of Poisson noise from projection data. This effect should be accounted for to adequately estimate the total uncertainty in absorbed dose estimates. This paper proposes a computationally practical algorithm that propagates uncertainty from projection data through clinical reconstruction algorithms to obtain uncertainties on the total measured counts within volumes of interest (VOIs). The algorithm is first validated on ${}^{177}$Lu and ${}^{225}$Ac phantom data by comparing estimated uncertainties from individual SPECT acquisitions to empirical estimates obtained from multiple acquisitions. It is then applied to (i) Monte Carlo and (ii) multi-time point ${}^{177}$Lu-DOTATATE and ${}^{225}$Ac-PSMA-617 patient data for time integrated activity (TIA) uncertainty estimation. The outcomes of this work are two-fold: (i) the proposed uncertainty algorithm is validated, and (ii) a blueprint is established for how the algorithm can be inform dosimetry protocols via TIA uncertainty estimation. The proposed algorithm is made publicly available in the open-source image reconstruction library PyTomography.

physics.med-ph↗

arXiv2024

Computationally Efficient Collimator-Detector Response Compensation in High Energy SPECT using 1D Convolutions and Rotations

Modeling of the collimator-detector response (CDR) in SPECT reconstruction enables improved resolution and accuracy, and is thus important for quantitative imaging applications such as dosimetry. The implementation of CDR modeling, however, can become a computational bottleneck when there are substantial components of septal penetration and scatter in the acquired data, since a direct convolution-based approach requires large 2D kernels. This work proposes a 1D convolution and rotation-based CDR model that reduces reconstruction times but maintains consistency with models that employ 2D convolutions. To enable open-source development and use of these models in image reconstruction, we release a SPECTPSFToolbox repository for the PyTomography project on GitHub.

physics.med-ph↗

arXiv2023

A Review and Roadmap of Deep Causal Model from Different Causal Structures and Representations

The fusion of causal models with deep learning introducing increasingly intricate data sets, such as the causal associations within images or between textual components, has surfaced as a focal research area. Nonetheless, the broadening of original causal concepts and theories to such complex, non-statistical data has been met with serious challenges. In response, our study proposes redefinitions of causal data into three distinct categories from the standpoint of causal structure and representation: definite data, semi-definite data, and indefinite data. Definite data chiefly pertains to statistical data used in conventional causal scenarios, while semi-definite data refers to a spectrum of data formats germane to deep learning, including time-series, images, text, and others. Indefinite data is an emergent research sphere inferred from the progression of data forms by us. To comprehensively present these three data paradigms, we elaborate on their formal definitions, differences manifested in datasets, resolution pathways, and development of research. We summarize key tasks and achievements pertaining to definite and semi-definite data from myriad research undertakings, present a roadmap for indefinite data, beginning with its current research conundrums. Lastly, we classify and scrutinize the key datasets presently utilized within these three paradigms.

cs.LG↗

arXiv2023

PyTomography: A Python Library for Medical Image Reconstruction

There is a need for open-source libraries in emission tomography that (i) use modern and popular backend code to encourage community contributions and (ii) offer support for the multitude of reconstruction techniques available in recent literature, such as those that employ artificial intelligence. The purpose of this research was to create and evaluate a GPU-accelerated, open-source, and user-friendly image reconstruction library, designed to serve as a central platform for the development, validation, and deployment of various tomographic reconstruction algorithms. PyTomography was developed using Python and inherits the GPU-accelerated functionality of PyTorch and parallelproj for fast computations. Its flexible and modular design decouples system matrices, likelihoods, and reconstruction algorithms, simplifying the process of integrating new imaging modalities using various python tools. Example use cases demonstrate the software capabilities in parallel hole SPECT and listmode PET imaging. Overall, we have developed and publicly share PyTomography, a highly optimized and user-friendly software for medical image reconstruction, with a class hierarchy that fosters the development of novel imaging applications.

physics.med-ph↗

arXiv2022

Reconstruct from BEV: A 3D Lane Detection Approach based on Geometry Structure Prior

In this paper, we propose an advanced approach in targeting the problem of monocular 3D lane detection by leveraging geometry structure underneath the process of 2D to 3D lane reconstruction. Inspired by previous methods, we first analyze the geometry heuristic between the 3D lane and its 2D representation on the ground and propose to impose explicit supervision based on the structure prior, which makes it achievable to build inter-lane and intra-lane relationships to facilitate the reconstruction of 3D lanes from local to global. Second, to reduce the structure loss in 2D lane representation, we directly extract BEV lane information from front view images, which tremendously eases the confusion of distant lane features in previous methods. Furthermore, we propose a novel task-specific data augmentation method by synthesizing new training data for both segmentation and reconstruction tasks in our pipeline, to counter the imbalanced data distribution of camera pose and ground slope to improve generalization on unseen data. Our work marks the first attempt to employ the geometry prior information into DNN-based 3D lane detection and makes it achievable for detecting lanes in an extra-long distance, doubling the original detection range. The proposed method can be smoothly adopted by other frameworks without extra costs. Experimental results show that our work outperforms state-of-the-art approaches by 3.8% F-Score on Apollo 3D synthetic dataset at real-time speed of 82 FPS without introducing extra parameters.

cs.CV↗

arXiv2022

Multi-level Domain Adaptation for Lane Detection

We focus on bridging domain discrepancy in lane detection among different scenarios to greatly reduce extra annotation and re-training costs for autonomous driving. Critical factors hinder the performance improvement of cross-domain lane detection that conventional methods only focus on pixel-wise loss while ignoring shape and position priors of lanes. To address the issue, we propose the Multi-level Domain Adaptation (MLDA) framework, a new perspective to handle cross-domain lane detection at three complementary semantic levels of pixel, instance and category. Specifically, at pixel level, we propose to apply cross-class confidence constraints in self-training to tackle the imbalanced confidence distribution of lane and background. At instance level, we go beyond pixels to treat segmented lanes as instances and facilitate discriminative features in target domain with triplet learning, which effectively rebuilds the semantic context of lanes and contributes to alleviating the feature confusion. At category level, we propose an adaptive inter-domain embedding module to utilize the position prior of lanes during adaptation. In two challenging datasets, ie TuSimple and CULane, our approach improves lane detection performance by a large margin with gains of 8.8% on accuracy and 7.4% on F1-score respectively, compared with state-of-the-art domain adaptation algorithms.

cs.CV↗

arXiv2022

A Review and Roadmap of Deep Learning Causal Discovery in Different Variable Paradigms

Understanding causality helps to structure interventions to achieve specific goals and enables predictions under interventions. With the growing importance of learning causal relationships, causal discovery tasks have transitioned from using traditional methods to infer potential causal structures from observational data to the field of pattern recognition involved in deep learning. The rapid accumulation of massive data promotes the emergence of causal search methods with brilliant scalability. Existing summaries of causal discovery methods mainly focus on traditional methods based on constraints, scores and FCMs, there is a lack of perfect sorting and elaboration for deep learning-based methods, also lacking some considers and exploration of causal discovery methods from the perspective of variable paradigms. Therefore, we divide the possible causal discovery tasks into three types according to the variable paradigm and give the definitions of the three tasks respectively, define and instantiate the relevant datasets for each task and the final causal model constructed at the same time, then reviews the main existing causal discovery methods for different tasks. Finally, we propose some roadmaps from different perspectives for the current research gaps in the field of causal discovery and point out future research directions.

cs.LG↗

arXiv2022

Polarization-Independent Wavelength Demultiplexer Based on Single Etched Diffraction Grating Device

Polarization-compatible receivers are indispensable in transceivers used for wavelength division multiplexing (WDM) optical communications, as light polarization is unpredictable after transmission through network fibers. However, the strong waveguide birefringence makes it difficult to realize a polarization-independent wavelength demultiplexer in a silicon photonic (SiPh) receiver. Here, we utilized the birefringence effect for simultaneously demultiplexing wavelengths and polarizations, and experimentally demonstrated a novel polarization-independent wavelength demultiplexer with a single device on a SiPh platform. The principle was validated on an etched diffraction grating (EDG), which successfully split the arbitrarily polarized light containing four wavelengths into eight channels with single-polarization and single-wavelength signals. Polarization-dependent losses of 0.5-1.8 dB, minimum insertion loss of 0.5 dB, and crosstalks lower than -30 dB were experimentally measured. Thus, a promising general solution was developed for implementing polarization-independent WDM receivers and other polarization-independent devices on SiPh and other platforms with birefringent waveguide devices.

physics.optics↗

arXiv2019

Ensuring Readability and Data-fidelity using Head-modifier Templates in Deep Type Description Generation

A type description is a succinct noun compound which helps human and machines to quickly grasp the informative and distinctive information of an entity. Entities in most knowledge graphs (KGs) still lack such descriptions, thus calling for automatic methods to supplement such information. However, existing generative methods either overlook the grammatical structure or make factual mistakes in generated texts. To solve these problems, we propose a head-modifier template-based method to ensure the readability and data fidelity of generated type descriptions. We also propose a new dataset and two automatic metrics for this task. Experiments show that our method improves substantially compared with baselines and achieves state-of-the-art performance on both datasets.

cs.CL↗

arXiv2018

KDSL: a Knowledge-Driven Supervised Learning Framework for Word Sense Disambiguation

We propose KDSL, a new word sense disambiguation (WSD) framework that utilizes knowledge to automatically generate sense-labeled data for supervised learning. First, from WordNet, we automatically construct a semantic knowledge base called DisDict, which provides refined feature words that highlight the differences among word senses, i.e., synsets. Second, we automatically generate new sense-labeled data by DisDict from unlabeled corpora. Third, these generated data, together with manually labeled data and unlabeled data, are fed to a neural framework conducting supervised and unsupervised learning jointly to model the semantic relations among synsets, feature words and their contexts. The experimental results show that KDSL outperforms several representative state-of-the-art methods on various major benchmarks. Interestingly, it performs relatively well even when manually labeled data is unavailable, thus provides a potential solution for similar tasks in a lack of manual annotations.

cs.CL↗

arXiv2013

Percolation on the institute-enterprise R&D collaboration networks

Realistic network-like systems are usually composed of multiple networks with interacting relations such as school-enterprise research and development collaboration networks. Here we study the percolation properties of a special kind of that R&D collaboration networks, namely institute-enterprise R&D collaboration networks. We introduce two actual IERDCNs to show their structural properties, and present a mathematical framework based on generating functions for analyzing an interacting network with any connection probability. Then we illustrate the percolation threshold and structural parameter arithmetic in the sub-critical and supercritical regimes. We compare the predictions of our mathematical framework and arithmetic to data for two real R&D collaboration networks and a number of simulations, and we find that they are in remarkable agreement with the data. We show applications of the framework to electronics R&D collaboration networks.

physics.soc-ph↗