Al-Huseiny, Muayed, Mahmoodi, Sasan and Nixon, Mark
Robust Rigid Shape Registration Method Using a Level Set Formulation
At Lecture Notes in Computer Science-6th International Symposium on Visual Computing, United States.
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.
Conference or Workshop Item
||Event Dates: Novemeber 2010
|Venue - Dates:
||Lecture Notes in Computer Science-6th International Symposium on Visual Computing, United States, 2010-11-01
||Southampton Wireless Group
||06 Sep 2010 15:27
||17 Apr 2017 18:13
|Further Information:||Google Scholar|
Actions (login required)