Multiple instance hidden markov models for GPR-based landmine detection
Ground Penetrating Radar (GPR) is a widely used technology for the detection of subsurface buried threats. Although GPR data contains a representation of 3D space, during training, target and false alarm locations are usually only provided in 2D space along the surface of the earth. To overcome uncertainty in target depth location, many algorithms simply extract features from multiple depth regions that are then independently used to make mine/non-mine decisions. A similar technique is employed in hidden Markov models (HMM) based landmine detection. In this approach, sequences of downtrack GPR responses over multiple depth regions are utilized to train an HMM, which learns the probability of a particular sequence of GPR responses being generated by a buried target. However, the uncertainty in object depth complicates learning for discriminating targets/non-targets since features at the (unknown) target depth can be significantly different from features at other depths but in the same volume. To mitigate the negative impact of the uncertainty in object depth, mixture models based on Multiple Instance Learning (MIL) have previously been developed. MIL is also applicable in the landmine detection problem using HMMs because features that are extracted independently from sequences of GPR signals over several depth bins can be viewed as a set of unlabeled time series, where the entire set either corresponds to a buried threat or a false alarm. In this work, a novel framework termed as multiple instance hidden Markov model (MIHMM) is developed. We show that the performance of the proposed approach for discriminating targets from non-targets in GPR data is promising. © 2013 SPIE.
Manandhar, A; Morton, KD; Collins, LM; Torrione, PA
Volume / Issue
Electronic International Standard Serial Number (EISSN)
International Standard Serial Number (ISSN)
International Standard Book Number 13 (ISBN-13)
Digital Object Identifier (DOI)