Abstract
An important step in multi-sensor data fusion is sensor registration, namely, to estimate sensors' range and azimuth biases from their asynchronous measurements. Assuming the target moves in a straight line with an unknown constant velocity, we propose a two-stage nonlinear least square (LS) approach to this problem. More specifically, in stage I, each sensor first estimates its own range bias individually, and then in stage II, all sensors jointly estimate their azimuth biases. We show that both of the nonconvex LS problems can be solved to global optimality under mild conditions. Simulation results show that the root mean square error (RMSE) of the proposed approach is quite close to the Cramér-Rao lower bound (CRLB) when the level of the measurement noise is small.
Original language | English (US) |
---|---|
Title of host publication | 2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - Proceedings |
Publisher | Institute of Electrical and Electronics Engineers Inc. |
Pages | 3271-3275 |
Number of pages | 5 |
ISBN (Electronic) | 9781509041176 |
DOIs | |
State | Published - Jun 16 2017 |
Event | 2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 - New Orleans, United States Duration: Mar 5 2017 → Mar 9 2017 |
Publication series
Name | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
---|---|
ISSN (Print) | 1520-6149 |
Other
Other | 2017 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2017 |
---|---|
Country/Territory | United States |
City | New Orleans |
Period | 3/5/17 → 3/9/17 |
Bibliographical note
Funding Information:This work is partially supported by NSF Grant CCF-1526434, NSFC Grants 61571384, 11631013, and 61601340, the China National Funds for Disti nguished Young Scientists Grant 61525105, and the China Postdoctoral Science Foundation Grant 2016T90890.
Publisher Copyright:
© 2017 IEEE.
Keywords
- Asynchronous multi-sensor registration problem
- nonconvex nonlinear LS
- tightness of semidefinite program (SDP) relaxation