Application of spectral decomposition to compression and watermarking of 3D triangle mesh geometry

Cayre, François; Alface, Patrice Rondão; Schmitt, Francis; Macq, Benoı̂t; Maître, H.

doi:10.1016/s0923-5965(02)00147-9

Cited by 65 publications

(50 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The creation information and logo of a creator are embedded in an electronic file in the form of unaware watermark which cannot be removed during sharing, and the watermark can be detected by a special software package [11,12]. Various watermarking methods were developed for the intellectual property protection of 2D/ 3D CAD models [13][14][15][16][17][18][19][20][21][22][23]. However, in a CPD environment, CAD models are needed to be shared safely, and watermark is not appropriate for sharing design information (design knowledge, parameters and so on) in a secure means.…”

Section: Watermarkmentioning

confidence: 99%

Encryption based partial sharing of CAD models

Cai

et al. 2015

ICA

View full text Add to dashboard Cite

Abstract. Model security for collaborative product development in a networked environment (or called networked manufacturing, grid manufacturing, and cloud manufacturing) is an important and also challenging research issue. An encryption based partial sharing approach for CAD models has been developed and presented in this paper. First, a random invertible decimal matrix to support the encryption approach is proposed, with which parts of a CAD model can be selected flexibly by the model owner for encrypting by different keys; Second, in order to guarantee the security, a dual-key mode and a key based authorization mechanism are proposed. Based on the model, different levels of security are achieved based on different key spaces, and the key based authorization mechanism is used for the model owner to control the partial access of the CAD model flexibly.

show abstract

Section: Watermarkmentioning

confidence: 99%

Encryption based partial sharing of CAD models

Cai

et al. 2015

ICA

View full text Add to dashboard Cite

show abstract

“…Watermarking algorithms can be classified as being in the spatial domain [1,2,3] or the frequency domain [4,5]; they also can be classified as relying on local constraints [1] or as being statistical in nature [2,3]. A survey of existing 3D watermarking algorithms was carried out in [6].…”

Section: Introductionmentioning

confidence: 99%

“…Most of the robust blind methods developed so far are in the spatial domain. Methods in the frequency domain include those using wavelets as well as those using spectral decomposition [4,5]. The spectral transform consists of the eigen-decomposition of the Laplacian matrix for a given mesh.…”

Section: Introductionmentioning

confidence: 99%

“…All these algorithms use the low-frequency coefficients as the message carrier and are non-blind. Blind and robust spectral domain watermarking have been proposed in [5,10,11]. The algorithm described in [10] has a very low bit-capacity while a set of specific constraints are enforced onto the distributions of spectral coefficients for information embedding in [11].…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Local Patch Blind Spectral Watermarking Method for 3D Graphics

Luo¹,

Wang²,

Borş³

et al. 2009

Digital Watermarking

View full text Add to dashboard Cite

Abstract. In this paper, we propose a blind watermarking algorithm for 3D meshes. The proposed algorithm embeds spectral domain constraints in segmented patches. After aligning the 3D object using volumetric moments, the patches are extracted using a robust segmentation method which ensures that they have equal areas. One bit is then embedded in each patch by enforcing specific constraints in the distribution of its spectral coefficients by using Principal Component Analysis (PCA). A series of experiments and comparisons with state-of-the-art in 3D graphics watermarking have been performed; they show that the proposed scheme provides a very good robustness against both geometry and connectivity attacks, while introducing a low level of dis torsion.

show abstract

“…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%

Authentication of 3-D Polygonal Meshes

Lin

Liao

et al. 2004

Digital Watermarking

View full text Add to dashboard Cite

Abstract. Designing a powerful fragile watermarking technique for authenticating 3-D polygonal meshes is a very difficult task. Yeo and Yeung [17] were first to propose a fragile watermarking method to perform authentication of 3-D polygonal meshes. Although their method can authenticate the integrity of 3-D polygonal meshes, it is unable to distinguish malicious attacks from incidental data processings. In this paper, we propose a new fragile watermarking method which not only is able to detect malicious attacks, but also is immune to incidental data processings. During the process of watermark embedding, mesh parameterization techniques are employed to perturb the coordinates of invalid vertices while cautiously maintaining the appearance of the original model. Since the proposed embedding method is independent of the order of vertices, the hidden watermark is immune to some attacks, such as vertex reordering. In addition, the proposed method can be used to perform region-based tampering detection. The experimental results have shown that the proposed fragile watermarking scheme is indeed powerful.

show abstract

Application of spectral decomposition to compression and watermarking of 3D triangle mesh geometry

Cited by 65 publications

References 10 publications

Encryption based partial sharing of CAD models

Encryption based partial sharing of CAD models

Local Patch Blind Spectral Watermarking Method for 3D Graphics

Authentication of 3-D Polygonal Meshes

Contact Info

Product

Resources

About