Ziyang Yuan
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
Ziyang Yuan has a total of 51 co-authors. Here are the top co-authors by number of shared publications:
- Hongxia Wang
College of Science, National University of Defense Technology, Changsha, China
11 shared publications Hongxia Wang
College of Science, National University of Defense Technology, Changsha, China
5 shared publications- Hui Zhang
Department of Mathematics, National University of Defense Technology, Changsha, China
3 shared publications Bo Chen
Suzhou Research Center, Institute of Automation, Chinese Academy of Sciences, Suzhou, China
2 shared publications- Lu Zhang
College of Science, National University of Defense Technology, Changsha, China
2 shared publications - Shuchang Zhang
Department of Mathematics National University of Defense Technology
2 shared publications
Latest Publications
- 4 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Imaging
- Vol. 12 (25730436) , 673-688
Net-BDR: Untrained Neural Networks Embedded Background Douglas Rachford Method for Fourier Phase Retrieval
Fourier phase retrieval (FPR) is a fundamental yet severely ill-posed inverse problem in physical optics. Although the Background Douglas Rachford (BDR) method alleviates ill-posedness by incorporating background information as a structural prior, its robustness degrades substantially under intense noise. To achieve robustness to strong noise and reduce the background information requirements, we introduce an implicit signal prior by reparameterizing the target signal through an untrained neural network (UNN). By doing so, we propose Net-BDR, an algorithm that integrates the UNN's implicit prior with the background's structural prior. This approach requires no pre-training and implicitly regularizes the solution space through the UNN's architecture. Specifically, Net-BDR employs an adaptive weighting strategy to embed the UNN into the BDR framework, dynamically balancing these dual priors while significantly enhancing computational efficiency. Furthermore, we theoretically prove that both Net-BDR and Adaptive Net-BDR converge to a stationary point of the objective function. Experiments demonstrate that Adaptive Net-BDR not only improves the reconstruction quality by at least 2-3 dB in PSNR under intense noise but also reduces the dependency on background information.
- 4 March 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computational Imaging
- Vol. 12 (25730436) , 673-688
Net-BDR: Untrained Neural Networks Embedded Background Douglas Rachford Method for Fourier Phase Retrieval
Fourier phase retrieval (FPR) is a fundamental yet severely ill-posed inverse problem in physical optics. Although the Background Douglas Rachford (BDR) method alleviates ill-posedness by incorporating background information as a structural prior, its robustness degrades substantially under intense noise. To achieve robustness to strong noise and reduce the background information requirements, we introduce an implicit signal prior by reparameterizing the target signal through an untrained neural network (UNN). By doing so, we propose Net-BDR, an algorithm that integrates the UNN's implicit prior with the background's structural prior. This approach requires no pre-training and implicitly regularizes the solution space through the UNN's architecture. Specifically, Net-BDR employs an adaptive weighting strategy to embed the UNN into the BDR framework, dynamically balancing these dual priors while significantly enhancing computational efficiency. Furthermore, we theoretically prove that both Net-BDR and Adaptive Net-BDR converge to a stationary point of the objective function. Experiments demonstrate that Adaptive Net-BDR not only improves the reconstruction quality by at least 2-3 dB in PSNR under intense noise but also reduces the dependency on background information.
- Open Access
- 31 March 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-10
Nuclear phase retrieval spectroscopy using resonant x-ray scattering
Light-matter interaction is exploited in spectroscopic techniques to access information about molecular, atomic or nuclear constituents of a sample. While scattered light carries both amplitude and phase information of the electromagnetic field, the latter is lost in intensity measurements. However, often the phase information is paramount to reconstruct the desired information of the target, as it is well known from coherent x-ray imaging. Here we introduce a phase retrieval method which allows us to reconstruct the field phase information from two-dimensional time- and energy-resolved spectra. We apply this method to the case of x-ray scattering off Mössbauer nuclei at a synchrotron radiation source. Knowledge of the phase allows also for the reconstruction of energy spectra from two-dimensional experimental data sets with excellent precision, without theoretical modelling of the sample. Our approach provides an efficient and accurate data analysis tool which will benefit x-ray quantum optics and Mössbauer spectroscopy with synchrotron radiation alike.
- 31 March 2025
- Published by Springer Nature in Nature Communications
- Vol. 16 (1) , 1-10
Open AccessNuclear phase retrieval spectroscopy using resonant x-ray scattering
Light-matter interaction is exploited in spectroscopic techniques to access information about molecular, atomic or nuclear constituents of a sample. While scattered light carries both amplitude and phase information of the electromagnetic field, the latter is lost in intensity measurements. However, often the phase information is paramount to reconstruct the desired information of the target, as it is well known from coherent x-ray imaging. Here we introduce a phase retrieval method which allows us to reconstruct the field phase information from two-dimensional time- and energy-resolved spectra. We apply this method to the case of x-ray scattering off Mössbauer nuclei at a synchrotron radiation source. Knowledge of the phase allows also for the reconstruction of energy spectra from two-dimensional experimental data sets with excellent precision, without theoretical modelling of the sample. Our approach provides an efficient and accurate data analysis tool which will benefit x-ray quantum optics and Mössbauer spectroscopy with synchrotron radiation alike.
- 26 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (10) , 7498-7520
Phase Retrieval With Background Information: Decreased References and Efficient Methods
Fourier phase retrieval (PR) is a severely ill-posed inverse problem that arises in various applications. To guarantee a unique solution and relieve the dependence on the initialization, background information can be exploited as a structural prior [1]. However, the requirement for the background information may be challenging when moving to high-resolution imaging. At the same time, the previously proposed projected gradient descent (PGD) method also demands much background information. In this paper, we present an improved theoretical result about the demand for the background information, along with two Douglas Rachford (DR) based methods. Analytically, we demonstrate that the background information required to ensure a unique solution can be decreased by nearly 1/2 for the 2-D signals compared to the 1-D signals. By generalizing the results into d -dimension, we show that the length of the background information more than (2 d +1/ d -1) folds of the signal is sufficient to ensure uniqueness. At the same time, we also analyze the stability and robustness of the model when the measurements and background information are corrupted by noise. Furthermore, two methods called Background Douglas Rachford (BDR) and Convex Background Douglas Rachford (CBDR) are proposed. BDR, which is a kind of non-convex method, is proven to have the local R-linear convergence rate under mild assumptions. Instead, the CBDR method uses the techniques of convexification and can be proven to have a global convergence guarantee as long as the background information is sufficient. To support this, a new property called F-RIP is established. We test the performance of the proposed methods through simulations as well as real experimental measurements, and demonstrate that they achieve a higher recovery rate with less background information compared to the PGD method.
- 26 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 70 (10) , 7498-7520
Phase Retrieval With Background Information: Decreased References and Efficient Methods
Fourier phase retrieval (PR) is a severely ill-posed inverse problem that arises in various applications. To guarantee a unique solution and relieve the dependence on the initialization, background information can be exploited as a structural prior [1]. However, the requirement for the background information may be challenging when moving to high-resolution imaging. At the same time, the previously proposed projected gradient descent (PGD) method also demands much background information. In this paper, we present an improved theoretical result about the demand for the background information, along with two Douglas Rachford (DR) based methods. Analytically, we demonstrate that the background information required to ensure a unique solution can be decreased by nearly 1/2 for the 2-D signals compared to the 1-D signals. By generalizing the results into d -dimension, we show that the length of the background information more than (2 d +1/ d -1) folds of the signal is sufficient to ensure uniqueness. At the same time, we also analyze the stability and robustness of the model when the measurements and background information are corrupted by noise. Furthermore, two methods called Background Douglas Rachford (BDR) and Convex Background Douglas Rachford (CBDR) are proposed. BDR, which is a kind of non-convex method, is proven to have the local R-linear convergence rate under mild assumptions. Instead, the CBDR method uses the techniques of convexification and can be proven to have a global convergence guarantee as long as the background information is sufficient. To support this, a new property called F-RIP is established. We test the performance of the proposed methods through simulations as well as real experimental measurements, and demonstrate that they achieve a higher recovery rate with less background information compared to the PGD method.
- 21 April 2024
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 250, 108178
VENet: Variational energy network for gland segmentation of pathological images and early gastric cancer diagnosis of whole slide images
- 21 April 2024
- Published by Elsevier in Computer Methods and Programs in Biomedicine
- Vol. 250, 108178
VENet: Variational energy network for gland segmentation of pathological images and early gastric cancer diagnosis of whole slide images
- Open Access
- 28 December 2023
- Vol. 4 (4) , 280-290
Fabrication of magnesium-doped porous polylactic acid microsphere for bone regeneration
Biodegradable polymer microspheres that can be used as drug carriers are of great importance in biomedical applications, however, there are still challenges in controllable preparation of microsphere surface morphology and improvement of bioactivity. In this paper, firstly, poly(L-lactic acid) (PLLA) was synthesised by ring-opening polymerisation under anhydrous anaerobic conditions and further combined with the emulsion method, biodegradable PLLA microspheres (PM) with sizes ranging from 60–100 μm and with good sphericity were prepared. In addition, to further improve the surface morphology of PLLA microspheres and enhance their bioactivity, functionalised porous PLLA microspheres loaded with magnesium oxide (MgO)/magnesium carbonate (MgCO3) (PMg) were also prepared by the emulsion method. The results showed that the loading of MgO/MgCO3 resulted in the formation of a porous structure on the surface of the microspheres (PMg) and the dissolved Mg2+ could be released slowly during the degradation of microspheres. In vitro cellular experiments demonstrated the good biocompatibility of PM and PMg, while the released Mg2+ further enhanced the anti-inflammatory effect and osteogenic activity of PMg. Functionalised PMg not only show promise for controlled preparation of drug carriers, but also have translational potential for bone regeneration.
- 28 December 2023
- Vol. 4 (4) , 280-290
Open AccessFabrication of magnesium-doped porous polylactic acid microsphere for bone regeneration
Biodegradable polymer microspheres that can be used as drug carriers are of great importance in biomedical applications, however, there are still challenges in controllable preparation of microsphere surface morphology and improvement of bioactivity. In this paper, firstly, poly(L-lactic acid) (PLLA) was synthesised by ring-opening polymerisation under anhydrous anaerobic conditions and further combined with the emulsion method, biodegradable PLLA microspheres (PM) with sizes ranging from 60–100 μm and with good sphericity were prepared. In addition, to further improve the surface morphology of PLLA microspheres and enhance their bioactivity, functionalised porous PLLA microspheres loaded with magnesium oxide (MgO)/magnesium carbonate (MgCO3) (PMg) were also prepared by the emulsion method. The results showed that the loading of MgO/MgCO3 resulted in the formation of a porous structure on the surface of the microspheres (PMg) and the dissolved Mg2+ could be released slowly during the degradation of microspheres. In vitro cellular experiments demonstrated the good biocompatibility of PM and PMg, while the released Mg2+ further enhanced the anti-inflammatory effect and osteogenic activity of PMg. Functionalised PMg not only show promise for controlled preparation of drug carriers, but also have translational potential for bone regeneration.
- Open Access
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2437-2447
Make Encoder Great Again in 3D GAN Inversion through Geometry and Occlusion-Aware Encoding
3D GAN inversion aims to achieve high reconstruction fidelity and reasonable 3D geometry simultaneously from a single image input. However, existing 3D GAN inversion methods rely on time-consuming optimization for each individual case. In this work, we introduce a novel encoder-based inversion framework based on EG3D, one of the most widely-used 3D GAN models. We leverage the inherent properties of EG3D’s latent space to design a discriminator and a background depth regularization. This enables us to train a geometry-aware encoder capable of converting the input image into corresponding latent code. Additionally, we explore the feature space of EG3D and develop an adaptive refinement stage that improves the representation ability of features in EG3D to enhance the recovery of fine-grained textural details. Finally, we propose an occlusion-aware fusion operation to prevent distortion in unobserved regions. Our method achieves impressive results comparable to optimization-based methods while operating up to 500 times faster. Our framework is well-suited for applications such as semantic editing.
- 1 October 2023
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 2437-2447
Open AccessMake Encoder Great Again in 3D GAN Inversion through Geometry and Occlusion-Aware Encoding
3D GAN inversion aims to achieve high reconstruction fidelity and reasonable 3D geometry simultaneously from a single image input. However, existing 3D GAN inversion methods rely on time-consuming optimization for each individual case. In this work, we introduce a novel encoder-based inversion framework based on EG3D, one of the most widely-used 3D GAN models. We leverage the inherent properties of EG3D’s latent space to design a discriminator and a background depth regularization. This enables us to train a geometry-aware encoder capable of converting the input image into corresponding latent code. Additionally, we explore the feature space of EG3D and develop an adaptive refinement stage that improves the representation ability of features in EG3D to enhance the recovery of fine-grained textural details. Finally, we propose an occlusion-aware fusion operation to prevent distortion in unobserved regions. Our method achieves impressive results comparable to optimization-based methods while operating up to 500 times faster. Our framework is well-suited for applications such as semantic editing.
- Open Access
Untrained neural network embedded Fourier phase retrieval from few measurements
Fourier phase retrieval (FPR) is a challenging task widely used in various applications. It involves recovering an unknown signal from its Fourier phaseless measurements. FPR with few measurements is important for reducing time and hardware costs, but it suffers from serious ill-posedness. Recently, untrained neural networks have offered new approaches by introducing learned priors to alleviate the ill-posedness without requiring any external data. However, they may not be ideal for reconstructing fine details in images and can be computationally expensive. This paper proposes an untrained neural network (NN) embedded algorithm based on the alternating direction method of multipliers (ADMM) framework to solve FPR with few measurements. Specifically, we use a generative network to represent the image to be recovered, which confines the image to the space defined by the network structure. To improve the ability to represent high-frequency information, total variation (TV) regularization is imposed to facilitate the recovery of local structures in the image. Furthermore, to reduce the computational cost mainly caused by the parameter updates of the untrained NN, we develop an accelerated algorithm that adaptively trades off between explicit and implicit regularization. Experimental results indicate that the proposed algorithm outperforms existing untrained NN-based algorithms with fewer computational resources and even performs competitively against trained NN-based algorithms.
Open AccessUntrained neural network embedded Fourier phase retrieval from few measurements
Fourier phase retrieval (FPR) is a challenging task widely used in various applications. It involves recovering an unknown signal from its Fourier phaseless measurements. FPR with few measurements is important for reducing time and hardware costs, but it suffers from serious ill-posedness. Recently, untrained neural networks have offered new approaches by introducing learned priors to alleviate the ill-posedness without requiring any external data. However, they may not be ideal for reconstructing fine details in images and can be computationally expensive. This paper proposes an untrained neural network (NN) embedded algorithm based on the alternating direction method of multipliers (ADMM) framework to solve FPR with few measurements. Specifically, we use a generative network to represent the image to be recovered, which confines the image to the space defined by the network structure. To improve the ability to represent high-frequency information, total variation (TV) regularization is imposed to facilitate the recovery of local structures in the image. Furthermore, to reduce the computational cost mainly caused by the parameter updates of the untrained NN, we develop an accelerated algorithm that adaptively trades off between explicit and implicit regularization. Experimental results indicate that the proposed algorithm outperforms existing untrained NN-based algorithms with fewer computational resources and even performs competitively against trained NN-based algorithms.
- Open Access
A Weighted Randomized Sparse Kaczmarz Method for Solving Linear Systems
The randomized sparse Kaczmarz method, designed for seeking the sparse solutions of the linear systems $Ax=b$, selects the $i$-th projection hyperplane with likelihood proportional to $\|a_{i}\|_2^2$, where $a_{i}^T$ is $i$-th row of $A$. In this work, we propose a weighted randomized sparse Kaczmarz method, which selects the $i$-th projection hyperplane with probability proportional to $\lvert\langle a_{i},x_{k}\rangle-b_{i}\rvert^p$, where $0<p<\infty$, for possible acceleration. It bridges the randomized Kaczmarz and greedy Kaczmarz by parameter $p$. Theoretically, we show its linear convergence rate in expectation with respect to the Bregman distance in the noiseless and noisy cases, which is at least as efficient as the randomized sparse Kaczmarz method. The superiority of the proposed method is demonstrated via a group of numerical experiments.Open AccessA Weighted Randomized Sparse Kaczmarz Method for Solving Linear Systems
The randomized sparse Kaczmarz method, designed for seeking the sparse solutions of the linear systems $Ax=b$, selects the $i$-th projection hyperplane with likelihood proportional to $\|a_{i}\|_2^2$, where $a_{i}^T$ is $i$-th row of $A$. In this work, we propose a weighted randomized sparse Kaczmarz method, which selects the $i$-th projection hyperplane with probability proportional to $\lvert\langle a_{i},x_{k}\rangle-b_{i}\rvert^p$, where $0<p<\infty$, for possible acceleration. It bridges the randomized Kaczmarz and greedy Kaczmarz by parameter $p$. Theoretically, we show its linear convergence rate in expectation with respect to the Bregman distance in the noiseless and noisy cases, which is at least as efficient as the randomized sparse Kaczmarz method. The superiority of the proposed method is demonstrated via a group of numerical experiments. - 8 November 2022
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 41 (8) , 1-18
A weighted randomized sparse Kaczmarz method for solving linear systems
- 8 November 2022
- Published by Springer Nature in Computational and Applied Mathematics
- Vol. 41 (8) , 1-18
A weighted randomized sparse Kaczmarz method for solving linear systems
- 22 April 2022
- Published by IOP Publishing in Inverse Problems
- Vol. 38 (6) , 065005
Adaptively sketched Bregman projection methods for linear systems
The sketch-and-project, as a general archetypal algorithm for solving linear systems, unifies a variety of randomized iterative methods such as the randomized Kaczmarz and randomized coordinate descent. However, since it aims to find a least-norm solution from a linear system, the randomized sparse Kaczmarz can not be included. This motivates us to propose a more general framework, called sketched Bregman projection (SBP) method, in which we are able to find solutions with certain structures from linear systems. To generalize the concept of adaptive sampling to the SBP method, we show how the progress, measured by Bregman distance, of single step depends directly on a sketched loss function. Theoretically, we provide detailed global convergence results for the SBP method with different adaptive sampling rules. At last, for the (sparse) Kaczmarz methods, a group of numerical simulations are tested, with which we verify that the methods utilizing sampling Kaczmarz–Motzkin rule demands the fewest computational costs to achieve a given error bound comparing to the corresponding methods with other sampling rules.
- 22 April 2022
- Published by IOP Publishing in Inverse Problems
- Vol. 38 (6) , 065005
Adaptively sketched Bregman projection methods for linear systems
The sketch-and-project, as a general archetypal algorithm for solving linear systems, unifies a variety of randomized iterative methods such as the randomized Kaczmarz and randomized coordinate descent. However, since it aims to find a least-norm solution from a linear system, the randomized sparse Kaczmarz can not be included. This motivates us to propose a more general framework, called sketched Bregman projection (SBP) method, in which we are able to find solutions with certain structures from linear systems. To generalize the concept of adaptive sampling to the SBP method, we show how the progress, measured by Bregman distance, of single step depends directly on a sketched loss function. Theoretically, we provide detailed global convergence results for the SBP method with different adaptive sampling rules. At last, for the (sparse) Kaczmarz methods, a group of numerical simulations are tested, with which we verify that the methods utilizing sampling Kaczmarz–Motzkin rule demands the fewest computational costs to achieve a given error bound comparing to the corresponding methods with other sampling rules.