[[abstract]]We present an efficient information hiding algorithm for polygonal models. The decision to referencing neighbors for each embeddable vertex is based on a modified breadth first search, starting from the initial polygon determining by principal component analysis. The surface complexity is then estimated by the distance between the embedding vertex and the center of its referencing neighbors. Different amounts of secret messages are adaptively embedded according to the surface properties of each vertex. A constant threshold is employed to control the maximum embedding capacity for each vertex and decrease the model distortion simultaneously. The experimental results show the proposed algorithm is efficient and can provide higher ...
Abstract—In this paper, we propose a reversible steganography scheme for 3D mesh models. The scheme ...
This paper presents a powerful high capacity 3D steganographic algorithm which can embed more than 9...
Abstract—Although it has been known that oblivious (or blind) watermarking schemes are less robust t...
[[abstract]]We present an efficient information hiding algorithm for polygonal models. The decision ...
Abstract—This work presents an information hiding technique based on the vertex representation for 3...
This paper presents a novel data hiding algorithm for 3D polygonal models whose vertices have given ...
International audienceIn this paper we present a high capacity data hiding method for 3D meshes. The...
Abstract—In this paper, we present a very high-capacity and low-distortion 3D steganography scheme. ...
Different compression methods [2] such as progressive meshes and single refinement mesh compression ...
[[abstract]]We present a data hiding algorithm for point-sampled geometry. The basic idea is to cons...
This paper presents a watermarking algorithm suitable for embedding private watermarks into three di...
Abstract This paper presents a new adaptive digital steganographic technique for three-dimensional (...
Reversible data hiding in the encrypted domain (RDH-ED) is a technique that protects the privacy of ...
This study adopts a triangle subdivision scheme to achieve reversible data embedding. The secret mes...
[[abstract]]This thesis presents a reversible data hiding method which is affine transformation inva...
Abstract—In this paper, we propose a reversible steganography scheme for 3D mesh models. The scheme ...
This paper presents a powerful high capacity 3D steganographic algorithm which can embed more than 9...
Abstract—Although it has been known that oblivious (or blind) watermarking schemes are less robust t...
[[abstract]]We present an efficient information hiding algorithm for polygonal models. The decision ...
Abstract—This work presents an information hiding technique based on the vertex representation for 3...
This paper presents a novel data hiding algorithm for 3D polygonal models whose vertices have given ...
International audienceIn this paper we present a high capacity data hiding method for 3D meshes. The...
Abstract—In this paper, we present a very high-capacity and low-distortion 3D steganography scheme. ...
Different compression methods [2] such as progressive meshes and single refinement mesh compression ...
[[abstract]]We present a data hiding algorithm for point-sampled geometry. The basic idea is to cons...
This paper presents a watermarking algorithm suitable for embedding private watermarks into three di...
Abstract This paper presents a new adaptive digital steganographic technique for three-dimensional (...
Reversible data hiding in the encrypted domain (RDH-ED) is a technique that protects the privacy of ...
This study adopts a triangle subdivision scheme to achieve reversible data embedding. The secret mes...
[[abstract]]This thesis presents a reversible data hiding method which is affine transformation inva...
Abstract—In this paper, we propose a reversible steganography scheme for 3D mesh models. The scheme ...
This paper presents a powerful high capacity 3D steganographic algorithm which can embed more than 9...
Abstract—Although it has been known that oblivious (or blind) watermarking schemes are less robust t...