Show simple item record

dc.contributor.authorLam, Joseph
dc.contributor.otherQueen's University (Kingston, Ont.). Theses (Queen's University (Kingston, Ont.))en
dc.date2015-01-30 16:06:03.107en
dc.date2015-02-04 14:12:11.215en
dc.date.accessioned2015-02-04T20:00:20Z
dc.date.available2015-02-04T20:00:20Z
dc.date.issued2015-02-04
dc.identifier.urihttp://hdl.handle.net/1974/12728
dc.descriptionThesis (Ph.D, Electrical & Computer Engineering) -- Queen's University, 2015-02-04 14:12:11.215en
dc.description.abstract3D object recognition using depth data remains a difficult problem in computer vision. In this thesis, an object recognition system based on registering repeatable 3D surface segments, termed recognition by registration (RbR) is proposed. The goal is to eliminate the dependency on local geometry for establishing point-to-point correspondences, while maintaining the robust trait of a global technique by applying a pairwise registration process on these individual segments. The extraction of repeatable surface segments is achieved by inheriting the high repeatability of interest points, most often utilized to increase the performance of matching local shape descriptors. Precisely, dense sets of interest points are connected to form the surface segment boundaries by greedily optimizing a smoothness constraint. The reconstructed boundaries provide an effective means to facilitate fast 3D region growing on the object and scene surfaces, forming the 3D interest segments. Pairwise registration of the model and scene interest segments must then consider the imperfectly extracted segments due to data noise, occlusion, and error from the segmentation itself. An adaptation of the robust 4 points congruent sets (4PCS) registration algorithm was shown to register interest segments efficiently with great success. This is achieved by utilizing the prior knowledge of the 3D model interest segments that can be preprocessed, coupled with pose clustering of the retrieved transformation candidates. Experimentally, the interest segment repeatability, registration rate, and the object recognition rate were evaluated using a variety of free-form objects in 3D model data corrupted with synthetic noise and real 2.5D cluttered scenes. It was found that the interest segments are highly repeatable (>80% per top segment per scene), and that they can also be registered successfully within a reasonable number of RANSAC cycle of the 4PCS algorithm. Compared to other state-of-the art local approaches, RbR enjoyed superior object recognition rates in both accurate LiDAR data and noisy Kinect data (on average >90% for all objects tested in both sets of data), demonstrating that the approach provides a very attractive alternate solution to those in the current literature.en_US
dc.languageenen
dc.language.isoenen_US
dc.relation.ispartofseriesCanadian thesesen
dc.rightsThis publication is made available by the authority of the copyright owner solely for the purpose of private study and research and may not be copied or reproduced except as permitted by the copyright laws without written authority from the copyright owner.en
dc.subject3D Segmentationen_US
dc.subjectObject Recognitionen_US
dc.subjectRegistrationen_US
dc.titleObject Recognition by Registration of Repeatable 3D Interest Segmentsen_US
dc.typethesisen_US
dc.description.degreePh.Den
dc.contributor.supervisorGreenspan, Michael A.en
dc.contributor.departmentElectrical and Computer Engineeringen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record