.png){kind=icon}
.png){kind=icon}
Return
Improved Clutter Removal in GPR by Robust Nonnegative Matrix Factorization
.png){kind=icon}
PRE
AI
DOI：10.1109/LGRS.2019.2937749.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The clutter encountered in the ground-penetrating radar (GPR) system severely decreases the visibility of subsurface objects, thus highly degrading the performance of the target detection algorithms. This letter presents a new clutter removal method based on nonnegative matrix factorization (NMF). The raw GPR data are represented as the sum of low-rank and sparse matrices, which correspond to the clutter and target components, respectively. The low-rank and sparse decomposition is performed using a robust version of NMF called RNMF. Although similar to the robust principal component analysis (PCA) (RPCA), which is recently widely used in image processing applications as well as in GPR, the proposed method is faster and has enhanced results. The state-of-the-art clutter removal methods, morphological component analysis (MCA), RPCA, besides the conventional PCA, have been included for comparison for both simulated and real data sets. The visual and quantitative results demonstrate that the proposed RNMF method outperforms the others. Moreover, it is 25 times faster than the RPCA for the given regularization parameter values.
Keywords:
Clutter
Matrix decomposition
Ground penetrating radar
Sparse matrices
Principal component analysis
Antenna accessories
Clutter removal
ground-penetrating radar (GPR)
low-rank and sparse matrix decomposition
nonnegative matrix decomposition
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
16.4
Papers:
1.0W
Citations:
5.1K