Synthetic aperture radar (SAR) is a remote sensing technology that can truly operate 24/7. It's an all-weather system that can operate at any time except in the most extreme conditions. Coherent change detection (CCD) in SAR can identify minute changes such as vehicle tracks that occur between images taken at different times. From polarimetric SAR capabilities, researchers have developed decompositions that allow one to automatically classify the scattering type in a single polarimetric SAR (PolSAR) image set. We extend that work to CCD in PolSAR images to identify the type change. Such as change caused by no return regions, trees, or ground. This work could then be used as a preprocessor for algorithms to automatically detect tracks.
Fast, accurate and robust automatic target recognition (ATR) in optical aerial imagery can provide game-changing advantages to military commanders and personnel. ATR algorithms must reject non-targets with a high degree of confidence in a world with an infinite number of possible input images. Furthermore, they must learn to recognize new targets without requiring massive data collections. Whereas most machine learning algorithms classify data in a closed set manner by mapping inputs to a fixed set of training classes, open set recognizers incorporate constraints that allow for inputs to be labelled as unknown. We have adapted two template-based open set recognizers to use computer generated synthetic images of military aircraft as training data, to provide a baseline for military-grade ATR: (1) a frequentist approach based on probabilistic fusion of extracted image features, and (2) an open set extension to the one-class support vector machine (SVM). These algorithms both use histograms of oriented gradients (HOG) as features as well as artificial augmentation of both real and synthetic image chips to take advantage of minimal training data. Our results show that open set recognizers trained with synthetic data and tested with real data can successfully discriminate real target inputs from non-targets. However, there is still a requirement for some knowledge of the real target in order to calibrate the relationship between synthetic template and target score distributions. We conclude by proposing algorithm modifications that may improve the ability of synthetic data to represent real data.
As unmanned systems (UMS) proliferate for security and defense applications, autonomous control system capabilities that enable them to perform tactical operations are of increasing interest. These operations, in which UMS must match or exceed the performance and speed of people or manned assets, even in the presence of dynamic mission objectives and unpredictable adversary behavior, are well beyond the capability of even the most advanced control systems demonstrated to date. In this paper we deconstruct the tactical autonomy problem, identify the key technical challenges, and place them into context with the autonomy taxonomy produced by the US Department of Defense's Autonomy Community of Interest. We argue that two key capabilities beyond the state of the art are required to enable an initial fieldable capability: rapid abstract perception in appropriate environments, and tactical reasoning. We summarize our work to date in tactical reasoning, and present initial results from a new research program focused on abstract perception in tactical environments. This approach seeks to apply semantic labels to a broad set of objects via three core thrusts. First, we use physics-based multi-sensor fusion to enable generalization from imperfect and limited training data. Second, we pursue methods to optimize sensor perspective to improve object segmentation, mapping and, ultimately, classification. Finally, we assess the potential impact of using sensors that have not traditionally been used by UMS to perceive their environment, for example hyperspectral imagers, on the ability to identify objects. Our technical approach and initial results are presented.
Except in extreme weather conditions, Synthetic aperture radar (SAR) is a remote sensing technology that can operate day or night. SAR can provide surveillance by making multiple passes over a wide area. For object-based intelligence, it is convenient to use these multiple passes to segment and classify the SAR images into objects that identify various terrains and man-made structures that we call "static-features." Our approach is unique in that we have multiple SAR passes of an area over a long period of time (on the order of weeks). From these many SAR images of the same area, we can combine SAR images from different times to create a variety of SAR products. For example, we introduce a novel SAR image product that captures how different regions decorrelate at different rates. From these many SAR products, we exact superpixels or groups of connected pixels that describe a homogenous region. Using pixels contained within a superpixel we develop a series of one-class classification algorithms using a goodness-of-fit metric that classifies terrains of interest in each SAR product for each superpixel. To combine the results from many SAR products we use P-value fusion. The result is a classification and a confidence about the different classes. To enforce spatial consistency, we represent the confidence labeling of the superpixels as a conditional random field and infer the most likely labeling by maximize the posterior probability of the random field. The result is a colorized SAR image where each color represents a different terrain class.
Coherent change detection (CCD) can indicate subtle scene changes in synthetic aperture radar (SAR) imagery, such as vehicle tracks. Automatic track detection in SAR CCD is difficult due to various sources of low coherence other than the track activity we wish to detect. Existing methods require user cues or explicit modeling of track structure, which limit algorithms' ability to find tracks that do not fit the model. In this paper, we present a track detection approach based on a pixel-level labeling of the image via a conditional random field classifier, with features based on radial derivatives of local Radon transforms. Our approach requires no modeling of track characteristics and no user input, other than a training phase for the unary cost of the conditional random field. Experiments show that our method can successfully detect both parallel and single tracks in SAR CCD as well as correctly declare when no tracks are present.
Coherent change detection (CCD) images, which are prod- ucts of combining two synthetic aperture radar (SAR) images taken at different times of the same scene, can reveal subtle sur- face changes such as those made by tire tracks. These images, however, have low texture and are noisy, making it difficult to au- Tomate track finding. Existing techniques either require user cues and can only trace a single track or make use of templates that are difficult to generalize to different types of tracks, such as those made by motorcycles, or vehicles sizes. This paper presents an approach to automatically identify vehicle tracks in CCD images. We identify high-quality track segments and leverage the con- strained Delaunay triangulation (CDT) to find completion track segments. We then impose global continuity and track smoothness using a binary random field on the resulting CDT graph to determine edges that belong to real tracks. Experimental results show that our algorithm outperforms existing state-of-the- Art techniques in both accuracy and speed.
Synthetic aperture radar (SAR) is a remote sensing technology that can truly operate 24/7. It's an all-weather system that can operate at any time except in the most extreme conditions. By making multiple passes over a wide area, a SAR can provide surveillance over a long time period. For high level processing it is convenient to segment and classify the SAR images into objects that identify various terrains and man-made structures that we call 'static features.' In this paper we concentrate on automatic road segmentation. This not only serves as a surrogate for finding other static features, but road detection in of itself is important for aligning SAR images with other data sources. In this paper we introduce a novel SAR image product that captures how different regions decorrelate at different rates. We also show how a modified Kolmogorov-Smirnov test can be used to model the static features even when the independent observation assumption is violated.
Combining multiple synthetic aperture radar (SAR) images taken at different times of the same scene produces coherent change detection (CCD) images that can detect small surface changes such as tire tracks. The resulting CCD images can be used in an automated approach to identify and label tracks. Existing techniques have limited success due to the noisy nature of these CCD images. In particular, existing techniques require some user cues and can only trace a single track. This paper presents an approach to automatically identify and label multiple tracks in CCD images. We use an explicit objective function that utilizes the Bayesian information criterion to find the simplest set of curves that explains the observed data. Experimental results show that it is capable of identifying tracks under various scenes and can correctly declare when no tracks are present.
Except in the most extreme conditions, Synthetic aperture radar (SAR) is a remote sensing technology that can operate day or night. A SAR can provide surveillance over a long time period by making multiple passes over a wide area. For object-based intelligence it is convenient to segment and classify the SAR images into objects that identify various terrains and man-made structures that we call “static features.” In this paper we introduce a novel SAR image product that captures how different regions decorrelate at different rates. Using superpixels and their first two moments we develop a series of one-class classification algorithms using a goodness-of-fit metric. P-value fusion is used to combine the results from different classes. We also show how to combine multiple one-class classifiers to get a confidence about a classification. This can be used by downstream algorithms such as a conditional random field to enforce spatial constraints.
Current techniques for building detection in Synthetic Aperture Radar (SAR) imagery can be computationally expensive and/or enforce stringent requirements for data acquisition. We present a technique that is effective and efficient at determining an approximate building location from multi-pass single-pol SAR imagery. This approximate location provides focus-of-attention to specific image regions for subsequent processing. The proposed technique assumes that for the desired image, a preprocessing algorithm has detected and labeled bright lines and shadows. Because we observe that buildings produce bright lines and shadows with predetermined relationships, our algorithm uses a graph clustering technique to find groups of bright lines and shadows that create a building. The nodes of the graph represent bright line and shadow regions, while the arcs represent the relationships between the bright lines and shadow. Constraints based on angle of depression and the relationship between connected bright lines and shadows are applied to remove unrelated arcs. Once the related bright lines and shadows are grouped, their locations are combined to provide an approximate building location. Experimental results are presented to demonstrate the outcome of this technique.
Current techniques for building detection in Synthetic Aperture Radar (SAR) imagery can be computationally expensive and/or enforce stringent requirements for data acquisition. The desire is to present a technique that is effective and efficient at determining an approximate building location. This approximate location can be used to extract a portion of the SAR image to then perform a more robust detection. The proposed technique assumes that for the desired image, bright lines and shadows, SAR artifact effects, are approximately labeled. These labels are enhanced and utilized to locate buildings, only if the related bright lines and shadows can be grouped. In order to find which of the bright lines and shadows are related, all of the bright lines are connected to all of the shadows. This allows the problem to be solved from a connected graph viewpoint. Where the nodes are the bright lines and shadows and the arcs are the connections between bright lines and shadows. Constraints based on angle of depression and the relationship between connected bright lines and shadows are applied to remove unrelated arcs. Once the related bright lines and shadows are grouped, their locations are combined to provide an approximate building location. Experimental results are provided showing the outcome of the technique.
A major goal of next-generation physical protection systems is to extend defenses far beyond the usual outer-perimeter-fence boundaries surrounding protected facilities. Mitigation of nuisance alarms is among the highest priorities. A solution to this problem is to create a robust capability to Automatically Recognize Malicious Indicators of intruders. In extended defense applications, it is not enough to distinguish humans from all other potential alarm sources as human activity can be a common occurrence outside perimeter boundaries. Our approach is unique in that it employs a stimulus to determine a malicious intent indicator for the intruder. The intruder's response to the stimulus can be used in an automatic reasoning system to decide the intruder's intent.
We have developed algorithms to automatically learn a detection map of a deployed sensor field for a virtual presence and extended defense (VPED) system without apriori knowledge of the local terrain. The VPED system is an unattended network of sensor pods, with each pod containing acoustic and seismic sensors. Each pod has the ability to detect and classify moving targets at a limited range. By using a network of pods we can form a virtual perimeter with each pod responsible for a certain section of the perimeter. The site's geography and soil conditions can affect the detection performance of the pods. Thus, a network in the field may not have the same performance as a network designed in the lab. To solve this problem we automatically estimate a network's detection performance as it is being installed at a site by a mobile deployment unit (MDU). The MDU will wear a GPS unit, so the system not only knows when it can detect the MDU, but also the MDU's location. In this paper, we demonstrate how to handle anisotropic sensor-configurations, geography, and soil conditions.
Proceedings of SPIE - The International Society for Optical Engineering
Koudelka, Melissa L.; Richards, John A.; Koch, Mark W.
Airborne ground moving-target indication (GMTI) radar can track moving vehicles at large standoff distances. Unfortunately, trajectories from multiple vehicles can become kinematically ambiguous, resulting in confusion between a target vehicle of interest and other vehicles. We propose the use of high range resolution (HRR) radar profiles and multinomial pattern matching (MPM) for target fingerprinting and track stitching to overcome kinematic ambiguities. Sandia's MPM algorithm is a robust template-based identification algorithm that has been applied successfully to various target recognition problems. MPM utilizes a quantile transformation to map target intensity samples to a small number of grayscale values, or quantiles. The algorithm relies on a statistical characterization of the multinomial distribution of the sample-by-sample intensity values for target profiles. The quantile transformation and statistical characterization procedures are extremely well suited to a robust representation of targets for HRR profiles: they are invariant to sensor calibration, robust to target signature variations, and lend themselves to efficient matching algorithms. In typical HRR tracking applications, target fingerprints must be initiated on the fly from a limited number of HRR profiles. Data may accumulate indefinitely as vehicles are tracked, and their templates must be continually updated without becoming unbounded in size or complexity. To address this need, an incrementally updated version of MPM has been developed. This implementation of MPM incorporates individual HRR profiles as they become available, and fuses data from multiple aspect angles for a given target to aid in track stitching. This paper provides a description of the incrementally updated version of MPM.
Gait or an individual's manner of walking, is one approach for recognizing people at a distance. Studies in psychophysics and medicine indicate that humans can recognize people by their gait and have found twenty-four different components to gait that taken together make it a unique signature. Besides not requiring close sensor contact, gait also does not necessarily require a cooperative subject. Using video data of people walking in different scenarios and environmental conditions we develop and test an algorithm that uses shape and motion to identify people from their gait. The algorithm uses dynamic time warping to match stored templates against an unknown sequence of silhouettes extracted from a person walking. While results under similar constraints and conditions are very good, the algorithm quickly degrades with varying conditions such as surface and clothing.
An unattended ground sensor (UGS) that attempts to perform target identification without providing some corresponding estimate of confidence level is of limited utility. In this context, a confidence level is a measure of probability that the detected vehicle is of a particular target class. Many identification methods attempt to match features of a detected vehicle to each of a set of target templates. Each template is formed empirically from features collected from vehicles known to be members of the particular target class. The nontarget class is inherent in this formulation and must be addressed in providing a confidence level. Often, it is difficult to adequately characterize the nontarget class empirically by feature collection, so assumptions must be made about the nontarget class. An analyst tasked with deciding how to use the confidence level of the classifier decision should have an accurate understanding of the meaning of the confidence level given. This paper compares several definitions of confidence level by considering the assumptions that are made in each, how these assumptions affect the meaning, and giving examples of implementing them in a practical acoustic UGS.
Face recognition systems require the ability to efficiently scan an existing database of faces to locate a match for a newly acquired face. The large number of faces in real world databases makes computationally intensive algorithms impractical for scanning entire databases. We propose the use of more efficient algorithms to 'prescreen' face databases, determining a limited set of likely matches that can be processed further to identify a match. We use both radial symmetry and shape to extract five features of interest on 3D range images of faces. These facial features determine a very small subset of discriminating points which serve as input to a prescreening algorithm based on a Hausdorff fraction. We show how to compute the Haudorff fraction in linear O(n) time using a range image representation. Our feature extraction and prescreening algorithms are verified using the FRGC v1.0 3D face scan data. Results show 97% of the extracted facial features are within 10 mm or less of manually marked ground truth, and the prescreener has a rank 6 recognition rate of 100%.
This paper presents a 3D facial recognition algorithm based on the Hausdorff distance metric. The standard 3D formulation of the Hausdorff matching algorithm has been modified to operate on a 2D range image, enabling a reduction in computation from O(N2) to O(N) without large storage requirements. The Hausdorff distance is known for its robustness to data outliers and inconsistent data between two data sets, making it a suitable choice for dealing with the inherent problems in many 3D datasets due to sensor noise and object self-occlusion. For optimal performance, the algorithm assumes a good initial alignment between probe and template datasets. However, to minimize the error between two faces, the alignment can be iteratively refined. Results from the algorithm are presented using 3D face images from the Face Recognition Grand Challenge database version 1.0.
This paper presents a 3D facial recognition algorithm based on the Hausdorff distance metric. The standard 3D formulation of the Hausdorff matching algorithm has been modified to operate on a 2D range image, enabling a reduction in computation from O(N2) to O(N) without large storage requirements. The Hausdorff distance is known for its robustness to data outliers and inconsistent data between two data sets, making it a suitable choice for dealing with the inherent problems in many 3D datasets due to sensor noise and object self-occlusion. For optimal performance, the algorithm assumes a good initial alignment between probe and template datasets. However, to minimize the error between two faces, the alignment can be iteratively refined. Results from the algorithm are presented using 3D face images from the Face Recognition Grand Challenge database version 1.0.
Matching a set of 3D points to another set of 3D points is an important part of any 3D object recognition system. The Hausdorff distance is known for it robustness in the face of obscuration, clutter, and noise. We show how to approximate the 3D Hausdorff fraction with linear time complexity and quadratic space complexity. We empirically demonstrate that the approximation is very good when compared to actual Hausdorff distances.
The sequential probability ratio test (SPRT) minimizes the expected number of observations to a decision and can solve problems in sequential pattern recognition. Some problems have dependencies between the observations, and Markov chains can model dependencies where the state occupancy probability is geometric. For a non-geometric process we show how to use the effective amount of independent information to modify the decision process, so that we can account for the remaining dependencies. Along with dependencies between observations, a successful system needs to handle the unknown class in unconstrained environments. For example, in an acoustic pattern recognition problem any sound source not belonging to the target set is in the unknown class. We show how to incorporate goodness of fit (GOF) classifiers into the Markov SPRT, and determine the worse case nontarget model. We also develop a multiclass Markov SPRT using the GOF concept.
As demonstrated by the anthrax attack through the United States mail, people infected by the biological agent itself will give the first indication of a bioterror attack. Thus, a distributed information system that can rapidly and efficiently gather and analyze public health data would aid epidemiologists in detecting and characterizing emerging diseases, including bioterror attacks. We propose using clusters of adverse health events in space and time to detect possible bioterror attacks. Space-time clusters can indicate exposure to infectious diseases or localized exposure to toxins. Most space-time clustering approaches require individual patient data. To protect the patient's privacy, we have extended these approaches to aggregated data and have embedded this extension in a sequential probability ratio test (SPRT) framework. The real-time and sequential nature of health data makes the SPRT an ideal candidate. The result of space-time clustering gives the statistical significance of a cluster at every location in the surveillance area and can be thought of as a ''health-index'' of the people living in this area. As a surrogate to bioterrorism data, we have experimented with two flu data sets. For both databases, we show that space-time clustering can detect a flu epidemic up to 21 to 28 days earlier than a conventional periodic regression technique. We have also tested using simulated anthrax attack data on top of a respiratory illness diagnostic category. Results show we do very well at detecting an attack as early as the second or third day after infected people start becoming severely symptomatic.