An algorithm for solving the inverse problem in total internal reflection microscopy

The inverse problem encountered in total internal reflection microscopy is particularly challenging due to the complex relationship between the data and the state vector. To address the computational difficulties and compute all possible solutions to this inverse problem, we propose an algorithm for solving problems of the form F ( x ) = y , where F is a nonlinear and continuous forward model, x is the state vector, and y is the data vector. The forward model is computationally expensive, lacks derivatives, and is treated as a black-box function, with no prior information available about the statistical properties of x , aside from a box constraint. Additionally, the data vector y is affected by uncertainties, making the retrieval of accurate solutions more challenging. To address these issues, the algorithm incorporates a neural network-based surrogate model to reduce computational costs and manage the absence of derivatives. A whitening transformation is applied to handle isotropic noise, and the residual is minimized within simple bounds. The method is further enhanced by a multistart solver that generates starting points through a hitting set problem, improving the exploration of the solution space and increasing the likelihood of finding all solutions. The solver iterates over the absolute function tolerance to identify both global and local minima, minimizes a least-squares function while adhering to simple bounds on variables during the local search phase, and includes a double box stopping rule. Additionally, the algorithm employs various sampling techniques and optimization methods, with the covariance matrix estimated using either a standard analytical approach or a Monte Carlo analysis. • Developed a robust solver for inverse problems in total internal reflection microscopy. • Proposed surrogate models to manage computational costs and non-analytical derivatives. • Introduced a multistart solver with hitting set algorithms for enhanced solution coverage. • Adapted dynamic tolerances for noisy data to distinguish global and local minima.

Authors

Institutions

Publication Details

Journal
Journal of Quantitative Spectroscopy and Radiative Transfer
Published
2025-06-07
DOI
https://doi.org/10.1016/j.jqsrt.2025.109534
Primary Topic
Photoacoustic and Ultrasonic Imaging
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An algorithm for solving the inverse problem in total internal reflection microscopy

Christopher L. Wirth, Dmitry Efremenko, Alexandru Doicu, Thomas Wriedt
1 links
Journal of Quantitative Spectroscopy and Radiative Transfer
Photoacoustic and Ultrasonic Imaging
article

An algorithm for solving the inverse problem in total internal reflection microscopy

Christopher L. Wirth, Dmitry Efremenko, Alexandru Doicu, Thomas Wriedt
article en

Abstract

The inverse problem encountered in total internal reflection microscopy is particularly challenging due to the complex relationship between the data and the state vector. To address the computational difficulties and compute all possible solutions to this inverse problem, we propose an algorithm for solving problems of the form F ( x ) = y , where F is a nonlinear and continuous forward model, x is the state vector, and y is the data vector. The forward model is computationally expensive, lacks derivatives, and is treated as a black-box function, with no prior information available about the statistical properties of x , aside from a box constraint. Additionally, the data vector y is affected by uncertainties, making the retrieval of accurate solutions more challenging. To address these issues, the algorithm incorporates a neural network-based surrogate model to reduce computational costs and manage the absence of derivatives. A whitening transformation is applied to handle isotropic noise, and the residual is minimized within simple bounds. The method is further enhanced by a multistart solver that generates starting points through a hitting set problem, improving the exploration of the solution space and increasing the likelihood of finding all solutions. The solver iterates over the absolute function tolerance to identify both global and local minima, minimizes a least-squares function while adhering to simple bounds on variables during the local search phase, and includes a double box stopping rule. Additionally, the algorithm employs various sampling techniques and optimization methods, with the covariance matrix estimated using either a standard analytical approach or a Monte Carlo analysis. • Developed a robust solver for inverse problems in total internal reflection microscopy. • Proposed surrogate models to manage computational costs and non-analytical derivatives. • Introduced a multistart solver with hitting set algorithms for enhanced solution coverage. • Adapted dynamic tolerances for noisy data to distinguish global and local minima.

Journal of Quantitative Spectroscopy and Radiative TransferVol. 345
Cleveland State University (US), University of Bremen (DE), Deutsches Zentrum für Luft- und Raumfahrt e. V. (DLR) (DE), Leibniz-Institut für Werkstofforientierte Technologien - IWT (DE), Oldham Council (GB)
National Science Foundation
Openalex Percentile: Top 88%
Photoacoustic and Ultrasonic Imaging
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.