Maximum Likelihood Joint Tracking and Association in a Strong Clutter without Combinatorial Complexity

10/20/2010
by   Leonid I. Perlovsky, et al.
0

We have developed an efficient algorithm for the maximum likelihood joint tracking and association problem in a strong clutter for GMTI data. By using an iterative procedure of the dynamic logic process "from vague-to-crisp," the new tracker overcomes combinatorial complexity of tracking in highly-cluttered scenarios and results in a significant improvement in signal-to-clutter ratio.

READ FULL TEXT
research
10/20/2022

Computing maximum likelihood thresholds using graph rigidity

The maximum likelihood threshold (MLT) of a graph G is the minimum numbe...
research
05/19/2022

Classifying one-dimensional discrete models with maximum likelihood degree one

We propose a classification of all one-dimensional discrete statistical ...
research
09/20/2017

Multi-camera Multi-Object Tracking

In this paper, we propose a pipeline for multi-target visual tracking un...
research
02/24/2021

Maximum Likelihood Constraint Inference from Stochastic Demonstrations

When an expert operates a perilous dynamic system, ideal constraint info...
research
08/08/2021

Multi-Target Tracking with Dependent Likelihood Structures in Labeled Random Finite Set Filters

In multi-target tracking, a data association hypothesis assigns measurem...
research
09/19/2016

The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences

Various applications involve assigning discrete label values to a collec...
research
05/08/2023

CURTAINs Flows For Flows: Constructing Unobserved Regions with Maximum Likelihood Estimation

Model independent techniques for constructing background data templates ...

Please sign up or login with your details

Forgot password? Click here to reset