Robust rigid shape registration method using a level set formulation

Authors:
Muayed S. Al-Huseiny;Sasan Mahmoodi;Mark S. Nixon
Affiliations:
University of Southampton, School of Electronics and Computer Science, UK;University of Southampton, School of Electronics and Computer Science, UK;University of Southampton, School of Electronics and Computer Science, UK
Venue:
ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
Year:
2010

Citing 6
Cited 1

A survey of image registration techniques

ACM Computing Surveys (CSUR)
Active shape models—their training and application

Computer Vision and Image Understanding
Shape alignment—optimal initial point and pose estimation

Pattern Recognition Letters
Non-rigid registration using distance functions

Computer Vision and Image Understanding - Special issue on nonrigid image registration
Kernel Density Estimation and Intrinsic Alignment for Shape Priors in Level Set Segmentation

International Journal of Computer Vision
Fourier Descriptors for Plane Closed Curves

IEEE Transactions on Computers

Robust similarity registration technique for volumetric shapes represented by characteristic functions

Pattern Recognition

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a fast algorithm for robust registration of shapes implicitly represented by signed distance functions(SDFs). The proposed algorithm aims to recover the transformation parameters( scaling, rotation, and translation) by minimizing the dissimilarity between two shapes. To achieve a robust and fast algorithm, linear orthogonal transformations are employed to minimize the dissimilarity measures. The algorithm is applied to various shape registration problems, to address issues such as topological invariance, shape complexity, and convergence speed and stability. The outcomes are compared with other state-of-the-art shape registration algorithms to show the advantages of the new technique.