arXiv subjects

Richard Huber

Publications and source records attributed to Richard Huber.

8 recordsLinked to original sources

arXiv2026

Systematic Analysis of Penalty-Optimised Illumination Design for Tomographic Volumetric Additive Manufacturing via the Extendable Framework TVAM AID Using the Core Imaging Library

Tomographic Volumetric Additive Manufacturing(TVAM) is a novel manufacturing method that allows for the fast creation of objects of complex geometry in layerless fashion. The process is based on the solidification of photopolymer that occurs when a sufficient threshold dose of light-energy is absorbed. In order to create complex shapes, an illumination plan must be designed to force solidification in some desired areas while leaving other regions liquid. Determining an illumination plan can be considered as an optimisation problem where a variety of objective functionals (penalties) can be used. This work considers a selection of penalty functions and their impact on selected printing metrics; linking the shape of penalty functions to ranges of light-energy dose levels in in-part regions that should be printed and out-of-part regions that should remain liquid. Further, the threshold parameters that are typically used to demarcate minimum light-energy for in-part regions and maximum light-energy for out-of-part regions are investigated systematically as design parameters on both existing and new methods. This enables the characterisation of their effects on some selected printing metrics as well as informed selection for default values. This work is underpinned by a reproducible and extensible framework, TVAM Adaptive Illumination Design(TVAM AID), which makes use of the open-source Core Imaging Library(CIL) that is designed for tomographic imaging with an emphasis on reconstruction. The foundation of TVAM AID which is presented here can hence be easily enhanced by existing functionality in CIL thus lowering the barrier to entry and encouraging use of strategies that already exist for reconstruction optimisation.

cs.CE↗

arXiv2025

Determination of Range Conditions for General Projection Pair Operators

Tomographic techniques are vital in modern medicine, allowing doctors to observe patients' interior features. Individual steps in the measurement process are modeled by `single projection operators' $p$. These are line integral operators over a collection of curves that covers the regions of interest. Then, the entire measurement process can be understood as a finite collection of such single projections, and thus be modeled by an $N$-projections operator $P=(p_1,\dots,p_N)$. The most well-known example of an $N$-projections operator is the restriction of the Radon transform to finitely many projection angles. Characterizations of the range of $N$-projections operators are of intrinsic mathematical interest and can also help in practical applications such as geometric calibration, motion detection, or model parameter identification. In this work, we investigate the range of projection pair operators $\mathcal{P}$ in the plane, i.e., operators formed by two projections ($N=2$) applied to functions in $\mathbb{R}^2$. We find that the set of annihilators to $\mathrm{rg}(\mathcal{P})$ that are regular distributions contains at most one dimension and a range condition can be explicitly determined by what we refer to as `kernel conditions'. With this tool, we examine the exponential fanbeam transform for which no range conditions were known, finding that no (regular) range condition exists, and therefore, arbitrary data can be approximated in an $L^2$ sense by projections of smooth functions. We also illustrate the use of this theory on a mixed parallel-fanbeam projection pair operator.

math.NA↗

arXiv2025

Convergence of Ray- and Pixel-Driven Discretization Frameworks in the Strong Operator Topology

Tomography is a central tool in medical applications, allowing doctors to investigate patients' interior features. The Radon transform (in two dimensions) is commonly used to model the measurement process in parallel-beam CT. Suitable discretization of the Radon transform and its adjoint (called the backprojection) is crucial. The most commonly used discretization approach combines what we refer to as the ray-driven Radon transform with what we refer to as the pixel-driven backprojection, as anecdotal reports describe these as showing the best approximation performance. However, there is little rigorous understanding of induced approximation errors. These methods involve three discretization parameters: the spatial-, detector-, and angular resolutions. Most commonly, balanced resolutions are used, i.e., the same (or similar) spatial- and detector resolutions are employed. We present an interpretation of ray- and pixel-driven discretizations as `convolutional methods', a special class of finite-rank operators. This allows for a structured analysis that can explain observed behavior. In particular, we prove convergence in the strong operator topology of the ray-driven Radon transform and the pixel-driven backprojection under balanced resolutions, thus theoretically justifying this approach. In particular, with high enough resolutions one can approximate the Radon transform arbitrarily well. Numerical experiments corroborate these theoretical findings.

math.NA↗

arXiv2025

A Novel Interpretation of the Radon Transform's Ray- and Pixel-Driven Discretizations under Balanced Resolutions

Tomographic investigations are a central tool in medical applications, allowing doctors to image the interior of patients. The corresponding measurement process is commonly modeled by the Radon transform. In practice, the solution of the tomographic problem requires discretization of the Radon transform and its adjoint (called the backprojection). There are various discretization schemes; often structured around three discretization parameters: spatial-, detector-, and angular resolutions. The most widespread approach uses the ray-driven Radon transform and the pixel-driven backprojection in a balanced resolution setting, i.e., the spatial resolution roughly equals the detector resolution. The use of these particular discretization approaches is based on anecdotal reports of their approximation performance, but there is little rigorous analysis of these methods' approximation errors. This paper presents a novel interpretation of ray-driven and pixel-driven methods as convolutional discretizations, illustrating that from an abstract perspective these methods are similar. Moreover, we announce statements concerning the convergence of the ray-driven Radon transform and the pixel-driven backprojection under balanced resolutions. Our considerations are supported by numerical experiments highlighting aspects of the discussed methods.

math.NA↗

arXiv2020

Convergence analysis of pixel-driven Radon and fanbeam transforms

This paper presents a novel mathematical framework for understanding pixel-driven approaches for the parallel beam Radon transform as well as for the fanbeam transform, showing that with the correct discretization strategy, convergence - including rates - in the $L^2$ operator norm can be obtained. These rates inform about suitable strategies for discretization of the occurring domains/variables, and are first established for the Radon transform. In particular, discretizing the detector in the same magnitude as the image pixels (which is standard practice) might not be ideal and in fact, asymptotically smaller pixels than detectors lead to convergence. Possible adjustments to limited-angle and sparse-angle Radon transforms are discussed, and similar convergence results are shown. In the same vein, convergence results are readily extended to a novel pixel-driven approach to the fanbeam transform. Numerical aspects of the discretization scheme are discussed, and it is shown in particular that with the correct discretization strategy, the typical high-frequency artifacts can be avoided.

math.NA↗

arXiv2019

Data-driven Evolutions of Critical Points

In this paper we are concerned with the learnability of energies from data obtained by observing time evolutions of their critical points starting at random initial equilibria. As a byproduct of our theoretical framework we introduce the novel concept of mean-field limit of critical point evolutions and of their energy balance as a new form of transport. We formulate the energy learning as a variational problem, minimizing the discrepancy of energy competitors from fulfilling the equilibrium condition along any trajectory of critical points originated at random initial equilibria. By Gamma-convergence arguments we prove the convergence of minimal solutions obtained from finite number of observations to the exact energy in a suitable sense. The abstract framework is actually fully constructive and numerically implementable. Hence, the approximation of the energy from a finite number of observations of past evolutions allows to simulate further evolutions, which are fully data-driven. As we aim at a precise quantitative analysis, and to provide concrete examples of tractable solutions, we present analytic and numerical results on the reconstruction of an elastic energy for a one-dimensional model of thin nonlinear-elastic rod.

cs.LG↗

arXiv2018

Coupled regularization with multiple data discrepancies

We consider a class of regularization methods for inverse problems where a coupled regularization is employed for the simultaneous reconstruction of data from multiple sources. Applications for such a setting can be found in multi-spectral or multi-modality inverse problems, but also in inverse problems with dynamic data. We consider this setting in a rather general framework and derive stability and convergence results, including convergence rates. In particular, we show how parameter choice strategies adapted to the interplay of different data channels allow to improve upon convergence rates that would be obtained by treating all channels equally. Motivated by concrete applications, our results are obtained under rather general assumptions that allow to include the Kullback-Leibler divergence as data discrepancy term. To simplify their application to concrete settings, we further elaborate several practically relevant special cases in detail. To complement the analytical results, we also provide an algorithmic framework and source code that allows to solve a class of jointly regularized inverse problems with any number of data discrepancies. As concrete applications, we show numerical results for multi-contrast MR and joint MR-PET reconstruction.

math.OC↗

arXiv2010

Use of semantic technologies for the development of a dynamic trajectories generator in a Semantic Chemistry eLearning platform

ChemgaPedia is a multimedia, webbased eLearning service platform that currently contains about 18.000 pages organized in 1.700 chapters covering the complete bachelor studies in chemistry and related topics of chemistry, pharmacy, and life sciences. The eLearning encyclopedia contains some 25.000 media objects and the eLearning platform provides services such as virtual and remote labs for experiments. With up to 350.000 users per month the platform is the most frequently used scientific educational service in the German spoken Internet. In this demo we show the benefit of mapping the static eLearning contents of ChemgaPedia to a Linked Data representation for Semantic Chemistry which allows for generating dynamic eLearning paths tailored to the semantic profiles of the users.

cs.AI↗