A fragile watermarking scheme for 3D meshes

Hao Tian Wu*, Yiu Ming CHEUNG

*Corresponding author for this work

Research output: Chapter in book/report/conference proceedingConference contributionpeer-review

28 Citations (Scopus)

Abstract

In this paper, we propose a new fragile watermarking scheme for 3D meshes. Firstly, the watermark information is adaptively embedded into the mesh geometry by slightly adjusting the vertex positions while the mesh topology is unchanged. The embedded watermark can be blindly retrieved with some priori knowledge and used to authenticate the integrity of the watermarked mesh. Compared with previous methods, our proposed one has the following advantages: (1) the embedded watermark is invariant to translation, rotation and uniformly scaling, but sensitive to other operations; (2) enhanced with a reference position, any processing made to the watermarked mesh can be detected; (3) the embedding strength is adjustable so that a trivial tampering with the watermarked mesh model may lead the embedded watermark to change. As a result, unauthorized modifications of the mesh model can be detected and classified.

Original languageEnglish
Title of host publicationProceedings of the 7th Multimedia and Security Workshop 2005, MM and Sec'05
Pages117-123
Number of pages7
Publication statusPublished - 2006
Event7th Multimedia and Security Workshop 2005, MM and Sec'05 - New York, NY, United States
Duration: 1 Aug 20052 Aug 2005

Publication series

NameProceedings of the 7th Multimedia and Security Workshop 2005, MM and Sec'05
Volume2006

Conference

Conference7th Multimedia and Security Workshop 2005, MM and Sec'05
Country/TerritoryUnited States
CityNew York, NY
Period1/08/052/08/05

Scopus Subject Areas

  • Engineering(all)

User-Defined Keywords

  • Dither modulation
  • Fragile watermarking
  • Mesh authentication
  • Mesh centroid
  • Tampering detection

Fingerprint

Dive into the research topics of 'A fragile watermarking scheme for 3D meshes'. Together they form a unique fingerprint.

Cite this