127 research outputs found

    Verification of the virtual bandwidth SAR (VB-SAR) scheme for centimetric resolution subsurface imaging from space

    Get PDF
    This work presents the first experimental demonstration of the virtual bandwidth synthetic aperture radar (VB-SAR) imaging scheme. VB-SAR is a newly-developed subsurface imaging technique which, in stark contrast to traditional close-proximity ground penetrating radar (GPR) schemes, promises imaging from remote standoff platforms such as aircraft and satellites. It specifically exploits the differential interferometric synthetic aperture radar (DInSAR) phase history of a radar wave within a drying soil volume to generate high- resolution vertical maps of the scattering through the soil volume. For this study, a stack of C-band VV polarisation DInSAR images of a sandy soil containing a buried target was collected in the laboratory whilst the soil moisture was varied - firstly during controlled water addition, and then during subsequent drying. The wetting image set established the moisture-phase relationship for the soil, which was then applied to the drying DInSAR image set using the VB-SAR scheme. This allowed retrieval of high resolution VB-SAR imagery with a vertical discrimination of 0.04m from a stack of 1m vertical resolution DInSAR images. This work unequivocally shows that the basic principles of the VB-SAR technique are valid and opens the door to further investigation of this promising technique

    An evaluation of the performance of multi-static handheld ground penetrating radar using full wave inversion for landmine detection

    Get PDF
    This thesis presents an empirical study comparing the ability of multi-static and bi-static, handheld, ground penetrating radar (GPR) systems, using full wave inversion (FWI), to determine the properties of buried anti-personnel (AP) landmines. A major problem associated with humanitarian demining is the occurrence of many false positives during clearance operations. Therefore, a reduction of the false alarm rate (FAR) and/or increasing the probability of detection (POD) is a key research and technical objective. Sensor fusion has emerged as a technique that promises to significantly enhance landmine detection. This study considers a handheld, combined metal detector (MD) and GPR device, and quantifies the advantages of the use of antenna arrays. During demining operations with such systems, possible targets are detected using the MD and further categorised using the GPR, possibly excluding false positives. A system using FWI imaging techniques to estimate the subsurface parameters is considered in this work.A previous study of multi-static GPR FWI used simplistic, 2D far-field propagation models, despite the targets being 3D and within the near field. This novel study uses full 3D electromagnetic (EM) wave simulation of the antenna arrays and propagation through the air and ground. Full EM simulation allows the sensitivity of radio measurements to landmine characteristics to be determined. The number and configuration of antenna elements are very important and must be optimised, contrary to the 2D sensitivity studies in (Watson, Lionheart 2014, Watson 2016) which conclude that the degree (number of elements) of the multi-static system is not critical. A novel sensitivity analysis for tilted handheld GPR antennas is used to demonstrate the positive impact of tilted antenna orientation on detection performance. A time domain GPR and A-scan data, consistent with a commercial handheld system, the MINEHOUND, is used throughout the simulated experiments which are based on synthetic GPR measurements.Finally, this thesis introduces a novel method of optimising the FWI solution through feature extraction or estimation of the internal air void typically present in pressure activated mines, to distinguish mines from non-mine targets and reduce the incidence of false positives

    Modern GPR Target Recognition Methods

    Full text link
    Traditional GPR target recognition methods include pre-processing the data by removal of noisy signatures, dewowing (high-pass filtering to remove low-frequency noise), filtering, deconvolution, migration (correction of the effect of survey geometry), and can rely on the simulation of GPR responses. The techniques usually suffer from the loss of information, inability to adapt from prior results, and inefficient performance in the presence of strong clutter and noise. To address these challenges, several advanced processing methods have been developed over the past decade to enhance GPR target recognition. In this chapter, we provide an overview of these modern GPR processing techniques. In particular, we focus on the following methods: adaptive receive processing of range profiles depending on the target environment; adoption of learning-based methods so that the radar utilizes the results from prior measurements; application of methods that exploit the fact that the target scene is sparse in some domain or dictionary; application of advanced classification techniques; and convolutional coding which provides succinct and representatives features of the targets. We describe each of these techniques or their combinations through a representative application of landmine detection.Comment: Book chapter, 56 pages, 17 figures, 12 tables. arXiv admin note: substantial text overlap with arXiv:1806.0459

    Investigating Key Techniques to Leverage the Functionality of Ground/Wall Penetrating Radar

    Get PDF
    Ground penetrating radar (GPR) has been extensively utilized as a highly efficient and non-destructive testing method for infrastructure evaluation, such as highway rebar detection, bridge decks inspection, asphalt pavement monitoring, underground pipe leakage detection, railroad ballast assessment, etc. The focus of this dissertation is to investigate the key techniques to tackle with GPR signal processing from three perspectives: (1) Removing or suppressing the radar clutter signal; (2) Detecting the underground target or the region of interest (RoI) in the GPR image; (3) Imaging the underground target to eliminate or alleviate the feature distortion and reconstructing the shape of the target with good fidelity. In the first part of this dissertation, a low-rank and sparse representation based approach is designed to remove the clutter produced by rough ground surface reflection for impulse radar. In the second part, Hilbert Transform and 2-D Renyi entropy based statistical analysis is explored to improve RoI detection efficiency and to reduce the computational cost for more sophisticated data post-processing. In the third part, a back-projection imaging algorithm is designed for both ground-coupled and air-coupled multistatic GPR configurations. Since the refraction phenomenon at the air-ground interface is considered and the spatial offsets between the transceiver antennas are compensated in this algorithm, the data points collected by receiver antennas in time domain can be accurately mapped back to the spatial domain and the targets can be imaged in the scene space under testing. Experimental results validate that the proposed three-stage cascade signal processing methodologies can improve the performance of GPR system

    Integration of ground-penetrating radar and gamma-ray detectors for non-intrusive localisation of buried radioactive sources

    Get PDF
    This thesis reports on the integration of ground-penetrating radar (GPR) and gamma ray detectors to improve the non-intrusive localisation of radioactive wastes buried in porous materials such as soil and concrete. The research was undertaken in two phases. In the first phase, a new non-intrusive technique for retrieving the depth of a buried radioactive source from two-dimensional raster radiation images was developed. The images were obtained by moving a gamma-ray detector in discrete steps on the surface of the material volume in which the source is buried and measuring the gamma spectrum at each step. The depth of the source was then estimated by fitting the intensity values from the measured spectra to an approximate three-dimensional gamma-ray attenuation model. This procedure was first optimised using Monte Carlo simulations and then validated using experiments. The results showed that this method is able to estimate the depth of a 658 kBq caesium-137 point source buried up to 18 cm in each of sand, soil and gravel. However, the use of only gamma-ray data to estimate the depth of the sources requires foreknowledge of the density of the embedding material. This is usually III IV difficult without having recourse to intrusive density estimation methods or historical density values. Therefore, the second phase of the research employed integrated GPR and gamma ray detection to solve this density requirement problem. Firstly, four density models were investigated using a suite of materials and the best model was then used to develop the integration method. Results from numerical simulations showed that the developed integration method can simultaneously retrieve the soil density and the depth and radius of disk-shaped radioactive objects buried up to 20 cm in soil of varying conditions with a elative error of less than 10%. Therefore, the integration method eliminates the need for prior knowledge of the density of the embedding material. This work represents the first time data from these two systems i.e., GPR and gamma-ray detector, will be integrated for the detection and localisation of radioactive sources. Furthermore, the results from the developed methods confirm that an integrated GPR and gamma-ray detector system is a viable tool for non-intrusive localisation of buried radioactive sources. This will enable improved characterisation of buried radioactive wastes encountered during the decommissioning of nuclear sites and facilities

    Design and Applications of Multi-Frequency Holographic Subsurface Radar: Review and Case Histories

    Get PDF
    Holographic subsurface radar (HSR) is not currently in widespread usage. This is due to a historical perspective in the ground-penetrating radar (GPR) community that the high attenuation of electromagnetic waves in most media of interest and the inability to apply time-varying gain to the continuous-wave (CW) HSR signal preclude sufficient effective penetration depth. While it is true that the fundamental physics of HSR, with its use of a CW signal, does not allow amplification of later (i.e., deeper) arrivals in lossy media (as is possible with impulse subsurface radar (ISR)), HSR has distinct advantages. The most important of these is the ability to do shallow subsurface imaging with a resolution that is not possible with ISR. In addition, the design of an HSR system is simpler than for ISR due to the relatively low-tech transmitting and receiving antennae. This paper provides a review of the main principles of HSR through an optical analogy and describes possible algorithms for radar hologram reconstruction. We also present a review of the history of development of systems and applications of the RASCAN type, which is possibly the only commercially available holographic subsurface radar. Among the subsurface imaging and remote sensing applications considered are humanitarian demining, construction inspection, nondestructive testing of dielectric aerospace materials, surveys of historic architecture and artworks, paleontology, and security screening. Each application is illustrated with relevant data acquired in laboratory and/or field experiments

    A generic framework for context-dependent fusion with application to landmine detection.

    Get PDF
    For complex detection and classification problems, involving data with large intra-class variations and noisy inputs, no single source of information can provide a satisfactory solution. As a result, combination of multiple classifiers is playing an increasing role in solving these complex pattern recognition problems, and has proven to be a viable alternative to using a single classifier. Over the past few years, a variety of schemes have been proposed for combining multiple classifiers. Most of these were global as they assign a degree of worthiness to each classifier, that is averaged over the entire training data. This may not be the optimal way to combine the different experts since the behavior of each one may not be uniform over the different regions of the feature space. To overcome this issue, few local methods have been proposed in the last few years. Local fusion methods aim to adapt the classifiers\u27 worthiness to different regions of the feature space. First, they partition the input samples. Then, they identify the best classifier for each partition and designate it as the expert for that partition. Unfortunately, current local methods are either computationally expensive and/or perform these two tasks independently of each other. However, feature space partition and algorithm selection are not independent and their optimization should be simultaneous. In this dissertation, we introduce a new local fusion approach, called Context Extraction for Local Fusion (CELF). CELF was designed to adapt the fusion to different regions of the feature space. It takes advantage of the strength of the different experts and overcome their limitations. First, we describe the baseline CELF algorithm. We formulate a novel objective function that combines context identification and multi-algorithm fusion criteria into a joint objective function. The context identification component thrives to partition the input feature space into different clusters (called contexts), while the fusion component thrives to learn the optimal fusion parameters within each cluster. Second, we propose several variations of CELF to deal with different applications scenario. In particular, we propose an extension that includes a feature discrimination component (CELF-FD). This version is advantageous when dealing with high dimensional feature spaces and/or when the number of features extracted by the individual algorithms varies significantly. CELF-CA is another extension of CELF that adds a regularization term to the objective function to introduce competition among the clusters and to find the optimal number of clusters in an unsupervised way. CELF-CA starts by partitioning the data into a large number of small clusters. As the algorithm progresses, adjacent clusters compete for data points, and clusters that lose the competition gradually become depleted and vanish. Third, we propose CELF-M that generalizes CELF to support multiple classes data sets. The baseline CELF and its extensions were formulated to use linear aggregation to combine the output of the different algorithms within each context. For some applications, this can be too restrictive and non-linear fusion may be needed. To address this potential drawback, we propose two other variations of CELF that use non-linear aggregation. The first one is based on Neural Networks (CELF-NN) and the second one is based on Fuzzy Integrals (CELF-FI). The latter one has the desirable property of assigning weights to subsets of classifiers to take into account the interaction between them. To test a new signature using CELF (or its variants), each algorithm would extract its set of features and assigns a confidence value. Then, the features are used to identify the best context, and the fusion parameters of this context are used to fuse the individual confidence values. For each variation of CELF, we formulate an objective function, derive the necessary conditions to optimize it, and construct an iterative algorithm. Then we use examples to illustrate the behavior of the algorithm, compare it to global fusion, and highlight its advantages. We apply our proposed fusion methods to the problem of landmine detection. We use data collected using Ground Penetration Radar (GPR) and Wideband Electro -Magnetic Induction (WEMI) sensors. We show that CELF (and its variants) can identify meaningful and coherent contexts (e.g. mines of same type, mines buried at the same site, etc.) and that different expert algorithms can be identified for the different contexts. In addition to the land mine detection application, we apply our approaches to semantic video indexing, image database categorization, and phoneme recognition. In all applications, we compare the performance of CELF with standard fusion methods, and show that our approach outperforms all these methods

    Context-dependent fusion with application to landmine detection.

    Get PDF
    Traditional machine learning and pattern recognition systems use a feature descriptor to describe the sensor data and a particular classifier (also called expert or learner ) to determine the true class of a given pattern. However, for complex detection and classification problems, involving data with large intra-class variations and noisy inputs, no single source of information can provide a satisfactory solution. As a result, combination of multiple classifiers is playing an increasing role in solving these complex pattern recognition problems, and has proven to be viable alternative to using a single classifier. In this thesis we introduce a new Context-Dependent Fusion (CDF) approach, We use this method to fuse multiple algorithms which use different types of features and different classification methods on multiple sensor data. The proposed approach is motivated by the observation that there is no single algorithm that can consistently outperform all other algorithms. In fact, the relative performance of different algorithms can vary significantly depending on several factions such as extracted features, and characteristics of the target class. The CDF method is a local approach that adapts the fusion method to different regions of the feature space. The goal is to take advantages of the strengths of few algorithms in different regions of the feature space without being affected by the weaknesses of the other algorithms and also avoiding the loss of potentially valuable information provided by few weak classifiers by considering their output as well. The proposed fusion has three main interacting components. The first component, called Context Extraction, partitions the composite feature space into groups of similar signatures, or contexts. Then, the second component assigns an aggregation weight to each detector\u27s decision in each context based on its relative performance within the context. The third component combines the multiple decisions, using the learned weights, to make a final decision. For Context Extraction component, a novel algorithm that performs clustering and feature discrimination is used to cluster the composite feature space and identify the relevant features for each cluster. For the fusion component, six different methods were proposed and investigated. The proposed approached were applied to the problem of landmine detection. Detection and removal of landmines is a serious problem affecting civilians and soldiers worldwide. Several detection algorithms on landmine have been proposed. Extensive testing of these methods has shown that the relative performance of different detectors can vary significantly depending on the mine type, geographical site, soil and weather conditions, and burial depth, etc. Therefore, multi-algorithm, and multi-sensor fusion is a critical component in land mine detection. Results on large and diverse real data collections show that the proposed method can identify meaningful and coherent clusters and that different expert algorithms can be identified for the different contexts. Our experiments have also indicated that the context-dependent fusion outperforms all individual detectors and several global fusion methods

    Advanced Techniques for Ground Penetrating Radar Imaging

    Get PDF
    Ground penetrating radar (GPR) has become one of the key technologies in subsurface sensing and, in general, in non-destructive testing (NDT), since it is able to detect both metallic and nonmetallic targets. GPR for NDT has been successfully introduced in a wide range of sectors, such as mining and geology, glaciology, civil engineering and civil works, archaeology, and security and defense. In recent decades, improvements in georeferencing and positioning systems have enabled the introduction of synthetic aperture radar (SAR) techniques in GPR systems, yielding GPR–SAR systems capable of providing high-resolution microwave images. In parallel, the radiofrequency front-end of GPR systems has been optimized in terms of compactness (e.g., smaller Tx/Rx antennas) and cost. These advances, combined with improvements in autonomous platforms, such as unmanned terrestrial and aerial vehicles, have fostered new fields of application for GPR, where fast and reliable detection capabilities are demanded. In addition, processing techniques have been improved, taking advantage of the research conducted in related fields like inverse scattering and imaging. As a result, novel and robust algorithms have been developed for clutter reduction, automatic target recognition, and efficient processing of large sets of measurements to enable real-time imaging, among others. This Special Issue provides an overview of the state of the art in GPR imaging, focusing on the latest advances from both hardware and software perspectives
    • …
    corecore