Abstract

ABSTRACTGround‐penetrating radar (GPR) is commonly used to detect buried and near‐surface geophysical structures. GPR denoising is necessary because some level of interference, such as from clutter, random noise and/or the column artefact, are inevitable and can cause false geological interpretations. Existing sparse representation methods, including wavelet transformation, curvelet transformation and dictionary learning, are critical in GPR denoising. However, they perform poorly in some cases because GPR data cannot be represented efficiently under severe interference. Thus, this study proposes an approach that combines shearlet transformation (ST) and a data‐driven tight frame (DDTF) to improve data sparsity. The ST can provide the prior information of GPR data to the DDTF, while the DDTF can self‐adaptively represent GPR data. First, we separate significant reflections and interferences using ST. Second, we apply the DDTF to further suppress the interferences by setting different thresholds in different ST scales and directions. Finally, we adopt inverse transformations to recover the GPR data. In the experiments, ST is used to show the differences between the significant reflections and interferences of the synthetic GPR data. We also sequentially remove each interference of the synthetic GPR data to clearly highlight the performance of the method. To ensure the effectiveness of the ST‐DDTF approach, we test the method using synthetic GPR data from different models, along with some example field GPR data. The ST‐DDTF method, which is aimed at improving data sparsity, shows state‐of‐the‐art results relative to more standard GPR denoising methods. Although our approach is time consuming, it is useful in processing small GPR data and obtaining accurate denoising results.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.