An efficient steganographic algorithm for 3-D models

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.