GPR noise suppression algorithm based on compressed parallel non-local mean filtering method

The quality of ground penetrating radar (GPR) data plays an important role in data processing and subsequent geological interpretation. When GPR data is seriously polluted by random noise, the effective signal will be largely masked. Conventional non-local mean (NLM) filtering can suppress random noise effectively, but it is limited in the application of large-scale data processing because of its high computational complexity. In this paper, a GPR noise suppression algorithm based on compressed parallel NLM filtering method is presented. The algorithm is based on data integration and uses data center symmetry to form a data compression algorithm, which reduces the computational complexity. By calculating the standard deviation of similarity, an adaptive filter parameter estimation algorithm is implemented to further improve the denoising effect. By introducing parallel algorithm, the computational efficiency is further improved. In the test of synthetic data, the denoising effect of the proposed method is better than other methods by comparing the mean root square error and the mean signal-to-noise ratio. In the test of real data in Dauphin Island, Alabama, the calculation time of the proposed method is 9.7 seconds, which is significantly better than the conventional NLM filtering algorithm, which verifies the feasibility and effectiveness of the proposed method.

Authors

Institutions

Publication Details

Published
2024-08-23
DOI
https://doi.org/10.1190/gem2024-029.1
Citations
1
Primary Topic
Geophysical Methods and Applications
Type
article
Field-Weighted Citation Impact
0.34
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

GPR noise suppression algorithm based on compressed parallel non-local mean filtering method

Yatong Cui
1 citations
Geophysical Methods and Applications
0.34
article

GPR noise suppression algorithm based on compressed parallel non-local mean filtering method

Yatong Cui
article en
1 citations

Abstract

The quality of ground penetrating radar (GPR) data plays an important role in data processing and subsequent geological interpretation. When GPR data is seriously polluted by random noise, the effective signal will be largely masked. Conventional non-local mean (NLM) filtering can suppress random noise effectively, but it is limited in the application of large-scale data processing because of its high computational complexity. In this paper, a GPR noise suppression algorithm based on compressed parallel NLM filtering method is presented. The algorithm is based on data integration and uses data center symmetry to form a data compression algorithm, which reduces the computational complexity. By calculating the standard deviation of similarity, an adaptive filter parameter estimation algorithm is implemented to further improve the denoising effect. By introducing parallel algorithm, the computational efficiency is further improved. In the test of synthetic data, the denoising effect of the proposed method is better than other methods by comparing the mean root square error and the mean signal-to-noise ratio. In the test of real data in Dauphin Island, Alabama, the calculation time of the proposed method is 9.7 seconds, which is significantly better than the conventional NLM filtering algorithm, which verifies the feasibility and effectiveness of the proposed method.

Tianjin Municipal Engineering Design and Research Institute (CN), Beijing Survey and Design Institute (China) (CN)
Openalex Percentile: Top 42%
Geophysical Methods and Applications
0.34
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.