AN EFFICIENT PIECEWISE MATCHED-FIELD TRACKING ALGORITHM

PDF

Authors
  1. Wilmut, M.J.
  2. Ozard, J.M.
  3. O'Keefe, K.
  4. Musil, M.
Corporate Authors
Defence Research Establishment Atlantic, Dartmouth NS (CAN);Royal Military Coll of Canada, Kingston ONT (CAN) Dept of Mathematics and Computer Science
Abstract
Efficient matched-field tracking (MFT) algorithms have been successfully applied to both simulated and measured data to determine the most likely positions of a sound souce that is localized ambiguously by a matched-field processing (MFP) system. They have been used to track sources moving linearly or on a circular path at constant speed and heading. The input to the trackers is a set of ambiguity surfaces, contiguous in time, generated by MFP. These algorithms assume that the track start and end times are known a priori; this restriction is removed in the Piecewise MFT algorithm (PTA). In a series of simulations it is shown that the statistically significant tracks, including their unknown start and end times, can be found with a mean absolute error equal to the time covered by 3 or fewer ambiguity surfaces, depending on the propagation and provided the track signal-to-noise ratio is greater than 13. The PTA was applied to measured data collected during the PACIFIC SHELF 93 trial to successfully identify the significant source track segments.
Date of publication
01 Jul 1997
Number of Pages
21
DSTKIM No
98-00047
CANDIS No
506552
Format(s):
Hardcopy;Document Image stored on Optical Disk

Permanent link

Document 1 of 1

Date modified: