Paper
21 March 2005 Handling uneven embedding capacity in binary images: a revisit
Author Affiliations +
Abstract
Hiding data in binary images can facilitate the authentication and annotation of important document images in digital domain. A representative approach is to first identify pixels whose binary color can be flipped without introducing noticeable artifacts, and then embed one bit in each non-overlapping block by adjusting the flippable pixel values to obtain the desired block parity. The distribution of these flippable pixels is highly uneven across the image, which is handled by random shuffling in the literature. In this paper, we revisit the problem of data embedding for binary images and investigate the incorporation of a most recent steganography framework known as the wet paper coding to improve the embedding capacity. The wet paper codes naturally handle the uneven embedding capacity through randomized projections. In contrast to the previous approach, where only a small portion of the flippable pixels are actually utilized in the embedding, the wet paper codes allow for a high utilization of pixels that have high flippability score for embedding, thus giving a significantly improved embedding capacity than the previous approach. The performance of the proposed technique is demonstrated on several representative images. We also analyze the perceptual impact and capacity-robustness relation of the new approach.
© (2005) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Min Wu, Jessica Fridrich, Miroslav Goljan, and Hongmei Gou "Handling uneven embedding capacity in binary images: a revisit", Proc. SPIE 5681, Security, Steganography, and Watermarking of Multimedia Contents VII, (21 March 2005); https://doi.org/10.1117/12.587379
Lens.org Logo
CITATIONS
Cited by 13 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Data hiding

Computer programming

Steganography

Visualization

Dysprosium

Error analysis

RELATED CONTENT

Steganography using the minimax eigenvalue decomposition
Proceedings of SPIE (November 06 1998)
Data hiding in binary text documents
Proceedings of SPIE (August 01 2001)
T-order statistics and secure adaptive steganography
Proceedings of SPIE (August 30 2005)
Writing on wet paper
Proceedings of SPIE (March 21 2005)

Back to Top