A Watermarking Scheme Based on k-means++ for Design Drawings

k-means++ 기반의 설계도면 워터마킹 기법

  • Lee, Suk-Hwan (Tongmyong University, Dept. of Information Security) ;
  • Kwon, Ki-Ryong (Division of Electronics, Computer and Telecomm. Eng., Pukyong National University)
  • 이석환 (동명대학교 정보보호학과) ;
  • 권기룡 (부경대학교 전자컴퓨터정보통신공학부)
  • Published : 2009.09.25

Abstract

A CAD design drawing based on vector data that is very important art work in industrial fields has been considered to content that the copyright protection is urgently needed. This paper presents a watermarking scheme based on k-means++ for CAD design drawing. One CAD design drawing consists of several layers and each layer consists of various geometric objects such as LINE, POLYLINE, CIRCLE, ARC, 3DFACE and POLYGON. POLYLINE with LINE, 3DFACE and ARC that are fundamental objects make up the majority in CAD design drawing. Therefore, the proposed scheme selects the target object with high distribution among POLYLINE, 3DFACE and ARC objects in CAD design drawing and then selects layers that include the most target object. Then we cluster the target objects in the selected layers by using k-means++ and embed the watermark into the geometric distribution of each group. The geometric distribution is the normalized length distribution in POLYLINE object, the normalized area distribution in 3DFACE object and the angle distribution in ARC object. Experimental results verified that the proposed scheme has the robustness against file format converting, layer attack as well as various geometric editing provided in CAD editing tools.

벡터 데이터 기반의 CAD 설계도면은 대부분 산업 분야에서 매우 주요한 저작물로, 저작권 보호 기술이 매우 필요한 콘텐츠로 인식되고 있다. 본 논문에서는 k-means++ 기반의 CAD 설계도면 워터마킹 기법을 제안한다. 하나의 CAD 설계도면은 여러 레이어들로 구성되며, 각 레이어는 폴리라인, 원, 호, 폴리곤 등의 다양한 기하학 객체들로 구성된다. 이들 기하학적 요소들 중 폴리라인 호 및 쿼드폴리곤 객체들은 CAD 설계도면의 기본적인 객체들로 객체 분포의 거의 대부분을 차지한다. 따라서 제안한 기법에서는 설계도면 내에 폴리라인, 쿼드폴리곤 및 호 객체들 중 가장 많은 수를 가지는 객체를 선택한 후, 이들 객체를 많이 분포하는 레이어들을 선택한다. 그리고 선택된 레이어 내에 객체들을 k-means++ 기반으로 그룹화한 다음, 각 그룹내에 기하학 특징 분포에 워터마크를 삽입한다. 이 때 기하학 특징 분포로는 폴리라인의 정규화된 길이 분포, 쿼드폴리곤의 정규화된 면적 분포 및 호의 각도 분포이다. 실험 결과로부터 제안한 기법이 CAD 도면툴 상에서 제공하는 다양한 기하학 편집과 파일포맷변환, 레이어 공격 등에 대하여 강인함을 확인하였다.

Keywords

References

  1. DRM One for CAD, http://www.fasoo.com
  2. S-Work for CAD/CAM, http://www.softcamp.co.kr
  3. AutoCAD OwnerGuard, http://www.armjisoft.com
  4. M. Barni, C.I. Podilchuk, F. Bartolini and E.J. Delp, 'Watermark embedding: hiding a signal within a cover image,' IEEE Communications Magazine, vol. 39, issue 8, pp. 102-108, Aug. 2001 https://doi.org/10.1109/35.940048
  5. M. Alghoniemy and A.H. Tewfik, 'Geometric invariance in image watermarking,' IEEE Transactions on Image Processing, vol. 13, issue 2, pp. 145-153, Feb. 2004 https://doi.org/10.1109/TIP.2004.823831
  6. E. T. Lin and E. J. Delp, 'Temporal synchronization in video watermarking,' IEEE Transactions on Signal Processing, vol. 52, issue 10, part 2, pp. 3007-3022, Oct. 2004 https://doi.org/10.1109/TSP.2004.833866
  7. Z. Jing, A.T.S. Ho, Q. Gang and P. Marziliano. 'Robust video watermarking of H.264/AVC,' IEEE Transactions on Circuits and Systems II: Express Briefs, vol. 54, issue 2, pp. 205-209, Feb. 2007 https://doi.org/10.1109/TCSII.2006.886247
  8. R. Ohbuchi, H. Masuda, and M. Aono, 'Watermarking three-dimensional polygonal models through geometric and topological modification,' IEEE Journal on Selected Areas in Communications, vol. 16, no. 4, pp. 551-560, May 1998 https://doi.org/10.1109/49.668977
  9. O. Benedens, 'Geometry-based watermarking 3D models,' IEEE Computer Graphics and Applications, vol. 19, no. 1, pp. 46-55, Jan./Feb. 1999 https://doi.org/10.1109/38.736468
  10. S.H. Lee and K.R, Kwon, 'A watermarking for 3D mesh using the patch CEGIs,' Digital Signal Processing, vol. 17, no. 2, pp. 396-413, Mar. 2007 https://doi.org/10.1016/j.dsp.2005.04.014
  11. 이석환, 권기룡, '패치 CEGI를 이용한 메쉬 워터마킹,' 대한전자공학회논문지, 제42권 CI편 제1호, pp. 67-78, 2005년
  12. S.H. Lee and K.R, Kwon, 'Mesh watermarking based projection onto two convex sets,' Multimedia Systems, vol. 13, no. 5-6, pp. 323-330, Feb. 2008 https://doi.org/10.1007/s00530-007-0095-8
  13. 이석환, 권기룡, '기하학적 구조 및 위치 보간기를 이용한 3D 애니메이션 워터마킹,' 대한전자공학회논문지, 제43권 CI편 제6호, pp. 71-82, 2006년
  14. R. Ohbuchi, H. Ueda, and S. Endoh, 'Robust watermarking of vector digital maps,' Proc. of IEEE International Conference on Multimedia and Expo (ICME), vol. 1, pp. 577-580, 2002
  15. B.J. Jang, K.R. Kwon, K.S. Moon, and Y. Huh, 'A new digital watermarking for architectural design drawing using LINEs and ARCs based on vertex,' Lecture Notes in Computer Science, vol. 2939/2004, pp. 544-557, 2004
  16. K.R. Kwon, S.H. Lee, E.J. Lee, and S.G. Kwon, 'Watermarking for 3D CAD drawings based on three components,' Lecture Notes in Computer Science, vol. 4109/2006, pp. 217-225, 2006 https://doi.org/10.1007/11815921_23
  17. K.R. Kwon, H.J. Chang, Gwang S. Jung, K.S. Moon, S.H Lee, '3D CAD drawing watermarking based on three components', IEEE International Conference on Image Processing (ICIP), pp. 1385-1388, Oct. 2006
  18. H. Zhao, W. Yuan, and Z. Wang, 'A new watermarking Scheme for CAD engineering drawings,' 9th International Conference on Computer-Aided Industrial Design and Conceptual Design, CAID/CD, pp. 518-522, 2008.
  19. AutoCAD 2010 dxf Reference, http://www.autodesk.com
  20. D. Arthur and S. Vassilvitskii, 'k-means++: the advantages of careful seeding'. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 1027-1035, 2007
  21. N. Aspert, D. Santa-Cruz, and T. Ebrahimi, 'MESH: measuring errors between surfaces using the Hausdorff distance,' IEEE International Conference in Multimedia and Expo (ICME2004), vol. 1, pp. 705-708, Aug. 2002
  22. M. Corsini, E. D. Gelasca, T. Ebrahimi, and M. Barni, 'Watermarked 3-D mesh quality assessment,' IEEE Trans. on Multimedia, vol. 9, no. 2, pp. 247-256, Feb. 2007 https://doi.org/10.1109/TMM.2006.886261
  23. E. D. Gelasca, T. Ebrahimi, M. Corsini, and M. Barni, 'Objective evaluation of the perceptual quality of 3D watermarking,' IEEE International Conference on Image Processing (ICIP2005), vol. 1, pp. I-241-4, Sep. 2005