Data Hiding in Binary Image using Block Parity

TL;DR

This paper introduces a novel data hiding technique in binary images that optimizes bit positions within subdivided blocks, enhancing image quality and maintaining low computational complexity.

Contribution

It proposes a new method using block parity and optimized bit positions for improved data hiding in binary images, outperforming previous techniques.

Findings

Improved image quality in stego-images

Low computational complexity of the method

Outperforms previous data hiding approaches

Abstract

Secret data hiding in binary images is more difficult than other formats since binary images require only one bit representation to indicate black and white. This study proposes a new method for data hiding in binary images using optimized bit position to replace a secret bit. This method manipulates blocks, which are sub-divided. The parity bit for a specified block decides whether to change or not, to embed a secret bit. By finding the best position to insert a secret bit for each divided block, the image quality of the resulting stego-image can be improved, while maintaining low computational complexity.The experimental results show that the proposed method has an improvement with respect to a previous work.