The problem of tomographic image reconstruction can be reduced to an optimization problem of finding unknown pixel values subject to minimizing the difference between the measured and forward projections. Iterative image reconstruction algorithms provide significant improvements over transform methods in computed tomography. In this paper, we present an extended class of power-divergence measures (PDMs), which includes a large set of distance and relative entropy measures, and propose an iterative reconstruction algorithm based on the extended PDM (EPDM) as an objective function for the optimization strategy. For this purpose, we introduce a system of nonlinear differential equations whose Lyapunov function is equivalent to the EPDM. Then, we derive an iterative formula by multiplicative discretization of the continuous-time system. Since the parameterized EPDM family includes the Kullback–Leibler divergence, the resulting iterative algorithm is a natural extension of the maximum-likelihood expectation-maximization (MLEM) method. We conducted image reconstruction experiments using noisy projection data and found that the proposed algorithm outperformed MLEM and could reconstruct high-quality images that were robust to measured noise by properly selecting parameters.
17 July 2018 in Mathematical Problems in Engineering
Iterative reconstruction (IR) algorithms based on the principle of optimization are known for producing better reconstructed images in computed tomography. In this paper, we present an IR algorithm based on minimizing a symmetrized Kullback-Leibler divergence (SKLD) that is called Jeffreys’ -divergence. The SKLD with iterative steps is guaranteed to decrease in convergence monotonically using a continuous dynamical method for consistent inverse problems. Specifically, we construct an autonomous differential equation for which the proposed iterative formula gives a first-order numerical discretization and demonstrate the stability of a desired solution using Lyapunov’s theorem. We describe a hybrid Euler method combined with additive and multiplicative calculus for constructing an effective and robust discretization method, thereby enabling us to obtain an approximate solution to the differential equation. We performed experiments and found that the IR algorithm derived from the hybrid discretization achieved high performance.
Iterative image reconstruction algorithms have considerable advantages over transform methods for computed tomography, but they each have their own drawbacks. In particular, the maximum-likelihood expectation-maximization (MLEM) algorithm reconstructs high-quality images even with noisy projection data, but it is slow. On the other hand, the simultaneous multiplicative algebraic reconstruction technique (SMART) converges faster at early iterations but is susceptible to noise. Here, we construct a novel algorithm that has the advantages of these different iterative schemes by combining ordered-subsets EM (OS-EM) and MART (OS-MART) with weighted geometric or hybrid means. It is theoretically shown that the objective function decreases with every iteration and the amount of decrease is greater than the mean between the decreases for OS-EM and OS-MART. We conducted image reconstruction experiments on simulated phantoms and deduced that our algorithm outperforms OS-EM and OS-MART alone. Our algorithm would be effective in practice since it incorporates OS-EM, which is currently the most popular technique of iterative image reconstruction from noisy measured projections.
Recently, an extended family of power-divergence measures with two parameters was proposed together with an iterative reconstruction algorithm based on minimization of the divergence measure as an objective function of the reconstructed images for computed tomography. Numerical experiments on the reconstruction algorithm illustrated that it has advantages over conventional iterative methods from noisy measured projections by setting appropriate values of the parameters. In this paper, we present a novel neural network architecture for determining the most appropriate parameters depending on the noise level of the projections and the shape of the target image. Through experiments, we show that the algorithm of the architecture, which has an optimization sub-network with multiplicative connections rather than additive ones, works well.
Computed tomography (CT) imaging plays a crucial role in various medical applications, but noise in projection data can significantly degrade image quality and hinder diagnosis accuracy. Iterative algorithms for tomographic image reconstruction outperform transform methods, especially in scenarios with severe noise in projections. In this paper, we propose a method to dynamically adjust two parameters included in the iterative rules during the reconstruction process. The algorithm, named the parameter-extended expectation-maximization based on power divergence (PXEM), aims to minimize the weighted extended power divergence between the measured and forward projections at each iteration. Our numerical and physical experiments showed that PXEM surpassed conventional methods such as maximum-likelihood expectation-maximization (MLEM), particularly in noisy scenarios. PXEM combines the noise suppression capabilities of power divergence-based expectation-maximization with static parameters at every iteration and the edge preservation properties of MLEM. The experimental results demonstrated significant improvements in image quality in metrics such as the structural similarity index measure and peak signal-to-noise ratio. PXEM improves CT image reconstruction quality under high noise conditions through enhanced optimization techniques.
The conventional approach to intensity-modulated radiation therapy treatment planning involves two distinct strategies: optimizing an evaluation function while accounting for dose constraints, and solving feasibility problems using feasibility-seeking projection methods that incorporate inequality constraints. This paper introduces a novel iterative scheme within the framework of continuous dynamical systems, wherein constraint conditions dynamically evolve to enhance the optimization process. The validity of dynamically varying dose constraints is theoretically established through the foundation of continuous-time dynamical systems theory. In particular, we formalize a system of differential equations, with both beam coefficients and dose constraints modeled as state variables. The asymptotic stability of the system’s equilibrium is rigorously proven, ensuring convergence to a solution. In practical terms, we leverage a discretized iteration formula derived from the continuous-time system to achieve rapid computational speed. The mathematical structure of the proposed approach, which directly incorporates dose-volume constraints into the objective function, facilitates significant computational efficiency and solution refinement. The proposed method has an inherent dynamics that approaches more desirable solutions within the set of solutions when the solution to the optimization problem is not an isolated point. This property guarantees the identification of optimal solutions that respect the prescribed dose-volume constraints while enhancing accuracy when such constraints are feasible. By treating dose constraints as variables and concurrently solving the optimization problem with beam coefficients, we can achieve more accurate results when compared with using fixed values for prescribed dose conditions.