GPR Clutter Reduction by Robust Orthonormal Subspace Learning

Deniz Kumlu*, Isin Erer

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

18 Citations (Scopus)

Abstract

The clutter severely decreases the target visibility, thus the detection rates in ground penetrating radar (GPR) systems. Recently proposed robust principal component analysis (RPCA) based clutter removal method decomposes the GPR image into its low rank and sparse parts corresponding to clutter and target components. Motivated by its encouraging results, many lower complexity low rank and sparse decomposition (LRSD) methods such as go decomposition (GoDec) or robust non-negative matrix factorization (RNMF) have been applied to GPR. This paper proposes a new clutter reduction method using robust orthonormal subspace learning (ROSL). The raw GPR image is decomposed into its clutter and target parts via ROSL. The proposed method is faster than the popular RPCA. Although it has similar complexity, and similar performance with GoDec and RNMF for fine tuned parameters of these methods, the proposed method does not require any presetting of the algorithm parameters. Its performance remains independent for a broad range parameter value. Results demonstrate that the proposed method achieves 14-48% higher performance in terms of PSNR values than the state-of-the-art LRSD methods for an arbitrary parameter choice.

Original languageEnglish
Article number9069272
Pages (from-to)74145-74156
Number of pages12
JournalIEEE Access
Volume8
DOIs
Publication statusPublished - 2020

Bibliographical note

Publisher Copyright:
© 2013 IEEE.

Keywords

  • Clutter reduction
  • GPR
  • low rank and sparse matrix decomposition
  • robust subspace learning

Fingerprint

Dive into the research topics of 'GPR Clutter Reduction by Robust Orthonormal Subspace Learning'. Together they form a unique fingerprint.

Cite this