Skip to main navigation Skip to search Skip to main content

A robust and invisible watermarking of 3D triangle meshes

  • Wang Liu*
  • , Sheng He Sun
  • *Corresponding author for this work
  • Harbin Institute of Technology

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

With the rapid development of computer multimedia, how to protect digital products from being copied, pirated and juggled has been an urgent issue in the information security field. Digital watermarking is a new method to solve the referred problems. This paper proposes a digital watermarking algorithm for three-dimension (3D) mesh models. The watermark is embedded into the host with modifying the lengths between the vertices and the centroid of models. The embedded watermark is invisible and can withstand the common attacks such as polygon mesh simplifications, addition of random noise, and similarity transforms. The validity of proposed algorithm has been confirmed with experiments.

Original languageEnglish
Title of host publicationKnowledge-Based Intelligent Information and Engineering Systems - 9th International Conference, KES 2005, Proceedings
PublisherSpringer Verlag
Pages881-888
Number of pages8
ISBN (Print)354028897X, 9783540288978
DOIs
StatePublished - 2005
Event9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2005 - Melbourne, Australia
Duration: 14 Sep 200516 Sep 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3684 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference9th International Conference on Knowledge-Based Intelligent Information and Engineering Systems, KES 2005
Country/TerritoryAustralia
CityMelbourne
Period14/09/0516/09/05

Fingerprint

Dive into the research topics of 'A robust and invisible watermarking of 3D triangle meshes'. Together they form a unique fingerprint.

Cite this