Reversible Data Hiding for 3D Point Cloud Model

Hao Luo, Jeng-Shyang Pan, Zhe-ming Lu, Hsiang-Cheh Huang
{"title":"Reversible Data Hiding for 3D Point Cloud Model","authors":"Hao Luo, Jeng-Shyang Pan, Zhe-ming Lu, Hsiang-Cheh Huang","doi":"10.1109/IIH-MSP.2006.155","DOIUrl":null,"url":null,"abstract":"This paper proposes a reversible data hiding scheme for 3D point cloud model. It exploits the high correlation among neighbor vertices to embed data. It starts with creating a set of 8-neighbor vertices clusters with randomly selected seed vertices. Then an 8-point integer DCT is performed on these clusters and an efficient highest frequency coefficient modification technique is employed to modulate the watermark bit. In data extraction, the modified clusters are retrieved first, and other operations are the inverse process of the data hiding. The original model can be perfectly recovered if it is intact. Our scheme is suitable for some specific applications where content accuracy of the original model must be guaranteed. Moreover, the method can be used for 3D point cloud model authentication, e.g., hiding a hash sequence.","PeriodicalId":272579,"journal":{"name":"2006 International Conference on Intelligent Information Hiding and Multimedia","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"14","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 International Conference on Intelligent Information Hiding and Multimedia","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IIH-MSP.2006.155","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 14

Abstract

This paper proposes a reversible data hiding scheme for 3D point cloud model. It exploits the high correlation among neighbor vertices to embed data. It starts with creating a set of 8-neighbor vertices clusters with randomly selected seed vertices. Then an 8-point integer DCT is performed on these clusters and an efficient highest frequency coefficient modification technique is employed to modulate the watermark bit. In data extraction, the modified clusters are retrieved first, and other operations are the inverse process of the data hiding. The original model can be perfectly recovered if it is intact. Our scheme is suitable for some specific applications where content accuracy of the original model must be guaranteed. Moreover, the method can be used for 3D point cloud model authentication, e.g., hiding a hash sequence.
三维点云模型的可逆数据隐藏
提出了一种三维点云模型的可逆数据隐藏方案。它利用相邻顶点之间的高度相关性来嵌入数据。它首先创建一组随机选择种子顶点的8个相邻顶点簇。然后对这些簇进行8点整数DCT,并采用高效的最高频率系数修改技术对水印位进行调制。在数据提取中,首先检索修改后的聚类,其他操作是与数据隐藏相反的过程。如果原始模型完好无损,可以完全复原。我们的方案适用于一些需要保证原始模型内容准确性的特定应用。此外,该方法可用于三维点云模型认证,例如隐藏哈希序列。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信