Takeshi Kojima
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Takeshi Kojima has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Tetsuya Yoshinaga
Institute of Biomedical Sciences, Tokushima University, 3-18-15 Kuramoto, Tokushima 770-8509, Japan
11 shared publications - Omar M. Abou Al-Ola
Faculty of Science, Tanta University, El-Giesh St., Tanta 31527, Egypt
8 shared publications - Yusaku Yamaguchi
Shikoku Medical Center for Children and Adults, National Hospital Organization, 2-1-1 Senyu, Zentsuji 765-8507, Japan
6 shared publications - Ryosuke Kasai
Institute of Biomedical Sciences, Tokushima University, 3-18-15 Kuramoto, Tokushima 770-8509, Japan
4 shared publications - Norihisa Obata
Graduate School of Health Sciences, Tokushima University, 3-18-15 Kuramoto, Tokushima 770-8509, Japan
2 shared publications - Ryosei Nakada
Radiation & Proton Therapy Office, Shizuoka Cancer Center, 1007 Shimonagakubo, Nagaizumi 411-8777, Japan
2 shared publications
Latest Publications
- Open Access
- 1 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (11) , 1912
Dynamical System Approach to Linear Inverse Problems Using Mutual Power Divergence
We present a dynamical-system approach to linear inverse problems based on a newly introduced discrepancy measure called the mutual power divergence (MPD). The MPD evaluates the mutual consistency between the measurement and the prediction and serves as a Lyapunov function for constructing a continuous-time dynamical system associated with the inverse problem. The equilibrium points of the system coincide with solutions of the linear model, and their stability is established using Lyapunov theory and LaSalle’s invariance principle. By discretizing the continuous-time dynamics with a multiplicative Euler scheme, we obtain an iterative reconstruction algorithm with multiplicative updates. The resulting iteration constitutes a two-parameter extension of the simultaneous multiplicative algebraic reconstruction technique. Numerical experiments on tomographic reconstruction problems demonstrate that the proposed algorithm achieves improved reconstruction accuracy over existing multiplicative methods.
- 1 June 2026
- Published by MDPI AG in Mathematics
- Vol. 14 (11) , 1912
Open AccessDynamical System Approach to Linear Inverse Problems Using Mutual Power Divergence
We present a dynamical-system approach to linear inverse problems based on a newly introduced discrepancy measure called the mutual power divergence (MPD). The MPD evaluates the mutual consistency between the measurement and the prediction and serves as a Lyapunov function for constructing a continuous-time dynamical system associated with the inverse problem. The equilibrium points of the system coincide with solutions of the linear model, and their stability is established using Lyapunov theory and LaSalle’s invariance principle. By discretizing the continuous-time dynamics with a multiplicative Euler scheme, we obtain an iterative reconstruction algorithm with multiplicative updates. The resulting iteration constitutes a two-parameter extension of the simultaneous multiplicative algebraic reconstruction technique. Numerical experiments on tomographic reconstruction problems demonstrate that the proposed algorithm achieves improved reconstruction accuracy over existing multiplicative methods.
- Open Access
- 2 June 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1852
Variable Dose-Constraints Method Based on Multiplicative Dynamical Systems for High-Precision Intensity-Modulated Radiation Therapy Planning
An optimization framework that effectively balances dose–volume constraints and treatment objectives is required in intensity-modulated radiation therapy (IMRT) planning. In our previous work, we proposed a dynamical systems-based approach in which dose constraints, along with beam coefficients, are treated as state variables and dynamically evolve within a continuous-time system. This method improved the accuracy of the solution by dynamically adjusting the dose constraints, but it had a significant drawback. Specifically, because it is as an iterative process derived from discretization of a linear differential equation system using the additive Euler method, a lower-bound clipping procedure is required to prevent the state variables for both beam coefficients and dose constraints from taking negative values. This issue could prevent constrained optimization from functioning properly and undermine the feasibility of the treatment plan. To address this problem, we propose two types of multiplicative continuous-time dynamical system that inherently preserve the nonnegativity of the state variables. We theoretically prove that the initial value problem for these systems converges to a solution that satisfies the constraints of consistent IMRT planning. Furthermore, to ensure computational practicality, we derive discretized iterative schemes from the continuous-time systems and confirm that their iterations maintain nonnegativity. This framework eliminates the need for artificial clipping procedures and leads to the multiplicative variable dose-constraints method, which dynamically adjusts dose constraints during the optimization process. Finally, numerical experiments are conducted to support and illustrate the theoretical results, showing how the proposed method achieves high-precision IMRT planning while ensuring physically meaningful solutions.
- 2 June 2025
- Published by MDPI AG in Mathematics
- Vol. 13 (11) , 1852
Open AccessVariable Dose-Constraints Method Based on Multiplicative Dynamical Systems for High-Precision Intensity-Modulated Radiation Therapy Planning
An optimization framework that effectively balances dose–volume constraints and treatment objectives is required in intensity-modulated radiation therapy (IMRT) planning. In our previous work, we proposed a dynamical systems-based approach in which dose constraints, along with beam coefficients, are treated as state variables and dynamically evolve within a continuous-time system. This method improved the accuracy of the solution by dynamically adjusting the dose constraints, but it had a significant drawback. Specifically, because it is as an iterative process derived from discretization of a linear differential equation system using the additive Euler method, a lower-bound clipping procedure is required to prevent the state variables for both beam coefficients and dose constraints from taking negative values. This issue could prevent constrained optimization from functioning properly and undermine the feasibility of the treatment plan. To address this problem, we propose two types of multiplicative continuous-time dynamical system that inherently preserve the nonnegativity of the state variables. We theoretically prove that the initial value problem for these systems converges to a solution that satisfies the constraints of consistent IMRT planning. Furthermore, to ensure computational practicality, we derive discretized iterative schemes from the continuous-time systems and confirm that their iterations maintain nonnegativity. This framework eliminates the need for artificial clipping procedures and leads to the multiplicative variable dose-constraints method, which dynamically adjusts dose constraints during the optimization process. Finally, numerical experiments are conducted to support and illustrate the theoretical results, showing how the proposed method achieves high-precision IMRT planning while ensuring physically meaningful solutions.
- Open Access
- 3 December 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (23) , 3826
Variable Dose-Constraints Method for Enhancing Intensity-Modulated Radiation Therapy Treatment Planning
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.
- 3 December 2024
- Published by MDPI AG in Mathematics
- Vol. 12 (23) , 3826
Open AccessVariable Dose-Constraints Method for Enhancing Intensity-Modulated Radiation Therapy Treatment Planning
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.
- Open Access
- 7 November 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (11) , 512
Optimizing Parameters for Enhanced Iterative Image Reconstruction Using Extended Power Divergence
In this paper, we propose a method for optimizing the parameter values in iterative reconstruction algorithms that include adjustable parameters in order to optimize the reconstruction performance. Specifically, we focus on the power divergence-based expectation-maximization algorithm, which includes two power indices as adjustable parameters. Through numerical and physical experiments, we demonstrate that optimizing the evaluation function based on the extended power-divergence and weighted extended power-divergence measures yields high-quality image reconstruction. Notably, the optimal parameter values derived from the proposed method produce reconstruction results comparable to those obtained using the true image, even when using distance functions based on differences between forward projection data and measured projection data, as verified by numerical experiments. These results suggest that the proposed method effectively improves reconstruction quality without the need for machine-learning techniques in parameter selection. Our findings also indicate that this approach is useful for enhancing the performance of iterative reconstruction algorithms, especially in medical imaging, where high-accuracy reconstruction under noisy conditions is required.
- 7 November 2024
- Published by MDPI AG in Algorithms
- Vol. 17 (11) , 512
Open AccessOptimizing Parameters for Enhanced Iterative Image Reconstruction Using Extended Power Divergence
In this paper, we propose a method for optimizing the parameter values in iterative reconstruction algorithms that include adjustable parameters in order to optimize the reconstruction performance. Specifically, we focus on the power divergence-based expectation-maximization algorithm, which includes two power indices as adjustable parameters. Through numerical and physical experiments, we demonstrate that optimizing the evaluation function based on the extended power-divergence and weighted extended power-divergence measures yields high-quality image reconstruction. Notably, the optimal parameter values derived from the proposed method produce reconstruction results comparable to those obtained using the true image, even when using distance functions based on differences between forward projection data and measured projection data, as verified by numerical experiments. These results suggest that the proposed method effectively improves reconstruction quality without the need for machine-learning techniques in parameter selection. Our findings also indicate that this approach is useful for enhancing the performance of iterative reconstruction algorithms, especially in medical imaging, where high-accuracy reconstruction under noisy conditions is required.
- Open Access
- 23 July 2024
- Published by MDPI AG in Journal of Imaging
- Vol. 10 (8) , 178
Iterative Tomographic Image Reconstruction Algorithm Based on Extended Power Divergence by Dynamic Parameter Tuning
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.
- 23 July 2024
- Published by MDPI AG in Journal of Imaging
- Vol. 10 (8) , 178
Open AccessIterative Tomographic Image Reconstruction Algorithm Based on Extended Power Divergence by Dynamic Parameter Tuning
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.
- Open Access
- 16 January 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (1) , 60
Iterative Image Reconstruction Algorithm with Parameter Estimation by Neural Network for Computed Tomography
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.
- 16 January 2023
- Published by MDPI AG in Algorithms
- Vol. 16 (1) , 60
Open AccessIterative Image Reconstruction Algorithm with Parameter Estimation by Neural Network for Computed Tomography
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.
- Open Access
- 15 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (22) , 4277
Image Reconstruction Algorithm Using Weighted Mean of Ordered-Subsets EM and MART for Computed Tomography
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.
- 15 November 2022
- Published by MDPI AG in Mathematics
- Vol. 10 (22) , 4277
Open AccessImage Reconstruction Algorithm Using Weighted Mean of Ordered-Subsets EM and MART for Computed Tomography
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.
- Open Access
Block-Iterative Reconstruction from Dynamically Selected Sparse Projection Views Using Extended Power-Divergence Measure
Iterative reconstruction of density pixel images from measured projections in computed tomography has attracted considerable attention. The ordered-subsets algorithm is an acceleration scheme that uses subsets of projections in a previously decided order. Several methods have been proposed to improve the convergence rate by permuting the order of the projections. However, they do not incorporate object information, such as shape, into the selection process. We propose a block-iterative reconstruction from sparse projection views with the dynamic selection of subsets based on an estimating function constructed by an extended power-divergence measure for decreasing the objective function as much as possible. We give a unified proposition for the inequality related to the difference between objective functions caused by one iteration as the theoretical basis of the proposed optimization strategy. Through the theory and numerical experiments, we show that nonuniform and sparse use of projection views leads to a reconstruction of higher-quality images and that an ordered subset is not the most effective for block-iterative reconstruction. The two-parameter class of extended power-divergence measures is the key to estimating an effective decrease in the objective function and plays a significant role in constructing a robust algorithm against noise.
Open AccessBlock-Iterative Reconstruction from Dynamically Selected Sparse Projection Views Using Extended Power-Divergence Measure
Iterative reconstruction of density pixel images from measured projections in computed tomography has attracted considerable attention. The ordered-subsets algorithm is an acceleration scheme that uses subsets of projections in a previously decided order. Several methods have been proposed to improve the convergence rate by permuting the order of the projections. However, they do not incorporate object information, such as shape, into the selection process. We propose a block-iterative reconstruction from sparse projection views with the dynamic selection of subsets based on an estimating function constructed by an extended power-divergence measure for decreasing the objective function as much as possible. We give a unified proposition for the inequality related to the difference between objective functions caused by one iteration as the theoretical basis of the proposed optimization strategy. Through the theory and numerical experiments, we show that nonuniform and sparse use of projection views leads to a reconstruction of higher-quality images and that an ordered subset is not the most effective for block-iterative reconstruction. The two-parameter class of extended power-divergence measures is the key to estimating an effective decrease in the objective function and plays a significant role in constructing a robust algorithm against noise.
- Open Access
Noise-Robust Image Reconstruction Based on Minimizing Extended Class of Power-Divergence Measures
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.
Open AccessNoise-Robust Image Reconstruction Based on Minimizing Extended Class of Power-Divergence Measures
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.
- Open Access
- 17 July 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-9
Tomographic Image Reconstruction Based on Minimization of Symmetrized Kullback-Leibler Divergence
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.- 17 July 2018
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2018, 1-9
Open AccessTomographic Image Reconstruction Based on Minimization of Symmetrized Kullback-Leibler Divergence
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.