Different compression methods [2] such as progressive meshes and single refinement mesh compression exist for mesh representation for 3D models and improving them is a challenge. This paper is a step in this direction, where we show that data hiding methods can be used to significantly improve the compression achieved for such methods. 3D meshes are made up of connectivity (edge set E) and geometric (vertices set V) information. The data hiding method should provide a very high embedding rate in order to achieve a desirable compression ratio. This can be modeled mathematically, given ‘V ’ points or vertices in 3D space; for a given compression ratio we use ‘K ’ points and hide rest of the connectivity and geometric information inside it. Th...
International audienceThis chapter presents the challenges of the data hiding methods, as well as th...
International audienceThis paper presents a robust watermarking algorithm applied to 3D compressed p...
[[abstract]]We present a data hiding algorithm for point-sampled geometry. The basic idea is to cons...
International audienceIn this paper we present a high capacity data hiding method for 3D meshes. The...
Geometry compression concerns the representation of three-dimensional objects. The goal of geometry ...
[[abstract]]We present an efficient information hiding algorithm for polygonal models. The decision ...
Three dimensional models are commonly used in computer graphics and 3D modeling characters in animat...
In this chapter, we discuss 3D compression techniques for reducing the delays in transmitting triang...
International audienceThree-dimensional (3-D) meshes are already profusely used in lot of domains. I...
This paper presents a novel data hiding algorithm for 3D polygonal models whose vertices have given ...
Goals of this work are to summarize the process and existing methods of 3D models watermarking, to c...
Polygonal meshes remain the primary representation for visualization of 3D data in a wide range of i...
International audienceA new reversible 3D mesh watermarking scheme is proposed in conjunction with p...
Abstract—This work presents an information hiding technique based on the vertex representation for 3...
Abstract — During a highly productive period running from 1995 to about 2002, the research in lossle...
International audienceThis chapter presents the challenges of the data hiding methods, as well as th...
International audienceThis paper presents a robust watermarking algorithm applied to 3D compressed p...
[[abstract]]We present a data hiding algorithm for point-sampled geometry. The basic idea is to cons...
International audienceIn this paper we present a high capacity data hiding method for 3D meshes. The...
Geometry compression concerns the representation of three-dimensional objects. The goal of geometry ...
[[abstract]]We present an efficient information hiding algorithm for polygonal models. The decision ...
Three dimensional models are commonly used in computer graphics and 3D modeling characters in animat...
In this chapter, we discuss 3D compression techniques for reducing the delays in transmitting triang...
International audienceThree-dimensional (3-D) meshes are already profusely used in lot of domains. I...
This paper presents a novel data hiding algorithm for 3D polygonal models whose vertices have given ...
Goals of this work are to summarize the process and existing methods of 3D models watermarking, to c...
Polygonal meshes remain the primary representation for visualization of 3D data in a wide range of i...
International audienceA new reversible 3D mesh watermarking scheme is proposed in conjunction with p...
Abstract—This work presents an information hiding technique based on the vertex representation for 3...
Abstract — During a highly productive period running from 1995 to about 2002, the research in lossle...
International audienceThis chapter presents the challenges of the data hiding methods, as well as th...
International audienceThis paper presents a robust watermarking algorithm applied to 3D compressed p...
[[abstract]]We present a data hiding algorithm for point-sampled geometry. The basic idea is to cons...