A Novel Coding Scheme for Large-Scale Point Cloud Sequences Based on Clustering and Registration

被引:9
作者
Sun, Xuebin [1 ]
Sun, Yuxiang [2 ]
Zuo, Weixun [3 ]
Cheng, Shing Shin [4 ]
Liu, Ming [5 ]
机构
[1] Shenzhen Univ, Coll Elect & Informat Engn, Shenzhen 518060, Peoples R China
[2] Hong Kong Polytech Univ, Dept Mech Engn, Hong Kong, Peoples R China
[3] Shenzhen Unity Dr Innovat Technol Co Ltd, Shenzhen 518000, Peoples R China
[4] Chinese Univ Hong Kong, Dept Mech & Automat Engn, Hong Kong, Peoples R China
[5] Hong Kong Univ Sci & Technol, Dept Elect & Comp Engn, Hong Kong, Peoples R China
关键词
Three-dimensional displays; Image coding; Laser radar; Redundancy; Encoding; Prediction algorithms; Video coding; Cluster-based prediction; compression; depth modeling mode (DMM); point cloud sequence; registration; COMPRESSION; EXTENSIONS;
D O I
10.1109/TASE.2021.3082196
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Due to the huge volume of point cloud data, storing and transmitting it is currently difficult and expensive in autonomous driving. Learning from the high-efficiency video coding (HEVC) framework, we propose a novel compression scheme for large-scale point cloud sequences, in which several techniques have been developed to remove the spatial and temporal redundancy. The proposed strategy consists mainly of three parts: intracoding, intercoding, and residual data coding. For intracoding, inspired by the depth modeling modes (DMMs), in 3-D HEVC (3-D-HEVC), a cluster-based prediction method is proposed to remove the spatial redundancy. For intercoding, a point cloud registration algorithm is utilized to transform two adjacent point clouds into the same coordinate system. By calculating the residual map of their corresponding depth image, the temporal redundancy can be removed. Finally, the residual data are compressed either by lossless or lossy methods. Our approach can deal with multiple types of point cloud data, from simple to more complex. The lossless method can compress the point cloud data to 3.63% of its original size by intracoding and 2.99% by intercoding without distance distortion. Experiments on the KITTI dataset also demonstrate that our method yields better performance compared with recent well-known methods.
引用
收藏
页码:2384 / 2396
页数:13
相关论文
共 43 条
[1]   Large-Scale 3D Point Cloud Compression Using Adaptive Radial Distance Prediction in Hybrid Coordinate Domains [J].
Ahn, Jae-Kyun ;
Lee, Kyu-Yul ;
Sim, Jae-Young ;
Kim, Chang-Su .
IEEE JOURNAL OF SELECTED TOPICS IN SIGNAL PROCESSING, 2015, 9 (03) :422-434
[2]   Broth: A General-Purpose Data Compressor [J].
Alakuijala, Jyrki ;
Farruggia, Andrea ;
Ferragina, Paolo ;
Kliuchnikov, Eugene ;
Obryk, Robert ;
Szabadka, Zoltan ;
Vandevenne, Lode .
ACM TRANSACTIONS ON INFORMATION SYSTEMS, 2019, 37 (01)
[3]  
Behr F, 2003, IEEE DATA COMPR CONF, P416
[4]   A METHOD FOR REGISTRATION OF 3-D SHAPES [J].
BESL, PJ ;
MCKAY, ND .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (02) :239-256
[5]  
Bin Tariq Z, 2015, SMARTGREENS 2015 PROCEEDINGS OF THE 4TH INTERNATIONAL CONFERENCE ON SMART CITIES AND GREEN ICT SYSTEMS, P256
[6]   Efficient Online Segmentation for Sparse 3D Laser Scans [J].
Bogoslavskyi, Igor ;
Stachniss, Cyrill .
PFG-JOURNAL OF PHOTOGRAMMETRY REMOTE SENSING AND GEOINFORMATION SCIENCE, 2017, 85 (01) :41-52
[7]  
Bogoslavskyi I, 2016, 2016 IEEE/RSJ INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS (IROS 2016), P163, DOI 10.1109/IROS.2016.7759050
[8]   Point Cloud Attribute Compression using 3-D Intra Prediction and Shape-Adaptive Transforms [J].
Cohen, Robert A. ;
Tian, Dong ;
Vetro, Anthony .
2016 DATA COMPRESSION CONFERENCE (DCC), 2016, :141-150
[9]   Transform Coding for Point Clouds Using a Gaussian Process Model [J].
de Queiroz, Ricardo L. ;
Chou, Philip A. .
IEEE TRANSACTIONS ON IMAGE PROCESSING, 2017, 26 (07) :3507-3517
[10]   Evaluation of lossless and lossy algorithms for the compression of scientific datasets in netCDF-4 or HDF5 files [J].
Delaunay, Xavier ;
Courtois, Aurelie ;
Gouillon, Flavien .
GEOSCIENTIFIC MODEL DEVELOPMENT, 2019, 12 (09) :4099-4113