No Arabic abstract
Forward-looking ground-penetrating radar (FLGPR) has recently been investigated as a remote sensing modality for buried target detection (e.g., landmines). In this context, raw FLGPR data is beamformed into images and then computerized algorithms are applied to automatically detect subsurface buried targets. Most existing algorithms are supervised, meaning they are trained to discriminate between labeled target and non-target imagery, usually based on features extracted from the imagery. A large number of features have been proposed for this purpose, however thus far it is unclear which are the most effective. The first goal of this work is to provide a comprehensive comparison of detection performance using existing features on a large collection of FLGPR data. Fusion of the decisions resulting from processing each feature is also considered. The second goal of this work is to investigate two modern feature learning approaches from the object recognition literature: the bag-of-visual-words and the Fisher vector for FLGPR processing. The results indicate that the new feature learning approaches outperform existing methods. Results also show that fusion between existing features and new features yields little additional performance improvements.
Substantial research has been devoted to the development of algorithms that automate buried threat detection (BTD) with ground penetrating radar (GPR) data, resulting in a large number of proposed algorithms. One popular algorithm GPR-based BTD, originally applied by Torrione et al., 2012, is the Histogram of Oriented Gradients (HOG) feature. In a recent large-scale comparison among five veteran institutions, a modified version of HOG referred to here as gprHOG, performed poorly compared to other modern algorithms. In this paper, we provide experimental evidence demonstrating that the modifications to HOG that comprise gprHOG result in a substantially better-performing algorithm. The results here, in conjunction with the large-scale algorithm comparison, suggest that HOG is not competitive with modern GPR-based BTD algorithms. Given HOGs popularity, these results raise some questions about many existing studies, and suggest gprHOG (and especially HOG) should be employed with caution in future studies.
We address the problem of robot localization using ground penetrating radar (GPR) sensors. Current approaches for localization with GPR sensors require a priori maps of the systems environment as well as access to approximate global positioning (GPS) during operation. In this paper, we propose a novel, real-time GPR-based localization system for unknown and GPS-denied environments. We model the localization problem as an inference over a factor graph. Our approach combines 1D single-channel GPR measurements to form 2D image submaps. To use these GPR images in the graph, we need sensor models that can map noisy, high-dimensional image measurements into the state space. These are challenging to obtain a priori since image generation has a complex dependency on subsurface composition and radar physics, which itself varies with sensors and variations in subsurface electromagnetic properties. Our key idea is to instead learn relative sensor models directly from GPR data that map non-sequential GPR image pairs to relative robot motion. These models are incorporated as factors within the factor graph with relative motion predictions correcting for accumulated drift in the position estimates. We demonstrate our approach over datasets collected across multiple locations using a custom designed experimental rig. We show reliable, real-time localization using only GPR and odometry measurements for varying trajectories in three distinct GPS-denied environments. For our supplementary video, see https://youtu.be/HXXgdTJzqyw.
Multistatic ground-penetrating radar (GPR) signals can be imaged tomographically to produce three-dimensional distributions of image intensities. In the absence of objects of interest, these intensities can be considered to be estimates of clutter. These clutter intensities spatially vary over several orders of magnitude, and vary across different arrays, which makes direct comparison of these raw intensities difficult. However, by gathering statistics on these intensities and their spatial variation, a variety of metrics can be determined. In this study, the clutter distribution is found to fit better to a two-parameter Weibull distribution than Gaussian or lognormal distributions. Based upon the spatial variation of the two Weibull parameters, scale and shape, more information may be gleaned from these data. How well the GPR array is illuminating various parts of the ground, in depth and cross-track, may be determined from the spatial variation of the Weibull scale parameter, which may in turn be used to estimate an effective attenuation coefficient in the soil. The transition in depth from clutter-limited to noise-limited conditions (which is one possible definition of GPR penetration depth) can be estimated from the spatial variation of the Weibull shape parameter. Finally, the underlying clutter distributions also provide an opportunity to standardize image intensities to determine when a statistically significant deviation from background (clutter) has occurred, which is convenient for buried threat detection algorithm development which needs to be robust across multiple different arrays.
The three electromagnetic properties appearing in Maxwells equations are dielectric permittivity, electrical conductivity and magnetic permeability. The study of point diffractors in a homogeneous, isotropic, linear medium suggests the use of logarithms to describe the variations of electromagnetic properties in the earth. A small anomaly in electrical properties (permittivity and conductivity) responds to an incident electromagnetic field as an electric dipole, whereas a small anomaly in the magnetic property responds as a magnetic dipole. Neither property variation can be neglected without justification. Considering radiation patterns of the different diffracting points, diagnostic interpretation of electric and magnetic variations is theoretically feasible but is not an easy task using Ground Penetrating Radar. However, using an effective electromagnetic impedance and an effective electromagnetic velocity to describe a medium, the radiation patterns of a small anomaly behave completely differently with source-receiver offset. Zero-offset reflection data give a direct image of impedance variations while large-offset reflection data contain information on velocity variations.
This research proposes a Ground Penetrating Radar (GPR) data processing method for non-destructive detection of tunnel lining internal defects, called defect segmentation. To perform this critical step of automatic tunnel lining detection, the method uses a CNN called Segnet combined with the Lovasz softmax loss function to map the internal defect structure with GPR synthetic data, which improves the accuracy, automation and efficiency of defects detection. The novel method we present overcomes several difficulties of traditional GPR data interpretation as demonstrated by an evaluation on both synthetic and real datas -- to verify the method on real data, a test model containing a known defect was designed and built and GPR data was obtained and analyzed.