Deghosting in multipassive acoustic sensors

Rong Yang; Gee Wah Ng

doi:10.1117/12.538724

12 April 2004 Deghosting in multipassive acoustic sensors

Rong Yang, Gee Wah Ng

Proceedings Volume 5434, Multisensor, Multisource Information Fusion: Architectures, Algorithms, and Applications 2004; (2004) https://doi.org/10.1117/12.538724
Event: Defense and Security, 2004, Orlando, Florida, United States

Abstract

In this paper, we describe a deghosting algorithm in multiple passive acoustic sensor environment. In a passive acoustic sensor system, a target is detected by its bearing to the sensor, and the target location is obtained from triangulation of bearings on different sensors. However, in multi-passive sensor and multi-target scenario, triangulation is difficult. This is because multi-target triangulation results in a number of ghost targets being generated. In order to remove the triangulating ghosts, the deghosting technique is essential to distinguish the true targets from the ghost targets. We suggest a deghosting algorithm by applying Bayes’ theorem and the likelihood function on the acoustic signals. A probability related to acoustic signal on each triangulating point is recursively computed and updated at every time stamp or frame. The triangulating point will be classified as a true target, once its probability exceeds a predefined threshold. Furthermore, acoustic signal has propagation delay. The situation yields the triangulating location biased to the bearing of the nearest sensor. In our algorithm, the propagation delay problem is solved by matching the histories of bearing tracks, and yields the unbiased location that has similar emitting times for the sensors contributing to the triangulation point. The emitting times can be derived from detecting times and propagation delays. Performance result is presented on simulation data.

Citation Download Citation

Rong Yang and Gee Wah Ng "Deghosting in multipassive acoustic sensors", Proc. SPIE 5434, Multisensor, Multisource Information Fusion: Architectures, Algorithms, and Applications 2004, (12 April 2004); https://doi.org/10.1117/12.538724

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