Share Email Print
cover

Proceedings Paper

Efficient multiple layer boundary detection in ground-penetrating radar data using an extended Viterbi algorithm
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In landmine detection using vehicle-mounted ground-penetrating radar (GPR) systems, ground tracking has proven to be an eective pre-processing step. Identifying the ground can aid in the correction of distortions in downtrack radar data, which can result in the reduction of false alarms due to ground anomalies. However, the air-ground interface is not the only layer boundary detectable by GPR systems. Multiple layers can exist within the ground, and these layers are of particular importance because they give rise to anomalous signatures below the ground surface, where target signatures will typically reside. In this paper, an ecient method is proposed for performing multiple ground layer-identication in GPR data. The method is an extension of the dynamic programming-based Viterbi algorithm, nding not only the globally optimal path, which can be associated with the ground surface, but also locally optimal paths that can be associated with distinct layer boundaries within the ground. In contrast with the Viterbi algorithm, this extended method is uniquely suited to detecting not only multiple layers that span the entire antenna array, but also layers that span only a subset of the channels of the array. Furthermore, it is able to accomplish this while retaining the ecient nature of the original Viterbi scheme.

Paper Details

Date Published: 10 May 2012
PDF: 13 pages
Proc. SPIE 8357, Detection and Sensing of Mines, Explosive Objects, and Obscured Targets XVII, 83571X (10 May 2012); doi: 10.1117/12.921236
Show Author Affiliations
Brandon Smock, Univ. of Florida (United States)
Joseph Wilson, Univ. of Florida (United States)


Published in SPIE Proceedings Vol. 8357:
Detection and Sensing of Mines, Explosive Objects, and Obscured Targets XVII
J. Thomas Broach; John H. Holloway, Editor(s)

© SPIE. Terms of Use
Back to Top