Concept

Universal code (data compression)

Related publications (30)

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 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

Computational Hardness and Explicit Constructions of Error Correcting Codes

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

We outline a procedure for using pseudorandom generators to construct binary codes with good properties, assuming the existence of sufficiently hard functions. Specifically, we give a polynomial time algorithm, which for every integers

n

and

k

, constru ...

2006

Spatio-Temporal Sampling and Distributed Compression of the Sound Field

Martin Vetterli, Emre Telatar, Luciano Sbaiz, Olivier Roy, Thibaut Ajdler, Robert Konsbruck

We investigate how the sound field induced by an acoustic event evolves over space and time. The characteristics of its bidimensional Fourier spectrum are analyzed and spatio-temporal sampling results using an array of microphones are provided for differen ...

2006

Universal variable-length data compression of binary sources using fountain codes

Mohammad Amin Shokrollahi

This paper proposes a universal variable-length lossless compression algorithm based on fountain codes. The compressor concatenates the Burrows-Wheeler block sorting transform (BWT) with a fountain encoder, together with the closed-loop iterative doping al ...

2004

On Compression Using the Distributed Karhunen-Loeve Transform

Martin Vetterli, Michael Christoph Gastpar, Pier Luigi Dragotti

In this paper, we discuss a framework for the distributed compression of vector sources, based on our previous work on distributed transform coding. In particular, our goal is to develop a strategy of first applying a suitable distributed Karhunen-Loeve tr ...

2004

On Network Correlated Data Gathering

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree communication structure, where the goal is to minimize the total transmission cost of transporting the information collected by the nodes, to the sink node. Two c ...

2004

Efficient decentralized communications in sensor networks

Razvan Cristescu

This thesis is concerned with problems in decentralized communication in large networks. Namely, we address the problems of joint rate allocation and transmission of data sources measured at nodes, and of controlling the multiple access of sources to a sha ...

EPFL2004

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

Image Compression Using Binary Space Partitioning Trees

Martin Vetterli

For low bit-rate compression applications, segmentation-based coding methods provide, in general, high compression ratios when compared with traditional (e.g., transform and subband) coding approaches. In this paper, we present a new segmentation-based ima ...

1996

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.

Computational Hardness and Explicit Constructions of Error Correcting Codes

Mohammad Amin Shokrollahi, Mahdi Cheraghchi Bashi Astaneh

n

and

k

, constru ...

2006