Publications associées à Lossy source coding via spatially coupled LDGM ensembles

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.

L'art des structures; Une introduction au fonctionnement des structures en architecture

Aurelio Muttoni

Le thème de la structure constitue depuis toujours un aspect fondamental de la construction, intéressant aussi bien les ingénieurs que les architectes. Cet ouvrage consacré aux structures en architecture s'est donné pour objectif de contribuer à faciliter ...

Presse Polytechnique et Universitaires Romandes, 2è édition2012

Performance analysis of VP8 image and video compression based on subjective evaluations

Touradj Ebrahimi, Francesca De Simone, Jong Seok Lee, Lutz Goldmann

Today, several alternatives for compression of digital pictures and video sequences exist to choose from. Beside internationally recognized standard solutions, open access options like the VP8 image and video compression have recently appeared and are gain ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2011

Scalable Feature Extraction for Coarse-to-Fine JPEG2000 Image Classification

Pierre Vandergheynst, Christophe De Vleeschouwer, Benoît Macq

In this paper, we address the issues of analyzing and classifying JPEG 2000 code-streams. An original representation, called integral volume, is first proposed to compute local image features progressively from the compressed code-stream, on any spatial im ...

Institute of Electrical and Electronics Engineers2011

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke, Satish Babu Korada

We consider lossy source compression of a binary symmetric source using polar codes and the low-complexity successive encoding algorithm. It was recently shown by Arikan that polar codes achieve the capacity of arbitrary symmetric binary-input discrete mem ...

Institute of Electrical and Electronics Engineers2010

On the Information Rates of the Plenoptic Function

Martin Vetterli, Minh Do

The plenoptic function describes the visual information available to an observer at any point in space and time. Samples of the plenoptic function (POF) are seen in video and in general visual content (images, mosaics, panoramic scenes, etc.), and rep- res ...

Institute of Electrical and Electronics Engineers2010

Methods for efficient certificate revocation list compression

Serge Vaudenay, Imad Aad, Valtteri Niemi, Rafik Chaabouni, Atefeh Mashatan

A method for providing efficient management of certificate revocation may comprise storing a list of identifiers of digital certificates including a revocation list defining a list of revoked certificates in an accumulator, storing a witness value in assoc ...

2010

Polar Codes are Optimal for Lossy Source Coding

Rüdiger Urbanke, Satish Babu Korada

We consider lossy source compression of a binary symmetric source with Hamming distortion function. We show that polar codes combined with a low-complexity successive cancellation encoding algorithm achieve the rate-distortion bound. The complexity of both ...

2009

Lossy Source Coding with Gaussian or Erased Side-Information

Emre Telatar, Suhas Diggavi, Etienne Perron

In this paper we find properties that are shared between two seemingly unrelated lossy source coding setups with side information. The first setup is when the source and side information are jointly Gaussian and the distortion measure is quadratic. The sec ...

2009

Lossy source coding via spatially coupled LDGM ensembles

Graph Chatbot

Chattez avec Graph Search

L'art des structures; Une introduction au fonctionnement des structures en architecture

Performance analysis of VP8 image and video compression based on subjective evaluations

Scalable Feature Extraction for Coarse-to-Fine JPEG2000 Image Classification

Polar Codes are Optimal for Lossy Source Coding

On the Information Rates of the Plenoptic Function

Methods for efficient certificate revocation list compression

Polar Codes are Optimal for Lossy Source Coding

Low bit-rate compression of omnidirectional images

Multi-experts scheduling system for real-time applications

Lossy Source Coding with Gaussian or Erased Side-Information

Low bit-rate compression of omnidirectional images

Multi-experts scheduling system for real-time applications

Performance analysis of VP8 image and video compression based on subjective evaluations

Scalable Feature Extraction for Coarse-to-Fine JPEG2000 Image Classification

Methods for efficient certificate revocation list compression

Polar Codes are Optimal for Lossy Source Coding

On the Information Rates of the Plenoptic Function

Polar Codes are Optimal for Lossy Source Coding

L'art des structures; Une introduction au fonctionnement des structures en architecture

Lossy Source Coding with Gaussian or Erased Side-Information