arXiv:2609.13969v1 Announce Type: new
Abstract: Ptychographic phase reconstruction is commonly formulated as an iterative inverse problem, requiring repeated object-probe updates and resulting in sub...
By Wen-Chun Lin, Yu-Chee Tseng, Jen-Jee Chen, Nan-You Chen
arXiv:2605. 01122v2 Announce Type: replace Abstract: Iterative ptychographic reconstruction algorithms are widely used for coherent diffractive imaging but can exhibit slow convergence under realistic experimental conditions.
By Bowen Zheng, Katayun Kamdin, David Shapiro, Alexander Ditter, Dayne Sasaki, Emma Bernard, Roopali Kukreja, Petrus H. Zwart, Slavom\'ir Nem\v{s}\'ak, Apurva Mehta, Nicholas Schwarz, Alexander Hexemer, Tanny Chavez
SlowFast‑SCI introduces a dual‑speed deep‑unfolding framework for spectral compressive imaging that combines a slow, pre‑trained backbone with a fast, test‑time adaptation stage. The slow phase distills a priors‑based model into a compact fast‑unfolding network, while the fast phase embeds lightweight modules that self‑supervise at test time without retraining the backbone. This design yields significant reductions in parameters and FLOPs, improves out‑of‑distribution PSNR by up to 5.79 dB, and accelerates adaptation four‑fold, all while remaining modular enough to integrate with any existing deep‑unfolding system.
By Haijin Zeng, Xuan Lu, Jiezhang Cao, Kai Zhang, Yurong Zhang, Qiangqiang Shen, Guoqing Chao, Li Jiang, Yongyong Chen, Jingyong Su, Jie Liu
arXiv:2605. 24590v2 Announce Type: replace-cross Abstract: Low-light, long-exposure defocus deblurring remains a challenging problem due to the simultaneous presence of severe blur and complex biased noise.
By Ziyan Huang, Lang Wu, Hongji Wang, Yifei Liu, Dongliang Tang, Hongqiao Wang
The paper introduces Scalable Bayesian Optimization of Composite Functions (SBOCF) for efficiently estimating physical parameters from scientific images, specifically targeting electron microscopy PACBED patterns. SBOCF leverages the composite structure of the image-matching objective, reducing modeled outputs from 24,649 to 11 by using patch-level summaries and correction terms. With only 50 simulator evaluations, SBOCF outperformed standard Bayesian optimization, achieving up to 290× lower median SSE on synthetic SrTiO3 benchmarks and producing accurate parameter estimates on experimental data without task-specific pretraining.
By Dasol Yoon, Poompol Buathong, Chia-Hao Lee, Yujia Zhang, David A. Muller, Peter I. Frazier
arXiv:2608. 02869v1 Announce Type: new Abstract: Ptychography neural networks suffer from scaling inconsistencies when generalizing out of distribution, limiting their real world viability.
By Albert Vong, Steven Henke, Oliver Hoidn, Hanna Ruth, Junjing Deng, Apurva Mehta, David Shapiro, Alexander Hexemer, Nicholas Schwarz
arXiv:2508. 05321v4 Announce Type: replace-cross Abstract: Assume you encounter an inverse problem that shall be solved for a large number of data, but no ground-truth data is available.
By Laura Hellwege, Johann Christopher Engster, Moritz Schaar, Thorsten M. Buzug, Maik Stille
Laser line-scanning microscopy enables fast volumetric imaging but produces anisotropic lateral resolution. Orthogonal line scans provide complementary directional information that can recover near-isotropic resolution, yet existing deep-learning methods require a separate model for each optical configuration.
The paper introduces a physics‑driven, cross‑domain iterative framework for self‑supervised low‑dose CT denoising. It first uses a learned sinogram prior and the LDCT noise model to separate Poisson and Gaussian noise components, then applies binomial and Gaussian data thinning to create two training pairs with independent noise realizations. These pairs train an image‑domain network whose outputs are forward‑projected to refine the prior, yielding consistent performance gains over existing self‑supervised baselines and comparable results to supervised methods.
By Xianlei Han, Shaoyu Wang, Jiancheng Fang, Weiwen Wu, Qiegen Liu
The paper presents a method for training single‑step neural surrogates that can handle wave‑scattering problems with tens of thousands of controllable variables. By dynamically generating training examples that highlight surrogate errors and using a replay dataset with normalization, the authors achieve a surrogate that accurately simulates two‑dimensional wave scattering for up to 41,772 variables and generalizes to over 3 million variables without retraining. The surrogate is applied to forward simulations and inverse design of freeform beam splitters and gradient‑index lenses, achieving speedups up to 26.5× compared to traditional FDTD methods.
By Charles Dove, Laura Waller
The paper presents a method for training single‑step neural surrogates that can handle wave‑scattering inverse problems with tens of thousands of controllable variables. By dynamically generating training examples through gradient ascent and using a replay dataset with normalization, the authors achieve a surrogate that accurately models two‑dimensional wave scattering for up to 41,772 variables and can generalize to over 3 million variables without retraining. The surrogate demonstrates comparable or better performance than traditional FDTD simulations for large‑scale forward simulations and inverse design of photonic devices, achieving speedups up to 26.5×.
X-ray computed tomography reconstruction is an ill-posed inverse problem, particularly in low-dose and sparse-angle settings where measurements are noisy and incomplete. While learned reconstruction methods such as the Learned Primal-Dual algorithm achieve strong performance, they typically rely on supervised training with access to ground-truth data, which is often unavailable in practice.