Robust and Fast Shape Registration Method based on Signed Distance Functions
Al-Huseiny, Muayed, Mahmoodi, Sasan and Nixon, Mark (2010) Robust and Fast Shape Registration Method based on Signed Distance Functions. Pattern Recognition (Submitted).
Full text not available from this repository.
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 based on phase correlation and statistical shape moments to compute the registration parameters individually. The algorithm proposed here is applied to various registration problems including medical applications, to address issues such as registration of shapes with various topologies, registration of complex shapes containing various numbers of sub-shapes, applicability to databases, accuracy, convergence speed and stability. The outcomes are compared with other state-of-the-art shape registration algorithms and collectively suggest the advantages of the new technique.
|Divisions:||Faculty of Physical and Applied Science > Electronics and Computer Science > Comms, Signal Processing & Control
|Date Deposited:||09 Sep 2010 16:13|
|Last Modified:||01 Mar 2012 12:04|
|Contributors:||Al-Huseiny, Muayed (Author)
Mahmoodi, Sasan (Author)
Nixon, Mark (Author)
|Further Information:||Google Scholar|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)