Show simple item record

dc.contributor.authorMattei, E.en_US
dc.contributor.authorCastrodad, A.en_US
dc.contributor.editorChen, Min and Zhang, Hao (Richard)en_US
dc.date.accessioned2018-01-10T07:42:43Z
dc.date.available2018-01-10T07:42:43Z
dc.date.issued2017
dc.identifier.issn1467-8659
dc.identifier.urihttp://dx.doi.org/10.1111/cgf.13068
dc.identifier.urihttps://diglib.eg.org:443/handle/10.1111/cgf13068
dc.description.abstractWe present an algorithm for the restoration of noisy point cloud data, termed Moving Robust Principal Components Analysis (MRPCA). We model the point cloud as a collection of overlapping two‐dimensional subspaces, and propose a model that encourages collaboration between overlapping neighbourhoods. Similar to state‐of‐the‐art sparse modelling‐based image denoising, the estimated point positions are computed by local averaging. In addition, the proposed approach models grossly corrupted observations explicitly, does not require oriented normals, and takes into account both local and global structure. Sharp features are preserved via a weighted ℓ minimization, where the weights measure the similarity between normal vectors in a local neighbourhood. The proposed algorithm is compared against existing point cloud denoising methods, obtaining competitive results.We present an algorithm for the restoration of noisy point cloud data, termed Moving Robust Principal Components Analysis (MRPCA). We model the point cloud as a collection of overlapping two‐dimensional subspaces, and propose a model that encourages collaboration between overlapping neighbourhoods. Similar to state‐of‐the‐art sparse modelling‐based image denoising, the estimated point positions are computed by local averaging. In addition, the proposed approach models grossly corrupted observations explicitly, does not require oriented normals, and takes into account both local and global structure. Sharp features are preserved via a weighted ℓ minimization, where the weights measure the similarity between normal vectors in a local neighbourhood. The proposed algorithm is compared against existing point cloud denoising methods, obtaining competitive results.en_US
dc.publisher© 2017 The Eurographics Association and John Wiley & Sons Ltd.en_US
dc.subjectpoint cloud
dc.subjectrobust PCA
dc.subjectgeometry processing
dc.subjectdenoising
dc.subjectsparse modelling
dc.subjectI.3.3 [Computer Graphics]: Computational Geometry and Object Modelling—Curve, surface, solid, and object representations
dc.titlePoint Cloud Denoising via Moving RPCAen_US
dc.description.seriesinformationComputer Graphics Forum
dc.description.sectionheadersArticles
dc.description.volume36
dc.description.number8
dc.identifier.doi10.1111/cgf.13068
dc.identifier.pages123-137


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record