Concept

Codage de Huffman

Publications associées (191)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

On scalable source coding with decoder side informations

Suhas Diggavi

We consider the problem of scalable source coding with decoder side informations. Two special cases of this problem have been investigated in the literature, namely successive refinement Wyner-Ziv (SR-WZ) coding and side-information scalable (SI-Scalable) ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

On Comparing Image and Video Compression Algorithms

Touradj Ebrahimi, Frédéric Dufaux, Mourad Ouaret

In this work, a performance evaluation of AVC Intra and JPEG2000 in terms of rate-distortion performance is conducted. A set of High Definition sequences with different spatial resolutions is used for this purpose. Results obtained show quite competitive p ...

2007

Codec-Independent Scalable Distributed Video Coding

Touradj Ebrahimi, Frédéric Dufaux, Mourad Ouaret

In this paper, we introduce novel schemes for scalable Distributed Video Coding (DVC), dealing with temporal, spatial and quality scalabilities. More specifically, conventional coding is used to obtain a base layer. DVC is then applied to generate enhancem ...

2007

The case for structured random codes in network communication theorems

Michael Christoph Gastpar

In the Shannon-theoretic analysis of joint source-channel coding problems, achievability is usually established via a two-stage approach: The sources are compressed into bits' and these bits are reliably communicated across the noisy channels. Random codin ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Reconfigurable media coding: a new specification model for multimedia coders

Marco Mattavelli, Christophe Lucarz

Multimedia coding technology, after about 20 years of active research, has delivered a rich variety of different and complex coding algorithms. Selecting an appropriate subset of these algorithms would, in principle, enable a designer to produce the codec ...

2007

Distributed Spatial Audio Coding in Wireless Hearing Aids

Martin Vetterli, Olivier Roy

The information content of binaural signals can be beneficial to many algorithms deployed in current digital hearing aids. However, the exchange of such signals over a wireless communication link requires transmission schemes that must fulfill demanding te ...

2007

A family of non-binary TLDPC codes: density evolution, convergence and thresholds

We generalize the results about how to compute iterative decoding thresholds over the binary erasure channel of non-binary LDPC code ensembles of [16] to non-binary TLDPC codes [2], [3]. We show in this case how density evolution can be performed in order ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Wyner-Ziv coding of multi-view omnidirectional images with overcomplete decompositions

Pascal Frossard, Ivana Tosic

This paper addresses the problem of distributed coding of light fields in camera networks. A novel distributed coding scheme with side information is presented, based on spherical image expansion over an overcomplete dictionary of geometric atoms. We propo ...

2007

Recent Advances in Multi-view Distributed Video Coding

Touradj Ebrahimi, Frédéric Dufaux, Mourad Ouaret

We consider dense networks of surveillance cameras capturing overlapped images of the same scene from different viewing directions, such a scenario being referred to as multi-view. Data compression is paramount in such a system due to the large amount of c ...

2007

On the Message Complexity of Indulgent Consensus

Rachid Guerraoui, Seth Gilbert

Many recommend planning for the worst and hoping for the best. In this paper we devise efficient indulgent consensus algorithms that can tolerate crash failures and arbitrarily long periods of asynchrony, and yet perform (asymptotically) optimally in well- ...

Springer2007