Reduced embedding complexity using BP message passing for LDGM codes.
Peter GüntherDagmar SchönfeldAntje WinklerPublished in: Security, Forensics, Steganography, and Watermarking of Multimedia Contents (2008)
Keyphrases
- message passing
- belief propagation
- graphical models
- ldpc codes
- stereo matching
- markov random field
- graph cuts
- probabilistic inference
- approximate inference
- factor graphs
- shared memory
- distributed systems
- inference in graphical models
- sum product algorithm
- distributed shared memory
- singly connected
- max product
- loopy belief propagation
- decoding algorithm
- error correction
- sum product
- energy minimization
- energy function
- pairwise
- three dimensional
- computational complexity
- high quality
- data hiding
- conditional random fields
- post processing
- preprocessing
- object recognition
- image sequences