DocumentCode
1665000
Title
An efficient steganographic algorithm for 3-D models
Author
Salman, M. ; Worrall, S. ; Kondoz, A.
Author_Institution
Centre for Commun. Syst. Res., Univ. of Surrey, Guildford
fYear
2008
Firstpage
2742
Lastpage
2745
Abstract
Almost all of the steganographic techniques developed so far require considerable processing, as much as 33% of the whole processing time in case of the fastest method, to define a stable sequence of Data Embedding Primitives (DEPs). We propose the use of an implicit point order (IPO) of 3-D models to establish such a sequence, defined by the description of a point set in a 3-D model. The novel approach, implicit point order (IPO) steganography, enables the elimination of the need for any pre-processing traversal stage. We present a blind, substitutive and affine invariant system in spatial domain. We discuss the performance of the method in terms of capacity, complexity, visibility and security. Experiments show that the proposed approach has high efficiency with low distortion and high capacity as compared to other schemes. Moreover, our blind scheme can process point sampled geometry (with no polygonal structures) and polygonal models.
Keywords
computational geometry; solid modelling; steganography; blind steganographic algorithm; data embedding primitive; implicit point order; point sampled 3D model; polygon 3D model; Data encapsulation; Information geometry; Information retrieval; Payloads; Power system security; Robustness; Solid modeling; Steganography; Watermarking;
fLanguage
English
Publisher
ieee
Conference_Titel
Signal Processing, 2008. ICSP 2008. 9th International Conference on
Conference_Location
Beijing
Print_ISBN
978-1-4244-2178-7
Electronic_ISBN
978-1-4244-2179-4
Type
conf
DOI
10.1109/ICOSP.2008.4697715
Filename
4697715
Link To Document