Please use this identifier to cite or link to this item:
https://doi.org/10.1016/j.cviu.2004.10.001
Title: | Efficient partial-surface registration for 3D objects | Authors: | Xiao, G. Ong, S.H. Foong, K.W.C. |
Keywords: | 3D registration 4-Point tuple Clustering Iterative refinement Partial surface Rigidity constraint Statistical properties |
Issue Date: | May-2005 | Citation: | Xiao, G., Ong, S.H., Foong, K.W.C. (2005-05). Efficient partial-surface registration for 3D objects. Computer Vision and Image Understanding 98 (2) : 271-294. ScholarBank@NUS Repository. https://doi.org/10.1016/j.cviu.2004.10.001 | Abstract: | We present a new method for three-dimensional partial-surface registration that utilizes both regional surface properties and shape rigidity constraint to align a partial object surface and its corresponding complete surface. The statistical properties of the vertices on the object surface are first computed and compared with each other to find the initial candidate correspondences. We use the overall object-shape rigidity constraint and a clustering method to obtain an approximation of the transformation parameters while, at the same time, rejecting correspondence outliers. The transformation parameters can be further refined with an iterative approach. The algorithm does not require any feature extraction or initial pose estimation, and is especially applicable when the object surfaces are formed by a large number of vertices, smooth with few salient features, and contain many regionally similar surface patches. Experiments confirm that the proposed scheme can achieve accurate registration results in an efficient manner. © 2004 Elsevier Inc. All rights reserved. | Source Title: | Computer Vision and Image Understanding | URI: | http://scholarbank.nus.edu.sg/handle/10635/55803 | ISSN: | 10773142 | DOI: | 10.1016/j.cviu.2004.10.001 |
Appears in Collections: | Staff Publications |
Show full item record
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.