Parallel BFS through pennant data structure with reducer hyper‐object based data hiding for 3D mesh images

Abstract

Data hiding refers to the technique employed to conceal sensitive data within various forms of multimedia, such as video, audio, text, 2D images, 3D images, and more, while also being able to successfully extract said information from the multimedia file. Although numerous data hiding techniques exist for 2D images, research on data hiding in 3D images is still in its early stages. Current 3D image steganography methods suffer from limitations in terms of embedding capacity and time complexity. To overcome these difficulties, we propose a novel 3D image steganographic technique using Parallel Breadth First Search (PBFS) with hyper‐object. Our approach utilizes the PBFS searching strategy, along with layer synchronization, to embed private information within the vertices of the 3D mesh images. To maximize the effectiveness of the process and minimize time, cost, complexity, and execution, we involved the data structure “bag” to parallelize the BFS. The implementation of bags is based on the pennant data structure. This methodology obtained an impressive Embedding Capacity (EC) of 9.00 bits per vertex (bpv) while maintaining superior visual quality and time complexity. Consequently, the proposed methodology holds great potential for widespread utilization across numerous sectors, including private and government organizations such as intelligence agencies, intellectual property rights management, cloud data security, defense, covert communication, medical imagery, and more.