Inverting Incomplete Fourier Transforms by a Sparse Regularization Model and Applications in Seismic Wavefield Modeling

06/10/2022
by   Tingting Wu, et al.
0

We propose a sparse regularization model for inversion of incomplete Fourier transforms and apply it to seismic wavefield modeling. The objective function of the proposed model employs the Moreau envelope of the ℓ_0 norm under a tight framelet system as a regularization to promote sparsity. This model leads to a non-smooth, non-convex optimization problem for which traditional iteration schemes are inefficient or even divergent. By exploiting special structures of the ℓ_0 norm, we identify a local minimizer of the proposed non-convex optimization problem with a global minimizer of a convex optimization problem, which provides us insights for the development of efficient and convergence guaranteed algorithms to solve it. We characterize the solution of the regularization model in terms of a fixed-point of a map defined by the proximity operator of the ℓ_0 norm and develop a fixed-point iteration algorithm to solve it. By connecting the map with an α-averaged nonexpansive operator, we prove that the sequence generated by the proposed fixed-point proximity algorithm converges to a local minimizer of the proposed model. Our numerical examples confirm that the proposed model outperforms significantly the existing model based on the ℓ_1-norm. The seismic wavefield modeling in the frequency domain requires solving a series of the Helmholtz equation with large wave numbers, which is a computationally intensive task. Applying the proposed sparse regularization model to the seismic wavefield modeling requires data of only a few low frequencies, avoiding solving the Helmholtz equation with large wave numbers. Numerical results show that the proposed method performs better than the existing method based on the ℓ_1 norm in terms of the SNR values and visual quality of the restored synthetic seismograms.

READ FULL TEXT

page 24

page 27

page 28

research
12/15/2014

Fixed Point Algorithm Based on Quasi-Newton Method for Convex Minimization Problem with Application to Image Deblurring

Solving an optimization problem whose objective function is the sum of t...
research
08/23/2013

Group-Sparse Signal Denoising: Non-Convex Regularization, Convex Optimization

Convex optimization with sparsity-promoting convex regularization is a s...
research
10/04/2018

Seamless Parametrization with Arbitrarily Prescribed Cones

Seamless global parametrization of surfaces is a key operation in geomet...
research
05/19/2021

Trilevel and Multilevel Optimization using Monotone Operator Theory

We consider rather a general class of multi-level optimization problems,...
research
04/10/2023

Approximate Primal-Dual Fixed-Point based Langevin Algorithms for Non-smooth Convex Potentials

The Langevin algorithms are frequently used to sample the posterior dist...
research
02/10/2020

Anderson Acceleration Using the H^-s Norm

Anderson acceleration (AA) is a technique for accelerating the convergen...
research
08/03/2023

Versatile Time-Frequency Representations Realized by Convex Penalty on Magnitude Spectrogram

Sparse time-frequency (T-F) representations have been an important resea...

Please sign up or login with your details

Forgot password? Click here to reset