skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information
  1. Building detection in SAR imagery.

    Abstract not provided.
  2. Road Segmentation using Multipass Single-Pol Synthetic Aperture Radar Imagery.

    Abstract not provided.
  3. Superpixel segmentation using multiple SAR image products.

    Abstract not provided.
  4. Biometric Algorithms for 3D Face Recognition.

    Abstract not provided.
  5. Single-Pol Synthetic Aperture Radar Terrain Classification using Multiclass Confidence for One-Class Classifiers

    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 algorithmsmore » 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.« less
  6. Recognition using gait.

    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 templatesmore » 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.« less
  7. Learning a detection map for a network of unattended ground sensors.

    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 themore » 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.« less
  8. Distributed Fusion for Water Quality.

    Abstract not provided.
  9. A novel window based method for approximating the Hausdorff in 3D range imagery.

    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.

Search for:
All Records
Creator / Author
"Koch, Mark William"

Refine by:
Resource Type
Publication Date
Creator / Author
Research Organization