Algorithms, Vol. 17, Pages 328: High-Fidelity Steganography: A Covert Parity Bit Model-Based Approach

Algorithms, Vol. 17, Pages 328: High-Fidelity Steganography: A Covert Parity Bit Model-Based Approach

Algorithms doi: 10.3390/a17080328

Authors: Tamer Rabie Mohammed Baziyad Ibrahim Kamel

The Discrete Cosine Transform (DCT) is fundamental to high-capacity data hiding schemes due to its ability to condense signals into a few significant coefficients while leaving many high-frequency coefficients relatively insignificant. These high-frequency coefficients are often replaced with secret data, allowing for the embedding of many secret bits while maintaining acceptable stego signal quality. However, because high-frequency components still affect the stego signal’s quality, preserving their structure is beneficial. This work introduces a method that maintains the structure of high-frequency DCT components during embedding through polynomial modeling. A scaled-down version of the secret signal is added to or subtracted from the polynomial-generated signal to minimize the error between the cover signal and the polynomial-generated signal. As a result, the stego image retains a structure similar to the original cover image. Experimental results demonstrate that this scheme improves the quality and security of the stego image compared to current methods. Notably, the technique’s robustness is confirmed by its resistance to detection by deep learning methods, as a Convolutional Neural Network (CNN) could not distinguish between the cover and stego images.