A mean field annealing approach to accurate free form shape matching

摘要

The SoftAssign algorithm is an elegant free form shape matching algorithm. While its objective function can be interpreted as consisting of three desired terms: minimising a weighted sum of matching errors of combinations of all the points in the two free form shapes to be matched, equalising their weights (probabilities) of being real ones and also maximising the overlapping area between the free form shapes to be matched, the last term has no effect on the optimisation of the parameters of interest due to normalisation. In this paper, we reformulate the last two terms using the inequality about the geometric and algebraic averages and the sum of the powers of these probabilities. For the sake of computational efficiency, instead of considering combinations of all the points in the overlapping free form shapes to be matched, we employ the traditional closest point criterion to establish possible correspondences between the two overlapping free form shapes to be matched. The saddle point solution of the resulting objective function no longer yields a closed form solution to the parameters of interest. For easy computation, we then adopt a pseudo-linearisation method to linearise the first order derivative of the objective function, leading the parameters of interest to be tracked and estimated with a closed form solution. The parameters of interest are finally optimised using the efficient deterministic annealing scheme with the camera motion parameters estimated using the quaternion method in the weighted least squares sense. A comparative study based on both synthetic data and real images with partial overlap has shown that the proposed algorithm is promising for the automatic matching of overlapping 3D free form shapes subject to a large range of motions.