Share Email Print

Proceedings Paper

A modified Murty algorithm for multiple hypothesis tracking
Author(s): Zhen (Jack) Ding; David Vandervies
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

In this paper, we present two practical modifications of the original Murty algorithm. First, the algorithm is modified to handle rectangular association matrix. The original Murty algorithm was developed for a square matrix. It is found that the expanding rules should be changed so that the cross-over pair within an assignment can be extended to the last column and can be repeated for the last column upon certain conditions. The second modification is the allowance of an "infeasible" assignment, where some tracks are not assigned with any measurements, therefore, good "infeasible" hypotheses are maintained and clutter seduced hypotheses are suppressed when the information evidence becomes stronger. Examples are used to demonstrate the modifications of the existing Murty algorithm for a practical implementation of an N-best Multiple Hypothesis Tracker.

Paper Details

Date Published: 19 May 2006
PDF: 10 pages
Proc. SPIE 6236, Signal and Data Processing of Small Targets 2006, 62360V (19 May 2006); doi: 10.1117/12.664925
Show Author Affiliations
Zhen (Jack) Ding, Raytheon Canada Ltd. (Canada)
David Vandervies, Raytheon Canada Ltd. (Canada)

Published in SPIE Proceedings Vol. 6236:
Signal and Data Processing of Small Targets 2006
Oliver E. Drummond, Editor(s)

© SPIE. Terms of Use
Back to Top