A method to perform seismic trace interpolation known as the Spitz method handles spatially aliased events. The Spitz method uses the unit-step prediction filter to estimate data spaced at Delta x/2. The missing data are obtained by solving a complex linear system of equations whose unknowns are the coefficients at the interpolated location. We attack this problem by introducing a half-step prediction filter that makes trace interpolation significantly more efficient and easier for implementation. A complex half-step prediction filter at frequency f/2 is computed in the least-squares sense to predict odd data components from even ones. At the frequency f, the prediction operator is shrunk and convolved with the input data spaced at Delta x to predict data at Delta x/2 directly. Instead of solving two systems of linear equations, as proposed by Spitz, only a system for the half-step prediction filter has to be solved. Numerical examples using a marine seismic common-midpoint (CMP) gather and a poststack seismic section were used to illustrate the new interpolation method.
A set of open-source routines capable of identifying possible oil-like spills based on two random forest classifiers were developed and tested with a Sentinel-1 SAR image dataset. The first random forest model is an ocean SAR image classifier where the labeling inputs were oil spills, biological films, rain cells, low wind regions, clean sea surface, ships, and terrain. The second one was a SAR image oil detector named “Radar Image Oil Spill Seeker (RIOSS)”, which classified oil-like targets. An optimized feature space to serve as input to such classification models, both in terms of variance and computational efficiency, was developed. It involved an extensive search from 42 image attribute definitions based on their correlations and classifier-based importance estimative. This number included statistics, shape, fractal geometry, texture, and gradient-based attributes. Mixed adaptive thresholding was performed to calculate some of the features studied, returning consistent dark spot segmentation results. The selected attributes were also related to the imaged phenomena’s physical aspects. This process helped us apply the attributes to a random forest, increasing our algorithm’s accuracy up to 90% and its ability to generate even more reliable results.
Oil spill detection and mapping (OSPM) is an extremely relevant issue from a scientific point of view due to the environmental impact on coastal and marine ecosystems. In this study, we present a new approach to assess scientific literature for the past 50 years. In this sense, our study aims to perform a bibliometric and network analysis using a literature review on the application of OSPM to assess researchers and trends in this field of science. In methodological terms we used the Scopus base to search for articles in the literature, then we used bibliometric tools to access information and reveal quantifying patterns in this field of literature. Our results suggest that the detection of oil in the sea has undergone a great evolution in the last decades and there is a strong relationship between the technological evolution aimed at detection with the improvement of remote sensing data acquisition methods. The most relevant contributions in this field of science involved countries such as China, the United States, and Canada. We revealed aspects of great importance and interest in OSPM literature using a bibliometric and network approach to give a clear overview of this field’s research trends.
Velocity analysis is an essential step in seismic reflection data processing. The conventional and fastest method to estimate how velocity changes with increasing depth is to calculate semblance coefficients. Traditional semblance has two problems: low time and velocity resolution and an inability to handle amplitude variation-with-offset (AVO) phenomenon. Although a method known as the AB semblance can arrive at peak velocities in the areas with an AVO anomaly, it has a lower velocity resolution than conventional semblance. We have developed a weighted AB semblance method that can handle both problems simultaneously. We have developed two new weighting functions to weight the AB semblance to enhance the resolution of velocity spectra in the time and velocity directions. In this way, we increase the time and velocity resolution while eliminating the AVO problem. The first weighting function is defined based on the ratio between the first and the second singular values of the time window to improve the resolution of velocity spectra in velocity direction. The second weighting function is based on the position of the seismic wavelet in the time window, thus enhancing the resolution of velocity spectra in time direction. We use synthetic and field data examples to show the superior performance of our approach over the traditional one.
The Levinson principle generally can be used to compute recursively the solution of linear equations. It can also be used to update the error terms directly. This is used to do single-channel deconvolution directly on seismic data without computing or applying a digital filter. Multichannel predictive deconvolution is used for seismic multiple attenuation. In a standard procedure, the prediction-error filter matrices are computed with a Levinson recursive algorithm, using a covariance matrix of the input data. The filtered output is the prediction errors or the nonpredictable part of the data. Starting with the classical Levinson recursion, wehave derived new algorithms for direct recursive calculationof the prediction errors without computing the data covariance-matrix or computing the prediction-error filters. One algorithm generates recursively the one-step forward and backward prediction errors and the L-step forward prediction error, computing only the filter matrices with the highest index. A numerically more stable algorithm uses reduced QR decomposition or singular-value decomposition (SVD) in a direct recursive computation of the prediction errors without computing any filter matrix. The new, stable, predictive algorithms require more arithmetic operations in the computer, but the computer programs and data flow are much simpler than for standard predictive deconvolution.