تبديل فوريه ضد نشت (ALFT) و كاربرد آن براي بازسازي داده‌هاي لرزه‌اي

Anti-leakage Fourier transform (ALFT) and its application for seismic data reconstruction

معمولاً در مراحل گوناگون پردازش داده هاي لرزه اي، فرض بر آن است كه اين داده ها به‌صورت منظم در راستاي مكان و زمان نمونه برداري شده اند. اما اغلب در عمل به علت محدوديت هاي دسترسي در منطقه مورد بررسي و نقص دستگاهي، اين فرض صادق نيست. از اين‌رو محاسبه طيف بسامدي سيگنال هايي با نمونه برداري نامنظم و بازسازي آن روي يك شبكه با نمونه-برداري منظم، يكي از مهم‌ترين بحث هاي رايج در پردازش سيگنال بشمار مي‌‌رود. در متن حاضر ضمن معرفي الگوريتم تبديل فوريه ضد نشت، از آن براي حذف نشت بسامدي ناشي از پنجره كردن داده‌‌ها و نمونه برداري نامنظم، استفاده و طيف بسامدي سيگنال را با دقت زيادي محاسبه مي كنيم. با استفاده از طيف بسامدي به‌دست آمده مي توان سيگنال را روي هر شبكه منظم دلخواهي بازسازي كرد. تبديل فوريه ضد نشت الگوريتمي تكراري است كه در هر تكرار تبديل فوريه گسسته سيگنال را محاسبه مي كند. در هر تكرار، بزرگ‌ترين ضريب فوريه انتخاب و روي شبكه نمونه‌برداري شده در حوزه t-x برگردانده و از سيگنال ورودي كسر مي‌شود. اين عمل تا زماني كه انرژي سيگنال باقي‌مانده به مقدار آستانه از قبل تعيين شده برسد، روي سيگنال باقي‌مانده تكرار مي‌‌شود. در اين مقاله الگوريتم تبديل فوريه ضد نشت در حوزه F-X بر برش هاي بسامد زماني داده هاي لرزه اي اِعمال شده و هر بسامد روي شبكه دلخواه، بازسازي مي شود. روش معرفي شده، داده هاي لرزه اي كاملاً نامنظم و داده هاي لرزه اي منظم با ردلرزه گم شده را با دقت زيادي بازسازي مي كند. در مورد داده هاي لرزه اي با نمونه‌برداري نزديك به منظم نيز با اِعمال يك ماسك ضد دگرنامي مي‌توان رويدادهاي با شيب بسيار تند را بازسازي كرد. كارايي روش روي داده هاي لرزه اي مصنوعي و واقعي ارزيابي، و نتايج آن عرضه شده است.

Discrete Fourier Transform (DFT) is the basic part of various algorithms of signal processing in many fields of science and technology. For analysis of signals with DFT, the length of discrete signal must be finite so signal to be analyzed must be divided to some windows. Consequently, spectrum leakage appears in frequency domain. Energy leakage of DFT spectrum can also occur due to non-uniform sampling in time or spatial domain and usually is more serious. The leakage can hide smaller spikes among actual spectrum and is an important factor that affects spectrum estimation. In practice, we should try to reduce the energy leakage of DFT spectrum to improve the resolution of frequency spectrum. For evenly sampled signals, suppressing approaches of spectrum leakage are diverse; most common method among them is windowing method. Study on how to suppress spectrum leakage of non-uniform Fourier transform is important both in theory and practice. Here we introduce and apply an anti leakage Fourier transform (ALFT) algorithms for suppressing spectrum leakage of non-uniform Fourier transform, improving the resolution of temporal frequency spectrum or spatial wave number spectrum. One of the areas of study that has the same problem is seismic exploration technology. Seismic data sets are generally irregularly sampled in inline midpoints, cross-line midpoints, offset and azimuth. This irregular sampling can limit the effectiveness of high end 3D de-multiple and imaging algorithms such as 3D surface related multiple elimination, wave equation pre-stack depth migration and many other processes. To overcome this issue, it is common in seismic data processing to use regularization and interpolation. Interpolation processes fill the missing traces and regularization transfer traces from their irregular recorded location to locations on a regular grid. We apply ALFT for seismic data interpolation and regularization that leads to reconstruction of seismic data on a regular grid. ALFT is an iterative algorithm that acts on frequency slices and reconstruct each temporal frequency spectrum along spatial dimensions. For an input data with N_p known samples, the original algorithm of ALFT can be performed as follow: 1- Computing Fourier components of the data using equation 1. f ?^(m+1) (k)=1/?X ?_(l=1)^Np??w(x_l ) f^m (x_l ) e^(-2?ikx_(l ) ) ?, (1) 2- Selecting the largest coefficient and adding it to the precomputed coefficients. 3- Updating data by subtracting the contribution of selected coefficient (equation 2) from input data (equation 3). f^k (x_l )=f ?_(k_p ) e^(2?ik_p x_l ) , (2) f^(m+1) (x_l )=f^m (x_l )-f^k (x_l ) , (3) 4- Iterating steps 2 and 3 until reaching the threshold. The idea of ALFT is simple and intuitive: first seismic data will be transformed to f -x domain, by applying DFT the f -k spectrum of data will be estimated. The largest Fourier coefficient is selected and subtracted from the input data. In the subsequent iterations, successive maximum components are subtracted until the norm of the residual is negligible. This iterative processes is able to recover a sparse spectrum that, when evaluated at sampling points, approximates regularly sampled data. This method relies on the common assumption that sparsely sampled data can be represented by a few Fourier components. ALFT can handle pure non-uniform seismic data and uniform seismic data with gap and missing traces. For regular data sets, by applying an anti-alias mask ALFT can handle steep dips. Generalization of ALFT to higher dimensions is simple and straightforward and for high dimension data ALFT can reconstruct very sparse data sets. Performance of the method was tested on both synthetic and real seismic data. We applied ALFT algorithm to reconstruction of synthetic and real seismic data sets. The results show the effectiveness of ALFT in interpolation and regularization of input data on any desired regular sampling grid. Compared to those interpolation methods that use FFT, ALFT has a slow procedure. However, computing the DFT’s in small windows of data sets, greatly reduces the computational cost of the algorithm. On the other hand, when the input data sets are sampled on a regular grid which has missing traces or gaps, one can use FFT instead of DFT to compute Fourier transform. ALFT reconstruction method suffers much less from edge effects and gibs phenomenon. The sequence of computing Fourier coefficients from maximum energy to minimum energy, and subtraction of contribution of them from remained data, plays a key rule in ALFT algorithm.