Characterization of binary string statistics for syntactic landmine detection

Ahmed O. Nasif; Brian L. Mark; Kenneth J. Hintz

doi:10.1117/12.884282

23 May 2011 Characterization of binary string statistics for syntactic landmine detection

Ahmed O. Nasif, Brian L. Mark, Kenneth J. Hintz

Proceedings Volume 8017, Detection and Sensing of Mines, Explosive Objects, and Obscured Targets XVI; 80171N (2011) https://doi.org/10.1117/12.884282
Event: SPIE Defense, Security, and Sensing, 2011, Orlando, Florida, United States

Abstract

Syntactic landmine detection has been proposed to detect and classify non-metallic landmines using ground penetrating radar (GPR). In this approach, the GPR return is processed to extract characteristic binary strings for landmine and clutter discrimination. In our previous work, we discussed the preprocessing methodology by which the amplitude information of the GPR A-scan signal can be effectively converted into binary strings, which identify the impedance discontinuities in the signal. In this work, we study the statistical properties of the binary string space. In particular, we develop a Markov chain model to characterize the observed bit sequence of the binary strings. The state is defined as the number of consecutive zeros between two ones in the binarized A-scans. Since the strings are highly sparse (the number of zeros is much greater than the number of ones), defining the state this way leads to fewer number of states compared to the case where each bit is defined as a state. The number of total states is further reduced by quantizing the number of consecutive zeros. In order to identify the correct order of the Markov model, the mean square difference (MSD) between the transition matrices of mine strings and non-mine strings is calculated up to order four using training data. The results show that order one or two maximizes this MSD. The specification of the transition probabilities of the chain can be used to compute the likelihood of any given string. Such a model can be used to identify characteristic landmine strings during the training phase. These developments on modeling and characterizing the string statistics can potentially be part of a real-time landmine detection algorithm that identifies landmine and clutter in an adaptive fashion.

Citation Download Citation

Ahmed O. Nasif, Brian L. Mark, and Kenneth J. Hintz "Characterization of binary string statistics for syntactic landmine detection", Proc. SPIE 8017, Detection and Sensing of Mines, Explosive Objects, and Obscured Targets XVI, 80171N (23 May 2011); https://doi.org/10.1117/12.884282

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available

Members: $17.00

Non-members: $21.00 ADD TO CART

PROCEEDINGS
9 PAGES

DOWNLOAD PAPER SAVE TO MY LIBRARY

GET CITATION

RIGHTS & PERMISSIONS

Get copyright permission Get copyright permission on Copyright Marketplace

KEYWORDS

Land mines

Mining

General packet radio service

Binary data

Quantization

Data modeling

Statistical modeling

Show All Keywords

Keywords/Phrases

Search In:

Publication Years