跳到主要內容

臺灣博碩士論文加值系統

(3.236.23.193) 您好!臺灣時間:2021/07/26 06:43
字體大小: 字級放大   字級縮小   預設字形  
回查詢結果 :::

詳目顯示

我願授權國圖
: 
twitterline
研究生:廖明洲
研究生(外文):Ming-Chou Liao
論文名稱:用於三維關鍵影格動畫並以表面距離為估算基礎之強健型盲式浮水印演算法
論文名稱(外文):Geodesic-based Robust Blind Watermarking Algorithm for Three-dimensional Keyframe Animation
指導教授:郭耀煌郭耀煌引用關係
指導教授(外文):Yau-Hwang Kuo
學位類別:碩士
校院名稱:國立成功大學
系所名稱:資訊工程學系碩博士班
學門:工程學門
學類:電資工程學類
論文種類:學術論文
論文出版年:2009
畢業學年度:97
語文別:英文
論文頁數:74
中文關鍵詞:著作權保護浮水印三維關鍵影格動畫表面距離表面粗糙度衡量
外文關鍵詞:Copyright ProtectionThree-dimensional Keyframe AnimationGeodesic DistanceWatermarkingSurface Roughness Estimation
相關次數:
  • 被引用被引用:0
  • 點閱點閱:116
  • 評分評分:
  • 下載下載:0
  • 收藏至我的研究室書目清單書目收藏:0
在本篇論文中,我們提出用於三維關鍵影格動畫之強健型盲式浮水印演算法以達到著作權保護的目的。本演算法首先由關鍵影格動畫中擷取出三維模型,接著以模型中各點間表面距離為估算基礎,將其分割成數個不受模型本身姿勢改變而影響的重要特徵區塊。然後根據各點與切割邊界的表面距離進一步將此特徵區塊分成許多不重疊的集合。再者,我們基於表面粗糙度來調整各個集合的平均表面距離以嵌入版權浮水印。最後,將此已嵌入浮水印的模型資訊反映於原出處,以獲得一個具有版權資訊浮水印的三維關鍵影格動畫。實驗結果證明所提出的演算法具有抵抗常見用於三維動畫之攻擊的能力,其中包括時間軸攻擊、姿勢改變,相似轉換,頂點重新排列,局部性變形,切割,簡化、隨機雜訊添加,表面平滑化等攻擊。
A novel robust blind watermarking algorithm for three-dimensional (3D) keyframe animation is proposed in this thesis for copyright protection. In this algorithm, the geodesic distance of each vertex pair on the 3D mesh model extracted from a 3D keyframe animation to be watermarked is calculated, and then this model is segmented into meaningful pose-invariant components based on the calculation result. Each meaningful component is further divided into non-overlapping cells according to the distribution of geodesic distances from its vertices to the cutting boundary. Moreover, the defined watermark is embedded into these cells by adjusting the mean value of geodesic distances according to surface roughness estimation. Finally, we insert this watermarked model to the original animation content to obtain a watermarked 3D keyframe animation. Our experimental results demonstrate that the proposed algorithm has the ability to resist the common attacks applied to the 3D animation content, these attacks include timeline attacks, pose changing, similarity transformations, vertex reordering, local deformation, cropping, simplification, additive random noise, and smoothing.
LIST OF TABLES X
LIST OF FIGURES XI
CHAPTER 1 INTRODUCTION 1
1.1. MOTIVATION 2
1.2. CONTRIBUTIONS 3
1.3. ORGANIZATION OF THE THESIS 4
CHAPTER 2 BACKGROUND 6
2.1. DIGITAL WATERMARKING 6
2.2. THREE-DIMENSIONAL OBJECT REPRESENTATION 8
2.3. THREE-DIMENSIONAL ANIMATION 11
2.3.1. Keyframe Animation 11
2.3.2. Skeleton-based Deformation 12
2.3.3. Skinning Mesh Animation 13
2.4. RELATED WORKS 14
CHAPTER 3 PROPOSED WATERMARKING ALGORITHM 20
3.1. OVERVIEW OF PROPOSED WATERMARKING ALGORITHM 20
3.2. GEODESIC COMPUTATION 22
3.3. MEANINGFUL COMPONENT EXTRACTION 27
3.3.1. Mesh Simplification 28
3.3.2. Multidimensional Scaling Transformation 31
3.3.3. Prominent Feature Point Detection 33
3.3.4. Component Extraction 36
3.3.5. Cutting Boundary Refinement 38
3.4. WATERMARKING EMBEDDING PROCEDURE 41
3.4.1. Vertex Set Partition 42
3.4.2. Roughness Estimation 46
3.4.3. Geodesic Distance-based Watermark Insertion 49
3.5. WATERMARKING DETECTION PROCEDURE 56
3.5.1. Geodesic Distance-based Watermark Detection 57
3.5.2. Ownership Decision 58
CHAPTER 4 EXPERIMENTAL RESULTS 60
CHAPTER 5 CONCLUSION AND FUTURE WORK 68
REFERENCES 69
[ABD07]E. E. Abdallah, A. B. Hamza, and P. Bhattacharya, “Spectral Graph-Theoretic Approach to 3D Mesh Watermarking,” Proc. Graphics Interface (GI), pp. 327-334, May 2007.
[AGA09]P. Agarwal and B. Prabhakaran, “Robust Blind Watermarking of Point-Sampled Geometry,” IEEE Trans. Information Forensics Security (TIFS), vol. 4, no. 1, pp. 36-48, March 2009.
[ALF07]P. R. Alface and B. Macq, “From 3D Mesh Data Hiding to 3D Shape Blind and Robust Watermarking: A Survey,” LNCS Trans. Data Hiding and Multimedia Security II, vol. 4499, pp. 91-115, June 2007.
[ASH06]M. Ashourian, “A New Mixed Spatial Domain Watermarking of Three Dimensional Triangle Mesh,” Proc. ACM Int. Conf. Computer Graphics and Interactive Techniques (GRAPHITE), pp. 251-255, Dec. 2006.
[BAR96]C. B. Barber, D. P. Dobkin, and H. Huhdanpaa, “The Quickhull Algorithm for Convex Hulls,” ACM Trans. Mathematical Software (TOMS), vol. 22, no. 4, pp. 469-483, Dec. 1996.
[BOR97]I. Borg and P. Groenen, Modern Multidimensional Scaling: Theory and Applications, Springer-Verlag, New York, 1997.
[CHO07-1]J. W. Cho, R. Prost, and H. Y. Jung, “An Oblivious Watermarking for 3-D Polygonal Meshes Using Distribution of Vertex Norms,” IEEE Trans. Signal Processing (TSP), vol. 55, no. 1, pp. 142-155, Jan. 2007.
[CHO07-2]C. M. Chou and D. C. Tseng, “Technologies for 3D Model Watermarking: A Survey,” Int. Journal of Computer Science and Network Security (IJCSNS), vol. 7, no. 2, Feb. 2007.
[COR07]M. Corsini, E. D. Gelasca, T. Ebrahimi, and M. Barni, “Watermarked 3D Mesh Quality Assessment,” IEEE Trans. Multimedia (TMM), vol. 9, no. 2, pp. 247-265, Feb. 2007.
[COX01]T. F. Cox and M. A. A. Cox, Multidimensional Scaling, Chapman and Hall, London, 2001.
[ELA03]A. Elad and R. Kimmel, “On Bending Invariant Signatures for Surfaces, “ IEEE Trans. Pattern Analysis and Machine Intelligence (TPAMI), vol. 25, no. 10, pp. 1285-1295, Oct. 2003.
[GAR97]M. Garland and P. Heckbert, “Surface Simplification Using Quadric Error Metrics,” Proc. ACM Annual Conf. Computer Graphics and Interactive Techniques (SIGGRAPH), pp.206-217, 1997.
[GOL88]A. V. Goldberg and R. E. Tarjan, “A New Approach to the Maximum-Flow Problem,” Journal of the ACM (JACM), vol. 35, no. 4, pp.921-940, Oct. 1988.
[HAO92]J. Hao and J. B. Orlin, “A Faster Algorithm for Finding the Minimum Cut in a Graph,” Proc. ACM-SIAM Symposium Discrete Algorithms (SODA), pp. 165-174, Jan. 1992.
[JAM05]D. L. James and C. D. Twigg, “Skinning Mesh Animations,” ACM Trans. Graphics (TOG), vol. 24, no. 3, pp. 399-407, July 2005.
[KAN98]S. Kanai, H. Date, and T. Kishinami, “Digital Watermarking for 3D Polygons using Multiresolution Wavelet Decomposition,” Proc. IFIP WG 5.2 Int. Workshop Geometric Modeling: Fundamentals and Applications (GEO-6), pp.296-307, Dec. 1998.
[KAT05]S. Katz, G. Leifman, and A. Tal, “Mesh Segmentation Using Feature Point and Core Extraction,” The Visual Computer, vol. 21, no. 8-10, pp. 649-658, Sept. 2005.
[KIM98]R. Kimmel and J. A. Sethian, “Computing Geodesic Paths on Manifolds,” Proc. National Academy of Science (PNAS), vol. 95, no. 15, pp. 8431-8435, July 1998.
[KIM07]J. Kim, K. H. Shin, and S. Choi, “Soft Geodesic Kernel K-Means,” Proc. IEEE Int. Conf. Acoustics, Speech and Signal (ICASSP), vol. 2, pp. 429-432, April 2007.
[KRU64]J. B. Kruskal, “Multidimensional Scaling by Optimizing Goodness of Fit to a Nonmetric Hypothesis,” Psychometrika, vol. 29, no. 1, pp. 1-27, March 1964.
[KRU78]J. B. Kruskal and M. Wish, Multidimensional Scaling, SAGE Publications, Thousand Oaks, CA, 1998.
[LEE07]S. H. Lee, and K. R. Kwon, “3D Keyframe Animation Watermarking Based on Orientation Interpolator,” IEICE Trans. Information and Systems, vol. E90-D, no. 11, pp. 1751-1761, Nov. 2007.
[LEW00]J. P. Lewis, M. Cordner, and N. Fong, “Pose Space Deformations: A Unified Approach to Shape Interpolation and Skeleton-Driven Deformation,” Proc. ACM Annual Conf. Computer Graphics and Interactive Techniques (SIGGRAPH), pp. 149-158, 2000.
[LIK01]A. Likas, N. Vlassis, and J. J. Verbeek, “The Global K-Means Clustering Algorithm,” Pattern Recognition, vol. 36, no. 2, pp. 451-461, Feb. 2001.
[LOU97]M. Lounsbery, T. D. Derose, and J. Warren, “Multiresolution analysis for surfaces of arbitrary topological type,” ACM Trans. Graphics (TOG), vol. 16, no. 1, pp. 34-73, Jan. 1997.
[MAN99]A. P. Mangan and R. T. Whitaker, “Partitioning 3D Surface Meshes Using Watershed Segmentation,” IEEE Trans. Visualization and Computer Graphics (TVCG), vol. 5, no.4, pp. 308-321, Oct.-Dec. 1999.
[MOT08]R. Motwani, A. Ambardekar, M. Motwani, and F. C. Harris, “Robust Watermarking of 3D Skinning Mesh Animations,” Proc. IEEE Int. Conf. Acoustics, Speech, and Signal Processing (ICASSP), pp. 1752-1756, April 2008.
[NOV02]M. Novotni and R. Klein, “Computing Geodesic Distances on Triangular Meshes,” Proc. Int. Conf. Computer Graphics, Visualization, and Computer Vision (WSCG), pp. 341-347, Feb. 2002.
[OHB98]R. Ohbuchi, H. Masuda, and M. Aono, “Watermarking Three-Dimensional Polygonal Models Through Geometric and Topological Modifications,” IEEE Journal Selected Areas in Communications (JSAC), vol. 16, no. 4, pp. 551-560, May 1998.
[STO97]M. Store and F. Wagner, “A Simple Min-Cut Algorithm, ” Journal of the ACM (JACM), vol. 44, no. 4, pp. 585-591, July 1997.
[TZO08]G. Tzortzis and A. Likas, “The Global Kernel K-Means Clustering Algorithm,” Proc. IEEE Joint Conf. Neural Networks (IJCNN), pp. 1977-1984, June 2008.
[UCC04]F. Uccheddu, M. Corsini, and M. Barni, “Wavelet-Based Blind Watermarking of 3D Models,” Proc. ACM Workshop Multimedia and Security, pp143-154, Sep. 2004.
[WAN07]K. Wang, G. Lavoue, F. Denis, and A. Baskurt, “Hierarchical Blind Watermarking of 3D Triangular Meshes,” Proc. IEEE Int. Conf. Multimedia and Expo (ICME), pp. 1235-1238, July 2007.
[WAN08]K. Wang, G. Lavoue, F. Denis, and A. Baskurt, “A Comprehensive Survey on Three-Dimensional Mesh Watermarking,” IEEE Trans. Multimedia (TMM), vol. 10, no. 8, pp. 1513-1527, Dec. 2008.
[WU01]J. H. Wu, S. M. Hu, J. G. Sun, and C. L. Tai, “An Effective Feature-Preserving Mesh Simplification Scheme Based on Face Constriction,” Proc. IEEE Pacific Conf. Computer Graphics and Applications (PG), pp. 12-21, Oct. 2001.
[XU05]R. Xu and D. Wunsch II, “Survey of Clustering Algorithms,” IEEE Trans. Neural Networks (TNN), vol. 16, no. 3, pp. 645-678, May 2005.
[ZAF05]S. Zafeiriou, A. Tefas, and I. Pitas, “Blind Robust Watermarking Schemes for Copyright Protection of 3D Mesh Objects,” IEEE Trans. Visualization and Computer Graphics (TVCG), vol. 11, no. 5, pp. 596-607, Sept.-Oct. 2005.
連結至畢業學校之論文網頁點我開啟連結
註: 此連結為研究生畢業學校所提供,不一定有電子全文可供下載,若連結有誤,請點選上方之〝勘誤回報〞功能,我們會盡快修正,謝謝!
QRCODE
 
 
 
 
 
                                                                                                                                                                                                                                                                                                                                                                                                               
第一頁 上一頁 下一頁 最後一頁 top
無相關期刊