A Majority Signal Parity Check Scheme For Data Hiding with Tree-Based Parity Check

Abstract

In order to increase the embedding efficiency, we analyse an asymptotic behaviour when developing a steganographic scheme. For steganography, it's crucial to minimise the cover and the distortion item and the stego object. Due to its simplicity, parity check using trees approach is particularly effective for using visual data to cover over a message. We suggest a Majority Signal Parity Check based on this methodology, which yields the least distortion when locating a stego object. Our method's reduced embedding efficiency is superior to that of earlier studies when the hidden message length reaches a sizeable amount.