arXiv subjects

Kris Thielemans

Publications and source records attributed to Kris Thielemans.

At least 19 recordsLinked to original sources

arXiv2026

PET Rapid Image Reconstruction Challenge (PETRIC)

Introduction: We describe the foundation of PETRIC, an image reconstruction challenge to minimise the computational runtime of related algorithms for Positron Emission Tomography (PET). Purpose: Although several similar challenges are well-established in the field of medical imaging, there have been no prior challenges for PET image reconstruction. Methods: Participants are provided with open-source software for implementation of their reconstruction algorithm(s). We define the objective function and reconstruct "gold standard" reference images, and provide metrics for quantifying algorithmic performance. We also received and curated phantom datasets (acquired with different scanners, radionuclides, and phantom types), which we further split into training and evaluation datasets. The automated computational framework of the challenge is released as open-source software. Results: Four teams with nine algorithms in total participated in the challenge. Their contributions made use of various tools from optimisation theory including preconditioning, stochastic gradients, and artificial intelligence. While most of the submitted approaches appear very similar in nature, their specific implementation lead to a range of algorithmic performance. Conclusion: As the first challenge for PET image reconstruction, PETRIC's solid foundations allow researchers to reuse its framework for evaluating new and existing image reconstruction methods on new or existing datasets. Variant versions of the challenge have and will continue to be launched in the future.

physics.med-ph↗

arXiv2026

A Modular Approach to Stochastic Optimisation for Inverse Problems Using the Core Imaging Library

The Core Imaging Library (CIL) is an open-source versatile Python framework for solving inverse problems with special emphasis on imaging applications such as computed tomography (CT), using a plug-in architecture for data and operators, interfacing to toolboxes such as ASTRA, TIGRE and SIRF. A key component of CIL is its optimisation module enabling users to flexibly combine mathematical operators and functionals to form smooth and non-smooth optimisation problems and solve these with a range of first-order algorithms. The present work introduces an expansion of CIL with a new modular framework for stochastic optimisation, allowing researchers to easily use a variety of existing stochastic optimisation algorithms as well form new ones by combining modular building blocks. Users can flexibly configure algorithmic components, adapt to diverse problem structures, and experiment with various sampling and step size strategies. Rather than individual black-box implementations of each fixed algorithm with significant redundancies, our design is modular providing building blocks that can be flexibly combined to realise a wealth of algorithm instances. The framework is particularly well-suited for large-scale applications, where stochastic methods offer notable computational advantages over deterministic approaches. To demonstrate its versatility and practical utility, we present experiments on real-world datasets from imaging inverse problems, such as X-Ray CT and Positron Emission Tomography (PET) reconstruction. In summary, the presented software expansion aims to support the research community with a robust, extensible optimisation suite for developing, testing, and benchmarking stochastic methods for inverse problems.

math.OC↗

arXiv2025

DIGS: Dynamic CBCT Reconstruction using Deformation-Informed 4D Gaussian Splatting and a Low-Rank Free-Form Deformation Model

3D Cone-Beam CT (CBCT) is widely used in radiotherapy but suffers from motion artifacts due to breathing. A common clinical approach mitigates this by sorting projections into respiratory phases and reconstructing images per phase, but this does not account for breathing variability. Dynamic CBCT instead reconstructs images at each projection, capturing continuous motion without phase sorting. Recent advancements in 4D Gaussian Splatting (4DGS) offer powerful tools for modeling dynamic scenes, yet their application to dynamic CBCT remains underexplored. Existing 4DGS methods, such as HexPlane, use implicit motion representations, which are computationally expensive. While explicit low-rank motion models have been proposed, they lack spatial regularization, leading to inconsistencies in Gaussian motion. To address these limitations, we introduce a free-form deformation (FFD)-based spatial basis function and a deformation-informed framework that enforces consistency by coupling the temporal evolution of Gaussian's mean position, scale, and rotation under a unified deformation field. We evaluate our approach on six CBCT datasets, demonstrating superior image quality with a 6x speedup over HexPlane. These results highlight the potential of deformation-informed 4DGS for efficient, motion-compensated CBCT reconstruction. The code is available at https://github.com/Yuliang-Huang/DIGS.

eess.IV↗

arXiv2024

Accelerated Convergent Motion Compensated Image Reconstruction

Motion correction aims to prevent motion artefacts which may be caused by respiration, heartbeat, or head movements for example. In a preliminary step, the measured data is divided in gates corresponding to motion states, and displacement maps from a reference state to each motion state are estimated. One common technique to perform motion correction is the motion compensated image reconstruction framework, where the displacement maps are integrated into the forward model corresponding to gated data. For standard algorithms, the computational cost per iteration increases linearly with the number of gates. In order to accelerate the reconstruction, we propose the use of a randomized and convergent algorithm whose per iteration computational cost scales constantly with the number of gates. We show improvement on theoretical rates of convergence and observe the predicted speed-up on two synthetic datasets corresponding to rigid and non-rigid motion.

math.OC↗

arXiv2024

Resolving Variable Respiratory Motion From Unsorted 4D Computed Tomography

4D Computed Tomography (4DCT) is widely used for many clinical applications such as radiotherapy treatment planning, PET and ventilation imaging. However, common 4DCT methods reconstruct multiple breath cycles into a single, arbitrary breath cycle which can lead to various artefacts, impacting the downstream clinical applications. Surrogate driven motion models can estimate continuous variable motion across multiple cycles based on CT segments `unsorted' from 4DCT, but it requires respiration surrogate signals with strong correlation to the internal motion, which are not always available. The method proposed in this study eliminates such dependency by adapting the hyper-gradient method to the optimization of surrogate signals as hyper-parameters, while achieving better or comparable performance, as demonstrated on digital phantom simulations and real patient data. Our method produces a high-quality motion-compensated image together with estimates of the motion, including breath-to-breath variability, throughout the image acquisition. Our method has the potential to improve downstream clinical applications, and also enables retrospective analysis of open access 4DCT dataset where no respiration signals are stored. Code is avaibale at https://github.com/Yuliang-Huang/4DCT-irregular-motion.

cs.CV↗

arXiv2024

Stochastic Optimisation Framework using the Core Imaging Library and Synergistic Image Reconstruction Framework for PET Reconstruction

We introduce a stochastic framework into the open--source Core Imaging Library (CIL) which enables easy development of stochastic algorithms. Five such algorithms from the literature are developed, Stochastic Gradient Descent, Stochastic Average Gradient (-Amélioré), (Loopless) Stochastic Variance Reduced Gradient. We showcase the functionality of the framework with a comparative study against a deterministic algorithm on a simulated 2D PET dataset, with the use of the open-source Synergistic Image Reconstruction Framework. We observe that stochastic optimisation methods can converge in fewer passes of the data than a standard deterministic algorithm.

math.NA↗

arXiv2024

Score-Based Generative Models for PET Image Reconstruction

Score-based generative models have demonstrated highly promising results for medical image reconstruction tasks in magnetic resonance imaging or computed tomography. However, their application to Positron Emission Tomography (PET) is still largely unexplored. PET image reconstruction involves a variety of challenges, including Poisson noise with high variance and a wide dynamic range. To address these challenges, we propose several PET-specific adaptations of score-based generative models. The proposed framework is developed for both 2D and 3D PET. In addition, we provide an extension to guided reconstruction using magnetic resonance images. We validate the approach through extensive 2D and 3D $\textit{in-silico}$ experiments with a model trained on patient-realistic data without lesions, and evaluate on data without lesions as well as out-of-distribution data with lesions. This demonstrates the proposed method's robustness and significant potential for improved PET reconstruction.

eess.IV↗

arXiv2023

PARALLELPROJ -- An open-source framework for fast calculation of projections in tomography

In this article, we introduce, a novel open-source framework designed for efficient parallel computation of projections in tomography leveraging either multiple CPU cores or GPUs. This framework efficiently implements forward and back projection functions for both sinogram and listmode data, utilizing Joseph's method, which is further extended to encompass time-of-flight (TOF) PET projections. Our evaluation involves a series of tests focusing on PET image reconstruction using data sourced from a state-of-the-art clinical PET/CT system. We thoroughly benchmark the performance of the projectors in non-TOF and TOF, sinogram, and listmode employing multi CPU-cores, hybrid CPU/GPU, and exclusive GPU mode. Moreover, we also investigate the timing of non-TOF sinogram projections calculated in STIR (Software for Tomographic Image Reconstruction) which recently integrated parallelproj as one of its projection backends. Our results indicate that the exclusive GPU mode provides acceleration factors between 25 and 68 relative to the multi-CPU-core mode. Furthermore, we demonstrate that OSEM listmode reconstruction of state-of-the-art real-world PET data sets is achievable within a few seconds using a single consumer GPU.

physics.med-ph↗

arXiv2021

Proceedings of the 16th Virtual International Meeting on Fully 3D Image Reconstruction in Radiology and Nuclear Medicine

These proceedings contain the presented papers at the 16th International Meeting on Fully Three-Dimensional Image Reconstruction in Radiology and Nuclear Medicine 2021, which was to be held in Leuven, Belgium, but had to be transformed in a virtual meeting because of the covid-19 pandemic. Fully3D is one of the major forums for presentation of new results in the field of 3D image reconstruction, primarily with applications in x-ray computer tomography, PET and SPECT. Over the life-time of the meeting the focus has shifted to reflect recent developments in the field. Many of the major developments in fully 3D PET and SPECT imaging were first presented at Fully3D, as were the key results for analytic reconstruction methods in cone beam x-ray CT. Similarly, in the 2021 meeting a broad range of topics has been presented. As expected, deep learning methods are being used increasingly: they are used as post-processing tools or incorporated in the reconstruction, often aiming at improved noise and/or artifact suppression.

physics.med-ph↗

arXiv2021

Artificial Intelligence in PET: an Industry Perspective

Artificial intelligence (AI) has significant potential to positively impact and advance medical imaging, including positron emission tomography (PET) imaging applications. AI has the ability to enhance and optimize all aspects of the PET imaging chain from patient scheduling, patient setup, protocoling, data acquisition, detector signal processing, reconstruction, image processing and interpretation. AI poses industry-specific challenges which will need to be addressed and overcome to maximize the future potentials of AI in PET. This paper provides an overview of these industry-specific challenges for the development, standardization, commercialization, and clinical adoption of AI, and explores the potential enhancements to PET imaging brought on by AI in the near future. In particular, the combination of on-demand image reconstruction, AI, and custom designed data processing workflows may open new possibilities for innovation which would positively impact the industry and ultimately patients.

cs.CV↗

arXiv2021

Stochastic EM methods with Variance Reduction for Penalised PET Reconstructions

Expectation-maximization (EM) is a popular and well-established method for image reconstruction in positron emission tomography (PET) but it often suffers from slow convergence. Ordered subset EM (OSEM) is an effective reconstruction algorithm that provides significant acceleration during initial iterations, but it has been observed to enter a limit cycle. In this work, we investigate two classes of algorithms for accelerating OSEM based on variance reduction for penalised PET reconstructions. The first is a stochastic variance reduced EM algorithm, termed as SVREM, an extension of the classical EM to the stochastic context, by combining classical OSEM with insights from variance reduction techniques for gradient descent. The second views OSEM as a preconditioned stochastic gradient ascent, and applies variance reduction techniques, i.e., SAGA and SVRG, to estimate the update direction. We present several numerical experiments to illustrate the efficiency and accuracy of the approaches. The numerical results show that these approaches significantly outperform existing OSEM type methods for penalised PET reconstructions, and hold great potential.

physics.med-ph↗

arXiv2021

Core Imaging Library -- Part I: a versatile Python framework for tomographic imaging

We present the Core Imaging Library (CIL), an open-source Python framework for tomographic imaging with particular emphasis on reconstruction of challenging datasets. Conventional filtered back-projection reconstruction tends to be insufficient for highly noisy, incomplete, non-standard or multi-channel data arising for example in dynamic, spectral and in situ tomography. CIL provides an extensive modular optimisation framework for prototyping reconstruction methods including sparsity and total variation regularisation, as well as tools for loading, preprocessing and visualising tomographic data. The capabilities of CIL are demonstrated on a synchrotron example dataset and three challenging cases spanning golden-ratio neutron tomography, cone-beam X-ray laminography and positron emission tomography.

math.OC↗

arXiv2020

Penalized PET/CT Reconstruction Algorithms with Automatic Realignment for Anatomical Priors

Two algorithms for solving misalignment issues in penalized PET/CT reconstruction using anatomical priors are proposed. Both approaches are based on a recently published joint motion estimation and image reconstruction method. The first approach deforms the anatomical image to align it with the functional one while the second approach deforms both images to align them with the measured data. Our current implementation alternates between image reconstruction and alignment estimation. To evaluate the potential of these approaches, we have chosen Parallel Level Sets (PLS) as a representative anatomical penalty, incorporating a spatially-variant penalty strength to achieve uniform local contrast. The performance was evaluated using simulated non-TOF data generated with an XCAT phantom in the thorax region. We used the attenuation image in the anatomical prior. The results demonstrated that both methods can estimate the misalignment and deform the anatomical image accordingly. However, the performance of the first approach depends highly on the workflow of the alternating process. The second approach shows a faster convergence rate to the correct alignment and is less sensitive to the workflow. Interestingly, the presence of anatomical information can improve the convergence rate of misalignment estimation for the second approach but slow it down for the first approach.

physics.med-ph↗

arXiv2019

Improved MR to CT synthesis for PET/MR attenuation correction using Imitation Learning

The ability to synthesise Computed Tomography images - commonly known as pseudo CT, or pCT - from MRI input data is commonly assessed using an intensity-wise similarity, such as an L2-norm between the ground truth CT and the pCT. However, given that the ultimate purpose is often to use the pCT as an attenuation map ($μ$-map) in Positron Emission Tomography Magnetic Resonance Imaging (PET/MRI), minimising the error between pCT and CT is not necessarily optimal. The main objective should be to predict a pCT that, when used as $μ$-map, reconstructs a pseudo PET (pPET) which is as close as possible to the gold standard PET. To this end, we propose a novel multi-hypothesis deep learning framework that generates pCTs by minimising a combination of the pixel-wise error between pCT and CT and a proposed metric-loss that itself is represented by a convolutional neural network (CNN) and aims to minimise subsequent PET residuals. The model is trained on a database of 400 paired MR/CT/PET image slices. Quantitative results show that the network generates pCTs that seem less accurate when evaluating the Mean Absolute Error on the pCT (69.68HU) compared to a baseline CNN (66.25HU), but lead to significant improvement in the PET reconstruction - 115a.u. compared to baseline 140a.u.

eess.IV↗

arXiv2018

Deep Boosted Regression for MR to CT Synthesis

Attenuation correction is an essential requirement of positron emission tomography (PET) image reconstruction to allow for accurate quantification. However, attenuation correction is particularly challenging for PET-MRI as neither PET nor magnetic resonance imaging (MRI) can directly image tissue attenuation properties. MRI-based computed tomography (CT) synthesis has been proposed as an alternative to physics based and segmentation-based approaches that assign a population-based tissue density value in order to generate an attenuation map. We propose a novel deep fully convolutional neural network that generates synthetic CTs in a recursive manner by gradually reducing the residuals of the previous network, increasing the overall accuracy and generalisability, while keeping the number of trainable parameters within reasonable limits. The model is trained on a database of 20 pre-acquired MRI/CT pairs and a four-fold random bootstrapped validation with a 80:20 split is performed. Quantitative results show that the proposed framework outperforms a state-of-the-art atlas-based approach decreasing the Mean Absolute Error (MAE) from 131HU to 68HU for the synthetic CTs and reducing the PET reconstruction error from 14.3% to 7.2%.

physics.med-ph↗

arXiv1995

A Mathematica Package for Computing N=2 Superfield Operator Product Expansions

We describe a general purpose Mathematica package for computing Superfield Operator Product Expansions in meromorphic $N=2$ superconformal field theory. Given the SOPEs for a set of ``basic" superfields, SOPEs of arbitrarily complicated composites can be computed automatically. Normal ordered products are always reduced to a standard form. It is possible to check the Jacobi identities, and to compute Poisson brackets (``classical SOPEs''). We present two explicit examples: a construction of the ``small'' $N=4$ superconformal algebra in terms of $N=2$ superfields, and a realisation of the $N=2$ superconformal algebra in terms of chiral and antichiral fermionic superfields.

hep-th↗

arXiv1995

Gauging Conformal Algebras with Relations between the Generators

We investigate the gauging of conformal algebras with relations between the generators. We treat the $W_{5/2}$--algebra as a specific example. We show that the gauge-algebra is in general reducible with an infinite number of stages. We show how to construct the BV-extended action, and hence the classical BRST charge. An important conclusion is that this can always be done in terms of the generators of the $W$--algebra only, that is, independent of the realisation. The present treatment is still purely classical, but already enables us to learn more about reducible gauge algebras and the BV-formalism.

hep-th↗

arXiv1995

An Algorithmic Approach to Operator Product Expansions, $W$-Algebras and $W$-Strings

String theory is currently the most promising theory to explain the spectrum of the elementary particles and their interactions. One of its most important features is its large symmetry group, which contains the conformal transformations in two dimensions as a subgroup. At quantum level, the symmetry group of a theory gives rise to differential equations between correlation functions of observables. We show that these Ward-identities are equivalent to Operator Product Expansions (OPEs), which encode the short-distance singularities of correlation functions with symmetry generators. The OPEs allow us to determine algebraically many properties of the theory under study. We analyse the calculational rules for OPEs, give an algorithm to compute OPEs, and discuss an implementation in Mathematica. There exist different string theories, based on extensions of the conformal algebra to so-called W-algebras. These algebras are generically nonlinear. We study their OPEs, with as main results an efficient algorithm to compute the beta-coefficients in the OPEs, the first explicit construction of the WB_2-algebra, and criteria for the factorisation of free fields in a W-algebra. An important technique to construct realisations of W-algebras is Drinfel'd- Sokolov reduction. The method consists of imposing certain constraints on the elements of an affine Lie algebra. We quantise this reduction via gauged WZNW-models. This enables us in a theory with a gauged W-symmetry, to compute exactly the correlation functions of the effective theory. Finally, we investigate the critical W-string theories based on an extension of the conformal algebra with one symmetry generator of dimension N. We clarify how the spectrum of this theory forms a minimal model of the W_N-algebra.

hep-th↗