一種可遞歸和并行實現(xiàn)的快速JPDA算法
A RECURSIVE AND PARALLEL FAST JPDA ALGORITHM
-
摘要: 聯(lián)合概率數(shù)據(jù)關(guān)聯(lián)算法是密集雜波環(huán)境下一種良好的多目標(biāo)數(shù)據(jù)關(guān)聯(lián)跟蹤算法。計算量爆炸效應(yīng)一直是該算法的一個難題。本文提出一種基于分層構(gòu)造關(guān)聯(lián)事件的快速算法,層次間的搜索具有遞歸性并可以獨立進(jìn)行,因而可以并行實現(xiàn)。文中還將本文的方法跟有關(guān)文獻(xiàn)方法作了比較,并且給出相應(yīng)的計算機(jī)仿真實驗和結(jié)果。
-
關(guān)鍵詞:
- 概率; 數(shù)據(jù)關(guān)聯(lián)和跟蹤; 快速算法
Abstract: Joint Probabilistic Data Association (JPDA) is a very fine optimal multitarget tracking and association algorithm in clutter. However, the calculation explosion effect in computation of association probabilities has been a difficulty. This paper will propose a method based on layered searching construction of association hypothesis events. According to the method, the searching schedule of the association events between two layers can be recursive and with independence, so it can also be implemented in parallel structure. Comparative analysis of the method with relative methods in other references and corresponding computer simulation tests and results are also given in the paper. -
Bar-shalom Y, Blackman T E. Tracking and Data Association. New York: Academic Press, 1988.[2]Blackman S S. Multiple Target Tracking with Radar Applications. Delham, MA: Artech House, 1986.[3]Fitzgerald R J. Development of practical PDA logic for tracking by microprocessor. Proceedings of American Controls Conference. Seattle, WA: June 1986, 889-898.[4]Roecker J A. A class of near optimal JPDA algorithms. IEEE Trans. on AES, 1994, AES-30(2): 504-510.[5]Zhou B, Bose N K. Multitarget tracking in clutter: Fast algorithm for data association. IEEE Trans. on AES, 1993, AES-29(2): 352-363.[6]James L F, David P C. Fast JPDA multitarget tracking algorithm. Applied Optics, 1989, 28(2) 371-376.[7]Houles A, Bar-shalomY. Multisensor tracking of a maneuvering target in clutter. IEEE Trans.[8]on AES, 1989, AES-25(2): 176-189. -
計量
- 文章訪問數(shù): 2545
- HTML全文瀏覽量: 133
- PDF下載量: 511
- 被引次數(shù): 0
下載:
