Analysis of Octree Coding for 3D Point Cloud Frame

Pei-Heng Li, Juo-Wei Lin, Yi-lun Huang, Ting-Lan Lin
{"title":"Analysis of Octree Coding for 3D Point Cloud Frame","authors":"Pei-Heng Li, Juo-Wei Lin, Yi-lun Huang, Ting-Lan Lin","doi":"10.1115/detc2019-97328","DOIUrl":null,"url":null,"abstract":"\n The octree coding has been used extensively for 3D point cloud compression. For encoding, the recursive octree partition is used for the 3D point cloud frame until only one point is contained in the cube bin, and the representative bits are recorded. For decoding, the reversal procedure is performed to reconstruct the 3D point cloud frame. During the reconstruction, the reconstructed point in a particular bin is usually quantized to a particular corner of the bin for the reconstructed 3D point cloud frame; this introduces coding distortion in the point location. In this paper, nine reconstructed locations are tested to distinguish their distortion results, and the bit cost is also analyzed.","PeriodicalId":166402,"journal":{"name":"Volume 9: 15th IEEE/ASME International Conference on Mechatronic and Embedded Systems and Applications","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Volume 9: 15th IEEE/ASME International Conference on Mechatronic and Embedded Systems and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1115/detc2019-97328","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The octree coding has been used extensively for 3D point cloud compression. For encoding, the recursive octree partition is used for the 3D point cloud frame until only one point is contained in the cube bin, and the representative bits are recorded. For decoding, the reversal procedure is performed to reconstruct the 3D point cloud frame. During the reconstruction, the reconstructed point in a particular bin is usually quantized to a particular corner of the bin for the reconstructed 3D point cloud frame; this introduces coding distortion in the point location. In this paper, nine reconstructed locations are tested to distinguish their distortion results, and the bit cost is also analyzed.
三维点云帧的八叉树编码分析
八叉树编码已广泛应用于三维点云压缩。在编码时,对三维点云帧使用递归八叉树分割,直到立方体箱中只包含一个点,并记录有代表性的比特。对于解码,执行反转程序以重建三维点云帧。在重建过程中,对于重建的三维点云帧,通常将特定仓中的重构点量化为仓的特定角;这在点定位中引入了编码失真。本文对9个重构位置进行了测试,以区分它们的失真结果,并分析了比特成本。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信