首页 > 最新文献

Inverse Problems最新文献

英文 中文
Optimizing quantitative photoacoustic imaging systems: the Bayesian Cramér-Rao bound approach. 优化定量光声成像系统:贝叶斯克拉梅-拉奥约束方法。
IF 2 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-12-01 Epub Date: 2024-11-20 DOI: 10.1088/1361-6420/ad910a
Evan Scope Crafts, Mark A Anastasio, Umberto Villa

Quantitative photoacoustic computed tomography (qPACT) is an emerging medical imaging modality that carries the promise of high-contrast, fine-resolution imaging of clinically relevant quantities like hemoglobin concentration and blood-oxygen saturation. However, qPACT image reconstruction is governed by a multiphysics, partial differential equation (PDE) based inverse problem that is highly non-linear and severely ill-posed. Compounding the difficulty of the problem is the lack of established design standards for qPACT imaging systems, as there is currently a proliferation of qPACT system designs for various applications and it is unknown which ones are optimal or how to best modify the systems under various design constraints. This work introduces a novel computational approach for the optimal experimental design of qPACT imaging systems based on the Bayesian Cramér-Rao bound (CRB). Our approach incorporates several techniques to address challenges associated with forming the bound in the infinite-dimensional function space setting of qPACT, including priors with trace-class covariance operators and the use of the variational adjoint method to compute derivatives of the log-likelihood function needed in the bound computation. The resulting Bayesian CRB based design metric is computationally efficient and independent of the choice of estimator used to solve the inverse problem. The efficacy of the bound in guiding experimental design was demonstrated in a numerical study of qPACT design schemes under a stylized two-dimensional imaging geometry. To the best of our knowledge, this is the first work to propose Bayesian CRB based design for systems governed by PDEs.

定量光声计算机断层扫描(qPACT)是一种新兴的医学成像模式,有望对血红蛋白浓度和血氧饱和度等临床相关量进行高对比度、高分辨率成像。然而,qPACT 图像重建受制于一个多物理场、基于偏微分方程(PDE)的逆问题,该问题具有高度非线性和严重的不确定性。使问题更加困难的是,qPACT 成像系统缺乏既定的设计标准,因为目前针对各种应用的 qPACT 系统设计层出不穷,而哪些设计是最佳的,或者在各种设计约束条件下如何对系统进行最佳修改,都是未知数。这项工作介绍了一种基于贝叶斯克拉梅尔-拉奥约束(CRB)的 qPACT 成像系统优化实验设计的新型计算方法。我们的方法采用了多项技术,以应对在 qPACT 的无限维函数空间环境中形成约束所面临的挑战,包括使用迹类协方差算子的先验,以及使用变分邻接法计算约束计算中所需的对数似然函数的导数。由此产生的基于贝叶斯 CRB 的设计度量计算效率高,且与用于解决逆问题的估计器的选择无关。通过对二维成像几何形状下的 qPACT 设计方案进行数值研究,证明了该约束在指导实验设计方面的功效。据我们所知,这是第一项针对受 PDEs 控制的系统提出基于贝叶斯 CRB 的设计的工作。
{"title":"Optimizing quantitative photoacoustic imaging systems: the Bayesian Cramér-Rao bound approach.","authors":"Evan Scope Crafts, Mark A Anastasio, Umberto Villa","doi":"10.1088/1361-6420/ad910a","DOIUrl":"10.1088/1361-6420/ad910a","url":null,"abstract":"<p><p>Quantitative photoacoustic computed tomography (qPACT) is an emerging medical imaging modality that carries the promise of high-contrast, fine-resolution imaging of clinically relevant quantities like hemoglobin concentration and blood-oxygen saturation. However, qPACT image reconstruction is governed by a multiphysics, partial differential equation (PDE) based inverse problem that is highly non-linear and severely ill-posed. Compounding the difficulty of the problem is the lack of established design standards for qPACT imaging systems, as there is currently a proliferation of qPACT system designs for various applications and it is unknown which ones are optimal or how to best modify the systems under various design constraints. This work introduces a novel computational approach for the optimal experimental design of qPACT imaging systems based on the Bayesian Cramér-Rao bound (CRB). Our approach incorporates several techniques to address challenges associated with forming the bound in the infinite-dimensional function space setting of qPACT, including priors with trace-class covariance operators and the use of the variational adjoint method to compute derivatives of the log-likelihood function needed in the bound computation. The resulting Bayesian CRB based design metric is computationally efficient and independent of the choice of estimator used to solve the inverse problem. The efficacy of the bound in guiding experimental design was demonstrated in a numerical study of qPACT design schemes under a stylized two-dimensional imaging geometry. To the best of our knowledge, this is the first work to propose Bayesian CRB based design for systems governed by PDEs.</p>","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"40 12","pages":"125012"},"PeriodicalIF":2.0,"publicationDate":"2024-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11577155/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142689375","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A microlocal and visual comparison of 2D Kirchhoff migration formulas in seismic imaging * 地震成像中二维基尔霍夫迁移公式的微观和视觉比较 *
IF 2.1 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-09-18 DOI: 10.1088/1361-6420/ad797b
Kevin Ganster, Eric Todd Quinto and Andreas Rieder
The term Kirchhoff migration refers to a collection of approximate linearized inversion formulas for solving the inverse problem of seismic tomography which entails reconstructing the Earth’s subsurface from reflected wave fields. A number of such formulas exists, the first dating from the 1950 s. As far as we know, these formulas have not yet been mathematically compared with respect to their imaging properties. This shortcoming is to be alleviated by the present work: we systematically discuss the advantages and disadvantages of the formulas in 2D from a microlocal point of view. To this end we consider the corresponding imaging operators in an unified framework as pseudodifferential or Fourier integral operators. Numerical examples illustrate the theoretical insights and allow a visual comparison of the different formulas.
基尔霍夫反演(Kirchhoff migration)指的是一系列近似线性化反演公式,用于解决地震层析成像的反演问题,即根据反射波场重建地球地下。据我们所知,这些公式还没有在成像特性方面进行过数学比较。本研究将弥补这一不足:我们将从微观局部的角度系统地讨论二维公式的优缺点。为此,我们在统一的框架内将相应的成像算子视为伪微分算子或傅里叶积分算子。数值示例说明了理论见解,并对不同公式进行了直观比较。
{"title":"A microlocal and visual comparison of 2D Kirchhoff migration formulas in seismic imaging *","authors":"Kevin Ganster, Eric Todd Quinto and Andreas Rieder","doi":"10.1088/1361-6420/ad797b","DOIUrl":"https://doi.org/10.1088/1361-6420/ad797b","url":null,"abstract":"The term Kirchhoff migration refers to a collection of approximate linearized inversion formulas for solving the inverse problem of seismic tomography which entails reconstructing the Earth’s subsurface from reflected wave fields. A number of such formulas exists, the first dating from the 1950 s. As far as we know, these formulas have not yet been mathematically compared with respect to their imaging properties. This shortcoming is to be alleviated by the present work: we systematically discuss the advantages and disadvantages of the formulas in 2D from a microlocal point of view. To this end we consider the corresponding imaging operators in an unified framework as pseudodifferential or Fourier integral operators. Numerical examples illustrate the theoretical insights and allow a visual comparison of the different formulas.","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"29 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142258276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Lipschitz stability of an inverse conductivity problem with two Cauchy data pairs 具有两个考奇数据对的反导问题的 Lipschitz 稳定性
IF 2.1 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-09-12 DOI: 10.1088/1361-6420/ad76d4
Martin Hanke
In 1996 Seo proved that two appropriate pairs of current and voltage data measured on the surface of a planar homogeneous object are sufficient to determine a conductive polygonal inclusion with known deviating conductivity. Here we show that the corresponding linearized forward map is injective, and from this we deduce Lipschitz stability of the solution of the original nonlinear inverse problem. We also treat the case of an insulating polygonal inclusion, in which case a single pair of Cauchy data is already sufficient for the same purpose.
1996 年,Seo 证明了在平面均质物体表面测量的两对适当的电流和电压数据足以确定具有已知偏差电导率的导电多边形包络。在这里,我们证明了相应的线性化前向映射是注入式的,并由此推导出原始非线性逆问题解的 Lipschitz 稳定性。我们还处理了绝缘多边形包络的情况,在这种情况下,单对柯西数据就足以达到同样的目的。
{"title":"Lipschitz stability of an inverse conductivity problem with two Cauchy data pairs","authors":"Martin Hanke","doi":"10.1088/1361-6420/ad76d4","DOIUrl":"https://doi.org/10.1088/1361-6420/ad76d4","url":null,"abstract":"In 1996 Seo proved that two appropriate pairs of current and voltage data measured on the surface of a planar homogeneous object are sufficient to determine a conductive polygonal inclusion with known deviating conductivity. Here we show that the corresponding linearized forward map is injective, and from this we deduce Lipschitz stability of the solution of the original nonlinear inverse problem. We also treat the case of an insulating polygonal inclusion, in which case a single pair of Cauchy data is already sufficient for the same purpose.","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"23 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142210256","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A bilevel optimization method for inverse mean-field games * 逆均值场博弈的双层优化方法 *
IF 2.1 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-09-12 DOI: 10.1088/1361-6420/ad75b0
Jiajia Yu, Quan Xiao, Tianyi Chen and Rongjie Lai
In this paper, we introduce a bilevel optimization framework for addressing inverse mean-field games, alongside an exploration of numerical methods tailored for this bilevel problem. The primary benefit of our bilevel formulation lies in maintaining the convexity of the objective function and the linearity of constraints in the forward problem. Our paper focuses on inverse mean-field games characterized by unknown obstacles and metrics. We show numerical stability for these two types of inverse problems. More importantly, we, for the first time, establish the identifiability of the inverse mean-field game with unknown obstacles via the solution of the resultant bilevel problem. The bilevel approach enables us to employ an alternating gradient-based optimization algorithm with a provable convergence guarantee. To validate the effectiveness of our methods in solving the inverse problems, we have designed comprehensive numerical experiments, providing empirical evidence of its efficacy.
在本文中,我们介绍了一种用于解决逆均值场博弈问题的双层优化框架,同时还探讨了为这一双层问题量身定制的数值方法。我们的双层表述的主要优点在于保持了前向问题中目标函数的凸性和约束条件的线性。我们的论文侧重于以未知障碍和度量为特征的反均值场博弈。我们展示了这两类逆问题的数值稳定性。更重要的是,我们首次通过求解由此产生的双层问题,建立了具有未知障碍的逆均值场博弈的可识别性。双梯度方法使我们能够采用一种基于梯度交替的优化算法,该算法具有可证明的收敛性保证。为了验证我们的方法在解决逆问题方面的有效性,我们设计了全面的数值实验,为其有效性提供了经验证据。
{"title":"A bilevel optimization method for inverse mean-field games *","authors":"Jiajia Yu, Quan Xiao, Tianyi Chen and Rongjie Lai","doi":"10.1088/1361-6420/ad75b0","DOIUrl":"https://doi.org/10.1088/1361-6420/ad75b0","url":null,"abstract":"In this paper, we introduce a bilevel optimization framework for addressing inverse mean-field games, alongside an exploration of numerical methods tailored for this bilevel problem. The primary benefit of our bilevel formulation lies in maintaining the convexity of the objective function and the linearity of constraints in the forward problem. Our paper focuses on inverse mean-field games characterized by unknown obstacles and metrics. We show numerical stability for these two types of inverse problems. More importantly, we, for the first time, establish the identifiability of the inverse mean-field game with unknown obstacles via the solution of the resultant bilevel problem. The bilevel approach enables us to employ an alternating gradient-based optimization algorithm with a provable convergence guarantee. To validate the effectiveness of our methods in solving the inverse problems, we have designed comprehensive numerical experiments, providing empirical evidence of its efficacy.","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"10 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-09-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142210255","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bayesian inversion with Student’s t priors based on Gaussian scale mixtures 基于高斯尺度混合物的贝叶斯反演与学生 t 先验
IF 2.1 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-09-11 DOI: 10.1088/1361-6420/ad75af
Angelina Senchukova, Felipe Uribe and Lassi Roininen
Many inverse problems focus on recovering a quantity of interest that is a priori known to exhibit either discontinuous or smooth behavior. Within the Bayesian approach to inverse problems, such structural information can be encoded using Markov random field priors. We propose a class of priors that combine Markov random field structure with Student’s t distribution. This approach offers flexibility in modeling diverse structural behaviors depending on available data. Flexibility is achieved by including the degrees of freedom parameter of Student’s t distribution in the formulation of the Bayesian inverse problem. To facilitate posterior computations, we employ Gaussian scale mixture representation for the Student’s t Markov random field prior, which allows expressing the prior as a conditionally Gaussian distribution depending on auxiliary hyperparameters. Adopting this representation, we can derive most of the posterior conditional distributions in a closed form and utilize the Gibbs sampler to explore the posterior. We illustrate the method with two numerical examples: signal deconvolution and image deblurring.
许多逆问题的重点是恢复一个先验已知表现出不连续或平滑行为的相关量。在逆问题的贝叶斯方法中,这种结构信息可以用马尔可夫随机场先验来编码。我们提出了一类将马尔可夫随机场结构与 Student's t 分布相结合的先验。这种方法可以根据可用数据,灵活地模拟各种结构行为。灵活性是通过在贝叶斯逆问题的表述中加入 Student's t 分布的自由度参数来实现的。为了方便后验计算,我们采用了高斯尺度混合表示法来表示 Student's t 马尔科夫随机场先验,这样就可以根据辅助超参数将先验表达为条件高斯分布。采用这种表示方法,我们可以以封闭形式推导出大部分后验条件分布,并利用吉布斯采样器探索后验。我们用两个数值示例来说明该方法:信号解卷积和图像去模糊。
{"title":"Bayesian inversion with Student’s t priors based on Gaussian scale mixtures","authors":"Angelina Senchukova, Felipe Uribe and Lassi Roininen","doi":"10.1088/1361-6420/ad75af","DOIUrl":"https://doi.org/10.1088/1361-6420/ad75af","url":null,"abstract":"Many inverse problems focus on recovering a quantity of interest that is a priori known to exhibit either discontinuous or smooth behavior. Within the Bayesian approach to inverse problems, such structural information can be encoded using Markov random field priors. We propose a class of priors that combine Markov random field structure with Student’s t distribution. This approach offers flexibility in modeling diverse structural behaviors depending on available data. Flexibility is achieved by including the degrees of freedom parameter of Student’s t distribution in the formulation of the Bayesian inverse problem. To facilitate posterior computations, we employ Gaussian scale mixture representation for the Student’s t Markov random field prior, which allows expressing the prior as a conditionally Gaussian distribution depending on auxiliary hyperparameters. Adopting this representation, we can derive most of the posterior conditional distributions in a closed form and utilize the Gibbs sampler to explore the posterior. We illustrate the method with two numerical examples: signal deconvolution and image deblurring.","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"10 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142210297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Exact recovery of the support of piecewise constant images via total variation regularization 通过总变异正则化精确恢复片断常数图像的支持度
IF 2.1 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-09-11 DOI: 10.1088/1361-6420/ad75b1
Yohann De Castro, Vincent Duval and Romain Petit
This work is concerned with the recovery of piecewise constant images from noisy linear measurements. We study the noise robustness of a variational reconstruction method, which is based on total (gradient) variation regularization. We show that, if the unknown image is the superposition of a few simple shapes, and if a non-degenerate source condition holds, then, in the low noise regime, the reconstructed images have the same structure: they are the superposition of the same number of shapes, each a smooth deformation of one of the unknown shapes. Moreover, the reconstructed shapes and the associated intensities converge to the unknown ones as the noise goes to zero.
这项研究涉及从噪声线性测量中恢复片状常数图像。我们研究了一种基于总(梯度)变化正则化的变分重建方法的噪声鲁棒性。我们的研究表明,如果未知图像是几个简单形状的叠加,并且如果非退化源条件成立,那么在低噪声条件下,重建图像具有相同的结构:它们是相同数量形状的叠加,每个形状都是其中一个未知形状的平滑变形。此外,当噪声为零时,重建的形状和相关的强度都会趋近于未知形状。
{"title":"Exact recovery of the support of piecewise constant images via total variation regularization","authors":"Yohann De Castro, Vincent Duval and Romain Petit","doi":"10.1088/1361-6420/ad75b1","DOIUrl":"https://doi.org/10.1088/1361-6420/ad75b1","url":null,"abstract":"This work is concerned with the recovery of piecewise constant images from noisy linear measurements. We study the noise robustness of a variational reconstruction method, which is based on total (gradient) variation regularization. We show that, if the unknown image is the superposition of a few simple shapes, and if a non-degenerate source condition holds, then, in the low noise regime, the reconstructed images have the same structure: they are the superposition of the same number of shapes, each a smooth deformation of one of the unknown shapes. Moreover, the reconstructed shapes and the associated intensities converge to the unknown ones as the noise goes to zero.","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"48 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142210287","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
fg-ORKA: fast and gridless reconstruction of moving and deforming objects in multidimensional data fg-ORKA:多维数据中移动和变形物体的快速无网格重建
IF 2.1 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-09-11 DOI: 10.1088/1361-6420/ad7495
Florian Bossmann, Jianwei Ma and Wenze Wu
Identifying and tracking objects over multiple observations is a frequent task in many applications. Traffic monitoring requires the tracking of vehicles or pedestrians in video data and geophysical exploration relies on identifying seismic wave fronts from data of multiple sensors, only to mention two examples. In many cases, the object changes its shape or position within the given data from one observation to another. Vehicles can change their position and angle relative to the camera while seismic waves have different arrival times, frequencies, or intensities depending on the sensor position. This complicates the task at hand. In a previous work, the authors presented a new algorithm to solve this problem—object reconstruction using K-approximation (ORKA). This algorithm is hindered by two conflicting limitations: the tracked movement is limited by the sampling grid while the complexity increases exponentially with the resolution. We introduce an iterative variant of the ORKA algorithm that is able to overcome this conflict. We also give a brief introduction on the original ORKA algorithm. Knowledge of the previous work is thus not required. We give theoretical error bounds and a complexity analysis which we validate with several numerical experiments. Moreover, we discuss the influence of different parameter choices in detail. The results clearly show that the iterative approach can outperform ORKA in both accuracy and efficiency. On the example of video processing we show that the new method can be applied where the original algorithm is too time and memory intensive. Furthermore, we demonstrate on seismic exploration data that we are now able to recover much finer details on the wave front movement then before.
在许多应用中,识别和跟踪多个观测对象是一项经常性任务。交通监控需要跟踪视频数据中的车辆或行人,地球物理勘探需要从多个传感器的数据中识别地震波前沿,这只是其中的两个例子。在许多情况下,从一次观测到另一次观测,物体在给定数据中的形状或位置都会发生变化。车辆相对于摄像机的位置和角度会发生变化,而地震波的到达时间、频率或强度则会因传感器位置的不同而不同。这使得手头的工作变得更加复杂。在之前的一项研究中,作者提出了一种解决这一问题的新算法--使用 K 近似法(ORKA)进行目标重建。该算法受到两个相互冲突的限制的阻碍:跟踪运动受到采样网格的限制,而复杂度则随着分辨率的增加呈指数增长。我们介绍了 ORKA 算法的迭代变体,它能够克服这一矛盾。我们还简要介绍了原始 ORKA 算法。因此不需要了解以前的工作。我们给出了理论误差范围和复杂性分析,并通过几个数值实验进行了验证。此外,我们还详细讨论了不同参数选择的影响。结果清楚地表明,迭代法在精度和效率上都优于 ORKA。以视频处理为例,我们表明新方法可以应用于原始算法时间和内存消耗过大的地方。此外,我们还在地震勘探数据上证明,我们现在能够恢复比以前更精细的波前运动细节。
{"title":"fg-ORKA: fast and gridless reconstruction of moving and deforming objects in multidimensional data","authors":"Florian Bossmann, Jianwei Ma and Wenze Wu","doi":"10.1088/1361-6420/ad7495","DOIUrl":"https://doi.org/10.1088/1361-6420/ad7495","url":null,"abstract":"Identifying and tracking objects over multiple observations is a frequent task in many applications. Traffic monitoring requires the tracking of vehicles or pedestrians in video data and geophysical exploration relies on identifying seismic wave fronts from data of multiple sensors, only to mention two examples. In many cases, the object changes its shape or position within the given data from one observation to another. Vehicles can change their position and angle relative to the camera while seismic waves have different arrival times, frequencies, or intensities depending on the sensor position. This complicates the task at hand. In a previous work, the authors presented a new algorithm to solve this problem—object reconstruction using K-approximation (ORKA). This algorithm is hindered by two conflicting limitations: the tracked movement is limited by the sampling grid while the complexity increases exponentially with the resolution. We introduce an iterative variant of the ORKA algorithm that is able to overcome this conflict. We also give a brief introduction on the original ORKA algorithm. Knowledge of the previous work is thus not required. We give theoretical error bounds and a complexity analysis which we validate with several numerical experiments. Moreover, we discuss the influence of different parameter choices in detail. The results clearly show that the iterative approach can outperform ORKA in both accuracy and efficiency. On the example of video processing we show that the new method can be applied where the original algorithm is too time and memory intensive. Furthermore, we demonstrate on seismic exploration data that we are now able to recover much finer details on the wave front movement then before.","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"58 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142210289","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Reconstructing a state-independent cost function in a mean-field game model 重构均值场博弈模型中与状态无关的成本函数
IF 2.1 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-09-05 DOI: 10.1088/1361-6420/ad7497
Kui Ren, Nathan Soedjak, Kewei Wang, Hongyu Zhai
In this short note, we consider an inverse problem to a mean-field games (MFGs) system where we are interested in reconstructing the state-independent running cost function from observed value-function data. We provide an elementary proof of a uniqueness result for the inverse problem using the standard multilinearization technique. One of the main features of our work is that we insist that the population distribution be a probability measure, a requirement that is not enforced in some of the existing literature on theoretical inverse MFGs.
在这篇短文中,我们考虑了均场博弈(MFGs)系统的逆问题,我们感兴趣的是如何从观测到的价值函数数据中重建与状态无关的运行成本函数。我们使用标准的多线性化技术为逆问题的唯一性结果提供了一个基本证明。我们工作的主要特点之一是,我们坚持认为人口分布是一个概率度量,而现有的一些关于理论逆 MFGs 的文献并没有强制执行这一要求。
{"title":"Reconstructing a state-independent cost function in a mean-field game model","authors":"Kui Ren, Nathan Soedjak, Kewei Wang, Hongyu Zhai","doi":"10.1088/1361-6420/ad7497","DOIUrl":"https://doi.org/10.1088/1361-6420/ad7497","url":null,"abstract":"In this short note, we consider an inverse problem to a mean-field games (MFGs) system where we are interested in reconstructing the state-independent running cost function from observed value-function data. We provide an elementary proof of a uniqueness result for the inverse problem using the standard multilinearization technique. One of the main features of our work is that we insist that the population distribution be a probability measure, a requirement that is not enforced in some of the existing literature on theoretical inverse MFGs.","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"258 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142210288","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Bouligand–Newton type methods for non-smooth ill-posed problems 非光滑问题的布利甘-牛顿型方法
IF 2.1 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-09-05 DOI: 10.1088/1361-6420/ad7496
Qinian Jin, Yun Zhang
We consider Newton-type methods for solving nonlinear ill-posed inverse problems in Hilbert spaces where the forward operators are not necessarily Gâteaux differentiable. Modifications are proposed with the non-existing Fréchet derivatives replaced by a family of bounded linear operators satisfying suitable properties. These bounded linear operators can be constructed by the Bouligand subderivatives which are defined as limits of Fréchet derivatives of the forward operator in differentiable points. The Bouligand subderivative mapping in general is not continuous unless the forward operator is Gâteaux differentiable which introduces challenges for convergence analysis of the corresponding Bouligand–Newton type methods. In this paper we will show that, under the discrepancy principle, these Bouligand–Newton type methods are iterative regularization methods of optimal order. Numerical results for an inverse problem arising from a non-smooth semi-linear elliptic equation are presented to test the performance of the methods.
我们考虑了在希尔伯特空间中求解非线性有问题逆问题的牛顿型方法,其中前向算子不一定是可加微分的。我们提出了一些修改建议,用满足适当性质的有界线性算子族代替不存在的弗雷谢特导数。这些有界线性算子可以由 Bouligand 次导数构建,而 Bouligand 次导数被定义为前向算子在可微分点上的弗雷谢特导数的极限。一般来说,除非前向算子是可加可微的,否则 Bouligand 次导数映射并不连续,这给相应的 Bouligand-Newton 类型方法的收敛性分析带来了挑战。本文将证明,在差异原理下,这些 Bouligand-Newton 类型方法是最优阶次的迭代正则化方法。本文将给出一个非光滑半线性椭圆方程逆问题的数值结果,以检验这些方法的性能。
{"title":"Bouligand–Newton type methods for non-smooth ill-posed problems","authors":"Qinian Jin, Yun Zhang","doi":"10.1088/1361-6420/ad7496","DOIUrl":"https://doi.org/10.1088/1361-6420/ad7496","url":null,"abstract":"We consider Newton-type methods for solving nonlinear ill-posed inverse problems in Hilbert spaces where the forward operators are not necessarily Gâteaux differentiable. Modifications are proposed with the non-existing Fréchet derivatives replaced by a family of bounded linear operators satisfying suitable properties. These bounded linear operators can be constructed by the Bouligand subderivatives which are defined as limits of Fréchet derivatives of the forward operator in differentiable points. The Bouligand subderivative mapping in general is not continuous unless the forward operator is Gâteaux differentiable which introduces challenges for convergence analysis of the corresponding Bouligand–Newton type methods. In this paper we will show that, under the discrepancy principle, these Bouligand–Newton type methods are iterative regularization methods of optimal order. Numerical results for an inverse problem arising from a non-smooth semi-linear elliptic equation are presented to test the performance of the methods.","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"9 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142226723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Fourier method for inverse source problem using correlation of passive measurements* 利用被动测量相关性解决逆源问题的傅立叶方法*
IF 2.1 2区 数学 Q1 MATHEMATICS, APPLIED Pub Date : 2024-09-04 DOI: 10.1088/1361-6420/ad6fc7
Faouzi Triki, Kristoffer Linder-Steinlein, Mirza Karamehmedović
We consider the inverse source problem for the time-dependent, constant-coefficient wave equation with Cauchy data and passive cross-correlation data.We propose to consider the cross-correlation as a wave equation itself and reconstruct the cross-correlation in the support of the source for the original Cauchy wave equation. Having access to the cross-correlation in the support of the source, we show that the cross-correlation solves a wave equation, and we reconstruct the cross-correlation from boundary data to recover the source in the original Cauchy wave equation. In addition, we show the inverse source problem is ill-posed and suffers from non-uniqueness when the mean of the source is zero and provide a uniqueness result and stability estimate in case of non-zero mean sources.
我们考虑了具有 Cauchy 数据和被动交叉相关数据的随时间变化的恒系数波方程的反源问题。我们建议将交叉相关视为波方程本身,并在源的支持下重建交叉相关,以获得原始 Cauchy 波方程。在获得源支持中的交叉相关性后,我们证明交叉相关性求解了一个波方程,并从边界数据中重建交叉相关性,以恢复原始考奇波方程中的源。此外,我们还证明了当源的均值为零时,逆源问题是求解困难且存在非唯一性的,并提供了非零均值源情况下的唯一性结果和稳定性估计。
{"title":"Fourier method for inverse source problem using correlation of passive measurements*","authors":"Faouzi Triki, Kristoffer Linder-Steinlein, Mirza Karamehmedović","doi":"10.1088/1361-6420/ad6fc7","DOIUrl":"https://doi.org/10.1088/1361-6420/ad6fc7","url":null,"abstract":"We consider the inverse source problem for the time-dependent, constant-coefficient wave equation with Cauchy data and passive cross-correlation data.We propose to consider the cross-correlation as a wave equation itself and reconstruct the cross-correlation in the support of the source for the original Cauchy wave equation. Having access to the cross-correlation in the support of the source, we show that the cross-correlation solves a wave equation, and we reconstruct the cross-correlation from boundary data to recover the source in the original Cauchy wave equation. In addition, we show the inverse source problem is ill-posed and suffers from non-uniqueness when the mean of the source is zero and provide a uniqueness result and stability estimate in case of non-zero mean sources.","PeriodicalId":50275,"journal":{"name":"Inverse Problems","volume":"21 1","pages":""},"PeriodicalIF":2.1,"publicationDate":"2024-09-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142226717","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Inverse Problems
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1