Efficient 3D shape registration by using distance maps and stochastic gradient descent method

Polycarp Omondi Okock, Jozef Urban, Karol Mikula

Abstract


This paper presents an efficient 3D shape registration by using distance maps and stochastic gradient descent method. The proposed algorithm aims to find the optimal affine transformation parameters (translation, scaling and rotation) that maps two distance maps to each other. These distance maps represent the shapes as an interface and we apply level sets methods to calculate the signed distance to these interfaces. To maximize the similarity between the two distance maps, we apply sum of squared difference (SSD) optimization and gradient descent methods to minimize it. To address the shortcomings of the standard gradient descent method i.e. many iterations to compute the minimum, we implemented the stochastic gradient descent method. The outcome of these two methods are compared to show the advantages of using stochastic gradient descent method. In addition we implement computational optimization’s such as parallelization to speed up the registration process


Full Text:

 Subscribers Only


DOI: https://doi.org/10.2478/tmmp-2020-0006