TY - GEN
T1 - Optimal asynchronous multi-sensor registration in 3 dimensions
AU - Jiang, Shunan
AU - Pu, Wenqiang
AU - Luo, Zhi Quan
PY - 2019/2/20
Y1 - 2019/2/20
N2 - The success of multi-sensor data fusion requires an important step called sensor registration, which involves estimating sensor biases from sensors' asynchronous measurements. There are two difficulties in the bias estimation problem: one is the unknown target states which serve as the nuisance variables in the estimation problem, the other is the highly nonlinear coordinate transformation between sensors' local and common coordinate frames. In this work, we focus on the 3-dimensional scenario and propose a new nonlinear least squares (LS) formulation which avoids estimating target states. The proposed LS formulation eliminates the target states by exploiting the nearly-constant velocity property of the target motion. To address the intrinsic nonlinearity, we propose a block coordinate descent (BCD) scheme for solving the formulation which alternately updates various bias estimates. Specifically, semidefinite relaxation technique is introduced to handle the nonlinearity brought by angle biases. Furthermore, two BCD algorithms with different block picking rules are proposed. Finally, the effectiveness and the efficiency of the proposed BCD algorithms are demonstrated in the numerical simulation section.
AB - The success of multi-sensor data fusion requires an important step called sensor registration, which involves estimating sensor biases from sensors' asynchronous measurements. There are two difficulties in the bias estimation problem: one is the unknown target states which serve as the nuisance variables in the estimation problem, the other is the highly nonlinear coordinate transformation between sensors' local and common coordinate frames. In this work, we focus on the 3-dimensional scenario and propose a new nonlinear least squares (LS) formulation which avoids estimating target states. The proposed LS formulation eliminates the target states by exploiting the nearly-constant velocity property of the target motion. To address the intrinsic nonlinearity, we propose a block coordinate descent (BCD) scheme for solving the formulation which alternately updates various bias estimates. Specifically, semidefinite relaxation technique is introduced to handle the nonlinearity brought by angle biases. Furthermore, two BCD algorithms with different block picking rules are proposed. Finally, the effectiveness and the efficiency of the proposed BCD algorithms are demonstrated in the numerical simulation section.
KW - Block coordinate descent algorithm
KW - Nonlinear least squares
KW - Semidefinite relaxation
KW - Sensor registration problem
UR - http://www.scopus.com/inward/record.url?scp=85063091798&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85063091798&partnerID=8YFLogxK
U2 - 10.1109/GlobalSIP.2018.8646342
DO - 10.1109/GlobalSIP.2018.8646342
M3 - Conference contribution
AN - SCOPUS:85063091798
T3 - 2018 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2018 - Proceedings
SP - 81
EP - 85
BT - 2018 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2018 - Proceedings
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE Global Conference on Signal and Information Processing, GlobalSIP 2018
Y2 - 26 November 2018 through 29 November 2018
ER -