Separable Reversible Data Hiding for Encrypted 3D Meshes Based on Self-Organized Blocking and Most Significant Bit Prediction

Abstract

As a booming technique that allows secret data extraction and information carrier recovery without any loss, reversible data hiding in different carriers has attracted more and more concerns in the field of information security. In this paper, a separable reversible data hiding technique for encrypted 3D meshes is proposed based on self-organized blocking and most significant bit (MSB) prediction. The content-owner traverses all faces of the mesh in the ascending index order. Through self-organized blocking, adjacent vertices are concentrated in different small sets. The central vertex is considered as the reference and the others as embedded vertices in each set. Then, multiple most significant bits between the central vertex and others are adaptively predicted and reserved as embeddable bits for secret data embedding. Because vertex coordinates in each set have a high space correlation and most vertices participate in the prediction process, a huge number of most significant bits can be marked as embeddable bits to embed secret data. Experimental results demonstrate that the proposed method can obtain the highest embedding rate compared with representative methods. To our best knowledge, the average embedding rate of the proposed method is about 28 bits per vertex (bpv) higher than the recently proposed method. Most importantly, instead of recovering meshes with higher quality, original meshes with high visual symmetry/quality can be recovered.

Keywords

• reversible data hiding
• 3D mesh model
• self-organized blocking