A Critical Look at the PMHT

نویسندگان

  • David Frederic Crouse
  • Marco Guerriero
  • Peter Willett
چکیده

We combine concepts from numerous papers to provide a derivation and description of a generalized Probabilistic Multi-Hypothesis Tracker that can track multiple targets in a cluttered environment, utilizing multiple sensors and feature measurements, if available. Additionally, we provide a full derivation of the algorithm, including parts omitted or abbreviated in other work. We also provide an improved analytic solution for the proir target-measurement probabilities (the πs) conditioned on the number of observations, a simplified method of performing the maximization step of the algorithm when multiple sensors are used, a consistent covariance approximation of the algorithm when using multiple sensors, explore the use of deterministic annealing to improve performance and discuss implementation difficulties. Index Terms Tracking, PMHT, EM Algorithm, Fusion 1 OVERVIEW Since its creation by Streit and Luginbuhl in 1993 [60], much research has been done on the Probabilistic Multi-Hypothesis Tracker (PMHT). In this paper, we combine concepts from past works and provide a general version of the PMHT algorithm allowing for tracking in the presence of clutter (false alarms) and missed detections and the utilization of classification data, range rate information and multiple synchronous sensors. This version makes no changes to the basis of the original algorithm, which is the Expectation Maximization (EM) algorithm. As a result, this generalized PMHT algorithm may be used as an improved foundation for other versions of the PMHT that build upon or alter the basis of the algorithm, such as the Multi-Frame Assignment PMHT (MFPMHT) accounting for missed detections by Blanding, Willett, Streit, and Dunham [7]. Being a generalized version of the PMHT, the algorithm Manuscript received April 3, 2009. This research was supported by the Office of Naval Research under contract N00014-07-1-0429, and by Vectraxx, Inc. All authors are with the Department of Electrical and Computer Engineering, University of Connecticut, 371 Fairfield Way, U-2157, Storrs, Connecticut 06269 USA (e-mail: crouse, marco.guerriero, [email protected]) We would like to thank Yaakov Bar-Shalom for his comments.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Corrections to "A Critical Look at the PMHT"

1557-6418/12/$17.00 c ° 2012 JAIF In the above paper [1], a constant was missing from equation (100) for 1⁄4m(n), the simplified form of equation (97) for the prior association probabilities involving hypergeometric functions. Without this constant, the resulting probabilities can be invalid, i.e., negative. This mistake carried through to equation (19) in the body of the text and into the form...

متن کامل

A Critical Look at World English Textbook Evaluation and Its Effects on EFL Pre-intermediate Iranian Learners' Speaking Skill

This research was designed to look at World English textbook evaluation and its effects on EFL pre-intermediate Iranian learners' speaking skill. Thirty male students were selected randomly in Eshtehard language school. They took a pre-test as a proficiency test first to determine their proficiency. To gain this aim, a language proficiency test, i.e., Nelson test was given to the total particip...

متن کامل

On Sequential Track Extraction within the PMHT Framework

Tracking multiple targets in a cluttered environment is a challenging task. Probabilistic multiple hypothesis tracking (PMHT) is an efficient approach for dealing with it. Essentially PMHT is based on expectation-maximization for handling with association conflicts. Linearity in the number of targets and measurements is the main motivation for a further development and extension of this methodo...

متن کامل

Tracking Algorithm Speed Comparisons Between MHT and PMHT

The Probabilistic Multi-Hypothesis Tracker (PMHT) is an emerging tracking algorithm that appears to have the potential to compete with other well-established tracking algorithms. One of the values that the PMHT brings to the tracking problem is its computational efficiency that grows linearly as the number of targets increases, whereas most tracking algorithms increase exponentially as targets ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Adv. Inf. Fusion

دوره 4  شماره 

صفحات  -

تاریخ انتشار 2009