Statistics – Machine Learning
Scientific paper
2010-10-20
Statistics
Machine Learning
13 pages
Scientific paper
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.
Deming Ross W.
Perlovsky Leonid I.
No associations
LandOfFree
Maximum Likelihood Joint Tracking and Association in a Strong Clutter without Combinatorial Complexity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Maximum Likelihood Joint Tracking and Association in a Strong Clutter without Combinatorial Complexity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Maximum Likelihood Joint Tracking and Association in a Strong Clutter without Combinatorial Complexity will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-717322