• Title/Summary/Keyword: Mesh denoising

Search Result 2, Processing Time 0.016 seconds

A Deep Learning-Based Face Mesh Data Denoising System (딥 러닝 기반 얼굴 메쉬 데이터 디노이징 시스템)

  • Roh, Jihyun;Im, Hyeonseung;Kim, Jongmin
    • Journal of IKEEE
    • /
    • v.23 no.4
    • /
    • pp.1250-1256
    • /
    • 2019
  • Although one can easily generate real-world 3D mesh data using a 3D printer or a depth camera, the generated data inevitably includes unnecessary noise. Therefore, mesh denoising is essential to obtain intact 3D mesh data. However, conventional mathematical denoising methods require preprocessing and often eliminate some important features of the 3D mesh. To address this problem, this paper proposes a deep learning based 3D mesh denoising method. Specifically, we propose a convolution-based autoencoder model consisting of an encoder and a decoder. The convolution operation applied to the mesh data performs denoising considering the relationship between each vertex constituting the mesh data and the surrounding vertices. When the convolution is completed, a sampling operation is performed to improve the learning speed. Experimental results show that the proposed autoencoder model produces faster and higher quality denoised data than the conventional methods.

Acceleration of Mesh Denoising Using GPU Parallel Processing (GPU의 병렬 처리 기능을 이용한 메쉬 평탄화 가속 방법)

  • Lee, Sang-Gil;Shin, Byeong-Seok
    • Journal of Korea Game Society
    • /
    • v.9 no.2
    • /
    • pp.135-142
    • /
    • 2009
  • Mesh denoising is a method to remove noise applying various filters. However, those methods usually spend much time since filtering is performed on CPU. Because GPU is specialized for floating point operations and faster than CPU, real-time processing for complex operations is possible. Especially mesh denoising is adequate for GPU parallel processing since it repeats the same operations for vertices or triangles. In this paper, we propose mesh denoising algorithm based on bilateral filtering using GPU parallel processing to reduce processing time. It finds neighbor triangles of each vertex for applying bilateral filter, and computes its normal vector. Then it performs bilateral filtering to estimate new vertex position and to update its normal vector.

  • PDF