Advertisement

Robust Watermarking and Affine Registration of 3D Meshes

  • Oliver Benedens
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2578)

Abstract

We propose a robust non-blind watermarking algorithm based on direct free form deformations and applicable to smooth (organic) meshes. The algorithm does generate “low frequent” smooth deformations. The second main contribution of this paper is a registration method capable of handling affine transformations in cases where meshes do not suffer from cropping. The method is an extension of results from Blake and Marinos [1] to the 3D dimensional case. We use this method as a preprocessing step of a conventional registration algorithm (capable of handling rigid transformations plus uniform scaling). We are therefore able to automatically retrieve watermarks from copies differing from the original by one global affine transformation and of course additional complex operations, the watermarking method is robust against, such as polygon simplification, subdivision surfaces, uniform- or gaussian distributed noise. We present experiments on robustness of watermarks and performance of the proposed registration technique.

Keywords

Feature Point Affine Transformation Watermark Scheme Polygon Simplification Rigid Transformation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Blake and C. Marinos, “Shape from texture: Estimation, isotropy and moments”, Artificial Intelligence, vol. 45, pp. 323–380, 1990.CrossRefGoogle Scholar
  2. 2.
    D. Sinclar and A. Blake. “Isoperimetric Normalization of Planar Curves”, IEEE Transactions On Pattern Analysis and Machine Intelligence, 16(4), pp. 769–777, August 1994.CrossRefGoogle Scholar
  3. 3.
    Vranic, D. Saupe and J. Richter, “Tools for 3D-object retrieval: Karhunen-Loeve Transform and spherical harmonics”, IEEE 2001 Workshop Multimedia Signal Processing, Cannes, France, Oct. 2001.Google Scholar
  4. 4.
    Praun, H. Hoppe and A. Finkelstein, “Robust Mesh Watermarking”, SIGGRAPH 99 Proceedings, pp. 69–76, 1999.Google Scholar
  5. 5.
    K. Yin, Z. Pan, J. Shi and D. Zhang. “Robust mesh watermarking based on multiresolution processing”, Computers & Graphics, vol. 25, pp. 409–420, 2001.CrossRefGoogle Scholar
  6. 6.
    R. Ohbuchi, A. Mukaiyama and S. Takahashi. “A Frequency-Domain Approach to Watermarking 3D Shapes”, EUROGRAPHICS 2002 Proceedings, Saarbrücken, September 2-6, 2002.Google Scholar
  7. 7.
    J. Feldmar and N. Ayache, “Rigid, affine and locally affine registration of free-form surfaces”, Int. J. of Comp. Vision, vol. 18, pp. 99–119, 1996.CrossRefGoogle Scholar
  8. 8.
    P. Besl and N. McKay, “A Method for Registration of 3-D Shapes”, IEEE Transactions on Pattern Analysis and Machine Intelligence, 14(2), pp. 239–255,1992.CrossRefGoogle Scholar
  9. 9.
    Y. Chen and G. Medioni, “Object modelling by registration of multiple range images”, Image and Vision Computing, 10(3), pp. 145–155, 1992.CrossRefGoogle Scholar
  10. 10.
    S. Umeyama, “Least Squares Estimation of Transformation Parameters Between Two Point Patterns”, IEEE Transactions on pattern analysis and machine intelligence, 13(4), 376–380, 1991.CrossRefGoogle Scholar
  11. 11.
    W. Press et al., “Numerical Recipes in C-Second Edition”, Cambridge University Press, 1992.Google Scholar
  12. 12.
    W. Hsu, J. Hughes and H. Kaufman, “Direct Manipulation of Free-Form Deformations”, SIGGRAPH’92 Proceedings, pp. 177–182, 1992.Google Scholar
  13. 13.
    S. Lee, “Interactive multiresolution editing of arbitrary meshes,” Computer Graphics Forum (Eurographics 99), vol. 18, no. 3, pp. 73–82, 1999.CrossRefGoogle Scholar
  14. 14.
    Garland, P. Heckbert. Surface Simplification Using Quadric Error Metrics. SIGGRAPH 97 Proceedings, 1997. QSlim simplfication package available from http://graphics.cs.uiuc.edu/~garland/software.html.
  15. 15.
    R. Ohbuchi, H. Masuda, and M. Aono. Watermarking Three-Dimensional Polygonal Models. Proceedings of the ACM International Conference on Multimedia.97, pp. 261–272, 1997Google Scholar
  16. 16.
    M. Wagner. Robust Watermarking of Polygonal Meshes. Proc. Geometric Modeling & Processing 2000, pp. 201–208, Hong Kong, April 10-12, 2000.Google Scholar
  17. 17.
    X. Mao, M. Shiba and A. Imamiya. Watermarking 3D Geometric Models Through Triangle Subdivision. Proceedings of SPIE Vol. 4314, Security and Watermarking of Multimedia Contents III, pp. 253–260, San-Jose, January, 2001.CrossRefGoogle Scholar
  18. 18.
    Ohbuchi, H. Masuda and M. Aono. A Shape-Preserving Data Embedding Algorithm for NURBS Curves and Surfaces. Proceedings of the Computer Graphics International (CGI) 1999, Canmore, Canada, June, 1999.Google Scholar
  19. 19.
    O. Benedens, “3D Watermarking Algorithms in Context of OpenSG Plus”, Technical Report 02i002-figd, 2002. Download through http://publica.fhg.de/.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Oliver Benedens
    • 1
  1. 1.Department Security Technology for Graphics and Communication SystemsFraunhofer IGDDarmstadtGermany

Personalised recommendations