Publication

Image security and processing in the JPEG 2000 compressed domain

Publications associées (314)

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

Sensing and Recovery under Sparsity Constraints

Ali Hormati

Popular transforms, like the discrete cosine transform or the wavelet transform, owe their success to the fact that they promote sparsity. These transforms are capable of extracting the structure of a large class of signals and representing them by a few t ...

EPFL2010

Approximation for Problems in Multi-User Information Theory

Soheil Mohajerzefreh

The main goal in network information theory is to identify fundamental limits of communication over networks, and design solutions which perform close to such limits. After several decades of effort, many important problems still do not have a characteriza ...

EPFL2010

Sparse Image Representation by Directionlets

Martin Vetterli, Vladan Velisavljevic, Pier Luigi Dragotti

Despite the success of the standard wavelet transform (WT) in image processing in recent years, the efficiency and sparsity of its representation are limited by the spatial symmetry and separability of its basis functions built in the horizontal and vertic ...

Elsevier2010

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 Limits of Perceptually Optimized JPEG

Touradj Ebrahimi, Francesca De Simone, Lutz Goldmann, Denis Filimonov

The study presented in this paper aims at quantifying the empirical limits of JPEG optimization, when the compressed stream is standard compliant and only the quantization tables are optimized. Image-dependent quantization tables, which minimize the bitrat ...

2010

Joint reconstruction of correlated images from compressed linear measurements

Pascal Frossard, Vijayaraghavan Thirumalai

This paper proposes a joint reconstruction algorithm for compressed correlated images that are given under the form of linear measurements. We first propose a geometry based model in order to describe the correlation between visual information in pairs of ...

2010

Motion Estimation from Compressed Linear Measurements

Pascal Frossard, Vijayaraghavan Thirumalai

This paper presents a novel algorithm for computing the relative motion between images from compressed linear measurements. We propose a geometry based correlation model that describes the relative motion between images by translational motion of visual f ...

2010

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

Universal Source Polarization and Spare Recovery

Emmanuel Abbé

Polar codes allow to perform lossless compression of i.i.d. sources at the lowest rate with low encoding and decoding complexity. In this paper, it is shown that for binary sources, there exist “universal polar codes” which can compress any source of low e ...

2010

A (256x256) Pixel 76.7mW CMOS Imager/ Compressor Based on Real-Time In-Pixel Compressive Sensing

Pierre Vandergheynst, Alexandre Schmid, Yusuf Leblebici, Laurent Jacques, Vahid Majidzadeh Bafar

A CMOS imager is presented which has the abil- ity to perform localized compressive sensing on-chip. In-pixel convolutions of the sensed image with measurement matrices are computed in real time, and a proposed programmable two- dimensional scrambling tech ...

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