Browse > Article
http://dx.doi.org/10.3745/KIPSTB.2008.15-B.4.307

Print-Scan Resilient Curve Watermarking using B-Spline Curve Model and its 2D Mesh-Spectral Transform  

Kim, Ji-Young (한국과학기술원 전자전산학과)
Lee, Hae-Yeoun (국립금오공과대학교 컴퓨터공학부)
Im, Dong-Hyuck (한국과학기술원 전자전산학과)
Ryu, Seung-Jin (한국과학기술원 전자전산학과)
Choi, Jung-Ho (한국과학기술원 전자전산학과)
Lee, Heung-Kyu (한국과학기술원 전자전산학과)
Publication Information
The KIPS Transactions:PartB / v.15B, no.4, 2008 , pp. 307-314 More about this Journal
Abstract
This paper presents a new robust watermarking method for curves that uses informed-detection. To embed watermarks, the presented algorithm parameterizes a curve using the B-spline model and acquires the control points of the B-spline model. For these control points, 2D mesh are created by applying Delaunay triangulation and then the mesh spectral analysis is performed to calculate the mesh spectral coefficients where watermark messages are embedded in a spread spectrum way. The watermarked coefficients are inversely transformed to the coordinates of the control points and the watermarked curve is reconstructed by calculating B-spline model with the control points. To detect the embedded watermark, we apply curve matching algorithm using inflection points of curve. After curve registration, we calculate the difference between the original and watermarked mesh spectral coefficients with the same process for embedding. By calculating correlation coefficients between the detected and candidate watermark, we decide which watermark was embedded. The experimental results prove the proposed scheme is more robust than previous watermarking schemes against print-scan process as well as geometrical distortions.
Keywords
Robust watermarking; B-spline curve; mesh-spectral transform; print-scan; geometric attack;
Citations & Related Records
연도 인용수 순위
  • Reference
1 V. Solachidis and I. Pitas, “Watermarking Polygonal Lines Using Fourier Descriptors,” IEEE Computer Graphics and Applications, Vol.24, No.3, 1998
2 H. Gou and Min Wu., “Data Hiding in Curves With Application to Fingerprinting Maps,” IEEE Trans. on Signal Processing, Vol.53, No.10, pp.3988-4004, 2005   DOI   ScienceOn
3 R. Ohbuchi, H. Ueda and S. Endoh, “Watermarking 2D Vector Maps in the Mesh-Spectral Domain,” Shape Modeling International, Vol.2003, pp.216-225, 2003   DOI
4 K. Solanki, U. Madhow, B. S. Manjunath, S. Chandrasekaran and I. El-Khalil, “Print and Scan Resilient Data Hiding in Images,” IEEE Trans. on Information Forensics and Security, Vol.1, No.4, 2006   DOI   ScienceOn
5 H. D. Brunk, An Introduction to Mathematical Statistics, Boston, MA: Ginn, 1960
6 E. Belogay, C. Cabrelli, U. Molter, and R. Shonkwiler, “Calculating the Hausdorff Distance Between Curves,” Information Processing Letter, Vol.64, No.1, pp.17-22, 1997   DOI   ScienceOn
7 A. K. Jain, Fundamentals of Digital Imae Processing, Englewood Cliffs, NJ: Prentice Hall, 1989
8 F. Mokhtarian and A. K. Mackworth, “A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves,” IEEE Trans. on Pattern Analysis and Machine Intelligence, Vol.14, No.8, 1992   DOI   ScienceOn