Recent progress regarding logarithmic Fourier-domain bidirectional deconvolution

Next: No need for preconditioning Up: Fu: Logarithm bi-decon Previous: Fu: Logarithm bi-decon

# Introduction

Usually, a seismic data trace can be defined as a convolution of a wavelet with a reflectivity series . This can be written as , where denotes convolution. Blind deconvolution seeks to estimate the wavelet and reflectivity series using only information contained in the data. Previously, seismic blind deconvolution has used two assumptions, namely whiteness and minimum phase. The whiteness assumption supposes that the reflectivity series has a flat spectrum, while the minimum-phase assumption supposes that the wavelet is causal and has a stable inverse. Recently, some new methods have been proposed to limit the effect of these two assumptions in seismic blind deconvolution.

In Zhang and Claerbout (2010a), the authors proposed to use a hyperbolic penalty function introduced in Claerbout (2009) instead of the conventional L2 norm penalty function to solve the blind deconvolution problem. With this method, a sparseness assumption replaces the traditional whiteness assumption. Furthermore, Zhang and Claerbout (2010b) proposed a new method called ``bidirectional deconvolution'' in order to overcome the minimum-phase assumption. Bidirectional deconvolution assumes that any mixed-phase wavelet can be decomposed into a convolution of two parts, , where is a minimum-phase wavelet and is a maximum-phase wavelet. To solve this problem, they estimated two deconvolution filters, and , which are the inverses of wavelets and , respectively. Since Zhang and Claerbout (2010b) solved the two deconvolution filters and alternately, we call this method the slalom method. Shen et al. (2011a) proposed another method to solve the same problem. They used a linearized approximation to solve the two deconvolution filters simultaneously. We call this method the symmetric method. Fu et al. (2011a) proposed a way to choose an initial solution to overcome the local-minima problem caused by the high nonlinearity of blind deconvolution. Shen et al. (2011b) discussed an important aspect of any inversion problem: preconditioning and how it improves bidirectional deconvolution. All of the aforementioned methods solved the problem in the time domain. Claerbout et al. (2011) proposed a new logarithmic, Fourier-domain, bidirectional deconvolution to solve the same problem. Fu et al. (2011b) showed that this new method converges faster than the above-mentioned time-domain methods

In this paper, I will attempt to answer an important question: Should we use a preconditioner with the logarithmic Fourier-domain bidirectional deconvolution? I will then show an example of including a gain function in this method.

 Recent progress regarding logarithmic Fourier-domain bidirectional deconvolution

Next: No need for preconditioning Up: Fu: Logarithm bi-decon Previous: Fu: Logarithm bi-decon

2012-05-10