Share Email Print
cover

Proceedings Paper

Using data compression for buried hazard detection
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Ground penetrating radar (GPR) based detection systems have used a variety of different features and machine learning methods to identify buried hazards and distinguish them from clutter and other objects. In this study, we describe a new feature extraction method based on Kolmogorov complexity and information theory. In particular, a three dimensional subset of GPR data centered at alarm location is partitioned into two-dimensional non-overlapping cells. Then, each cell is compressed using gzip and a feature vector is formed from the file sizes of the compressed cells. Finally, an SVM classifier is trained on compression features. The proposed method is applied to data acquired from outdoor test sites containing over 3800 buried hazards, including nonmetal and low-metal targets. The performance is measured by use of ROC curves and compared against four algorithms. These algorithms are based on geometric features and are fused with a powered geometric mean method. The compression-based algorithm outperforms the other individual methods. We also tested different fusion algorithms involving combinations of these five algorithms. The best combination, the product of compression algorithm and two of the others, dominates the current state of the art solution by a significant margin.

Paper Details

Date Published: 3 May 2017
PDF: 8 pages
Proc. SPIE 10182, Detection and Sensing of Mines, Explosive Objects, and Obscured Targets XXII, 101820T (3 May 2017); doi: 10.1117/12.2262563
Show Author Affiliations
Ferit Toska, Univ. of Florida (United States)
Joseph N. Wilson, Univ. of Florida (United States)


Published in SPIE Proceedings Vol. 10182:
Detection and Sensing of Mines, Explosive Objects, and Obscured Targets XXII
Steven S. Bishop; Jason C. Isaacs, Editor(s)

© SPIE. Terms of Use
Back to Top