scholarly journals Efficient Wavefield Inversion With Outer Iterations and Total Variation Constraint

2020 ◽  
Vol 58 (8) ◽  
pp. 5836-5846 ◽  
Author(s):  
Chao Song ◽  
Tariq A. Alkhalifah
2020 ◽  
Vol 221 (2) ◽  
pp. 1327-1340
Author(s):  
H S Aghamiry ◽  
A Gholami ◽  
S Operto

SUMMARY Extended formulation of full waveform inversion (FWI), called wavefield reconstruction inversion (WRI), offers potential benefits of decreasing the non-linearity of the inverse problem by replacing the explicit inverse of the wave-equation operator of classical FWI (the oscillating Green functions) with a suitably defined data-driven regularized inverse. This regularization relaxes the wave-equation constraint to reconstruct wavefields that match the data, hence mitigating the risk of cycle skipping. The subsurface model parameters are then updated in a direction that reduces these constraint violations. However, in the case of a rough initial model, the phase errors in the reconstructed wavefields may trap the waveform inversion in a local minimum leading to inaccurate subsurface models. In this paper, in order to avoid matching such incorrect phase information during the early WRI iterations, we design a new cost function based upon phase retrieval, namely a process which seeks to reconstruct a signal from the amplitude of linear measurements. This new formulation, called wavefield inversion with phase retrieval (WIPR), further improves the robustness of the parameter estimation subproblem by a suitable phase correction. We implement the resulting WIPR problem with an alternating-direction approach, which combines the majorization-minimization (MM) algorithm to linearise the phase-retrieval term and a variable splitting technique based upon the alternating direction method of multipliers (ADMM). This new workflow equipped with Tikhonov-Total variation (TT) regularization, which is the combination of second-order Tikhonov and total variation regularizations and bound constraints, successfully reconstructs the 2004 BP salt model from a sparse fixed-spread acquisition using a 3 Hz starting frequency and a homogeneous initial velocity model.


2013 ◽  
Vol 1 ◽  
pp. 200-231 ◽  
Author(s):  
Andrea C.G. Mennucci

Abstract In this paper we discuss asymmetric length structures and asymmetric metric spaces. A length structure induces a (semi)distance function; by using the total variation formula, a (semi)distance function induces a length. In the first part we identify a topology in the set of paths that best describes when the above operations are idempotent. As a typical application, we consider the length of paths defined by a Finslerian functional in Calculus of Variations. In the second part we generalize the setting of General metric spaces of Busemann, and discuss the newly found aspects of the theory: we identify three interesting classes of paths, and compare them; we note that a geodesic segment (as defined by Busemann) is not necessarily continuous in our setting; hence we present three different notions of intrinsic metric space.


2018 ◽  
Vol 8 (4) ◽  
pp. 12
Author(s):  
DEVANAND BHONSLE ◽  
VIVEK KUMAR CHANDRA ◽  
SINHA G. R. ◽  
◽  
◽  
...  

2013 ◽  
Vol 32 (5) ◽  
pp. 1289-1292
Author(s):  
Yuan-yuan GAO ◽  
Yong-feng DIAO ◽  
Yun BIAN

Sensors ◽  
2021 ◽  
Vol 21 (2) ◽  
pp. 591
Author(s):  
Manasavee Lohvithee ◽  
Wenjuan Sun ◽  
Stephane Chretien ◽  
Manuchehr Soleimani

In this paper, a computer-aided training method for hyperparameter selection of limited data X-ray computed tomography (XCT) reconstruction was proposed. The proposed method employed the ant colony optimisation (ACO) approach to assist in hyperparameter selection for the adaptive-weighted projection-controlled steepest descent (AwPCSD) algorithm, which is a total-variation (TV) based regularisation algorithm. During the implementation, there was a colony of artificial ants that swarm through the AwPCSD algorithm. Each ant chose a set of hyperparameters required for its iterative CT reconstruction and the correlation coefficient (CC) score was given for reconstructed images compared to the reference image. A colony of ants in one generation left a pheromone through its chosen path representing a choice of hyperparameters. Higher score means stronger pheromones/probabilities to attract more ants in the next generations. At the end of the implementation, the hyperparameter configuration with the highest score was chosen as an optimal set of hyperparameters. In the experimental results section, the reconstruction using hyperparameters from the proposed method was compared with results from three other cases: the conjugate gradient least square (CGLS), the AwPCSD algorithm using the set of arbitrary hyperparameters and the cross-validation method.The experiments showed that the results from the proposed method were superior to those of the CGLS algorithm and the AwPCSD algorithm using the set of arbitrary hyperparameters. Although the results of the ACO algorithm were slightly inferior to those of the cross-validation method as measured by the quantitative metrics, the ACO algorithm was over 10 times faster than cross—Validation. The optimal set of hyperparameters from the proposed method was also robust against an increase of noise in the data and can be applicable to different imaging samples with similar context. The ACO approach in the proposed method was able to identify optimal values of hyperparameters for a dataset and, as a result, produced a good quality reconstructed image from limited number of projection data. The proposed method in this work successfully solves a problem of hyperparameters selection, which is a major challenge in an implementation of TV based reconstruction algorithms.


Sign in / Sign up

Export Citation Format

Share Document