作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2006, Vol. 32 ›› Issue (24): 170-171. doi: 10.3969/j.issn.1000-3428.2006.24.061

• 人工智能及识别技术 • 上一篇    下一篇

数据关联的时序有限自动机模型的建模方法

刘 群,梁 冰   

  1. (哈尔滨工程大学计算机科学技术学院,哈尔滨 150001)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2006-12-20 发布日期:2006-12-20

Modeling Method of Data Association Based on Temporal Finite Automata

LIU Qun, LIANG Bing   

  1. (School of Computer Science and Technology, Harbin Engineering University, Harbin 150001)
  • Received:1900-01-01 Revised:1900-01-01 Online:2006-12-20 Published:2006-12-20

摘要: 介绍了一种用时序自动机为数据关联问题建模的方法,对数据关联问题的研究方法做了新的尝试。目前有多种数据关联算法,对这些方法的分析和评价成为急于解决的问题。鉴于观测信息的时序性,该文以有限自动机(FA)为基础,将时间序列引入到有限自动机中,定义了时序有限自动机(TFA),建立了数据关联(DA)的时序有限自动机模型,用于判断关联算法得到的航迹准确性。

关键词: 数据融合, 数据关联, 时序有限自动机, 有限自动机, 建模

Abstract: This paper suggests a method of temporal finite automata modeling for data association problem. A lot of data association algorithm is proposed, but there is no data association model for the performance evaluation. In order to support temporal observation for data association, timed sequence is introduced to finite automata, and temporal finite automata is defined to model data association problem. This method is applied to validate the veracity of multi-target track.

Key words: Data fusion, Data association, Temporal finite automata(TFA), Finite automata(FA), Modeling