Result: An accelerated IMM JPDA algorithm for tracking multiple manoeuvring targets in clutter

Title:
An accelerated IMM JPDA algorithm for tracking multiple manoeuvring targets in clutter
Authors:
BOJILOV, Ljudmil V, ALEXIEV, Kiril M, KONSTANTINOVA, Pavlina D
Source:
NMA 2002 : numerical methods and applications (Borovets, 20-24 August 2002, revised papers)Lecture notes in computer science. :274-282
Publisher Information:
Berlin: Springer, 2003.
Publication Year:
2003
Physical Description:
print, 6 ref
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Informatique théorique, Theoretical computing, Algorithmique. Calculabilité. Arithmétique ordinateur, Algorithmics. Computability. Computer arithmetics, Cible multiple, Multiple target, Blanco múltiple, Fouillis écho, Clutter, Confusión eco, Méthode combinatoire, Combinatorial method, Método combinatorio, Méthode numérique, Numerical method, Método numérico, Pistage, Tracking, Rastreo, Poursuite cible, Target tracking, Association donnée prpbabiliste conjointe, Interacting multiple model
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Central Laboratory for Parallel Processing, Bulgarian Academy of Sciences, Acad. G. Bonchev Str., Bl. 25-A, 1113 Sofia, Bulgaria
ISSN:
0302-9743
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=14780401
Rights:
Copyright 2003 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.14780401
Database:
PASCAL Archive

Further Information

Theoretically the most powerful approach for tracking multiple targets is known to be Multiple Hypothesis Tracking (MHT) method. The MHT method, however, leads to combinatorial explosion and computational overload. By using an algorithm for finding the K-best assignments, MHT approach can be considerably optimized in terms of computational load. A much simpler alternative of MHT approach can be the Joint Probabilistic Data Association (JPDA) algorithm combined with Interacting Multiple Models (IMM) approach. Even though it is much simpler, this approach can overwhelm computations as well. To overcome this drawback an algorithm due to Murty and optimized by Miller, Stone and Cox is embedded in IMM-JPDA algorithm for determining a ranked set of K-best hypotheses instead of all feasible hypotheses. The presented algorithm assures continuous maneuver detection and adequate estimation of manoeuvring targets in heavy clutter. This affects in a good target tracking performance with limited computational and memory requirements. The corresponding numerical results are presented.