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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Performance bounds for sensor registration


    Contributors:
    Ristic, B. (author) / Okello, N. (author) / Hwa-Tung Ong, (author)


    Publication date :

    2002-01-01


    Size :

    718401 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Performance Bounds for Sensor Registration

    Ristic, B. / Okello, N. / Ong, H.-T. et al. | British Library Conference Proceedings | 2002


    Online Sensor Registration

    Vermaak, J. / Maskell, S. / Briers, M. et al. | British Library Conference Proceedings | 2005


    Sensor registration using airlanes

    Hwa-Tung Ong, / Ristic, B. / Oxenham, M.G. | IEEE | 2002


    SENSOR ID REGISTRATION SYSTEM

    TAKEUCHI SEIJI | European Patent Office | 2019

    Free access

    Sensor Registration Using Airlanes

    Ong, H.-T. / Ristic, B. / Oxenham, M. et al. | British Library Conference Proceedings | 2002