Robust Rigid Shape Registration Method Using a Level Set Formulation

Al-Huseiny, Muayed, Mahmoodi, Sasan and Nixon, Mark (2010) Robust Rigid Shape Registration Method Using a Level Set Formulation. At Lecture Notes in Computer Science-6th International Symposium on Visual Computing, Las Vegas, USA, , 252-261.


[img] PDF
Download (221Kb)


This paper presents a fast algorithm for robust registration of shapes implicitly represented by signed distance functions(SDF). 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.

Item Type: Conference or Workshop Item (Speech)
Additional Information: Event Dates: Novemeber 2010
Divisions : Faculty of Physical Sciences and Engineering > Electronics and Computer Science > Southampton Wireless Group
ePrint ID: 271517
Accepted Date and Publication Date:
November 2010Published
Date Deposited: 06 Sep 2010 15:27
Last Modified: 31 Mar 2016 14:19
Further Information:Google Scholar

Actions (login required)

View Item View Item

Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.

View more statistics