基于局部融合的三维模型信息隐藏算法研究

Shuai Ren, Shengxian Liu, Binbin Wang
{"title":"基于局部融合的三维模型信息隐藏算法研究","authors":"Shuai Ren, Shengxian Liu, Binbin Wang","doi":"10.1145/3565387.3565456","DOIUrl":null,"url":null,"abstract":"Aiming at the problem that the single-carrier 3D model has a weak ability to resist heterogeneous compression attacks, an information hiding algorithm based on the local feature fusion of the multi-carrier 3D model is proposed. First, the PCA (principal components analysis) regression method was used to estimate the normal carrier of the surface curvature, and the feature points of the vector set of 3D model were extracted from the surface curvature; Secondly, the carrier set was prefused with spindle correction, and then the distance threshold between feature points was set by ICP (Iterative Closest Point) nearest point iterative algorithm. After the fusion state of the carrier was obtained, the local fusion block was extracted by difference calculation with the original carrier; Thirdly, Arnold is used to scramble the secret information to get the binary sequence with the optimal matching degree with the carrier; Finally, meshed local fusion blocks, whose structural complexity is defined by the perimeter of the grid, embed binary sequences into vertices with high structural complexity. The algorithm hides the binary sequences with optimal matching degree with the carrier in the vertices with high structural complexity in the local fusion block, the invisibility and robustness of the algorithm are improved greatly. It can be seen from the experimental results that the proposed algorithm has high resistance to non-uniform compression and other attacks, indicating that its invisibility and robustness are high.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Research on Information Hiding Algorithm Based on Local Fusion of 3D Model\",\"authors\":\"Shuai Ren, Shengxian Liu, Binbin Wang\",\"doi\":\"10.1145/3565387.3565456\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Aiming at the problem that the single-carrier 3D model has a weak ability to resist heterogeneous compression attacks, an information hiding algorithm based on the local feature fusion of the multi-carrier 3D model is proposed. First, the PCA (principal components analysis) regression method was used to estimate the normal carrier of the surface curvature, and the feature points of the vector set of 3D model were extracted from the surface curvature; Secondly, the carrier set was prefused with spindle correction, and then the distance threshold between feature points was set by ICP (Iterative Closest Point) nearest point iterative algorithm. After the fusion state of the carrier was obtained, the local fusion block was extracted by difference calculation with the original carrier; Thirdly, Arnold is used to scramble the secret information to get the binary sequence with the optimal matching degree with the carrier; Finally, meshed local fusion blocks, whose structural complexity is defined by the perimeter of the grid, embed binary sequences into vertices with high structural complexity. The algorithm hides the binary sequences with optimal matching degree with the carrier in the vertices with high structural complexity in the local fusion block, the invisibility and robustness of the algorithm are improved greatly. It can be seen from the experimental results that the proposed algorithm has high resistance to non-uniform compression and other attacks, indicating that its invisibility and robustness are high.\",\"PeriodicalId\":182491,\"journal\":{\"name\":\"Proceedings of the 6th International Conference on Computer Science and Application Engineering\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-10-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 6th International Conference on Computer Science and Application Engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3565387.3565456\",\"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 6th International Conference on Computer Science and Application Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3565387.3565456","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

针对单载波三维模型抗异构压缩攻击能力弱的问题,提出了一种基于多载波三维模型局部特征融合的信息隐藏算法。首先,采用主成分分析(PCA)回归方法估计曲面曲率的法向载体,并从曲面曲率中提取三维模型向量集的特征点;其次,对载体集进行主轴校正预处理,然后采用ICP (Iterative nearest Point)最近点迭代算法设置特征点之间的距离阈值;获得载体的融合状态后,通过与原载体的差分计算提取局部融合块;第三,利用Arnold对秘密信息进行置乱,得到与载体匹配度最优的二值序列;最后,通过网格周长定义结构复杂度的网格局部融合块,将二值序列嵌入到结构复杂度较高的顶点中。该算法将与载体匹配度最优的二值序列隐藏在局部融合块中结构复杂度较高的顶点中,大大提高了算法的不可见性和鲁棒性。从实验结果可以看出,该算法对非均匀压缩等攻击具有较高的抵抗能力,说明其不可见性和鲁棒性较高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Research on Information Hiding Algorithm Based on Local Fusion of 3D Model
Aiming at the problem that the single-carrier 3D model has a weak ability to resist heterogeneous compression attacks, an information hiding algorithm based on the local feature fusion of the multi-carrier 3D model is proposed. First, the PCA (principal components analysis) regression method was used to estimate the normal carrier of the surface curvature, and the feature points of the vector set of 3D model were extracted from the surface curvature; Secondly, the carrier set was prefused with spindle correction, and then the distance threshold between feature points was set by ICP (Iterative Closest Point) nearest point iterative algorithm. After the fusion state of the carrier was obtained, the local fusion block was extracted by difference calculation with the original carrier; Thirdly, Arnold is used to scramble the secret information to get the binary sequence with the optimal matching degree with the carrier; Finally, meshed local fusion blocks, whose structural complexity is defined by the perimeter of the grid, embed binary sequences into vertices with high structural complexity. The algorithm hides the binary sequences with optimal matching degree with the carrier in the vertices with high structural complexity in the local fusion block, the invisibility and robustness of the algorithm are improved greatly. It can be seen from the experimental results that the proposed algorithm has high resistance to non-uniform compression and other attacks, indicating that its invisibility and robustness are high.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信