PCC竞技场:点云压缩算法的基准平台

Cheng-Hao Wu, Chih-Fan Hsu, Ting-Chun Kuo, C. Griwodz, M. Riegler, Géraldine Morin, Cheng-Hsin Hsu
{"title":"PCC竞技场:点云压缩算法的基准平台","authors":"Cheng-Hao Wu, Chih-Fan Hsu, Ting-Chun Kuo, C. Griwodz, M. Riegler, Géraldine Morin, Cheng-Hsin Hsu","doi":"10.1145/3386293.3397112","DOIUrl":null,"url":null,"abstract":"Point Cloud Compression (PCC) algorithms can be roughly categorized into: (i) traditional Signal-Processing (SP) based and, more recently, (ii) Machine-Learning (ML) based. PCC algorithms are often evaluated with very different datasets, metrics, and parameters, which in turn makes the evaluation results hard to interpret. In this paper, we propose an open-source benchmark, called PCC Arena, which consists of several point cloud datasets, a suite of performance metrics, and a unified procedure. To demonstrate its practicality, we employ PCC Arena to evaluate three SP-based and one ML-based PCC algorithms. We also conduct a user study to quantify the user experience on rendered objects reconstructed from different PCC algorithms. Several interesting insights are revealed in our evaluations. For example, SP-based PCC algorithms have diverse design objectives and strike different trade-offs between coding efficiency and time complexity. Furthermore, although ML-based PCC algorithms are quite promising, they may suffer from long running time, unscalability to diverse point cloud densities, and high engineering complexity. Nonetheless, ML-based PCC algorithms are worth of more in-depth studies, and PCC Arena will play a critical role in the follow-up research for more interpretable and comparable evaluation results.","PeriodicalId":246411,"journal":{"name":"Proceedings of the 12th ACM International Workshop on Immersive Mixed and Virtual Environment Systems","volume":"43 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":"{\"title\":\"PCC arena: a benchmark platform for point cloud compression algorithms\",\"authors\":\"Cheng-Hao Wu, Chih-Fan Hsu, Ting-Chun Kuo, C. Griwodz, M. Riegler, Géraldine Morin, Cheng-Hsin Hsu\",\"doi\":\"10.1145/3386293.3397112\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Point Cloud Compression (PCC) algorithms can be roughly categorized into: (i) traditional Signal-Processing (SP) based and, more recently, (ii) Machine-Learning (ML) based. PCC algorithms are often evaluated with very different datasets, metrics, and parameters, which in turn makes the evaluation results hard to interpret. In this paper, we propose an open-source benchmark, called PCC Arena, which consists of several point cloud datasets, a suite of performance metrics, and a unified procedure. To demonstrate its practicality, we employ PCC Arena to evaluate three SP-based and one ML-based PCC algorithms. We also conduct a user study to quantify the user experience on rendered objects reconstructed from different PCC algorithms. Several interesting insights are revealed in our evaluations. For example, SP-based PCC algorithms have diverse design objectives and strike different trade-offs between coding efficiency and time complexity. Furthermore, although ML-based PCC algorithms are quite promising, they may suffer from long running time, unscalability to diverse point cloud densities, and high engineering complexity. Nonetheless, ML-based PCC algorithms are worth of more in-depth studies, and PCC Arena will play a critical role in the follow-up research for more interpretable and comparable evaluation results.\",\"PeriodicalId\":246411,\"journal\":{\"name\":\"Proceedings of the 12th ACM International Workshop on Immersive Mixed and Virtual Environment Systems\",\"volume\":\"43 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"6\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 12th ACM International Workshop on Immersive Mixed and Virtual Environment Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3386293.3397112\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 12th ACM International Workshop on Immersive Mixed and Virtual Environment Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3386293.3397112","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

摘要

点云压缩(PCC)算法大致可以分为:(i)基于传统信号处理(SP)的算法和(ii)基于机器学习(ML)的算法。PCC算法通常使用非常不同的数据集、度量和参数进行评估,这反过来又使评估结果难以解释。在本文中,我们提出了一个名为PCC Arena的开源基准,它由几个点云数据集、一套性能指标和一个统一的过程组成。为了证明其实用性,我们使用PCC Arena来评估三种基于sp和一种基于ml的PCC算法。我们还进行了一项用户研究,以量化从不同的PCC算法重建的渲染对象的用户体验。在我们的评估中揭示了一些有趣的见解。例如,基于sp的PCC算法具有不同的设计目标,并且在编码效率和时间复杂度之间进行了不同的权衡。此外,尽管基于ml的PCC算法很有前途,但它们可能存在运行时间长、无法扩展到不同点云密度以及高工程复杂性等问题。尽管如此,基于ml的PCC算法值得更深入的研究,PCC Arena将在后续研究中发挥关键作用,以获得更具可解释性和可比性的评价结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
PCC arena: a benchmark platform for point cloud compression algorithms
Point Cloud Compression (PCC) algorithms can be roughly categorized into: (i) traditional Signal-Processing (SP) based and, more recently, (ii) Machine-Learning (ML) based. PCC algorithms are often evaluated with very different datasets, metrics, and parameters, which in turn makes the evaluation results hard to interpret. In this paper, we propose an open-source benchmark, called PCC Arena, which consists of several point cloud datasets, a suite of performance metrics, and a unified procedure. To demonstrate its practicality, we employ PCC Arena to evaluate three SP-based and one ML-based PCC algorithms. We also conduct a user study to quantify the user experience on rendered objects reconstructed from different PCC algorithms. Several interesting insights are revealed in our evaluations. For example, SP-based PCC algorithms have diverse design objectives and strike different trade-offs between coding efficiency and time complexity. Furthermore, although ML-based PCC algorithms are quite promising, they may suffer from long running time, unscalability to diverse point cloud densities, and high engineering complexity. Nonetheless, ML-based PCC algorithms are worth of more in-depth studies, and PCC Arena will play a critical role in the follow-up research for more interpretable and comparable evaluation results.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信