Name
Abstract | ||
|---|---|---|
For the last five years or so, several 3D data hiding algo- rithms have been developed. Few of them proposed methods to hide data in 3D objects without changing the position of vertices in the 3D space. In this paper we propose a new ap- proach of data hiding in 3D objects based on the minimum spanning tree (MST). This method is lossless in the sense that the positions of the vertices are unchanged. The method is blind and does not depend on the ordering of the data in the files. Moreover the embedding capacity is significant and can be as high as 2.5% of the size of the 3D object. |
Year | Venue | Keywords |
|---|---|---|
2008 | EUSIPCO | computer graphics,data encapsulation,mesh generation,trees (mathematics),3d data hiding algorithm,3d objects,3d triangular mesh topology,mst,lossless data hiding method,minimum spanning tree |
Field | DocType | ISSN |
Lossless data hiding,Embedding,Vertex (geometry),Computer science,Information hiding,Algorithm,Theoretical computer science,Lossless compression,Triangle mesh,Minimum spanning tree | Conference | 2219-5491 |
Citations | PageRank | References |
2 | 0.47 | 9 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| P. Amat | 1 | 3 | 0.85 |
| William Puech | 2 | 535 | 76.74 |
| sebastien druon | 3 | 2 | 0.47 |
| J. P. Pedeboy | 4 | 19 | 3.91 |