基于三维模型网格结构特征的复合信息隐藏算法

Shuai Ren, Qianqian Zhang, Aoxiong Fan
{"title":"基于三维模型网格结构特征的复合信息隐藏算法","authors":"Shuai Ren, Qianqian Zhang, Aoxiong Fan","doi":"10.1145/3565387.3565457","DOIUrl":null,"url":null,"abstract":"In order to improve the capacity and robustness of 3D model information hiding, a composite information hiding algorithm based on 3D model mesh characteristics is proposed in this paper. First, compute the vertex strength of the 3D model, divide the vertices of the 3D model, arrange the vertices of each area into a one-dimensional sequence according to the vertex strength in descending order, and then generate the vertex strength matrix according to the characteristics of the secret information data; Embed the vertex intensity matrix, adjust the vertex coordinates of the 3D model according to the vertex intensity matrix of the embedded information; finally, calculate the intensity of the triangular mesh of the 3D model and normalize it, and adjust the triangular mesh in the face list of the OBJ file of the 3D model according to the information embedding rules order to complete the embedding. The experimental results show that the algorithm can significantly improve the embedding capacity, and has strong robustness to geometric transformation, clipping, simplification and noise attacks.","PeriodicalId":182491,"journal":{"name":"Proceedings of the 6th International Conference on Computer Science and Application Engineering","volume":"58 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Composite Information Hiding Algorithm Based on Three-Dimensional Model Grid Structure Characteristics\",\"authors\":\"Shuai Ren, Qianqian Zhang, Aoxiong Fan\",\"doi\":\"10.1145/3565387.3565457\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In order to improve the capacity and robustness of 3D model information hiding, a composite information hiding algorithm based on 3D model mesh characteristics is proposed in this paper. First, compute the vertex strength of the 3D model, divide the vertices of the 3D model, arrange the vertices of each area into a one-dimensional sequence according to the vertex strength in descending order, and then generate the vertex strength matrix according to the characteristics of the secret information data; Embed the vertex intensity matrix, adjust the vertex coordinates of the 3D model according to the vertex intensity matrix of the embedded information; finally, calculate the intensity of the triangular mesh of the 3D model and normalize it, and adjust the triangular mesh in the face list of the OBJ file of the 3D model according to the information embedding rules order to complete the embedding. The experimental results show that the algorithm can significantly improve the embedding capacity, and has strong robustness to geometric transformation, clipping, simplification and noise attacks.\",\"PeriodicalId\":182491,\"journal\":{\"name\":\"Proceedings of the 6th International Conference on Computer Science and Application Engineering\",\"volume\":\"58 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.3565457\",\"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.3565457","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了提高三维模型信息隐藏的容量和鲁棒性,提出了一种基于三维模型网格特征的复合信息隐藏算法。首先计算三维模型的顶点强度,对三维模型的顶点进行划分,将各区域的顶点按顶点强度降序排列成一维序列,然后根据秘密信息数据的特征生成顶点强度矩阵;嵌入顶点强度矩阵,根据嵌入信息的顶点强度矩阵调整三维模型的顶点坐标;最后,计算三维模型三角网格的强度并进行归一化,并根据信息嵌入规则对三维模型OBJ文件的面表中的三角网格进行调整,以完成嵌入。实验结果表明,该算法能显著提高嵌入容量,对几何变换、裁剪、简化和噪声攻击具有较强的鲁棒性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Composite Information Hiding Algorithm Based on Three-Dimensional Model Grid Structure Characteristics
In order to improve the capacity and robustness of 3D model information hiding, a composite information hiding algorithm based on 3D model mesh characteristics is proposed in this paper. First, compute the vertex strength of the 3D model, divide the vertices of the 3D model, arrange the vertices of each area into a one-dimensional sequence according to the vertex strength in descending order, and then generate the vertex strength matrix according to the characteristics of the secret information data; Embed the vertex intensity matrix, adjust the vertex coordinates of the 3D model according to the vertex intensity matrix of the embedded information; finally, calculate the intensity of the triangular mesh of the 3D model and normalize it, and adjust the triangular mesh in the face list of the OBJ file of the 3D model according to the information embedding rules order to complete the embedding. The experimental results show that the algorithm can significantly improve the embedding capacity, and has strong robustness to geometric transformation, clipping, simplification and noise attacks.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信