2008
DOI: 10.1111/j.1467-8659.2008.01161.x
|View full text |Cite
|
Sign up to set email alerts
|

Distortion‐Free Steganography for Polygonal Meshes

Abstract: We present a technique for steganography in polygonal meshes. Our method hides a message in the indexed representation of a mesh by permuting the order in which faces and vertices are stored. The permutation is relative to a reference ordering that encoder and decoder derive from the mesh connectivity in a consistent manner. Our method is distortion-free because it does not modify the geometry of the mesh. Compared to previous steganographic methods for polygonal meshes our capacity is up to an order of magnit… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

1
60
0

Year Published

2010
2010
2022
2022

Publication Types

Select...
4
4
1

Relationship

0
9

Authors

Journals

citations
Cited by 50 publications
(61 citation statements)
references
References 20 publications
(13 reference statements)
1
60
0
Order By: Relevance
“…The embedding scheme hides secret messages in the vertices of 3D polygon models. Similarly, Bogomjakov et al [78], hide a message in the indexed representation of a mesh by permuting the order in which faces and vertices are stored. Although, such methods claim higher embedding capacity, however time complexity to generate the mesh and then rendering can be an issue.…”
Section: Adaptive Steganographymentioning
confidence: 99%
“…The embedding scheme hides secret messages in the vertices of 3D polygon models. Similarly, Bogomjakov et al [78], hide a message in the indexed representation of a mesh by permuting the order in which faces and vertices are stored. Although, such methods claim higher embedding capacity, however time complexity to generate the mesh and then rendering can be an issue.…”
Section: Adaptive Steganographymentioning
confidence: 99%
“…[Wang and Cheng 2005] increase the embedding capacity and reduce the distortion by employing a multi-level embedding procedure. Bogomjakov et al [Bogomjakov et al 2008] propose a distortion-free steganographic method, using the redundancy in the indexed representation of a mesh by permuting the order in which faces and vertices are stored. Tu et al [Tu et al 2010] improves the efficiency in the original mapping of [Bogomjakov et al 2008], further increasing its capacity.…”
Section: D Watermarkingmentioning
confidence: 99%
“…Bogomjakov et al [Bogomjakov et al 2008] propose a distortion-free steganographic method, using the redundancy in the indexed representation of a mesh by permuting the order in which faces and vertices are stored. Tu et al [Tu et al 2010] improves the efficiency in the original mapping of [Bogomjakov et al 2008], further increasing its capacity. Chao et al [Chao et al 2009] propose a high-capacity, low-distortion method based on vertex projection onto the principal axis.…”
Section: D Watermarkingmentioning
confidence: 99%
“…Another limitation is that this approach cannot withstand certain malicious attacks such as smoothing, additional noise, non uniform scaling, simplification, and vertices resampling [19]. As a result, the proposed approach is not suitable for the applications of digital content protection and authentication .Similarly, Bogomjakov et al [55], hide a message in the indexed representation of a mesh by permuting the order in which faces and vertices are stored. The permutation is relative to a reference ordering that encoder and decoder derive from the mesh connectivity in a consistent manner.…”
Section: Milestones For Adaptive Steganographymentioning
confidence: 99%