dc.contributor.author | Mattei, E. | en_US |
dc.contributor.author | Castrodad, A. | en_US |
dc.contributor.editor | Chen, Min and Zhang, Hao (Richard) | en_US |
dc.date.accessioned | 2018-01-10T07:42:43Z | |
dc.date.available | 2018-01-10T07:42:43Z | |
dc.date.issued | 2017 | |
dc.identifier.issn | 1467-8659 | |
dc.identifier.uri | http://dx.doi.org/10.1111/cgf.13068 | |
dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf13068 | |
dc.description.abstract | 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.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.subject | point cloud | |
dc.subject | robust PCA | |
dc.subject | geometry processing | |
dc.subject | denoising | |
dc.subject | sparse modelling | |
dc.subject | I.3.3 [Computer Graphics]: Computational Geometry and Object Modelling—Curve, surface, solid, and object representations | |
dc.title | Point Cloud Denoising via Moving RPCA | en_US |
dc.description.seriesinformation | Computer Graphics Forum | |
dc.description.sectionheaders | Articles | |
dc.description.volume | 36 | |
dc.description.number | 8 | |
dc.identifier.doi | 10.1111/cgf.13068 | |
dc.identifier.pages | 123-137 | |