Exploiting color for graph-based 3D point cloud denoising

Muhammad Abeer Irfan, Enrico Magli

Abstract: Highlights•In a denoising problem, the correct location of a point also depends on the color attribute and not only the geometry of the neighboring points, and the correct color also depends on the geometry of the neighbors.•Graph-based convex optimization enforces smoothness on the graph signal to perform the denoising task.•Several different tasks, i.e., denoising of color-only noise, geometry-only noise, and both of them jointly, an be addressed employing the same algorithm by simply adapting the parameters to each denoising scenario.•Tikhonov regularization performs better than Total variation in all the denoising scenarios.•The algorithm is robust to different noise distributions and intensities.