Performance bounds for sensor registration

B. Ristic1, N. Okello2, Hwa-Tung Ong1
1ISR Division, DSTO Australia, Edinburgh, SA, Australia
2CSSIP, University of Melbourne, Edinburgh, Australia

Tóm tắt

This paper explores the subject of Cramer-Rao lower bounds for unbiased sensor registration algorithms. Two Cartesian coordinate systems are considered: a two-dimensional regional plane for tactical surveillance and the Earth-centred-Earth-fixed (ECEF) coordinates for wide area surveillance. The theoretical performance bound is of fundamental importance both for algorithm performance assessment and for the prediction of best achievable performance given target and sensor location, and number and accuracy of measurements. The performance of the iterative least-squares registration algorithm, obtained by Monte Carlo simulations, is compared to the theoretical bounds.

Từ khóa

#Surveillance #Iterative algorithms #Australia #Sensor systems #Azimuth #Target tracking #Error correction #Degradation #Coordinate measuring machines #Radar measurements

Tài liệu tham khảo

10.1109/RADAR.1995.522564 kay, 1993, Statistical Signal Processing Estimation Theory farrell, 1998, The Global Positioning System and Inertial Navigation leung, 1995, Comparison of registration error correction techniques for air surveillance radar network, Proc SPIE, 2561, 498, 10.1117/12.217682 dana, 1990, Registration: A prerequisite for multiple sensor tracking, Chapter 3 in Multitarget-Multisensor Tracking Advanced Applications, 155 10.1016/0020-0255(94)90006-X graybill, 1976, Theory and Application of the Linear Model drummond, 1995, Feedback in track fusion without process noise, Proc SPIE, 2561, 369, 10.1117/12.217722 frankel, 1995, Multisensor tracking of ballistic targets, Proc SPIE, 2561, 337, 10.1117/12.217709 blackman, 1999, Design and Analysis of Modern Tracking Systems 10.1109/7.766925 10.1002/0471221279 farina, 1985, Radar Data Processing