.png){kind=icon}
.png){kind=icon}
Return
GPR Clutter Reduction by Robust Orthonormal Subspace Learning
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2020.2988333.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 & x2013; 48 & x0025; higher performance in terms of PSNR values than the state-of-the-art LRSD methods for an arbitrary parameter choice.
Keywords:
Ground penetrating radar
Clutter
Sparse matrices
Robustness
Minimization
Matrix decomposition
Principal component analysis
Clutter reduction
low rank and sparse matrix decomposition
robust subspace learning
GPR
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.