TY - GEN
T1 - A high-capacity data hiding method for polygonal meshes
AU - Wu, Hao Tian
AU - CHEUNG, Yiu Ming
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2007
Y1 - 2007
N2 - This paper presents a high-capacity data hiding method for 3D polygonal meshes. By slightly modifying the distance from a vertex to its traversed neighbors based on quantization, a watermark (i.e., a string of binary numbers) can be embedded into a polygonal mesh during a mesh traversal process. The impact of embedding can be tuned by appropriately choosing the quantization step. The embedded data is robust against those content-preserving manipulations, such as rotation, uniformly scaling and translation, as well as mantissa truncation of vertex coordinate to a certain degree, but sensitive to malicious manipulations. Therefore, it can be used for authentication and content annotation of polygonal meshes. Compared with the previous work, the capacity of the proposed method is relatively high, tending to 1 bit/vertex. Besides to define the embedding primitive over a neighborhood so as to achieve resistance to substitution attacks, the security is also improved by making it hard to estimate the quantization step from the modified distances. A secret key is used to order the process of mesh traversal so that it is even harder to construct a counterfeit mesh with the same watermark. The numerical results show the efficacy of the proposed method.
AB - This paper presents a high-capacity data hiding method for 3D polygonal meshes. By slightly modifying the distance from a vertex to its traversed neighbors based on quantization, a watermark (i.e., a string of binary numbers) can be embedded into a polygonal mesh during a mesh traversal process. The impact of embedding can be tuned by appropriately choosing the quantization step. The embedded data is robust against those content-preserving manipulations, such as rotation, uniformly scaling and translation, as well as mantissa truncation of vertex coordinate to a certain degree, but sensitive to malicious manipulations. Therefore, it can be used for authentication and content annotation of polygonal meshes. Compared with the previous work, the capacity of the proposed method is relatively high, tending to 1 bit/vertex. Besides to define the embedding primitive over a neighborhood so as to achieve resistance to substitution attacks, the security is also improved by making it hard to estimate the quantization step from the modified distances. A secret key is used to order the process of mesh traversal so that it is even harder to construct a counterfeit mesh with the same watermark. The numerical results show the efficacy of the proposed method.
UR - http://www.scopus.com/inward/record.url?scp=38149066749&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-74124-4_13
DO - 10.1007/978-3-540-74124-4_13
M3 - Conference proceeding
AN - SCOPUS:38149066749
SN - 9783540741237
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 188
EP - 200
BT - Information Hiding - 8th International Workshop, IH 2006, Revised Selected Papers
PB - Springer Verlag
T2 - 8th International Workshop on Information Hiding, IH 2006
Y2 - 10 June 2006 through 12 June 2006
ER -