A Generalization of Blahut-Arimoto Algorithm to Compute Rate-Distortion Regions of Multiterminal Source Coding Under Logarithmic Loss

Yigit Ugur 1 Inaki Estella Aguerri 1 Abdellatif Zaidi 2
1 Huawei Technologies France [Boulogne-Billancour]
2 UPEM - Université Paris-Est Marne-la-Vallée
Abstract : In this paper, we present iterative algorithms that numerically compute the rate-distortion regions of two problems: the two-encoder multiterminal source coding problem and the Chief Executive Officer (CEO) problem, both under logarithmic loss distortion measure.With the clear connection of these models with the distributed information bottleneck method, the proposed algorithms may find usefulness in a variety of applications, such as clustering, pattern recognition and learning. We illustrate the efficiency of our algorithms through some numerical examples.
Type de document :
Communication dans un congrès
IEEE Information Theory Workshop, ITW, Nov 2017, Kaohshiung, Taiwan. 2017
Liste complète des métadonnées
https://hal.archives-ouvertes.fr/hal-01806549
Contributeur : Abdellatif Zaidi <>
Soumis le : dimanche 3 juin 2018 - 15:59:43
Dernière modification le : mardi 3 juillet 2018 - 08:03:04

Lien texte intégral

arxiv

Identifiants

  • HAL Id : hal-01806549, version 1
  • ARXIV : 1708.07309

Collections

UPEC-UPEM | ENPC | PARISTECH | LIGM | LIGM_SIGNAL

Citation

Yigit Ugur, Inaki Estella Aguerri, Abdellatif Zaidi. A Generalization of Blahut-Arimoto Algorithm to Compute Rate-Distortion Regions of Multiterminal Source Coding Under Logarithmic Loss. IEEE Information Theory Workshop, ITW, Nov 2017, Kaohshiung, Taiwan. 2017. 〈hal-01806549〉

Exporter

BibTeX TEI DC DCterms EndNote

Partager

Métriques

Consultations de la notice

22

Contact

support.ccsd.cnrs.fr
hal.support@ccsd.cnrs.fr
Logo CCSD