Point Set Registration With a Hybrid Structure Constraint

Abstract

Due to some unfavorable factors, how to accurately register point sets is still a challenging task. In this paper, an effective point set registration approach is proposed based on a hybrid structure constrain. In the proposed method, a composite weight coefficient is determined based on the amplitudes of the vector and the corresponding projection of neighbor points. Given the composite weight coefficient, a local structure constraint is constructed as a linear combination of the vectors of neighbor points. A Gaussian mixture model is established by utilizing the local structure constraint and a global structure constraint based on the motion coherence theory. In addition, an expectation-maximization algorithm is derived to solve the unknown variables in the proposed model. For the constraint terms, an update strategy is utilized to obtain the approximately optimal weight coefficients. Compared to the state-of-the-art approaches, the proposed model is more robust due to the use of multiple effective constraints. Experimental results on some widely used data sets demonstrate the effectiveness of the proposed model.

Keywords

• Point set registration
• Gaussian mixture model
• structure constraint
• expectation-maximization algorithm