Registration of 2D Points Using Geometric Algebra and Tensor Voting

In this paper, we present a novel algorithm that combines the power of expression of Geometric Algebra with the robustness of Tensor Voting to find the correspondences between two sets of 2D points with an underlying rigid transformation. Unlike other popular algorithms for point registration (like the Iterated Closest Points), our algorithm does not require an initialization, works equally well with small and large transformations between the data sets, performs even in the presence of large amounts of outliers (90% and more), and have less chance to be trapped in “local minima”. Furthermore, we will show how this algorithm can be easily extended to account for multiple overlapping motions and certain non-rigid transformations. Keywords Geometric algebra · Tensor voting · Computer vision

• Type: Journal
• Year: 2010
• Where: JMIV
• Authors: Leo Reyes-Lozano, Gérard G. Medioni, Eduardo Bayro-Corrochano
• Keywords: Algorithm, Geometric Algebra, Iterated Closest Points, JMIV 2010