首页> 外文会议> >Speed-up and detection performance of a nearest-neighbors algorithm for matched-field processing with a vertical line array
【24h】

Speed-up and detection performance of a nearest-neighbors algorithm for matched-field processing with a vertical line array

机译:垂直线阵列匹配场处理的最近邻算法的加速和检测性能

获取原文

摘要

Matched-field processing (MFP) matches measured acoustic fields of an underwater acoustic source against a full set of replica fields filling a volume of ocean in which the detection and localization of the source is desired. Selecting for matching those replica fields that are most like the data, i.e., the nearest-neighbors (NNs) to the data, offers a way of reducing the computational search space. By applying this technique an order of magnitude speedup was obtained. The probability of detection for the Bartlett beamformer, with and without selection of the replicas, was estimated from simulations of noisy data received on a vertical line array at practical time-bandwidth products. To achieve the same detection performance over the search region for four detection criteria with selection required signal-to-noise ratios between 0.2 and 2.0 dB higher than without selection for the same false alarm probability.
机译:匹配场处理(MFP)将水下声源的测得的声场与填充了一定体积的海洋的全套复制场进行匹配,在其中需要对声源进行检测和定位。选择以匹配最类似于数据的那些副本字段,即与数据的最近邻居(NN),提供了一种减少计算搜索空间的方式。通过应用该技术,获得了数量级的加速。通过对在实际时间带宽乘积下在垂直线阵列上接收到的噪声数据的仿真,可以估算出选择和不选择副本时Bartlett波束形成器的检测概率。为了在四个检测标准的搜索区域上实现相同的检测性能,并且对于相同的误报概率,选择所需的信噪比要比不选择时高0.2至2.0 dB。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号