Developing a Semantic-Driven Hybrid Segmentation Method for Point Clouds of 3D Shapes

被引:6
作者
Yang, Xiaowen [1 ]
Han, Xie [1 ]
Li, Qingde [2 ]
He, Ligang [3 ]
Pang, Min [1 ]
Jia, Caiqin [1 ]
机构
[1] North Univ China, Sch Data Sci & Technol, Taiyuan 030051, Peoples R China
[2] Univ Hull, Dept Comp Sci, Kingston Upon Hull HU6 7RX, N Humberside, England
[3] Univ Warwick, Dept Comp Sci, Coventry CV4 7AL, W Midlands, England
基金
中国国家自然科学基金;
关键词
Three-dimensional displays; Shape; Clustering algorithms; Image segmentation; Feature extraction; Semantics; Surface reconstruction; Semantic-driven; local concave-convex histogram; variational method; shape diameter function; MESH SEGMENTATION; RECONSTRUCTION; DECOMPOSITION; RECOGNITION;
D O I
10.1109/ACCESS.2020.2976847
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
With the rapid development of point cloud processing technologies and the availability of a wide range of 3D capturing devices, a geometric object from the real world can be directly represented digitally as a dense and fine point cloud. Decomposing a 3D shape represented in point cloud into meaningful parts has very important practical implications in the fields of computer graphics, virtual reality and mixed reality. In this paper, a semantic-driven automated hybrid segmentation method is proposed for 3D point cloud shapes. Our method consists of three stages: semantic clustering, variational merging, and region remerging. In the first stage, a new feature of point cloud, called Local Concave-Convex Histogram, is introduced to first extract saddle regions complying with the semantic boundary feature. All other types of regions are then aggregated according to this extracted feature. This stage often leads to multiple over-segmentation convex regions, which are then remerged by a variational method established based on the narrow-band theory. Finally, in order to recombine the regions with the approximate shapes, order relation is introduced to improve the weighting forms in calculating the conventional Shape Diameter Function. We have conducted extensive experiments with the Princeton Dataset. The results show that the proposed algorithm outperforms the state-of-the-art algorithms in this area. We have also applied the proposed algorithm to process the point cloud data acquired directly from the real 3D objects. It achieves excellent results too. These results demonstrate that the method proposed in this paper is effective and universal.
引用
收藏
页码:40861 / 40880
页数:20
相关论文
共 58 条
[1]  
Akai N, 2017, IEEE INT VEH SYM, P1356, DOI 10.1109/IVS.2017.7995900
[2]  
[Anonymous], 2005, Graphics Interface
[3]  
[Anonymous], P IEEE CVF C COMP VI
[4]   Hierarchical mesh segmentation based on fitting primitives [J].
Attene, M ;
Falcidieno, B ;
Spagnuolo, M .
VISUAL COMPUTER, 2006, 22 (03) :181-193
[5]   Mesh Segmentation with Concavity-Aware Fields [J].
Au, Oscar Kin-Chung ;
Zheng, Youyi ;
Chen, Menglin ;
Xu, Pengfei ;
Tai, Chiew-Lan .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 2012, 18 (07) :1125-1134
[6]   Graph based over-segmentation methods for 3D point clouds [J].
Ben-Shabat, Yizhak ;
Avraham, Tamar ;
Lindenbaum, Michael ;
Fischer, Anath .
COMPUTER VISION AND IMAGE UNDERSTANDING, 2018, 174 :12-23
[7]   RECOGNITION-BY-COMPONENTS - A THEORY OF HUMAN IMAGE UNDERSTANDING [J].
BIEDERMAN, I .
PSYCHOLOGICAL REVIEW, 1987, 94 (02) :115-147
[8]   An experimental comparison of min-cut/max-flow algorithms for energy minimization in vision [J].
Boykov, Y ;
Kolmogorov, V .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2004, 26 (09) :1124-1137
[9]   Strategies for polyhedral surface decomposition: An experimental study [J].
Chazelle, B ;
Dobkin, DP ;
Shouraboura, N ;
Tal, A .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1997, 7 (5-6) :327-342
[10]   Fast and robust shape diameter function [J].
Chen, Shuangmin ;
Liu, Taijun ;
Shu, Zhenyu ;
Xin, Shiqing ;
He, Ying ;
Tu, Changhe .
PLOS ONE, 2018, 13 (01)