论文标题
通过扩展反转来解决声传输反问题
Solution of an Acoustic Transmission Inverse Problem by Extended Inversion
论文作者
论文摘要
简单的单轨传输示例的研究表明,全波倒置的扩展源公式如何在没有虚假的局部最小值(“循环跳过”)的情况下产生优化问题,因此可以通过牛顿样局部优化方法有效解决。数据由从因果压力场提取的单个迹线组成,根据线性声学在均匀流体中传播,并在距瞬态点能源的给定距离处记录。源强度(“小波”)被假定为准冲动,时间滞后的零能量大于指定的最大滞后。逆问题是:从记录的跟踪中,恢复具有指定支持的声音速度或缓慢和源源小波,以便数据与规定的RMS相对误差拟合。最小二乘目标函数具有多个大型残留最小化器。扩展的逆问题允许源能量随着时间的流逝而传播,并用加权二次惩罚代替了最大滞后约束。同伴论文表明,要正确选择重量操作员,扩展目标的任何固定点都会产生最小二乘物镜的全局最小化器的良好近似,而最大滞后和假定的噪声水平的倍数则差异很高。本文总结了同伴论文中发展的理论,并提出了数值实验,证明了在具体实例中预测的准确性。我们还展示了如何在迭代优化期间动态调整惩罚量表,以提高缓慢估计的准确性。
Study of a simple single-trace transmission example shows how an extended source formulation of full-waveform inversion can produce an optimization problem without spurious local minima ("cycle skipping"), hence efficiently solvable via Newton-like local optimization methods. The data consist of a single trace extracted from a causal pressure field, propagating in a homogeneous fluid according to linear acoustics, and recorded at a given distance from a transient point energy source. The source intensity ("wavelet") is presumed quasi-impulsive, with zero energy for time lags greater than a specified maximum lag. The inverse problem is: from the recorded trace, recover both the sound velocity or slowness and source wavelet with specified support, so that the data is fit with prescribed RMS relative error. The least-squares objective function has multiple large residual minimizers. The extended inverse problem permits source energy to spread in time, and replaces the maximum lag constraint by a weighted quadratic penalty. A companion paper shows that for proper choice of weight operator, any stationary point of the extended objective produces a good approximation of the global minimizer of the least squares objective, with slowness error bounded by a multiple of the maximum lag and the assumed noise level. This paper summarizes the theory developed in the companion paper and presents numerical experiments demonstrating the accuracy of the predictions in concrete instances. We also show how to dynamically adjust the penalty scale during iterative optimization to improve the accuracy of the slowness estimate.