Publications associées à Codage de Huffman

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.

Source-Channel Communication in Sensor Networks

Martin Vetterli, Michael Christoph Gastpar

Sensors acquire data, and communicate this to an interested party. The arising coding problem is often split into two parts: First, the sensors compress their respective acquired signals, potentially applying the concepts of distributed source coding. Then ...

2003

An ASIC implementation of adaptive arithmetic coding

Andreas Peter Burg

In this work, we present an improved version of an ASIC implementation of the adaptive arithmetic coding algorithm which uses a two-level memory hierarchy. We propose algorithmic modifications and a special hardware structure to speed-up the design without ...

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

R-D Analysis of Adaptive Edge Representations

Pierre Vandergheynst, Lorenzo Granai

This paper presents a Rate-Distortion analysis for a simple horizon edge image model. A quadtree with anisotropy and rotation is performed on this kind of image, giving a toy model for a non-linear adaptive coding technique, and its Rate-Distortion behavio ...

IEEE2002

Optimal Filter Banks for Multiple Description Coding: Analysis and Synthesis

Martin Vetterli, Pier Luigi Dragotti

Multiple description (MD) coding is a source coding technique for information transmission over unreliable networks. In MD coding, the coder generates several different descriptions of the same signal and the decoder can produce a useful reconstruction of ...

Institute of Electrical and Electronics Engineers2002

A generalized Rate-Distortion limit for edge representation

Pierre Vandergheynst, Lorenzo Granai

This paper presents a rate-distortion analysis for a simple horizon edge image model. A quadtree with anisotropy and rotation is performed in this kind of image, giving a toy model for a non-linear adaptive coding technique, and its rate-distortion behavio ...

2002

Lossy to lossless object-based coding of 3-D MRI data

Jean-Philippe Thiran, Gloria Menegaz

We propose a fully three-dimensional object-based coding system exploiting the diagnostic relevance of the different regions of the volumetric data for rate allocation. The data are first decorrelated via a 3D discrete wavelet transform. The implementation ...

2002

To Code, Or Not To Code: On the Optimality of Symbol-by-Symbol Communication

Martin Vetterli, Michael Christoph Gastpar, Bixio Rimoldi

When is uncoded transmission optimal? This paper derives easy-to-check necessary and sufficient conditions that do not require finding the rate-distortion and the capacity-cost functions. We consider the symbol-by-symbol communication of discrete-time memo ...

2001

Analysis of optimal filter banks for multiple description coding

Martin Vetterli, Pier Luigi Dragotti

We study the problem of multiple description (MD) coding of stationary Gaussian sources with memory. First, we compute an approximate rate distortion region for these sources, which we prove to be asymptotically tight at high rates: this region generalizes ...

2000

Codage de Huffman

Graph Chatbot

Chattez avec Graph Search

Source-Channel Communication in Sensor Networks

An ASIC implementation of adaptive arithmetic coding

R-D Analysis of Adaptive Edge Representations

Optimal Filter Banks for Multiple Description Coding: Analysis and Synthesis

A generalized Rate-Distortion limit for edge representation

Lossy to lossless object-based coding of 3-D MRI data

To Code, Or Not To Code: On the Optimality of Symbol-by-Symbol Communication

Analysis of optimal filter banks for multiple description coding

Time-Splitting Multiple-Access

Decoding algebraic geometric codes

R-D Analysis of Adaptive Edge Representations

To Code, Or Not To Code: On the Optimality of Symbol-by-Symbol Communication

An ASIC implementation of adaptive arithmetic coding

Source-Channel Communication in Sensor Networks

Optimal Filter Banks for Multiple Description Coding: Analysis and Synthesis

Time-Splitting Multiple-Access

A generalized Rate-Distortion limit for edge representation

Decoding algebraic geometric codes

Analysis of optimal filter banks for multiple description coding

Lossy to lossless object-based coding of 3-D MRI data