压缩动态点云流的时间八叉树

M. Slomp, Hiroshi Kawasaki, Furukawa Ryo, R. Sagawa
{"title":"压缩动态点云流的时间八叉树","authors":"M. Slomp, Hiroshi Kawasaki, Furukawa Ryo, R. Sagawa","doi":"10.1109/3DV.2014.79","DOIUrl":null,"url":null,"abstract":"Range-based scanners built upon multiple cameras and projectors offer affordable, entire-shape and high-speed setups for 3D scanning. The point cloud streams produced by these devices require large amounts of storage space. Compressing these datasets is challenging since the capturing process may result in noise and surface irregularities, and consecutive frames can differ substantially in the overall point distribution. Exploiting spatial and temporal coherency is difficult on such conditions, but nonetheless crucial for achieving decent compression rates. This paper introduces a novel data structure, the temporal sparse voxel octree, capable of grouping spatio-temporal coherency of multiple point cloud streams into a single voxel hierarchy. In the data structure, a bit mask is attached to each node, existing nodes can then be reused at different frames by manipulating their bit masks, providing substantial memory savings. Although the technique yields some losses, the amount of loss can be controlled.","PeriodicalId":275516,"journal":{"name":"2014 2nd International Conference on 3D Vision","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Temporal Octrees for Compressing Dynamic Point Cloud Streams\",\"authors\":\"M. Slomp, Hiroshi Kawasaki, Furukawa Ryo, R. Sagawa\",\"doi\":\"10.1109/3DV.2014.79\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Range-based scanners built upon multiple cameras and projectors offer affordable, entire-shape and high-speed setups for 3D scanning. The point cloud streams produced by these devices require large amounts of storage space. Compressing these datasets is challenging since the capturing process may result in noise and surface irregularities, and consecutive frames can differ substantially in the overall point distribution. Exploiting spatial and temporal coherency is difficult on such conditions, but nonetheless crucial for achieving decent compression rates. This paper introduces a novel data structure, the temporal sparse voxel octree, capable of grouping spatio-temporal coherency of multiple point cloud streams into a single voxel hierarchy. In the data structure, a bit mask is attached to each node, existing nodes can then be reused at different frames by manipulating their bit masks, providing substantial memory savings. Although the technique yields some losses, the amount of loss can be controlled.\",\"PeriodicalId\":275516,\"journal\":{\"name\":\"2014 2nd International Conference on 3D Vision\",\"volume\":\"23 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-12-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 2nd International Conference on 3D Vision\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/3DV.2014.79\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 2nd International Conference on 3D Vision","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/3DV.2014.79","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

基于范围的扫描仪建立在多个摄像机和投影仪上,为3D扫描提供经济实惠,完整形状和高速设置。这些设备产生的点云流需要大量的存储空间。压缩这些数据集具有挑战性,因为捕获过程可能导致噪声和表面不规则,并且连续帧在整体点分布上可能存在很大差异。在这种情况下,利用空间和时间的相干性是很困难的,但对于实现体面的压缩率至关重要。本文介绍了一种新的数据结构——时间稀疏体素八叉树,它能够将多个点云流的时空相干性分组到单个体素层次结构中。在数据结构中,每个节点都附加一个位掩码,然后可以通过操作它们的位掩码在不同的帧中重用现有节点,从而节省大量内存。虽然该技术会产生一些损失,但损失的数量是可以控制的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Temporal Octrees for Compressing Dynamic Point Cloud Streams
Range-based scanners built upon multiple cameras and projectors offer affordable, entire-shape and high-speed setups for 3D scanning. The point cloud streams produced by these devices require large amounts of storage space. Compressing these datasets is challenging since the capturing process may result in noise and surface irregularities, and consecutive frames can differ substantially in the overall point distribution. Exploiting spatial and temporal coherency is difficult on such conditions, but nonetheless crucial for achieving decent compression rates. This paper introduces a novel data structure, the temporal sparse voxel octree, capable of grouping spatio-temporal coherency of multiple point cloud streams into a single voxel hierarchy. In the data structure, a bit mask is attached to each node, existing nodes can then be reused at different frames by manipulating their bit masks, providing substantial memory savings. Although the technique yields some losses, the amount of loss can be controlled.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Querying 3D Mesh Sequences for Human Action Retrieval Temporal Octrees for Compressing Dynamic Point Cloud Streams High-Quality Depth Recovery via Interactive Multi-view Stereo Iterative Closest Spectral Kernel Maps Close-Range Photometric Stereo with Point Light Sources
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1