We propose a nonlinear primal-dual algorithm for the retrieval of phase shift and absorption from a single x ray in-line phase contrast, or Fresnel diffraction, image. The algorithm permits us to regularize phase and absorption separately. We demonstrate that taking into account the nonlinearity in the reconstruction improves reconstruction compared with linear methods. We also demonstrate that choosing different regularizers for absorption and phase can improve the reconstructions. The use of the total variation and its generalization in a primal-dual approach allows us to exploit the sparsity of the investigated sample. On both simulated and real datasets, the proposed nonlinear primal-dual hybrid gradient (NL-PDHG) method yields reconstructions with considerably fewer artifacts and improved the normalized mean squared error compared with its linearized version.

Download full-text PDF

Source
http://dx.doi.org/10.1364/OL.469174DOI Listing

Publication Analysis

Top Keywords

nonlinear primal-dual
12
primal-dual algorithm
8
phase absorption
8
phase contrast
8
phase
6
algorithm phase
4
absorption
4
absorption retrieval
4
retrieval single
4
single phase
4

Similar Publications

Purpose: In this work, the use of joint Total Generalized Variation (TGV) regularization to improve Multipool-Lorentzian fitting of chemical exchange saturation transfer (CEST) Spectra in terms of stability and parameter signal-to-noise ratio (SNR) was investigated.

Theory And Methods: The joint TGV term was integrated into the nonlinear parameter fitting problem. To increase convergence and weight the gradients, preconditioning using a voxel-wise singular value decomposition was applied to the problem, which was then solved using the iteratively regularized Gauss-Newton method combined with a Primal-Dual splitting algorithm.

View Article and Find Full Text PDF

KETCHUP: Parameterizing of large-scale kinetic models using multiple datasets with different reference states.

Metab Eng

March 2024

Department of Chemical Engineering, The Pennsylvania State University, University Park, PA, 16802, USA; DOE Center for Advanced Bioenergy and Bioproducts Innovation, USA. Electronic address:

Large-scale kinetic models provide the computational means to dynamically link metabolic reaction fluxes to metabolite concentrations and enzyme levels while also conforming to substrate level regulation. However, the development of broadly applicable frameworks for efficiently and robustly parameterizing models remains a challenge. Challenges arise due to both the heterogeneity, paucity, and difficulty in obtaining flux and/or concentration data but also due to the computational difficulties of the underlying parameter identification problem.

View Article and Find Full Text PDF

Distributed continuous-time accelerated neurodynamic approaches for sparse recovery via smooth approximation to L-minimization.

Neural Netw

April 2024

Chongqing Key Laboratory of Nonlinear Circuits and Intelligent Information Processing, School of Electronic and Information Engineering, Southwest University, Chongqing 400715, China. Electronic address:

This paper develops two continuous-time distributed accelerated neurodynamic approaches for solving sparse recovery via smooth approximation to L-norm minimization problem. First, the L-norm minimization problem is converted into a distributed smooth optimization problem by utilizing multiagent consensus theory and smooth approximation. Then, a distributed primal-dual accelerated neurodynamic approach is designed by using Karush-Kuhn-Tucker (KKT) condition and Nesterov's accelerated method.

View Article and Find Full Text PDF

This article investigates a class of systems of nonlinear equations (SNEs). Three distributed neurodynamic models (DNMs), namely a two-layer model (DNM-I) and two single-layer models (DNM-II and DNM-III), are proposed to search for such a system's exact solution or a solution in the sense of least-squares. Combining a dynamic positive definite matrix with the primal-dual method, DNM-I is designed and it is proved to be globally convergent.

View Article and Find Full Text PDF

This article investigates constrained online noncooperative games (NGs) of multiagent systems over unbalanced digraphs, where the cost functions of players are time-varying and are gradually revealed to corresponding players only after decisions are made. Moreover, in the problem, the players are subject to local convex set constraints and time-varying coupling nonlinear inequality constraints. To the best of our knowledge, no result about online games with unbalanced digraphs has been reported, let alone constrained online games.

View Article and Find Full Text PDF

Want AI Summaries of new PubMed Abstracts delivered to your In-box?

Enter search terms and have AI summaries delivered each week - change queries or unsubscribe any time!