dc.contributor.author | Petrelli, Alioscia | en_US |
dc.contributor.author | Di Stefano, Luigi | en_US |
dc.contributor.editor | Chen, Min and Zhang, Hao (Richard) | en_US |
dc.date.accessioned | 2016-09-27T10:02:03Z | |
dc.date.available | 2016-09-27T10:02:03Z | |
dc.date.issued | 2016 | |
dc.identifier.issn | 1467-8659 | |
dc.identifier.uri | http://dx.doi.org/10.1111/cgf.12732 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf12732 | |
dc.description.abstract | Inspired by recent work on robust and fast computation of 3D Local Reference Frames (LRFs), we propose a novel pipeline for coarse registration of 3D point clouds. Key to the method are: (i) the observation that any two corresponding points endowed with an LRF provide a hypothesis on the rigid motion between two views, (ii) the intuition that feature points can be matched based solely on cues directly derived from the computation of the LRF, (iii) a feature detection approach relying on a saliency criterion which captures the ability to establish an LRF repeatably. Unlike related work in literature, we also propose a comprehensive experimental evaluation based on diverse kinds of data (such as those acquired by laser scanners, Kinect and stereo cameras) as well as on quantitative comparison with respect to other methods. We also address the issue of setting the many parameters that characterize coarse registration pipelines fairly and realistically. The experimental evaluation vouches that our method can handle effectively data acquired by different sensors and is remarkably fast.Inspired by recent work on robust and fast computation of 3D Local Reference Frames (LRFs), we propose a novel pipeline for coarse registration of 3D point clouds. Key to the method are: (i) the observation that any two corresponding points endowed with an LRF provide a hypothesis on the rigid motion between two views, (ii) the intuition that feature points can be matched based solely on cues directly derived from the computation of the LRF, (iii) a feature detection approach relying on a saliency criterion which captures the ability to establish an LRF repeatably. | en_US |
dc.publisher | Copyright © 2016 The Eurographics Association and John Wiley & Sons Ltd. | en_US |
dc.subject | computer vision—3D shape registration | |
dc.subject | 3D shape matching | |
dc.subject | 3D local reference frame | |
dc.subject | I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling—Geometric algorithms, languages and systems | |
dc.subject | I.4.3 [Image Processing and Computer Vision]: Enhancement—Registration | |
dc.subject | I.4.6 [Image Processing and Computer Vision]: Segmentation—Edge and feature detection | |
dc.title | Pairwise Registration by Local Orientation Cues | en_US |
dc.description.seriesinformation | Computer Graphics Forum | |
dc.description.sectionheaders | Articles | |
dc.description.volume | 35 | |
dc.description.number | 6 | |
dc.identifier.doi | 10.1111/cgf.12732 | |
dc.identifier.pages | 59-72 | |