Title
Reduced embedding complexity using BP message passing for LDGM codes
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.
Year
DOI
Venue
2008
10.1117/12.766649
PROCEEDINGS OF THE SOCIETY OF PHOTO-OPTICAL INSTRUMENTATION ENGINEERS (SPIE)
Keywords
Field
DocType
steganography,matrix embedding,low-density codes,belief propagation,binary quantization
Steganography,Generator matrix,Embedding,Upper and lower bounds,Coset leader,Algorithm,Code word,Message passing,Mathematics,Belief propagation
Conference
Volume
ISSN
Citations 
6819
0277-786X
0
PageRank 
References 
Authors
0.34
5
3
Name
Order
Citations
PageRank
peter gunther100.34
dagmar schonfeld200.34
Antje Winkler31449.17