Please use this identifier to cite or link to this item: http://hdl.handle.net/11455/19337
標題: 轉換域的三維模型資訊偽裝演算法之研究
A Steganographic Algorithm for 3D Polygonal Meshes in the Transform Domain
作者: 張聖杰 
Chang, Sheng-Chieh 
關鍵字: Polygonal Meshes;多面體網格;Steganography;Transform Domain;資訊偽裝;轉換域
出版社: 資訊科學系所
引用: [Asho2004] M. Ashourian, R. Enteshari, and J. Jeon, “Digital Watermarking of Three-Dimensional Polygonal Models in the Spherical Coordinate System,” Proceedings of the Computer Graphics International, pp. 590-593, 2004. [Aspe2002a] N. Aspert, E. Drelie, Y. Maret, and T. Ebrahimi, “Steganography for Three-Dimensional Polygonal Meshes,” Proceedings of SPIE 47th Annual Meeting, Seattle, WA, USA, pp. 705-708, 2002. [Aspe2002b] N. Aspert, D. Santa-Cruz, and T. Ebrahimi, “Mesh: Measuring Errors between Surfaces Using the Hausdorff Distance,” Proceedings of IEEE International Conference on Multimedia and Expo 2002, pp. 705-708, 2002. [Bene1999a] O. Benedens, “Geometry-Based Watermarking of 3D Models,” IEEE Computer Graphics and Applications, Vol. 19, No. 1, pp. 46-55, 1999. [Bene1999b] O. Benedens, “Watermarking of 3D Polygon Based Models with Robustness against Mesh Simplification,” Proceedings of SPIE: Security and Watermarking of Multimedia Contents, pp. 329-340, 1999. [Bene2003] O. Benedens, J. Dittmann, and F. A. P. Petitcolas, “3D Watermarking Design Evaluation,” Proceedings of Security and Watermarking of Multimedia Contents V, Santa Clara, CA, USA, pp. 337-348, 2003. [Boro2003] P. Borodin, M. Guthe, and R. Klein, “Out-of-Core Simplification with Guaranteed Error Tolerance,” Proceedings of the Eighth International Fall Workshop on Vision, Modeling and Visualisation 2003, Munich, Germany, pp. 309-316, 2003. [Cayr2003a] F. Cayre and B. Macq, “Data Hiding on 3-D Triangle Meshes,” IEEE Transactions on Signal Processing, Vol. 51, No. 4, pp. 939-949, 2003. [Cayr2003b] F. Cayre, P. Rondao-Alface, F. Schmitt, B. Macq, and H. Maître, “Application of Spectral Decomposition to Compression and Watermarking of 3D Triangle Mesh Geometry,” Signal Processing: Image Communication, Vol. 18, No. 4, pp. 309-319, 2003. [Chen2001a] B. Chen and G. W. Wornell, “Quantization Index Modulation Methods for Digital Watermarking and Information Embedding of Multimedia,” The Journal of VLSI Signal Processing, Vol. 27, No. 1 - 2, pp. 7-33, 2001. [Chen2001b] B. Chen and G. W. Wornell, “Quantization Index Modulation: A Class of Provably Good Methods for Digital Watermarking and Information Embedding,” IEEE Transactions on Information Theory, Vol. 47, No. 4, pp. 1423-1443, 2001. [Chen2003] Z. Chen, B. Bodenheimer, and J. F. Barnes, “Robust Transmission of 3D Geometry over Lossy Networks,” Proceedings of the Eighth International Conference on 3D Web Technology, Saint Malo, France, pp. 161-208, 2003. [Chen2006] Y.-M. Cheng, C.-M. Wang, Y.-Y. Tsai, and P.-C. Wang, “An Adaptive Steganographic Algorithm for 3D Polygon Meshes,” submitted for publication. [Cohe2004] D. Cohen-Steiner, P. Alliez, and M. Desbrun, “Variational Shape Approximation,” ACM Transactions on Graphics, Vol. 23, No. 3, pp. 905-914, 2004. [Cott2004] D. Cotting, T. Weyrich, M. Pauly, and M. Gross, “Robust Watermarking of Point-Sampled Geometry,” Proceedings of International Conference on Shape Modeling and Applications, pp. 233-242, 2004. [Jin2004] J. Q. Jin, M. Y. Dai, H. J. Bao, and Q. S. Peng, “Watermarking on 3D Mesh Based on Spherical Wavelet Transform,” Journal of Zhejiang University SCIENCE, Vol. 5, No. 3, pp. 251-258, 2004. [Kana1998] S. Kanai, H. Date, and T. Kishinami, “Digital Watermarking for 3D Polygons Using Multi-Resolution Wavelet Decomposition,” Proceedings of Sixth IFIP WG 5.2 International Workshop on Geometric Modeling: Fundamentals and Applications (GEO-6), pp. 296-307, 1998. [Karn2000] Z. Karni and C. Gotsman, “Spectral Compression of Mesh Geometry,” Proceedings of SIGGRAPH 2000, pp. 279-286, 2000. [Katz2000] S. Katzenbeisser and F. A. P. Petitcolas, Information Hiding Techniques for Steganography and Digital Watermarking, Artech House, London, 2000. [Kim2000] T. H. Kim, J. Lee, and S. Y. Shin, “Robust Motion Watermarking Based on Multiresolution Analysis,” Computer Graphics Forum, Vol. 19, No. 3, pp. 189-198, 2000. [Mare2004] Y. Maret and T. Ebrahimi, “Data Hiding on 3D Polygonal Meshes,” Proceedings of the 2004 Workshop on Multimedia and Security, Magdeburg, Germany, pp. 68-74, 2004. [Muro2003] K. Murotani and K. Sugihara, “Watermarking 3D Polygonal Meshes Using the Singular Spectrum Analysis,” Proceedings of the 10th IMA International Conference on The Mathematics of Surfaces, pp. 85-98, 2003. [Muro2004] K. Murotani and K. Sugihara, “Watermarking 3D Polygonal Meshes Using Generalized Singular Spectrum Analysis,” Proceedings of NICOGRAPH International Conference, pp. 121-126, 2004. [Ohbu1997] R. Ohbuchi, H. Masuda, and M. Aono, “Watermaking Three-Dimensional Polygonal Models,” Proceedings of Fifth ACM International Conference on Multimedia, Seattle, Washington, USA, pp. 261-272, 1997. [Ohbu1998a] R. Ohbuchi, H. Masuda, and M. Aono, “Data Embedding Algorithms for Geometrical and Non-Geometrical Targets in Three-Dimensional Polygonal Models,” Computer Communications, Vol. 21, No. 15, pp. 1344-1354, 1998. [Ohbu1998b] R. Ohbuchi, H. Masuda, and M. Aono, “Watermarking Three-Dimensional Polygonal Models through Geometric and Topological Modifications,” IEEE Journal on Selected Areas in Communications, Vol. 16, No. 4, pp. 551-560, 1998. [Ohbu1999] R. Ohbuchi, H. Masuda, and M. Aono, “A Shape-Preserving Data Embedding Algorithm for Nurbs Curves and Surfaces,” Proceedings of Computer Graphics International, pp. 180-187, 1999. [Ohbu2001] R. Ohbuchi, S. Takahashi, T. Miyazawa, and A. Mukaiyama, “Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain,” Proceedings of Graphics Interface 2001, Ottawa, Ontario, Canada, pp. 9-17, 2001. [Ohbu2002] R. Ohbuchi, A. Mukaiyama, and S. Takahashi, “A Frequency-Domain Approach to Watermarking 3D Shapes,” Computer Graphics Forum, Vol. 21, No. 3, pp. 373-382, 2002. [Ohbu2004] R. Ohbuchi, A. Mukaiyama, and S. Takahashi, “Watermarking a 3D Shape Model Defined as a Point Set,” Proceedings of Cyber Worlds 2004, pp. 392-399, 2004. [Paya2003] F. Payan and M. Antonini, “3D Multiresolution Context-Based Coding for Geometry Compression,” Proceedings of 2003 International Conference on Image Processing, pp. 785-788, 2003. [Peti1999] F. A. P. Petitcolas, R. J. Anderson, and M. G. Kuhn, “Information Hiding - a Survey,” Proceedings of the IEEE, Vol. 87, No. 7, pp. 1062-1078, 1999. [Pfit1996] B. Pfitzmann, “Information Hiding Terminology - Results of an Informal Plenary Meeting and Additional Proposals,” Proceedings of the First International Workshop on Information Hiding, pp. 347-350, 1996. [Prau1999] E. Praun, H. Hoppe, and A. Finkelstein, “Robust Mesh Watermarking,” Proceedings of SIGGRAPH 1999, pp. 49-56, 1999. [Raja2004] K. T. Rajamani, S. C. Joshi, and M. A. Styner, “Bone Model Morphing for Enhanced Surgical Visualization,” Proceedings of IEEE International Symposium on Biomedical Imaging: Macro to Nano, pp. 1255-1258, 2004. [Szym2003] A. Szymczak and J. Vanderhyde, “Extraction of Topologically Simple Isosurfaces from Volume Datasets,” Proceedings of the 14th IEEE Visualization 2003 (VIS''03), p. 10, 2003. [Ucch2004] F. Uccheddu, M. Corsini, and M. Barni, “Wavelet-Based Blind Watermarking of 3D Models,” Proceedings of the Multimedia and Security Workshop on Multimedia and Security, pp. 143-154, 2004. [Wagn2000] M. G. Wagner, “Robust Watermarking of Polygonal Meshes,” Proceedings of Geometric Modeling and Processing 2000, Hong Kong, pp. 201-208, 2000. [Wang2003] C.-M. Wang and H.-W. Chen, “Watermarking 3D Polygonal Meshes Using 3D Models,” Journal of Engineering, National Chung Hsing University, Vol. 14, No. 2, pp. 123-134, 2003. [Wang2005a] C.-M. Wang and Y.-M. Cheng, “An Efficient Information Hiding Algorithm for Polygonal Models,” Computer Graphics Forum, Vol. 24, No. 3, pp. 591-600, 2005. [Wang2005b] C.-M. Wang and P.-C. Wang, “Data Hiding Approach for Point-Sampled Geometry,” IEICE Transactions on Communications, Vol. E88-B, No. 1, pp. 190-194, 2005. [Wang2006] C.-M. Wang and P.-C. Wang, “Steganography on Point-Sampled Geometry,” Computers & Graphics, Vol. 30, No. 2, pp. 244-254, 2006. [Wu2005] J. Wu and L. Kobbelt, “Efficient Spectral Watermarking of Large Meshes with Orthogonal Basis Functions,” The Visual Computer, Vol. 21, No. 8-10, pp. 848-857, 2005. [Yin2001] K. Yin, Z. Pan, J. Shi, and D. Zhang, “Robust Mesh Watermarking Based on Multiresolution Processing,” Computers and Graphics, Vol. 25, No. 3, pp. 409-420, 2001. [Yu2003] Z. Yu, H. S. Horace, and L. F. Kowk, “Robust Watermarking of 3D Polygonal Models Based on Vertice Scrambling,” Computer Graphics International, pp. 254-257, 2003.
摘要: 
三維模型之資訊偽裝即在研究如何將秘密訊息嵌入三維模型來傳送秘密訊息,以保持訊息的隱密性和完整性。此方面之研究依其訊息之嵌入方式可分為空間域及轉換域二種領域。轉換域的技術於嵌入資訊時,三維模型的變形可全域分散於整個三維模型,減少發生局部突兀變形的風險。然而,目前轉換域的資訊偽裝演算法具低資訊嵌入量的缺點,嚴重降低其應用範疇。
有鑑於此,本篇論文提出一個新的、基於轉換域、具盲擷取性的三維資訊偽裝演算法,可大幅提高資訊嵌入容量。首先,我們輸入位處世界座標空間內的多面體模型。我們利用頂點資訊求出頂點向量,並將之先轉換至特徵空間,最後轉換至球面座標系統。接著,我們給定量化刻度參數,並透過量化刻度調變(Quantization Index Modulation, QIM)的技巧,在嵌入0、1字串訊息時改變三維模型頂點向量的長度及方向。最後,我們將偽裝模型逆向轉換回原始的世界座標空間,即可建構出偽裝模型。擷取訊息則將偽裝模型依記錄的量化刻度參數以相同方式行之。此外,為了能提高可用模型之複雜度,我們更提出一個改良的演算法。實驗結果顯示:我們的演算法可嵌入接近於模型頂點個數三倍的秘密訊息。演算法僅需原始量化刻度參數,不需原始模型即可正確地擷取出秘密訊息。適用的模型複雜度最多可達13萬個頂點。此外,掩護模型與偽裝模型間之變形以肉眼觀察難以察覺。差異程度經量化後,RMSE在0.001%至0.7%之間,Hausdorff距離平均值在0.001%至0.6%之間。最後,我們的演算法可有效抵抗相似轉換(affine transformation)攻擊,包含平移、旋轉及等向縮放等。
總結本篇論文,我們的演算法具高嵌入訊息容量,優於同為轉換域技術的其他演算法。演算法具有盲擷取性、支援高複雜度模型、具備低變形程度的特徵。此外,演算法可有效抵抗相似轉換攻擊。我們認為提出的轉換域三維模型資訊偽裝演算法能有效提升三維模型資訊偽裝之應用範疇。

The steganography for 3D models investigates techniques for embedding the secret message into 3D models for the converted communications. Algorithms for 3D steganography can be classified into the spatial domain and the transform domain, according to the approach they embed the secret message. Based on the transform domain, the distortion is dispersed globally on the 3D stego model, reducing potential abrupt visual aliasing. However, current algorithms in the transform domain suffer from having low embedding capacity, which severely hampers the scope of steganographic applications.
This thesis proposes a new, blind detection, high capacity steganographic algorithm for 3D polygonal meshes in the transform domain. First, given a 3D polygonal mesh in the world coordinate space, our algorithm determines the vertex vectors based on the vertex coordinate information. Second, we transform the vertex vectors to the feature space and then to the spherical coordinate space. Third, given a quantity parameter, we employ the skill of Quantization Index Modulation (QIM) to change the length as well as the direction of the vertex vectors for embedding the secret message containing the 0 and 1 bits string. Finally, we re-convert the stego model from the current spherical coordinate space to the world coordinate space. Extracting the message from the 3D model is proceeded on the reverse approach of the embedding steps using the same quantity parameter. In addition, we propose an improved algorithm, allowing our algorithm to support complex models with up to 130000 vertices.
Experimental results show that the message capacity of our algorithm is nearly three times the numbers of the vertices in the 3D model. We can extract the secret message requiring no aid of the cover model, achieving the blind detection mechanism. Furthermore, the stego model shows insignificant visual difference, in comparison to the cover model. This also demonstrates the imperceptibility features of our algorithm. The root mean square errors between two models range from 0.001% to 0.7%, while the mean of the Hausdorff distance ranges from 0.001% to 0.6%. Finally, our algorithm is robust against affine transformation attacks, including translation, rotation and uniform scaling.
In conclusion, our algorithm has high message capacity, which is superior to our counterparts in the transform domain. The algorithm is with blind detection feature, and supports rather complex models. The message embedding does not introduce significant visual distortion to the stego model. Finally, our algorithm is robust against affine transformation attacks. The algorithm we propose is feasible to the applications of the steganography.
URI: http://hdl.handle.net/11455/19337
其他識別: U0005-1108200620494300
Appears in Collections:資訊科學與工程學系所

Show full item record
 
TAIR Related Article

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.