Tracking multiple targets in cluttered environments with a probabilistic multihypothesis tracker

Darin T. Dunham; Robert G. Hutchins

doi:10.1117/12.277188

23 June 1997 Tracking multiple targets in cluttered environments with a probabilistic multihypothesis tracker

Darin T. Dunham, Robert G. Hutchins

Proceedings Volume 3086, Acquisition, Tracking, and Pointing XI; (1997) https://doi.org/10.1117/12.277188
Event: AeroSense '97, 1997, Orlando, FL, United States

Abstract

Tracking multiple targets in a cluttered environment is extremely difficult. Traditional approaches use simple techniques to determine what are the true measurements by a combination of gating and some form of a nearest neighbor association. As clutter densities increase, these traditional algorithms fail to perform well. To counter this problem, the multi-hypothesis tracking (MHT) algorithm was developed. This approach enumerates almost every conceivable possible combination of measurements to determine the most likely. This process quickly becomes very complex and requires vast amounts of memory in order to store all of the possible tracks. To avoid this complexity, more sophisticated single hypothesis data association techniques have been developed, such as the probabilistic data association filter (PDAF). These algorithms have enjoyed some success but do not take advantage of any future data to help clarify ambiguous situations. On the other hand, the probabilistic multi-hypothesis tracking (PMHT) algorithm, proposed by Streit and Luginbuhl in 1995, attempts to use the best aspects of the MHT and the PDAF. In the PMHT algorithm, data is processed in batches, thereby using information from before and after each measurement to determine the likelihood of each measurement-to-track association. Furthermore, like the PDAF, it does not attempt to make hard assignments or enumerate all possible combinations. but instead associates each measurement with each track based upon its probability of association. Actual performance and initialization of the PMHT algorithm in the presence of significant clutter has not been adequately researched. This study focuses on the performance of the PMHT algorithm in dense clutter and the initialization thereof. In addition, the effectiveness of measurement attribute data is analyzed, especially as it relates to algorithm initialization. Further, it compares the performance of this algorithm to the nearest neighbor, MHT, and PDAF.

Citation Download Citation

Darin T. Dunham and Robert G. Hutchins "Tracking multiple targets in cluttered environments with a probabilistic multihypothesis tracker", Proc. SPIE 3086, Acquisition, Tracking, and Pointing XI, (23 June 1997); https://doi.org/10.1117/12.277188

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available