Improved Clutter Removal in GPR by Robust Nonnegative Matrix Factorization

Deniz Kumlu, Isin Erer*

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

71 Citations (Scopus)

Abstract

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.

Original languageEnglish
Article number8836507
Pages (from-to)958-962
Number of pages5
JournalIEEE Geoscience and Remote Sensing Letters
Volume17
Issue number6
DOIs
Publication statusPublished - Jun 2020

Bibliographical note

Publisher Copyright:
© 2019 IEEE.

Keywords

  • Clutter removal
  • ground-penetrating radar (GPR)
  • low-rank and sparse matrix decomposition
  • nonnegative matrix decomposition

Fingerprint

Dive into the research topics of 'Improved Clutter Removal in GPR by Robust Nonnegative Matrix Factorization'. Together they form a unique fingerprint.

Cite this