An improved data hiding approach for polygon meshes |
| |
Authors: | Shih-Chun Tu Wen-Kai Tai Martin Isenburg Chin-Chen Chang |
| |
Affiliation: | 1. Department of Computer Science and Information Engineering, National Dong Hwa University, 1, Sec. 2, Da Hsueh Rd., Shou-Feng, Hualien, 974, Taiwan 2. Lawrence Livermore National Laboratory, Livermore, USA 3. Department of Computer Science and Information Engineering, National United University, 1, Lien Da, Kungching Li, Miaoli, 360, Taiwan
|
| |
Abstract: | We present an improved technique for data hiding in polygonal meshes, which is based on the work of Bogomjakov et al. (Comput.
Graph. Forum 27(2):637–642, 2008). Like their method, we use an arrangement on primitives relative to a reference ordering to embed a message. But instead
of directly interpreting the index of a primitive in the reference ordering as the encoded/decoded bits, our method slightly
modifies the mapping so that our modification doubles the chance of encoding an additional bit compared to Bogomjakov et al.’s
(Comput. Graph. Forum 27(2):637–642, 2008). We illustrate the inefficiency in the original mapping of Bogomjakov et al. (Comput. Graph. Forum 27(2):637–642, 2008) with an intuitive representation using a binary tree. |
| |
Keywords: | |
本文献已被 SpringerLink 等数据库收录! |
|