Proceedings: GI 2007

Spectral graph-theoretic approach to 3D mesh watermarking

Emad Abdallah , A. Ben Hamza , Prabir Bhattacharya

Proceedings of Graphics Interface 2007: Montréal, Québec, Canada, 28 - 30 May 2007, 327-334

DOI 10.20380/GI2007.43

  • Bibtex

    @inproceedings{Abdallah:2007:10.20380/GI2007.43,
    author = {Abdallah, Emad and Ben Hamza, A. and Bhattacharya, Prabir},
    title = {Spectral graph-theoretic approach to 3D mesh watermarking},
    booktitle = {Proceedings of Graphics Interface 2007},
    series = {GI 2007},
    year = {2007},
    issn = {0713-5424},
    isbn = {978-1-56881-337-0},
    location = {Montr{\'e}al, Qu{\'e}bec, Canada},
    pages = {327--334},
    numpages = {8},
    doi = {10.20380/GI2007.43},
    acmdoi = {doi>10.1145/1268517.1268570},
    publisher = {Canadian Human-Computer Communications Society},
    address = {University of Waterloo, Waterloo, Ontario, Canada},
    }

Abstract

We propose a robust and imperceptible spectral watermarking method for high rate embedding of a watermark into 3D polygonal meshes. Our approach consists of four main steps: (1) the mesh is partitioned into smaller sub-meshes, and then the watermark embedding and extraction algorithms are applied to each sub-mesh, (2) the mesh Laplacian spectral compression is applied to the sub-meshes, (3) the watermark data is distributed over the spectral coefficients of the compressed sub-meshes, (4) the modified spectral coefficients with some other basis functions are used to obtain uncompressed watermarked 3D mesh. The main attractive features of this approach are simplicity, flexibility in data embedding capacity, and fast implementation. Extensive experimental results show the improved performance of the proposed method, and also its robustness against the most common attacks including the geometric transformations, adaptive random noise, mesh smoothing, mesh cropping, and combinations of these attacks.