Binary quantization using Belief Propagation with decimation over factor graphs of LDGM codes

Simple item page
dc.creatorFiller, Tomas
dc.creatorFridrich, Jessica
dc.date2007-10-01
dc.date.accessioned2026-07-07T08:33:28Z
dc.date.available2026-07-07T08:33:28Z
dc.descriptionWe propose a new algorithm for binary quantization based on the Belief Propagation algorithm with decimation over factor graphs of Low Density Generator Matrix (LDGM) codes. This algorithm, which we call Bias Propagation (BiP), can be considered as a special case of the Survey Propagation algorithm proposed for binary quantization by Wainwright et al. [8]. It achieves the same near-optimal rate-distortion performance with a substantially simpler framework and 10-100 times faster implementation. We thus challenge the widespread belief that binary quantization based on sparse linear codes cannot be solved by simple Belief Propagation algorithms. Finally, we give examples of suitably irregular LDGM codes that work with the BiP algorithm and show their performance.
dc.descriptionForty-Fifth Annual Allerton Conference on Communication, Control, and Computing, 2007, 10 pages, 6 figures
dc.identifierhttps://arxiv.org/abs/0710.0192
dc.identifierhttp://arxiv.org/abs/0710.0192
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/139144
dc.subjectInformation Theory
dc.titleBinary quantization using Belief Propagation with decimation over factor graphs of LDGM codes
dc.typetext

Files

Collections

arXiv