Point Cloud Inpainting Based on Delaunay Triangulation

被引:0
|
作者
Liu, Yu-Lin [1 ]
Chou, He-Sheng [1 ]
Lee, Ming-Zhan [2 ]
Chan, Mei-Ling [3 ]
Lin, Ting-Lan [4 ]
Chen, Chiung-An [5 ]
Chen, Shin-Lun [1 ]
机构
[1] Chung Yuan Christian Univ, Dept Elect Engn, Taoyuan, Taiwan
[2] Natl Cheng Kung Univ, Dept Elect Engn, Tainan, Taiwan
[3] Jiaying Univ, Coll Phys Educ, Meizhou City Coll Phys Educ, Meizhou, Peoples R China
[4] Natl Taipei Univ Technol, Dept Elect Engn, Taipei, Taiwan
[5] Ming Chi Univ Technol, Dept Elect Engn, New Taipei 243303, Taiwan
关键词
D O I
10.1109/APSIPAASC58517.2023.10317549
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Point cloud is a point-based representation of three-dimensional data used to describe the geometry of objects or scenes However, due to its large data volume, a point cloud needs to be compressed to reduce the data volume. After point cloud compression, some points may be lost, causing the loss of edge details and the appearance of point cloud holes and outliers, leading to a significant subjective quality decrease and affecting point cloud development in practical applications. In this paper, an effective point cloud repair method is proposed. First, use the mean filter to remove outliers, so that the subsequent point-filling algorithm can avoid errors caused by outliers. Secondly, the point cloud is analyzed by the Delaunay triangulation method. Perform statistical analysis on the areas of all triangles. If an individual triangle has an area larger than the average, it is marked. After comparing the triangles, the coordinates of all the holes in the point cloud can be found, so as to identify the holes in the point cloud. In the hole-filling strategy, the interpolation method is used to average the coordinates and color information of the three vertices of the triangle to obtain the filling point, that is, to complete the restoration of the point cloud data. When evaluating the results, in addition to PSNR, the GraphSim index proposed by Q. Yang was also referred to [1]. This indicator is closer to the subjective evaluation of people and better reflects the subjective evaluation of people. According to the experimental results, the GraphSim of the proposed method can reach 0.363, which significantly improves the point cloud data after V-PCC compression [2].
引用
收藏
页码:1525 / 1529
页数:5
相关论文
共 50 条
  • [1] The Computation of Delaunay Triangulation of LiDAR Point Cloud Based on GPU
    Chao, Yi
    Wu, Tao
    Wang, Xiaohui
    Zheng, Guizhou
    2015 23RD INTERNATIONAL CONFERENCE ON GEOINFORMATICS, 2015,
  • [2] Analysis and simplification of point cluster based on Delaunay triangulation model
    Ai, TH
    Liu, YL
    ADVANCES IN SPATIAL ANALYSIS AND DECISION MAKING, 2004, 1 : 9 - 18
  • [3] Seamless Service Handoff Based on Delaunay Triangulation for Mobile Cloud Computing
    Yang, Zhen
    Liu, Xing
    Hu, Zhongwei
    Yuan, Chaowei
    WIRELESS PERSONAL COMMUNICATIONS, 2017, 93 (03) : 795 - 809
  • [4] Seamless Service Handoff Based on Delaunay Triangulation for Mobile Cloud Computing
    Liu, Xing
    Yang, Zhen
    Hu, Zhongwei
    Yuan, Chaowei
    2013 16TH INTERNATIONAL SYMPOSIUM ON WIRELESS PERSONAL MULTIMEDIA COMMUNICATIONS (WPMC), 2013,
  • [5] Seamless Service Handoff Based on Delaunay Triangulation for Mobile Cloud Computing
    Zhen Yang
    Xing Liu
    Zhongwei Hu
    Chaowei Yuan
    Wireless Personal Communications, 2017, 93 : 795 - 809
  • [6] Rapid 2D Delaunay triangulation algorithm for random distributed point cloud data
    Wang, Wen
    Su, Tianyun
    Wang, Guoyu
    Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics, 2015, 27 (09): : 1653 - 1660
  • [7] Rapid Delaunay triangulation for randomly distributed point cloud data using adaptive Hilbert curve
    Su, Tianyun
    Wang, Wen
    Lv, Zhihan
    Wu, Wei
    Li, Xinfang
    COMPUTERS & GRAPHICS-UK, 2016, 54 : 65 - 74
  • [8] An adaptive and rapid 3D Delaunay triangulation for randomly distributed point cloud data
    Tianyun Su
    Wen Wang
    Haixing Liu
    Zhendong Liu
    Xinfang Li
    Zhen Jia
    Lin Zhou
    Zhuanling Song
    Ming Ding
    Aiju Cui
    The Visual Computer, 2022, 38 : 197 - 221
  • [9] An adaptive and rapid 3D Delaunay triangulation for randomly distributed point cloud data
    Su, Tianyun
    Wang, Wen
    Liu, Haixing
    Liu, Zhendong
    Li, Xinfang
    Jia, Zhen
    Zhou, Lin
    Song, Zhuanling
    Ding, Ming
    Cui, Aiju
    VISUAL COMPUTER, 2022, 38 (01): : 197 - 221
  • [10] Research Based on the Point Cloud Adaptive Algorithm of Delaunay
    Peng, Zhenghong
    Yang, Yan
    ISISE 2008: INTERNATIONAL SYMPOSIUM ON INFORMATION SCIENCE AND ENGINEERING, VOL 2, 2008, : 350 - +