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

Statistics – Machine Learning

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

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.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

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.

Rate now

     

Profile ID: LFWR-SCP-O-717322

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.