Rongfang Gong
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Rongfang Gong has a total of 38 co-authors. Here are the top co-authors by number of shared publications:
- Ye Zhang
MSU-BIT-SMBU Joint Research Center of Applied Mathematics, Shenzhen MSU-BIT University, Shenzhen, China
7 shared publications - Xiaoliang Cheng
School of Mathematical Sciences, Zhejiang University, Hangzhou, China
4 shared publications W. Han
Department of Mathematics, University of Iowa, Iowa City, IA, USA
3 shared publicationsX. L. Cheng
Department of Mathematics, Zhejiang University, Hangzhou, Zhejiang, People's Republic of China
3 shared publicationsXiaoliang Cheng
Zhejiang University
3 shared publications- Catharine Wing Kwan Lo
School of Mathematical Sciences, Shenzhen University
2 shared publications
Latest Publications
- 11 November 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (11) , 115006
A two-step approach for recovering both time and space dependent Robin coefficients in parabolic systems
This study addresses an inverse Robin problem for parabolic partial differential equations, aiming to identify an unknown space-time dependent Robin coefficient on an inaccessible boundary from Cauchy data measured on an accessible boundary. Such a problem arises in many applications but is inherently ill-posed due to instability and nonlinear dependence of the solution on the data. To overcome these difficulties, a two-step solution strategy is proposed that transforms the nonlinear inverse problem into a sequence of well-posed problems. In the first step, the problem is reduced to a linear parabolic Cauchy problem and is solved using a coupled complex boundary method with a complex Robin condition, allowing Dirichlet and Neumann data to be incorporated simultaneously and stably. Space-time Tikhonov regularization is employed to ensure well-posedness. In the second step, the recovered boundary data are used to reconstruct the Robin coefficient by applying Newton’s method combined with Lavrentiev regularization. The proposed approach is supported by theoretical results, including convergence, stability, error estimates, and uniform boundedness. Numerical experiments demonstrate accurate reconstruction of smooth, discontinuous, and time-dependent Robin coefficients under various noise levels ranging from 0.1% to 5%. The results validate the theoretical convergence rates and demonstrate the method’s robustness in handling complex three-dimensional geometries. Overall, the proposed framework provides a stable and robust tool for inverse Robin problems arising in engineering, physics, and environmental applications.
- 11 November 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (11) , 115006
A two-step approach for recovering both time and space dependent Robin coefficients in parabolic systems
This study addresses an inverse Robin problem for parabolic partial differential equations, aiming to identify an unknown space-time dependent Robin coefficient on an inaccessible boundary from Cauchy data measured on an accessible boundary. Such a problem arises in many applications but is inherently ill-posed due to instability and nonlinear dependence of the solution on the data. To overcome these difficulties, a two-step solution strategy is proposed that transforms the nonlinear inverse problem into a sequence of well-posed problems. In the first step, the problem is reduced to a linear parabolic Cauchy problem and is solved using a coupled complex boundary method with a complex Robin condition, allowing Dirichlet and Neumann data to be incorporated simultaneously and stably. Space-time Tikhonov regularization is employed to ensure well-posedness. In the second step, the recovered boundary data are used to reconstruct the Robin coefficient by applying Newton’s method combined with Lavrentiev regularization. The proposed approach is supported by theoretical results, including convergence, stability, error estimates, and uniform boundedness. Numerical experiments demonstrate accurate reconstruction of smooth, discontinuous, and time-dependent Robin coefficients under various noise levels ranging from 0.1% to 5%. The results validate the theoretical convergence rates and demonstrate the method’s robustness in handling complex three-dimensional geometries. Overall, the proposed framework provides a stable and robust tool for inverse Robin problems arising in engineering, physics, and environmental applications.
- 19 March 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (3) , 035008
Bioluminescence tomography via a shape optimization method based on a complex-valued model
In this study, we investigate the inverse source problem arising in bioluminescence tomography, the objective of which is to reconstruct both the support and the intensity of an internal light source from boundary measurements governed by an elliptic model. A shape optimization framework is developed in which the source intensity and its support are decoupled through first-order optimality conditions. To enhance the stability of the reconstruction, we incorporate a parameter-dependent coupled complex boundary method together with perimeter and volume regularizations. Source support is represented by a level set function, allowing the algorithm to naturally accommodate topological changes and recover multiple, closely spaced, or nested source regions. Theoretical justifications for the proposed formulation and regularization strategy are established, and extensive numerical experiments are performed to assess the reconstruction accuracy for both noise-free and noisy data. The results demonstrate that our method achieves robust and accurate recovery of source geometry and intensity, exhibits clear advantages over existing approaches.
- 19 March 2026
- Published by IOP Publishing in Inverse Problems
- Vol. 42 (3) , 035008
Bioluminescence tomography via a shape optimization method based on a complex-valued model
In this study, we investigate the inverse source problem arising in bioluminescence tomography, the objective of which is to reconstruct both the support and the intensity of an internal light source from boundary measurements governed by an elliptic model. A shape optimization framework is developed in which the source intensity and its support are decoupled through first-order optimality conditions. To enhance the stability of the reconstruction, we incorporate a parameter-dependent coupled complex boundary method together with perimeter and volume regularizations. Source support is represented by a level set function, allowing the algorithm to naturally accommodate topological changes and recover multiple, closely spaced, or nested source regions. Theoretical justifications for the proposed formulation and regularization strategy are established, and extensive numerical experiments are performed to assess the reconstruction accuracy for both noise-free and noisy data. The results demonstrate that our method achieves robust and accurate recovery of source geometry and intensity, exhibits clear advantages over existing approaches.
- 27 October 2025
- Published by IOP Publishing in Biomedical Physics & Engineering Express
- Vol. 11 (6) , 065022
Segmentation of glioma sub-regions based on EnnUnet in tumor treating fields
Accurate segmentation of glioblastoma (GBM), including the whole tumor (WT), tumor core (TC), and enhancing tumor (ET), from multi-modal magnetic resonance images (MRI) is essential for precise Tumor Treating Fields (TTFields) simulation. This study aims to address the challenges of this segmentation task to improve the accuracy of TTFields simulation results. We propose enhanced nnUnet (EnnUnet), a novel framework for multi-modal MRI segmentation that enhances the robust and widely-used nnUnet architecture. This advanced architecture integrates three key innovations: (1) Generalized Multi-kernel Convolution blocks are incorporated to capture multi-scale features and long-range dependencies. (2) A dual attention mechanism is employed at skip connections to refine feature fusion. (3) A novel boundary and Top-K loss is implemented for boundary-based refinement and to focus the training process on hard-to-segment pixels. The effectiveness of each enhancement was systematically evaluated through an ablation study on the BraTS 2023 dataset. The final EnnUnet model achieved superior performance, with average Dice scores of 93.52%, 92.07%, and 87.60% for the WT, TC, and ET, respectively, consistently outperforming other state-of-the-art methods. Furthermore, TTFields simulations on real patient data demonstrated that our precise segmentations yield more realistic electric field distributions compared to simplified homogeneous tumor models. The proposed EnnUnet architecture showcases promising potential for highly accurate and robust glioma segmentation. It offers a more reliable foundation for computational modeling, which is essential for enhancing the precision of TTFields treatment planning and advancing personalized therapeutic strategies for GBM patients.
- 27 October 2025
- Published by IOP Publishing in Biomedical Physics & Engineering Express
- Vol. 11 (6) , 065022
Segmentation of glioma sub-regions based on EnnUnet in tumor treating fields
Accurate segmentation of glioblastoma (GBM), including the whole tumor (WT), tumor core (TC), and enhancing tumor (ET), from multi-modal magnetic resonance images (MRI) is essential for precise Tumor Treating Fields (TTFields) simulation. This study aims to address the challenges of this segmentation task to improve the accuracy of TTFields simulation results. We propose enhanced nnUnet (EnnUnet), a novel framework for multi-modal MRI segmentation that enhances the robust and widely-used nnUnet architecture. This advanced architecture integrates three key innovations: (1) Generalized Multi-kernel Convolution blocks are incorporated to capture multi-scale features and long-range dependencies. (2) A dual attention mechanism is employed at skip connections to refine feature fusion. (3) A novel boundary and Top-K loss is implemented for boundary-based refinement and to focus the training process on hard-to-segment pixels. The effectiveness of each enhancement was systematically evaluated through an ablation study on the BraTS 2023 dataset. The final EnnUnet model achieved superior performance, with average Dice scores of 93.52%, 92.07%, and 87.60% for the WT, TC, and ET, respectively, consistently outperforming other state-of-the-art methods. Furthermore, TTFields simulations on real patient data demonstrated that our precise segmentations yield more realistic electric field distributions compared to simplified homogeneous tumor models. The proposed EnnUnet architecture showcases promising potential for highly accurate and robust glioma segmentation. It offers a more reliable foundation for computational modeling, which is essential for enhancing the precision of TTFields treatment planning and advancing personalized therapeutic strategies for GBM patients.
- Open Access
- 28 November 2024
- Published by IOP Publishing in Inverse Problems
- Vol. 40 (12) , 125022
Determining sources in the bioluminescence tomography problem
In this paper, we revisit the bioluminescence tomography (BLT) problem, where one seeks to reconstruct bioluminescence signals (an internal light source) from external measurements of the Cauchy data. As one kind of optical imaging, the BLT has many merits such as high signal-to-noise ratio, non-destructivity and cost-effectiveness etc and has potential applications such as cancer diagnosis, drug discovery and development as well as gene therapies and so on. In the literature, BLT is extensively studied based on diffusion approximation equation, where the distribution of peak sources is to be reconstructed and no solution uniqueness is guaranteed without adequate a priori information. Motivated by the solution uniqueness issue, several theoretical results are explored. The major contributions in this work that are new to the literature are two-fold: first, we show the theoretical uniqueness of the BLT problem where the light sources are in the shape of C 2 domains or polyhedral- or corona-shaped; second, we support our results with plenty of problem-orientated numerical experiments.
- 28 November 2024
- Published by IOP Publishing in Inverse Problems
- Vol. 40 (12) , 125022
Open AccessDetermining sources in the bioluminescence tomography problem
In this paper, we revisit the bioluminescence tomography (BLT) problem, where one seeks to reconstruct bioluminescence signals (an internal light source) from external measurements of the Cauchy data. As one kind of optical imaging, the BLT has many merits such as high signal-to-noise ratio, non-destructivity and cost-effectiveness etc and has potential applications such as cancer diagnosis, drug discovery and development as well as gene therapies and so on. In the literature, BLT is extensively studied based on diffusion approximation equation, where the distribution of peak sources is to be reconstructed and no solution uniqueness is guaranteed without adequate a priori information. Motivated by the solution uniqueness issue, several theoretical results are explored. The major contributions in this work that are new to the literature are two-fold: first, we show the theoretical uniqueness of the BLT problem where the light sources are in the shape of C 2 domains or polyhedral- or corona-shaped; second, we support our results with plenty of problem-orientated numerical experiments.
- 24 May 2024
- Published by IOP Publishing in Inverse Problems
- Vol. 40 (7) , 075002
Uniqueness and numerical inversion in bioluminescence tomography with time-dependent boundary measurement
In the paper, an inverse source problem in bioluminescence tomography (BLT) is investigated. BLT is a method of light imaging and offers many advantages such as sensitivity, cost-effectiveness, high signal-to-noise ratio and non-destructivity. It thus has promising prospects for many applications such as cancer diagnosis, drug discovery and development as well as gene therapies. In the literature, BLT is extensively studied based on the (stationary) diffusion approximation (DA) equation, where the distribution of peak sources is reconstructed and no solution uniqueness is guaranteed without proper a priori information. In this work, motivated by solution uniqueness, a novel dynamic coupled DA model is proposed. Theoretical analysis including the well-posedness of the forward problem and the solution uniqueness of the inverse problem are given. Based on the new model, iterative inversion algorithms under the framework of regularizing schemes are introduced and applied to reconstruct the smooth and non-smooth sources. We discretize the regularization functional with the finite element method and give the convergence rate of numerical solutions. Several numerical examples are implemented to validate the effectiveness of the new model and the proposed algorithms.
- 24 May 2024
- Published by IOP Publishing in Inverse Problems
- Vol. 40 (7) , 075002
Uniqueness and numerical inversion in bioluminescence tomography with time-dependent boundary measurement
In the paper, an inverse source problem in bioluminescence tomography (BLT) is investigated. BLT is a method of light imaging and offers many advantages such as sensitivity, cost-effectiveness, high signal-to-noise ratio and non-destructivity. It thus has promising prospects for many applications such as cancer diagnosis, drug discovery and development as well as gene therapies. In the literature, BLT is extensively studied based on the (stationary) diffusion approximation (DA) equation, where the distribution of peak sources is reconstructed and no solution uniqueness is guaranteed without proper a priori information. In this work, motivated by solution uniqueness, a novel dynamic coupled DA model is proposed. Theoretical analysis including the well-posedness of the forward problem and the solution uniqueness of the inverse problem are given. Based on the new model, iterative inversion algorithms under the framework of regularizing schemes are introduced and applied to reconstruct the smooth and non-smooth sources. We discretize the regularization functional with the finite element method and give the convergence rate of numerical solutions. Several numerical examples are implemented to validate the effectiveness of the new model and the proposed algorithms.
- 7 March 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 473
A new second-order dynamical method for solving linear inverse problems in Hilbert spaces
- 7 March 2024
- Published by Elsevier in Applied Mathematics and Computation
- Vol. 473
A new second-order dynamical method for solving linear inverse problems in Hilbert spaces
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Communications on Analysis and Computation
- Vol. 2 (2) , 159-179
Tumor Treating Fields: Modeling and a numerical algorithm
This paper investigates the optimal control problem generated in Tumor Treating Fields (TTFields). TTFields is an emerging cancer treatment method with several advantages including the convenience of treatment, fewer side effects, and a better quality of life for patients. Therefore, it holds significant promise for applications in cancer treatments and other fields. In view of such an immense potential, in this work, we are motivated to determine the optimal arrangement of electrodes for TTFields. The paper begins by presenting a comprehensive modeling process for TTFields, followed by the establishment of an optimal control problem that involves finding the optimal configuration of the electrode array. To solve this problem, the particle swarm optimization (PSO) algorithm, which is a type of intelligent algorithm, is employed, and is further improved on to address various situations. Finally, the model is validated and the effectiveness of the PSO algorithm is verified through numerical examples.
- 1 January 2024
- Published by American Institute of Mathematical Sciences (AIMS) in Communications on Analysis and Computation
- Vol. 2 (2) , 159-179
Tumor Treating Fields: Modeling and a numerical algorithm
This paper investigates the optimal control problem generated in Tumor Treating Fields (TTFields). TTFields is an emerging cancer treatment method with several advantages including the convenience of treatment, fewer side effects, and a better quality of life for patients. Therefore, it holds significant promise for applications in cancer treatments and other fields. In view of such an immense potential, in this work, we are motivated to determine the optimal arrangement of electrodes for TTFields. The paper begins by presenting a comprehensive modeling process for TTFields, followed by the establishment of an optimal control problem that involves finding the optimal configuration of the electrode array. To solve this problem, the particle swarm optimization (PSO) algorithm, which is a type of intelligent algorithm, is employed, and is further improved on to address various situations. Finally, the model is validated and the effectiveness of the PSO algorithm is verified through numerical examples.
- Open Access
A CCBM-based generalized GKB iterative regularization algorithm for inverse Cauchy problems
This paper examines inverse Cauchy problems that are governed by a kind of elliptic partial differential equation. The inverse problems involve recovering the missing data on an inaccessible boundary from the measured data on an accessible boundary, which is severely ill-posed. By using the coupled complex boundary method (CCBM), which integrates both Dirichlet and Neumann data into a single Robin boundary condition, we reformulate the underlying problem into an operator equation. Based on this new formulation, we study the solution existence issue of the reduced problem with noisy data. A Golub-Kahan bidiagonalization (GKB) process together with Givens rotation is employed for iteratively solving the proposed operator equation. The regularizing property of the developed method, called CCBM-GKB, and its convergence rate results are proved under a posteriori stopping rule. Finally, a linear finite element method is used for the numerical realization of CCBM-GKB. Various numerical experiments demonstrate that CCBM-GKB is a kind of accelerated iterative regularization method, as it is much faster than the classic Landweber method.
Open AccessA CCBM-based generalized GKB iterative regularization algorithm for inverse Cauchy problems
This paper examines inverse Cauchy problems that are governed by a kind of elliptic partial differential equation. The inverse problems involve recovering the missing data on an inaccessible boundary from the measured data on an accessible boundary, which is severely ill-posed. By using the coupled complex boundary method (CCBM), which integrates both Dirichlet and Neumann data into a single Robin boundary condition, we reformulate the underlying problem into an operator equation. Based on this new formulation, we study the solution existence issue of the reduced problem with noisy data. A Golub-Kahan bidiagonalization (GKB) process together with Givens rotation is employed for iteratively solving the proposed operator equation. The regularizing property of the developed method, called CCBM-GKB, and its convergence rate results are proved under a posteriori stopping rule. Finally, a linear finite element method is used for the numerical realization of CCBM-GKB. Various numerical experiments demonstrate that CCBM-GKB is a kind of accelerated iterative regularization method, as it is much faster than the classic Landweber method.
- 1 September 2020
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 375
Second order asymptotical regularization methods for inverse problems in partial differential equations
- 1 September 2020
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 375
Second order asymptotical regularization methods for inverse problems in partial differential equations
- 30 April 2020
- Published by IOP Publishing in Inverse Problems
- Vol. 36 (5) , 055013
A new class of accelerated regularization methods, with application to bioluminescence tomography
In this paper we propose a new class of iterative regularization methods for solving ill-posed linear operator equations. The prototype of these iterative regularization methods is in the form of second order evolution equation with a linear vanishing damping term, which can be viewed not only as an extension of the asymptotical regularization, but also as a continuous analog of the Nesterov’s acceleration scheme. New iterative regularization methods are derived from this continuous model in combination with appropriate numerical discretization schemes such as damped symplectic methods. The regularization property as well as convergence rates and acceleration effects under the Hölder-type source conditions of both continuous and discretized methods are proven. The second part of this paper is concerned with the application of the newly developed accelerated iterative regularization methods to the diffusion-based bioluminescence tomography, which is modeled as an inverse source problem in elliptic partial differential equations with both Dirichlet and Neumann boundary data. A novel mathematical formulation is proposed so that the discrepancy principle can be applied to stop the iteration procedure without the usage of Sobolev embedding constants. Several numerical examples, as well as acomparison with the state-of-the-art methods, are given to show the accuracy and the acceleration effect of the new methods.
- 30 April 2020
- Published by IOP Publishing in Inverse Problems
- Vol. 36 (5) , 055013
A new class of accelerated regularization methods, with application to bioluminescence tomography
In this paper we propose a new class of iterative regularization methods for solving ill-posed linear operator equations. The prototype of these iterative regularization methods is in the form of second order evolution equation with a linear vanishing damping term, which can be viewed not only as an extension of the asymptotical regularization, but also as a continuous analog of the Nesterov’s acceleration scheme. New iterative regularization methods are derived from this continuous model in combination with appropriate numerical discretization schemes such as damped symplectic methods. The regularization property as well as convergence rates and acceleration effects under the Hölder-type source conditions of both continuous and discretized methods are proven. The second part of this paper is concerned with the application of the newly developed accelerated iterative regularization methods to the diffusion-based bioluminescence tomography, which is modeled as an inverse source problem in elliptic partial differential equations with both Dirichlet and Neumann boundary data. A novel mathematical formulation is proposed so that the discrepancy principle can be applied to stop the iteration procedure without the usage of Sobolev embedding constants. Several numerical examples, as well as acomparison with the state-of-the-art methods, are given to show the accuracy and the acceleration effect of the new methods.