基于横截面方法的动态点云压缩

Faranak Tohidi, M. Paul, A. Ulhaq
{"title":"基于横截面方法的动态点云压缩","authors":"Faranak Tohidi, M. Paul, A. Ulhaq","doi":"10.48550/arXiv.2204.11409","DOIUrl":null,"url":null,"abstract":"The recent development of dynamic point clouds has introduced the possibility of mimicking natural reality, and greatly assisting quality of life. However, to broadcast successfully, the dynamic point clouds require higher compression due to their huge volume of data compared to the traditional video. Recently, MPEG finalized a Video-based Point Cloud Compression standard known as V-PCC. However, V-PCC requires huge computational time due to expensive normal calculation and segmentation, sacrifices some points to limit the number of 2D patches, and cannot occupy all spaces in the 2D frame. The proposed method addresses these limitations by using a novel cross-sectional approach. This approach reduces expensive normal estimation and segmentation, retains more points, and utilizes more spaces for 2D frame generation compared to the VPCC. The experimental results using standard video sequences show that the proposed technique can achieve better compression in both geometric and texture data compared to the V-PCC standard.","PeriodicalId":91831,"journal":{"name":"Advances in image and video technology : Pacific Rim Symposium, PSIVT ... proceedings. IEEE Pacific Rim Symposium on Image and Video Technology","volume":"4 1","pages":"61-74"},"PeriodicalIF":0.0000,"publicationDate":"2022-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Dynamic Point Cloud Compression with Cross-Sectional Approach\",\"authors\":\"Faranak Tohidi, M. Paul, A. Ulhaq\",\"doi\":\"10.48550/arXiv.2204.11409\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The recent development of dynamic point clouds has introduced the possibility of mimicking natural reality, and greatly assisting quality of life. However, to broadcast successfully, the dynamic point clouds require higher compression due to their huge volume of data compared to the traditional video. Recently, MPEG finalized a Video-based Point Cloud Compression standard known as V-PCC. However, V-PCC requires huge computational time due to expensive normal calculation and segmentation, sacrifices some points to limit the number of 2D patches, and cannot occupy all spaces in the 2D frame. The proposed method addresses these limitations by using a novel cross-sectional approach. This approach reduces expensive normal estimation and segmentation, retains more points, and utilizes more spaces for 2D frame generation compared to the VPCC. The experimental results using standard video sequences show that the proposed technique can achieve better compression in both geometric and texture data compared to the V-PCC standard.\",\"PeriodicalId\":91831,\"journal\":{\"name\":\"Advances in image and video technology : Pacific Rim Symposium, PSIVT ... proceedings. IEEE Pacific Rim Symposium on Image and Video Technology\",\"volume\":\"4 1\",\"pages\":\"61-74\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-04-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in image and video technology : Pacific Rim Symposium, PSIVT ... proceedings. IEEE Pacific Rim Symposium on Image and Video Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.48550/arXiv.2204.11409\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in image and video technology : Pacific Rim Symposium, PSIVT ... proceedings. IEEE Pacific Rim Symposium on Image and Video Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.48550/arXiv.2204.11409","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

动态点云的最新发展已经引入了模仿自然现实的可能性,并极大地提高了生活质量。然而,与传统视频相比,动态点云由于其庞大的数据量,需要更高的压缩才能成功播出。最近,MPEG最终确定了一个基于视频的点云压缩标准,称为V-PCC。然而,V-PCC算法由于常规计算和分割代价昂贵,需要耗费大量的计算时间,并且为了限制2D patch的数量而牺牲了一些点,并且不能占据2D帧中的所有空间。提出的方法通过使用一种新的横断面方法解决了这些限制。与VPCC相比,这种方法减少了昂贵的正态估计和分割,保留了更多的点,并利用了更多的空间来生成2D帧。使用标准视频序列的实验结果表明,与V-PCC标准相比,该方法在几何和纹理数据上都能取得更好的压缩效果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Dynamic Point Cloud Compression with Cross-Sectional Approach
The recent development of dynamic point clouds has introduced the possibility of mimicking natural reality, and greatly assisting quality of life. However, to broadcast successfully, the dynamic point clouds require higher compression due to their huge volume of data compared to the traditional video. Recently, MPEG finalized a Video-based Point Cloud Compression standard known as V-PCC. However, V-PCC requires huge computational time due to expensive normal calculation and segmentation, sacrifices some points to limit the number of 2D patches, and cannot occupy all spaces in the 2D frame. The proposed method addresses these limitations by using a novel cross-sectional approach. This approach reduces expensive normal estimation and segmentation, retains more points, and utilizes more spaces for 2D frame generation compared to the VPCC. The experimental results using standard video sequences show that the proposed technique can achieve better compression in both geometric and texture data compared to the V-PCC standard.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信