17 search results - page 3 / 4 » Watermarking 3D Polygonal Meshes in the Mesh Spectral Domain |
SMI
2003
IEEE
13 years 11 months ago
2003
IEEE
This paper proposes a digital watermarking algorithm for 2D vector digital maps. The watermark is a robust, informed-detection watermark to be used to prevent such abuses as an in...
SMI
2006
IEEE
14 years 10 days ago
2006
IEEE
We present an algorithm for finding a meaningful vertexto-vertex correspondence between two 3D shapes given as triangle meshes. Our algorithm operates on embeddings of the two sh...
ICML
2007
IEEE
14 years 7 months ago
2007
IEEE
This paper investigates compression of 3D objects in computer graphics using manifold learning. Spectral compression uses the eigenvectors of the graph Laplacian of an object'...
CG
2007
Springer
13 years 6 months ago
2007
Springer
This paper presents a robust non-blind watermarking scheme for subdivision surfaces. The algorithm works in the frequency domain, by modulating spectral coefficients of the subdi...
CGF
2007
13 years 6 months ago
2007
We propose a mesh segmentation algorithm via recursive bisection where at each step, a sub-mesh embedded in 3D is first spectrally projected into the plane and then a contour is ...