Gate size for sequential most-probable-hypothesis tracking

Oliver E. Drummond

doi:10.1117/12.179105

6 July 1994 Gate size for sequential most-probable-hypothesis tracking

Oliver E. Drummond

Proceedings Volume 2235, Signal and Data Processing of Small Targets 1994; (1994) https://doi.org/10.1117/12.179105
Event: SPIE's International Symposium on Optical Engineering and Photonics in Aerospace Sensing, 1994, Orlando, FL, United States

Abstract

The choice of gate size depends on the type of data association algorithm used and the optimization criteria. A prior well known analysis has presented a practical gate size for tracking approaches that sequentially select the most probable hypothesis. This paper revisits that analysis and presents an alternate approach. The intent of the gate sizing in this paper is to design the largest gate that eliminates any observation from the gate whose hypothesis probability is less than the null hypothesis probability. A study of the two approaches to sizing a gate reveals a dilemma and inconsistencies that under further scrutiny are resolved for reasonable conditions by decomposing the null hypothesis into two hypotheses.

Citation Download Citation

Oliver E. Drummond "Gate size for sequential most-probable-hypothesis tracking", Proc. SPIE 2235, Signal and Data Processing of Small Targets 1994, (6 July 1994); https://doi.org/10.1117/12.179105

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