2001
DOI: 10.1016/s0097-8493(01)00065-6
|View full text |Cite
|
Sign up to set email alerts
|

Robust mesh watermarking based on multiresolution processing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
62
0

Year Published

2004
2004
2013
2013

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 97 publications
(62 citation statements)
references
References 18 publications
0
62
0
Order By: Relevance
“…the number of locally embedded bits) in rough areas of the cover mesh. Different roughness measures have been proposed in the literature of mesh watermarking, respectively based on the minimum [YIK03] or total [Bor06] length of the incident edges of a vertex, the dihedral angle between neighbouring facets [CW07] and the variance of the facet normal directions [YPSZ01]. Lavoué [Lav09] devises a roughness measure based on the curvature difference between the input mesh and a carefully smoothed version.…”
Section: Use Of Hvs Features For Mesh Watermarkingmentioning
confidence: 99%
“…the number of locally embedded bits) in rough areas of the cover mesh. Different roughness measures have been proposed in the literature of mesh watermarking, respectively based on the minimum [YIK03] or total [Bor06] length of the incident edges of a vertex, the dihedral angle between neighbouring facets [CW07] and the variance of the facet normal directions [YPSZ01]. Lavoué [Lav09] devises a roughness measure based on the curvature difference between the input mesh and a carefully smoothed version.…”
Section: Use Of Hvs Features For Mesh Watermarkingmentioning
confidence: 99%
“…Spatial techniques [1,2] are quite fast and simple to implement, but do not yet provide enough robustness and are rather adapted for blind fragile watermarking or steganography. Spectral algorithms decompose the target 3D object into a spectral-like (or multi-resolution) domain using wavelets [3], multi-resolution decomposition [4,5] or spectral analysis [6,7,8] in order to embed the watermark by modifying kinds of spectral coefficients. Our objective is to propose an efficient watermarking algorithm for subdivision surfaces, which have not been, for the moment, considered in existing 3D techniques.…”
Section: Introductionmentioning
confidence: 99%
“…There are a great number of existing robust watermarking algorithms designed to protect 3-D graphic models [1,2,3], [8], [11,12,13], [16], [19]. Their common purpose is to provide a robust way to protect target contents when attacks are encountered.…”
Section: Introductionmentioning
confidence: 99%