Critical Angle for Optimal Correlation Assignment to Control Memory and Computational Load Requirements in a Densely Populated Target Environment
The research presents a simulation study on the performance of a target tracker using a critical angle selection technique for optimal correlation assignment of a target track with the incoming observation(s) for the track splitting filter (TSF) algorithm. In a typical TSF all the observations falling inside a likelihood ellipse are used for update. However, our proposed optimal correlation procedure TSF algorithm uses only those observations for track update that fall within the critical angle sector made inside the prediction ellipse. This kind of approach is particularly important if the computational and memory requirements are limited relative to the amount of input data (number of objects) that can potentially saturate the system.
Previous performance work  has been done on specific (deterministic) scenarios. One of the reasons for considering the specific scenarios, which were normally crossing targets, was to test the efficiency of the track splitting algorithm. This approach gives a measure of performance for a specific, possibly unrealistic scenario. However, such investigation procedures help in designing tracking systems that can select high-value targets based on particular attributes.
In order to develop procedures that would enable a more general performance assessment compared with deterministic scenarios, our study adopted a random target motion scenario. Its implementation for testing the proposed technique using a track splitting Kalman filter algorithm is investigated. A number of performance parameters that give the activity profile of the tracking scenario are also investigated. This kind of performance evaluation can provide in-depth knowledge of tracking activity for developing possibly better and more appropriate target tracking systems. The complete prototype system is implemented using a TMS320C6416 digital signal processor (DSP).
KeywordsCritical Angle Target Tracking Digital Signal Processor Neighboring Target Tracking Scenario
Unable to display preview. Download preview PDF.
- 1.D.P. Atherton, E. Gul, A. Kountzeris, and M. Kharbouch (1990) Tracking multiple targets using parallel processing. Proceedings of IEE, Part D, No. 4, July, pp. 225-234.Google Scholar
- 3.D.P. Atherton and C. Deacon (1985) Tracking studied of two crossing targets. IFAC Identification and System Parameter Estimation Symposium, University of York, July, pp. 637-642.Google Scholar
- 5.S.S. Blackman (1986) Multiple-target tracking with radar applications. Artech House, Dedham, MA.Google Scholar
- 6.M. Kharbouch (1991) Some investigations on target tracking. PhD thesis, Sussex University.Google Scholar
- 7.D.M. Akbar Hussain (2003) Tracking multiple objects using modified track-measurement assignment weight approach for data association, INMIC-2003, International Multi-topic Conference, December 08-09, Islamabad, Pakistan.Google Scholar
- 8.D.M. Akbar Hussain, Michael Durrant, and Jeff Dionne (2001) Exploiting the computational re-sources of a programmable DSP micro-processor (Micro Signal Architecture MSA) in the field of multiple target tracking. SHARC International DSP Conference 2001, September 10-11, Northeastern University, Boston.Google Scholar
- 9.D.P. Atherton, D.M.A. Hussain, and E. Gul (1991) Target tracking using transputers as parallel processors. 9th IFAC Symposium on Identification and system Parameter Estimation, Budapest, Hungary, July.Google Scholar