In multiple target tracking (MTT), track splitting algorithms are computationally intensive because several filters have to be run when branching occurs, and the outputs of these filters have to be compared for similarity calculations. Within a transputer network implementation of a tracking algorithm, each processor performs these calculations making it necessary to circulate track information around the network. During this pipeline-like process, the similarity calculations across the transputers tend to produce a system bottleneck. The author overcomes this problem by presenting a clustering algorithm which avoids the need for similarity calculations between transputers.
Clustering algorithm for transputer implementation of a target tracker
Cluster-Algorithmus für Transputer-Implementierung eines Target-Tracker
IEE Colloquium on 'Transputer Applications' ; No.129 ; 7/1-7/5
1989
, 6 Quellen
Conference paper
English
Implementation of a transputer-based flight controller
Tema Archive | 1988
|Implementation of a transputer-based flight controller
Tema Archive | 1990
|Transputer Implementation of an Adaptive Algorithm of Signal Detection on a Sequence of Images
British Library Online Contents | 1996
|Implementation and Analysis of Target Tracker in Fire Control System
British Library Conference Proceedings | 1998
|