Publication

Adaptive scalar quantization without side information

Publications associées (43)

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

Bits from Photons

Feng Yang

The trends in the design of image sensors are to build sensors with low noise, high sensitivity, high dynamic range, and small pixel size. How can we benefit from pixels with small size and high sensitivity? In this dissertation, we study a new image senso ...

EPFL2012

Estimation of Sparse MIMO Channels with Common Support

Martin Vetterli, Ali Hormati, Yann Barbotin

We consider the problem of estimating sparse communication channels in the MIMO context. In small to medium bandwidth communications, as in the current standards for OFDM and CDMA communication systems (with bandwidth up to 20 MHz), such channels are indiv ...

2012

Bits from Photons: Oversampled Image Acquisition Using Binary Poisson Statistics

Martin Vetterli, Luciano Sbaiz, Yue Lu, Feng Yang

We study a new image sensor that is reminiscent of traditional photographic film. Each pixel in the sensor has a binary response, giving only a one-bit quantized measurement of the local light intensity. To analyze its performance, we formulate the oversam ...

Institute of Electrical and Electronics Engineers2012

One-Bit Measurements With Adaptive Thresholds

Michaël Unser, Arash Amini, Ulugbek Kamilov, Aurélien Bourquard

We introduce a new method for adaptive one-bit quantization of linearmeasurements and propose an algorithm for the recovery of signals based on generalized approximate message passing (GAMP). Our method exploits the prior statistical information on the sig ...

Ieee-Inst Electrical Electronics Engineers Inc2012

Bits from Photons: Oversampled Image Acquisition Using Binary Poisson Statistics

Martin Vetterli, Luciano Sbaiz, Yue Lu, Feng Yang

EPFL2011

Multichannel Sampling of Signals With Finite Rate of Innovation

Loïc Arnaud Baboulaz, Pier Luigi Dragotti

In this letter, we present a possible extension of the theory of sampling signals with finite rate of innovation (FRI) to the case of multichannel acquisition systems. The essential issue of a multichannel system is that each channel introduces different u ...

2010

Approximately achieving Gaussian relay network capacity with lattice codes

Suhas Diggavi

Recently, it has been shown that a quantize-map-and-forward scheme approximately achieves (within a constant number of bits) the Gaussian relay network capacity for arbitrary topologies [1]. This was established using Gaussian codebooks for transmission an ...

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

Multi-experts scheduling system for real-time applications

Mario Bellino

This thesis focuses on the decisional process of autonomous systems, and more particularly, on the way to take a decision when the time at disposal in order to assess the whole situation is shorter than necessary. Indeed, numerous systems propose solutions ...

EPFL2009

On unifying sparsity and geometry for image-based 3D scene representation

Ivana Tosic

Demand has emerged for next generation visual technologies that go beyond conventional 2D imaging. Such technologies should capture and communicate all perceptually relevant three-dimensional information about an environment to a distant observer, providin ...

EPFL2009

Interval consensus: from quantized gossip to voting

Martin Vetterli, Patrick Thiran, Florence Bénézit

We design distributed and quantized average consensus algorithms on arbitrary connected networks. By construction, quantized algorithms cannot produce a real, analog average. Instead, our algorithm reaches consensus on the quantized interval that contains ...

2009