Abstract
Point cloud denoising is a crucial and fundamental step in geometry processing, which has achieved significant progress in the last two decades. Denoising real-world noisy point clouds is a very challenging problem since it is hard to describe the complex real-world noise by simple distributions such as Gaussian distribution. Furthermore, existing methods may suffer from performance degradation when dealing with real-world noisy point clouds with complex structures, which contain not only sharp features (sharp edges, sharp corners, etc.) but also smooth features, fine features, etc. To solve the above-mentioned problems, we propose a novel structure-aware denoising approach by exploiting the prior information in both external clean point clouds and the given noisy point cloud. We first group nonlocal self-similarity (NSS) patches from a set of external clean point clouds. Then, we employ the Gaussian Mixture Model (GMM) learning algorithm to learn external NSS priors over patch groups. Next, the internal priors are learned from the given noisy point cloud in the same way to refine the prior model. We integrate both the learned external and internal priors into a set of orthogonal dictionaries to efficiently estimate point normals. Finally, we propose a feature-aware point updating method through adaptive neighborhood selection to reposition points to match the estimated normals. Extensive experiments show that our approach achieves favorable comprehensive performance compared with many popular or state-of-the-art methods in terms of both objective and visual perception. The source code can be found at https://zhiyongsu.github.io.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Similar Papers
More From: Computer-Aided Design
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.