Chapter 32

Surface registration by markers guided nonrigid iterative closest points algorithm

Dominik Spinczyk    Faculty of Biomedical Engineering, Silesian University of Technology, Zabrze, Poland

Abstract

The problem of matching irregular surfaces was tested with additional markers as landmarks for the extension of the nonrigid iterative closest points algorithm. The general idea of presented approach was to take into account knowledge about markers' positions not only in computing transformation phase but also in finding correspondence phase in every algorithm's iteration. Four variants of retrieving correspondence were implemented and compared: the Euclidean distance, normal vectors with initial rigid registration, static and dynamic ...

Get Emerging Trends in Image Processing, Computer Vision and Pattern Recognition now with O’Reilly online learning.

O’Reilly members experience live online training, plus books, videos, and digital content from 200+ publishers.