Paper
4 May 2016 Target detection in GPR data using joint low-rank and sparsity constraints
Author Affiliations +
Abstract
In ground penetrating radars, background clutter, which comprises the signals backscattered from the rough, uneven ground surface and the background noise, impairs the visualization of buried objects and subsurface inspections. In this paper, a clutter mitigation method is proposed for target detection. The removal of background clutter is formulated as a constrained optimization problem to obtain a low-rank matrix and a sparse matrix. The low-rank matrix captures the ground surface reflections and the background noise, whereas the sparse matrix contains the target reflections. An optimization method based on split-Bregman algorithm is developed to estimate these two matrices from the input GPR data. Evaluated on real radar data, the proposed method achieves promising results in removing the background clutter and enhancing the target signature.
© (2016) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Abdesselam Bouzerdoum, Fok Hing Chi Tivive, and Canicious Abeynayake "Target detection in GPR data using joint low-rank and sparsity constraints", Proc. SPIE 9857, Compressive Sensing V: From Diverse Modalities to Big Data Analytics, 98570A (4 May 2016); https://doi.org/10.1117/12.2228345
Lens.org Logo
CITATIONS
Cited by 6 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
General packet radio service

Target detection

Algorithm development

Optimization (mathematics)

Principal component analysis

Filtering (signal processing)

Matrices

Back to Top