Adaptive distributed source coding

We consider distributed source coding in the presence of hidden variables that parameterize the statistical dependence among sources. We derive the Slepian-Wolf bound and devise coding algorithms for a block-candidate model of this problem. The encoder sends, in addition to syndrome bits, a portion...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society. - 1992. - 21(2012), 5 vom: 22. Mai, Seite 2630-40
1. Verfasser: Varodayan, David (VerfasserIn)
Weitere Verfasser: Lin, Yao-Chung, Girod, Bernd
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2012
Zugriff auf das übergeordnete Werk:IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
Schlagworte:Journal Article
LEADER 01000naa a22002652 4500
001 NLM213256878
003 DE-627
005 20231224021224.0
007 cr uuu---uuuuu
008 231224s2012 xx |||||o 00| ||eng c
024 7 |a 10.1109/TIP.2011.2175936  |2 doi 
028 5 2 |a pubmed24n0711.xml 
035 |a (DE-627)NLM213256878 
035 |a (NLM)22106146 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Varodayan, David  |e verfasserin  |4 aut 
245 1 0 |a Adaptive distributed source coding 
264 1 |c 2012 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 15.08.2012 
500 |a Date Revised 19.04.2012 
500 |a published: Print-Electronic 
500 |a Citation Status MEDLINE 
520 |a We consider distributed source coding in the presence of hidden variables that parameterize the statistical dependence among sources. We derive the Slepian-Wolf bound and devise coding algorithms for a block-candidate model of this problem. The encoder sends, in addition to syndrome bits, a portion of the source to the decoder uncoded as doping bits. The decoder uses the sum-product algorithm to simultaneously recover the source symbols and the hidden statistical dependence variables. We also develop novel techniques based on density evolution (DE) to analyze the coding algorithms. We experimentally confirm that our DE analysis closely approximates practical performance. This result allows us to efficiently optimize parameters of the algorithms. In particular, we show that the system performs close to the Slepian-Wolf bound when an appropriate doping rate is selected. We then apply our coding and analysis techniques to a reduced-reference video quality monitoring system and show a bit rate saving of about 75% compared with fixed-length coding 
650 4 |a Journal Article 
700 1 |a Lin, Yao-Chung  |e verfasserin  |4 aut 
700 1 |a Girod, Bernd  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society  |d 1992  |g 21(2012), 5 vom: 22. Mai, Seite 2630-40  |w (DE-627)NLM09821456X  |x 1941-0042  |7 nnns 
773 1 8 |g volume:21  |g year:2012  |g number:5  |g day:22  |g month:05  |g pages:2630-40 
856 4 0 |u http://dx.doi.org/10.1109/TIP.2011.2175936  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 21  |j 2012  |e 5  |b 22  |c 05  |h 2630-40