Fig 1 - uploaded by Joseph N. Wilson
Content may be subject to copyright.
Sweeping pattern of RPA
Source publication
The Region Processing Algorithm (RPA) has been developed by the Office of the Army Humanitarian Demining Research and Development (HD R&D) Program as part of improvements for the AN/PSS-14. The effort was a collaboration between the HD R&D Program, L-3 Communication CyTerra Corporation, University of Florida, Duke University and University of Misso...
Context in source publication
Context 1
... sweeping pattern was very time-consuming, it was decided later to change the sweeping pattern to be 6 times across and 2 times perpendicular to the suspected location. Generating vertical sweeps turned out to be difficult for a human operator, particularly as applied in a live mine field, and it was necessary to refine the sweeping pattern again. Fig. 1 illustrates the sweeping pattern in the latest RPA development effort. It consists of 2 background sweeps that are about 0.5 meters away from the suspected alarm location, and then 10 sweeps across the alarm location. Each swing is about 0.5 meters ...
Similar publications
The main objective of this article is to analyze the evolution of the figure of the
humanitarian intervention since its creation in the early ‘70s to the present. In this
way it would be possible to determine how useful it has become in order to protect
the lives of Yazidis pursued by the Mujahideen belonging to the Islamic State (IS), a
caliphate...
Exposure to conflict and natural disasters poses significant risks to the mental health and psychosocial wellbeing of affected populations. Children and adolescents are particularly vulnerable given that humanitarian emergencies often disrupt the very social institutions, community resources, economic livelihoods, and infrastructural supports that...
Warwick University UK
A transportation network plays a crucial role in delivering emergency goods to people affected by natural and man made disasters. The purpose of emergency goods transportation is to rapidly provide the appropriate emergency supplies to the disaster-struck areas. This requires a systemic coordination to prioritize the allocation of goods to desired...
Citations
... In order to determine the potential usefulness of the proposed method for real world problems, the CAMP algorithm has been tested on landmine detection data. The data was collected using an Electromagnetic Induction (EMI) sensor installed on a handheld landmine detection unit [38]. The response of a target to the EMI sensor depends on the metallic properties of the buried object such as metal content and conductivity. ...
... A higher confidence value means that the probability of the target being a mine is high and vice-versa. A detailed discussion of these features and training of the FOWA system can be found in [38]. We use the CAMP algorithm for prototype-based classification of the EMI data and compare our results with that of the FOWA network. ...
In this paper, a new matching pursuits dissimilarity measure (MPDM) is presented that compares two signals using the information provided by their matching pursuits (MP) approximations, without requiring any prior domain knowledge. MPDM is a flexible and differentiable measure that can be used to perform shape-based comparisons and fuzzy clustering of very high-dimensional, possibly compressed, data. A novel prototype based classification algorithm, which is termed the computer aided minimization procedure (CAMP), is also proposed. The CAMP algorithm uses the MPDM with the competitive agglomeration (CA) fuzzy clustering algorithm to build reliable shape based prototypes for classification. MP is a well known sparse signal approximation technique, which is commonly used for video and image coding. The dictionary and coefficient information produced by MP has previously been used to define features to build discrimination and prototype based classifiers. However, existing MP based classification applications are quite problem domain specific, thus making their generalization to other problems quite difficult. The proposed CAMP algorithm is the first MP based classification system that requires no assumptions about the problem domain and builds a bridge between the MP and fuzzy clustering algorithms. Experimental results also show that the CAMP algorithm is more resilient to outliers in test data than the multilayer perceptron (MLP) and support-vector-machine (SVM) classifiers, as well as prototype-based classifiers using the Euclidean distance as their dissimilarity measure.
Buried explosive hazards (BEHs), including traditional landmines and homemade improvised explosives, have proven difficult to detect and defeat during and after conflicts around the world. Despite their various sizes, shapes and construction material, ground penetrating radar (GPR) is an excellent phenomenology for detecting BEHs due to its ability to sense localized differences in electromagnetic properties. Handheld GPR detectors are common equipment for detecting BEHs because of their flexibility (in part due to the human operator) and effectiveness in cluttered environments. With modern digital electronics and positioning systems, handheld GPR sensors can sense and map variation in electromagnetic properties while searching for BEHs. Additionally, large-scale computers have demonstrated an insatiable appetite for ingesting massive datasets and extracting meaningful relationships. This is no more evident than the maturation of deep learning artificial neural networks (ANNs) for image and speech recognition now commonplace in industry and academia. This confluence of sensing, computing and pattern recognition technologies offers great potential to develop automatic target recognition techniques to assist GPR operators searching for BEHs. In this work deep learning ANNs are used to detect BEHs and discriminate them from harmless clutter. We apply these techniques to a multi-antennae, handheld GPR with centimeter-accurate positioning system that was used to collect data over prepared lanes containing a wide range of BEHs. This work demonstrates that deep learning ANNs can automatically extract meaningful information from complex GPR signatures, complementing existing GPR anomaly detection and classification techniques.
This paper develops an anomaly detection algorithm for subsurface object detection using the handheld ground penetrating radar. The algorithm is based on the Mahalanobis distance measure with adaptive update of the background statistics. It processes the data sequentially for each data sample in a causal manner to generate detection confidences. The algorithm is applied to process the data from two different radars, an impulse and a step-frequency, for performance evaluation.
Symmetric and asymmetric buried explosive hazards (BEHs) present real, persistent, deadly threats on the modern battlefield. Current approaches to mitigate these threats rely on highly trained operatives to reliably detect BEHs with reasonable false alarm rates using handheld Ground Penetrating Radar (GPR) and metal detectors. As computers become smaller, faster and more efficient, there exists greater potential for automated threat detection based on state-of-the-art machine learning approaches, reducing the burden on the field operatives. Recent advancements in machine learning, specifically deep learning artificial neural networks, have led to significantly improved performance in pattern recognition tasks, such as object classification in digital images. Deep convolutional neural networks (CNNs) are used in this work to extract meaningful signatures from 2-dimensional (2-D) GPR B-scans and classify threats. The CNNs skip the traditional "feature engineering" step often associated with machine learning, and instead learn the feature representations directly from the 2-D data. A multi-antennae, handheld GPR with centimeter-accurate positioning data was used to collect shallow subsurface data over prepared lanes containing a wide range of BEHs. Several heuristics were used to prevent over-training, including cross validation, network weight regularization, and "dropout." Our results show that CNNs can extract meaningful features and accurately classify complex signatures contained in GPR B-scans, complementing existing GPR feature extraction and classification techniques.
Matching pursuits is a well known technique for signal representation and has also been used as a feature extractor for some classification systems. However, applications that use matching pursuits (MP) algorithm in their feature extraction stage are quite problem domain specific, making their adaptation for other types of problems quite hard. In this paper we propose a matching pursuits based similarity measure that uses only the dictionary, coefficients and residual information provided by the MP algorithm while comparing two signals. Hence it is easily applicable to a variety of problems. We show that using the MP based similarity measure for competitive agglomerative fuzzy clustering leads to an interesting and novel update equation that combines the standard fuzzy prototype updating equation with a term involving the error between approximated signals and approximated prototypes. The potential value of the similarity measure is investigated using the fuzzy k-nearest prototype algorithm of Frigui for a two-class, signal classification problem. It is shown that the new similarity measure significantly outperforms the Euclidean distance.
