Fast graph-based denoising for point cloud color information

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Watanabe, Ryosuke, Nonaka, Keisuke, Pavez, Eduardo, Kobayashi, Tatsuya, Ortega, Antonio
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929386963337216
author Watanabe, Ryosuke
Nonaka, Keisuke
Pavez, Eduardo
Kobayashi, Tatsuya
Ortega, Antonio
author_facet Watanabe, Ryosuke
Nonaka, Keisuke
Pavez, Eduardo
Kobayashi, Tatsuya
Ortega, Antonio
contents Point clouds are utilized in various 3D applications such as cross-reality (XR) and realistic 3D displays. In some applications, e.g., for live streaming using a 3D point cloud, real-time point cloud denoising methods are required to enhance the visual quality. However, conventional high-precision denoising methods cannot be executed in real time for large-scale point clouds owing to the complexity of graph constructions with K nearest neighbors and noise level estimation. This paper proposes a fast graph-based denoising (FGBD) for a large-scale point cloud. First, high-speed graph construction is achieved by scanning a point cloud in various directions and searching adjacent neighborhoods on the scanning lines. Second, we propose a fast noise level estimation method using eigenvalues of the covariance matrix on a graph. Finally, we also propose a new low-cost filter selection method to enhance denoising accuracy to compensate for the degradation caused by the acceleration algorithms. In our experiments, we succeeded in reducing the processing time dramatically while maintaining accuracy relative to conventional denoising methods. Denoising was performed at 30fps, with frames containing approximately 1 million points.
format Preprint
id arxiv_https___arxiv_org_abs_2401_09721
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Fast graph-based denoising for point cloud color information
Watanabe, Ryosuke
Nonaka, Keisuke
Pavez, Eduardo
Kobayashi, Tatsuya
Ortega, Antonio
Computer Vision and Pattern Recognition
Image and Video Processing
Signal Processing
Point clouds are utilized in various 3D applications such as cross-reality (XR) and realistic 3D displays. In some applications, e.g., for live streaming using a 3D point cloud, real-time point cloud denoising methods are required to enhance the visual quality. However, conventional high-precision denoising methods cannot be executed in real time for large-scale point clouds owing to the complexity of graph constructions with K nearest neighbors and noise level estimation. This paper proposes a fast graph-based denoising (FGBD) for a large-scale point cloud. First, high-speed graph construction is achieved by scanning a point cloud in various directions and searching adjacent neighborhoods on the scanning lines. Second, we propose a fast noise level estimation method using eigenvalues of the covariance matrix on a graph. Finally, we also propose a new low-cost filter selection method to enhance denoising accuracy to compensate for the degradation caused by the acceleration algorithms. In our experiments, we succeeded in reducing the processing time dramatically while maintaining accuracy relative to conventional denoising methods. Denoising was performed at 30fps, with frames containing approximately 1 million points.
title Fast graph-based denoising for point cloud color information
topic Computer Vision and Pattern Recognition
Image and Video Processing
Signal Processing
url https://arxiv.org/abs/2401.09721