Extracting Sharp Features from RGB‐D Images

dc.contributor.authorCao, Y‐P.en_US
dc.contributor.authorJu, T.en_US
dc.contributor.authorXu, J.en_US
dc.contributor.authorHu, S‐M.en_US
dc.contributor.editorChen, Min and Zhang, Hao (Richard)en_US
dc.date.accessioned2018-01-10T07:42:44Z
dc.date.available2018-01-10T07:42:44Z
dc.date.issued2017
dc.description.abstractSharp edges are important shape features and their extraction has been extensively studied both on point clouds and surfaces. We consider the problem of extracting sharp edges from a sparse set of colour‐and‐depth (RGB‐D) images. The noise‐ridden depth measurements are challenging for existing feature extraction methods that work solely in the geometric domain (e.g. points or meshes). By utilizing both colour and depth information, we propose a novel feature extraction method that produces much cleaner and more coherent feature lines. We make two technical contributions. First, we show that intensity edges can augment the depth map to improve normal estimation and feature localization from a single RGB‐D image. Second, we designed a novel algorithm for consolidating feature points obtained from multiple RGB‐D images. By utilizing normals and ridge/valley types associated with the feature points, our algorithm is effective in suppressing noise without smearing nearby features.Sharp edges are important shape features and their extraction has been extensively studied both on point clouds and surfaces. We consider the problem of extracting sharp edges from a sparse set of colour‐and‐depth (RGB‐D) images. The noise‐ridden depth measurements are challenging for existing feature extraction methods that work solely in the geometric domain (e.g. points or meshes). By utilizing both colour and depth information, we propose a novel feature extraction method that produces much cleaner and more coherent feature lines. We make two technical contributions. First, we show that intensity edges can augment the depth map to improve normal estimation and feature localization from a single RGB‐D image. Second, we designed a novel algorithm for consolidating feature points obtained from multiple RGB‐D images. By utilizing normals and ridge/valley types associated with the feature points, our algorithm is effective in suppressing noise without smearing nearby features.en_US
dc.description.number8
dc.description.sectionheadersArticles
dc.description.seriesinformationComputer Graphics Forum
dc.description.volume36
dc.identifier.doi10.1111/cgf.13069
dc.identifier.issn1467-8659
dc.identifier.pages138-152
dc.identifier.urihttps://doi.org/10.1111/cgf.13069
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13069
dc.publisher© 2017 The Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectpoint‐based graphics
dc.subjectmodelling
dc.subjectobject scanning/acquisition
dc.subjectI.3.3 [Computer Graphics]: Picture/Image Generation — Digitizing and Scanning I.3.5 [Computer Graphics]: Computational Geometry and Object Modelling — Curve, surface, solid, and object representations
dc.titleExtracting Sharp Features from RGB‐D Imagesen_US
Files
Collections