Christine Guillemot

Learn More
Single-image super-resolution (SR) is the problem of generating a single high resolution (HR) image, given one low resolution (LR) image as input. In this paper we propose a low-complexity and yet efficient algorithm that reconstruct the HR image in one pass (instead, e.g. of 7 passes for a magnification factor of 4 in [3]). The proposed algorithm falls(More)
This paper addresses the problem of optimal minimum mean-squared error reconstruction of quantised samples in Wyner-Ziv video coding systems. Closed-form expressions of the optimal reconstructed values are derived for a Laplacian correlation model. The method is used for both single and multiple side information scenarios (the latter is also referred to as(More)
A multiple description scalar quantization (MDSQ) based coding system can be regarded as a source coder (quantizer) followed by a channel coder, i.e. the combination of index and codeword assignment. The redundancy, or the correlation between the descriptions, is controlled by the number of diagonals covered by the index assignment. We consider here the(More)
This paper describes a hybrid coder/decoder rate control for a Wyner-Ziv video coding scheme with a feedback channel. The approach is first based on a method to estimate at the encoder the minimum rate required for the Slepian-Wolf (SW) encoded data. This estimation makes use only of the Lapacian correlation model. The decoder then estimates the bit error(More)
Discrete Fourier transform (DFT) codes have been used as joint source-channel codes in order to provide robustness against channel errors and erasures. This paper presents a frame-theoretic analysis of lowpass DFT codes with erasures. First, it is shown that such codes make a special class of frames. Then, the message reconstructions by the frame-theoretic(More)
In this paper, we propose a novel inpainting algorithm combining the advantages of PDE-based schemes and examplar-based approaches. The proposed algorithm relies on the use of structure tensors to define the filling order priority and template matching. The structure tensors are computed in a hierarchic manner whereas the template matching is based on a(More)
We analyze the dependencies between the variables involved in the source and channel coding chain. This analysis is carried out in the framework of Bayesian networks, which provide both an intuitive representation for the global model of the coding chain, and a way of deriving joint (soft) decoding algorithms. Three sources of dependencies are involved in(More)