Paper
18 March 2008 Reduced embedding complexity using BP message passing for LDGM codes
Peter Günther, Dagmar Schönfeld, Antje Winkler
Author Affiliations +
Abstract
The application of Low-Density Generator Matrix (LDGM) Codes combined with Survey Propagation (SP) in steganography seems to be advantageous, since it is possible to approximate the coset leader directly. Thus, large codeword length can be applied, resulting in an embedding efficiency close to the theoretical upper bound of embedding efficiency. Since this approach is still quite complex, this paper deals with the application of Belief Propagation (BP) to LDGM Codes used to reduce the complexity of embedding while keeping the embedding efficiency constant.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Peter Günther, Dagmar Schönfeld, and Antje Winkler "Reduced embedding complexity using BP message passing for LDGM codes", Proc. SPIE 6819, Security, Forensics, Steganography, and Watermarking of Multimedia Contents X, 681919 (18 March 2008); https://doi.org/10.1117/12.766649
Lens.org Logo
CITATIONS
Cited by 1 scholarly publication.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Surface plasmons

Steganography

Forward error correction

Binary data

Chemical elements

Matrices

Algorithms

RELATED CONTENT

Robust fingerprinting codes and applications
Proceedings of SPIE (February 11 2009)
Sphere-hardening dither modulation
Proceedings of SPIE (February 16 2006)
Writing on wet paper
Proceedings of SPIE (March 21 2005)

Back to Top