Yusaku Yamaguchi
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
Yusaku Yamaguchi has a total of 12 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
12 shared publications - Omar M. Abou Al-Ola
Faculty of Science, Tanta University, El-Giesh St., Tanta 31527, Egypt
7 shared publications - Takeshi Kojima
Institute of Biomedical Sciences, Tokushima University, 3-18-15 Kuramoto, Tokushima 770-8509, Japan
6 shared publications - Ryosuke Kasai
Institute of Biomedical Sciences, Tokushima University, 3-18-15 Kuramoto, Tokushima 770-8509, Japan
3 shared publications Kiyoko Tateishi
Graduate School of Health Sciences, Tokushima University, 3-18-15 Kuramoto, Tokushima 770-8509, Japan
2 shared publicationsOmar M. Abou Al-Ola
Tanta Univ. (Egypt)
2 shared publications
Latest Publications
- 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
- 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
- 1 January 2019
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2019 (1)
Tomographic Inverse Problem with Estimating Missing Projections
Image reconstruction in computed tomography can be treated as an inverse problem, namely, obtaining pixel values of a tomographic image from measured projections. However, a seriously degraded image with artifacts is produced when a certain part of the projections is inaccurate or missing. A novel method for simultaneously obtaining a reconstructed image and an estimated projection by solving an initial‐value problem of differential equations is proposed. A system of differential equations is constructed on the basis of optimizing a cost function of unknown variables for an image and a projection. Three systems described by nonlinear differential equations are constructed, and the stability of a set of equilibria corresponding to an optimized solution for each system is proved by using the Lyapunov stability theorem. To validate the theoretical result given by the proposed method, metal artifact reduction was numerically performed.
- 1 January 2019
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2019 (1)
Open AccessTomographic Inverse Problem with Estimating Missing Projections
Image reconstruction in computed tomography can be treated as an inverse problem, namely, obtaining pixel values of a tomographic image from measured projections. However, a seriously degraded image with artifacts is produced when a certain part of the projections is inaccurate or missing. A novel method for simultaneously obtaining a reconstructed image and an estimated projection by solving an initial‐value problem of differential equations is proposed. A system of differential equations is constructed on the basis of optimizing a cost function of unknown variables for an image and a projection. Three systems described by nonlinear differential equations are constructed, and the stability of a set of equilibria corresponding to an optimized solution for each system is proved by using the Lyapunov stability theorem. To validate the theoretical result given by the proposed method, metal artifact reduction was numerically performed.
- 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. - Open Access
- 1 January 2017
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
Continuous Analog of Accelerated OS‐EM Algorithm for Computed Tomography
The maximum‐likelihood expectation‐maximization (ML‐EM) algorithm is used for an iterative image reconstruction (IIR) method and performs well with respect to the inverse problem as cross‐entropy minimization in computed tomography. For accelerating the convergence rate of the ML‐EM, the ordered‐subsets expectation‐maximization (OS‐EM) with a power factor is effective. In this paper, we propose a continuous analog to the power‐based accelerated OS‐EM algorithm. The continuous‐time image reconstruction (CIR) system is described by nonlinear differential equations with piecewise smooth vector fields by a cyclic switching process. A numerical discretization of the differential equation by using the geometric multiplicative first‐order expansion of the nonlinear vector field leads to an exact equivalent iterative formula of the power‐based OS‐EM. The convergence of nonnegatively constrained solutions to a globally stable equilibrium is guaranteed by the Lyapunov theorem for consistent inverse problems. We illustrate through numerical experiments that the convergence characteristics of the continuous system have the highest quality compared with that of discretization methods. We clarify how important the discretization method approximates the solution of the CIR to design a better IIR method.
- 1 January 2017
- Published by Wiley in Mathematical Problems in Engineering
- Vol. 2017 (1)
Open AccessContinuous Analog of Accelerated OS‐EM Algorithm for Computed Tomography
The maximum‐likelihood expectation‐maximization (ML‐EM) algorithm is used for an iterative image reconstruction (IIR) method and performs well with respect to the inverse problem as cross‐entropy minimization in computed tomography. For accelerating the convergence rate of the ML‐EM, the ordered‐subsets expectation‐maximization (OS‐EM) with a power factor is effective. In this paper, we propose a continuous analog to the power‐based accelerated OS‐EM algorithm. The continuous‐time image reconstruction (CIR) system is described by nonlinear differential equations with piecewise smooth vector fields by a cyclic switching process. A numerical discretization of the differential equation by using the geometric multiplicative first‐order expansion of the nonlinear vector field leads to an exact equivalent iterative formula of the power‐based OS‐EM. The convergence of nonnegatively constrained solutions to a globally stable equilibrium is guaranteed by the Lyapunov theorem for consistent inverse problems. We illustrate through numerical experiments that the convergence characteristics of the continuous system have the highest quality compared with that of discretization methods. We clarify how important the discretization method approximates the solution of the CIR to design a better IIR method.
- 30 March 2016
- Published by SPIE-Intl Soc Optical Eng
- Vol. 9783, 97834T-97834T-7
Noise reduction in computed tomography using a multiplicative continuous-time image reconstruction method
- 30 March 2016
- Published by SPIE-Intl Soc Optical Eng
- Vol. 9783, 97834T-97834T-7
Noise reduction in computed tomography using a multiplicative continuous-time image reconstruction method
- 30 March 2016
- Published by SPIE-Intl Soc Optical Eng
- Vol. 9783, 97834Q-97834Q-8
Continuous analog of multiplicative algebraic reconstruction technique for computed tomography
- 30 March 2016
- Published by SPIE-Intl Soc Optical Eng
- Vol. 9783, 97834Q-97834Q-8
Continuous analog of multiplicative algebraic reconstruction technique for computed tomography