Search

Ground Penetrating Radar (GPR) is a non-destructive geophysical technique utilizing electromagnetic pulses to detect subsurface material properties. The analysis of regions of interest (ROIs) in GPR images often entails the identification of hyperbolic reflection regions of underground targets through accurate segmentation, a crucial preprocessing step. Currently, this represents a research gap. In the hyperbolic reflection region, manual segmentation not only demands professional expertise but is also time-consuming and error-prone. Automatic segmentation can aid in accurately determining the location and depth of the reflection region, thereby enhancing data interpretation and analysis. This study presents a deep residual Convolutional Neural Network (Res-CNN) that integrates skip connections within an encoder-decoder framework for ROI-binarized hyperbolic segmentation. The proposed framework includes designed downsampling and upsampling modules that facilitate feature computation sharing between these two modules through skip connections within network blocks. In the evaluation of both simple and complex models, our method attained PSNR, SSIM, and FSIM values of 57.1894, 0.9933, and 0.9336, and 58.4759, 0.9958, and 0.9677, respectively. Compared to traditional segmentation methods, the proposed approach demonstrated clearer segmentation results, enabling intelligent and effective identification of the ROI region containing abnormal hyperbolic reflection waves in GPR images. [ABSTRACT FROM AUTHOR]

As a fundamental part of ground penetrating radar (GPR) data processing, reverse time migration (RTM) can correctly position reflection waves and focusing diffraction waves on the proper spatial position. Least-squares reverse-time migration (LSRTM) is widely used in the seismic field for its ability to suppress artifacts and generate high-resolution images in comparison to conventional RTM. However, in the particular case of GPR detection methods, LSRTM is extremely susceptible to aliasing artifacts caused by under-sampling. In pursuit of enhanced precision in underground structure characterization, this paper presents the development of a new LSRTM based on modified total variation (MTV) regularization to improve imaging resolution. Initially, the objective function of LSRTM is derived by combining the Born approximation in 2-D transversal magnetic mode. Next, the adjoint equations and their gradients are solved using the Lagrange multiplier method. The objective function is then constrained by MTV regularization to ensure the precision and convergence of the LSRTM, which delivers a refined edge with reconstruction details. In the numerical experiments, in comparison to the conventional LSRTM method, the LSRTM-MTV algorithm demonstrated a 30.4% increase in computational speed and a 21.1% reduction in mean squared error (MSE). The outperformance of the proposed method is verified in detail through the image resolution and amplitude preservation in the test of synthetic data and laboratory data. Future research efforts will center on applying the proposed method to models featuring dispersive or anisotropic media that closely mimic real-world conditions and extending the application to various imaging techniques involving objective function minimization. [ABSTRACT FROM AUTHOR]

Efficient and accurate simulation of ground penetrating radar (GPR) in the open region helps immensely in both grasping the features of echoes and facilitating the interpretation of real GPR data. Due to the limitation of the computer model, however, the strong artificial boundary reflections, especially the low-frequency propagating waves encountered at the late stage of simulation greatly affect the simulation accuracy of GPR. This paper presents an innovative optimized unsplit-field convolutional perfectly matched layer (UCPML) based on rotated staggered grid (RSG) scheme to truncate the finite-difference time-domain (FDTD) lattices. Rather than obey the sharp variation based on an ${m}$ th-order polynomial, the optimized approach employs a novel optimized term and an adjustment factor to seek a gentle variation on optimal constitutive coefficients. This guarantees that the determination of optimal constitutive coefficients can be less influenced by the order of polynomial and especially, to improve the absorptive performance on low-frequency propagating waves. The calculating efficiency and accuracy of the RSG-FDTD scheme, as well as the absorbing performance of the optimized UCPML, are verified by two numerical examples. In particular, the analysis of the amplitude-frequency features of low-frequency clutters at steady state of the electromagnetic (EM) field and the corresponding global reflection error in the time–frequency domain is also presented. [ABSTRACT FROM AUTHOR]

We introduce a novel implementation of a rotated staggered grid (RSG) finite difference (FD) method based on the unsplit convolutional perfectly matched layer (UCPML). The method is carried out using rotated staggered FD operators and a general complex frequency shifted stretching factor. It can offer a number of advantages over the RSG with split convolutional perfectly matched layer (SCPML), such as improving computational efficiency, overcoming the numerical dispersions resulting from the high-frequency propagation and strong contrasts in material, and specifically absorbing the evanescent modes at grazing incidence. A half-space numerical example with a lossy medium attached demonstrates that large-scale spurious reflections and evanescent modes at grazing incidence are absorbed efficiently by the UCPML in RSG scheme. Meanwhile, the comparison of the reflection error between the proposed algorithm and traditional approaches [using time-dependent reflection error (TDRE) and frequency-dependent reflection error (FDRE)] suggests that the proposed algorithm of RSG provides a preferable improvement in absorbing low-frequency coda wave of evanescent modes, particularly in the lossy medium that possesses inhomogeneous discontinuities. [ABSTRACT FROM PUBLISHER]

The chaos oscillation particle swarm optimization (COPSO) algorithm is prone to binge trapped in the local optima when dealing with certain complex models in ground-penetrating radar (GPR) data inversion, because it inherently suffers from premature convergence, high computational costs, and extremely slow convergence times, especially in the middle and later periods of iterative inversion. Considering that the bilateral connections between different particle positions can improve both the algorithmic searching efficiency and the convergence performance, we first develop a fast single-trace-based approach to construct an initial model for 2-D PSO inversion and then propose a TV-regularization-based improved PSO (TVIPSO) algorithm that employs total variation (TV) regularization as a constraint technique to adaptively update the positions of particles. B by adding the new velocity variations and optimal step size matrices, the search range of the random particles in the solution space can be significantly reduced, meaning blindness in the search process can be avoided. By introducing constraint-oriented regularization to allow the optimization search to move out of the inaccurate region, the premature convergence and blurring problems can be mitigated to further guarantee the inversion accuracy and efficiency. We report on three inversion experiments involving multilayered, fluctuated terrain models and a typical complicated inner-interface model to demonstrate the performance of the proposed algorithm. The results of the fluctuated terrain model show that compared with the COPSO algorithm, the fitness error (MAE) of the TVIPSO algorithm is reduced from 2.3715 to 1.0921, while for the complicated inner-interface model the fitness error (MARE) of the TVIPSO algorithm is reduced from 1.9539 to 1.5674. [ABSTRACT FROM AUTHOR]