Publication

Polar Codes are Optimal for Lossy Source Coding

Related publications (107)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

A Stochastic Model for Video and its Information Rates

Martin Vetterli, Minh Do

We propose a stochastic model for video and compute its information rates. The model has two sources of information representing ensembles of camera motion and visual scene data (i.e. "realities"). The sources of information are combined generating a vecto ...

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

A comparative study of JPEG 2000, AVC/H.264, and HD Photo

Touradj Ebrahimi, Francesca De Simone, Frédéric Dufaux, Mourad Ouaret

In this paper, we report a study evaluating rate-distortion performance between JPEG 2000, AVC/H.264 High 4:4:4 Intra and HD Photo. A set of ten high definition color images with different spatial resolutions has been used. Both the PSNR and the perceptual ...

2007

The Wyner-Ziv Problem with Noisy Side-Information at the Encoder

Etienne Perron

In the problem of lossy source coding with side-information, it is well known (Wyner and Ziv 1976) that knowledge of the side-information at the encoder improves the rate-distortion trade-off for binary sources and the Hamming distortion measure. We consid ...

2006

Burrows-Wheeler text compression with fountain codes

Mohammad Amin Shokrollahi, Bertrand Ndzana Ndzana

This paper presents an algorithm in a purely lossless text compression setting based on fountain codes and the Burrows-Wheeler transform (BWT). The scheme consists of five stages, each of which is briefly described in the paper. The algorithm offers encour ...

2006

Lossy source coding for a cascade communication system with side-informations

Suhas Diggavi

We investigate source coding in a cascade communication system consisting of an encoder, a relay and an end terminal, where both the relay and the end terminal wish to reconstruct source

X

with certain fidelities. Additionally, side-informations

Z

and ...

2006

Achievable error exponents in multiterminal source coding

Michael Christoph Gastpar

Encoding correlated sources at separate encoders has been studied extensively from the perspective of asymptotically long block codes. The associated error exponents are known for the case of lossless source coding. In this paper, we introduce a novel tech ...

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

On the Use of Masking Models for Image and Audio Watermarking

Justin Picard, Arnaud Robert

In most watermarking systems, masking models, inherited from data compression algorithms, are used to preserve fidelity by controlling the perceived distortion resulting from adding the watermark to the original signal. So far, little attention has been pa ...

2005

Compression of ECG as a Signal with Finite Rate of Innovation

Martin Vetterli, Thierry Blu, Yan Hao

Compression of ECG (electrocardiogram) as a signal with finite rate of innovation (FRI) is proposed in this paper. By modelling the ECG signal as the sum of bandlimited and nonuniform linear spline which contains finite rate of innovation (FRI), sampling t ...

IEEE2005

On Wyner-Ziv networks

Michael Christoph Gastpar

Wyner and Ziv [1] determined the rate-distortion function of source coding with side information. In this paper, we consider a network extension of their scenario: Many sources have to be compressed in a rate-distortion sense for a decoder that has access ...

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

Lossy source coding for a cascade communication system with side-informations

Suhas Diggavi

We investigate source coding in a cascade communication system consisting of an encoder, a relay and an end terminal, where both the relay and the end terminal wish to reconstruct source

X

with certain fidelities. Additionally, side-informations

Z

and ...

2006