Publication

Set theoretic compression with an application to image coding

Related publications (111)

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.

Sparse Approximation Using M-Term Pursuits with Applications to Image and Video Compression

Pascal Frossard, Pierre Vandergheynst, Adel Rahmoune

This paper introduces an algorithm for sparse approximation in redundant dictionaries, called the M-Term Pursuit (MTP), based on the matching pursuit approach (MP). This algorithm decomposes the signal into a linear combination of selected atoms, chosen to ...

2005

Identification of Image Variations based on Equivalence Classes

Touradj Ebrahimi

This paper presents a fingerprinting method based on equivalence classes. An equivalence class is composed of a reference image and all its variations (or replicas). For each reference image, a decision function is built. The latter determines if a given i ...

SPIE2005

Images Identification Based on Equivalence Classes

Touradj Ebrahimi

The image identification problem consists in identifying all the equivalent forms of a given reference image. An image is equivalent to the reference image, if the former results from the application of an image operator (or a composition of image operator ...

SPIE2005

Rate-distortion optimized geometrical image processing

Rahul Shukla

Since geometrical features, like edges, represent one of the most important perceptual information in an image, efficient exploitation of such geometrical information is a key ingredient of many image processing tasks, including compression, denoising and ...

EPFL2004

Geometrical Image Denoising Using Quadtree Segmentation

Martin Vetterli, Rahul Shukla

We propose a quadtree segmentation based denoising algo- rithm, which attempts to capture the underlying geometrical structure hidden in real images corrupted by random noise. The algorithm is based on the quadtree coding scheme pro- posed in our earlier w ...

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

Color image quality on the Internet

Sabine Süsstrunk, Stefan Winkler

Color image quality depends on many factors, such as the initial capture system and its color image processing, compression, transmission, the output device, media and associated viewing conditions. In this paper, we are primarily concerned with color imag ...

2004

Image security and processing in the JPEG 2000 compressed domain

Raphaël Grosbois

Digital images are becoming increasingly successful thanks to the development and the facilitated access to systems permitting their generation (i.e. camera, scanner, imaging software, etc). A digital image basically corresponds to a 2D discrete set of reg ...

EPFL2003

Low rate and scalable image coding with redundant representations

Pascal Frossard, Pierre Vandergheynst

New breakthroughs in image coding possibly rely in signal decomposition through non-separable basis functions. The work proposed in this paper provides an adaptive way of representing images as a sum of two-dimensional features. It presents a low bit-rate ...

2003

High flexibility scalable image coding

Pascal Frossard, Pierre Vandergheynst

This paper presents a new, highly flexible, scalable image coder based on a Matching Pursuit expansion. The dictionary of atoms is built by translation, rotation and anisotropic refinement of gaussian functions, in order to efficiently capture edges in nat ...

SPIE2003