Publication

Image compression with learnt tree-structured dictionaries

Publications associées (68)

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

Sparse image approximation with application to flexible image coding

Natural images are often modeled through piecewise-smooth regions. Region edges, which correspond to the contours of the objects, become, in this model, the main information of the signal. Contours have the property of being smooth functions along the dire ...

EPFL2005

Image/video representation and scalable coding using redundant dictionaries

Adel Rahmoune

Compact or efficient representation for either images or image sequences is key operation to performing image and video processing tasks, such as compression, analysis, etc. The efficiency of an approximation is evaluated by the sparsity measure of the app ...

EPFL2005

A simple test to check the optimality of sparse signal approximations

Pierre Vandergheynst, Rémi Gribonval

Approximating a signal or an image with a sparse linear expansion from an over-complete dictionary of atoms is an extremely useful tool to solve many signal processing problems. Finding the sparsest approximation of a signal from an arbitrary dictionary is ...

2005

Directionlets

Vladan Velisavljevic

Efficient representation of geometrical information in images is very important in many image processing areas, including compression, denoising and feature extraction. However, the design of transforms that can capture these geometrical features and repre ...

EPFL2005

Learning Structured Dictionaries for Image Representation

Pierre Vandergheynst, Gianluca Monaci

The dictionary approach to signal and image processing has been massively investigated in the last two decades, proving very attractive for a wide range of applications. The effectiveness of dictionary-based methods, however, is strongly influenced by the ...

2004

Learning structured dictionaries for image representation

Pierre Vandergheynst, Gianluca Monaci

IEEE2004

A Bayesian Approach to Video Expansions on Parametric Over-Complete 2-D Dictionaries

Pierre Vandergheynst, Oscar Divorra Escoda

In this work, we explore a framework for the sparse representation of video sequences by means of spatio ...

IEEE2004

Grammar-Based Tree Compression

Grammar-based compression means to find a small grammar that generates a given object. Such a grammar reveals the structure of the object (according to the grammar formalism used); the main advantage of this compression method is that the resulting grammar ...

2004

A Matching Pursuit Full Search Algorithm for Image Approximations

Pierre Vandergheynst, Oscar Divorra Escoda

There is a growing interest on adapted signal expansions for efficient sparse approximations. For this purpose, signal expansions on over-complete bases are of high interest. Several strategies exist in order to get sparse approximations of a signal as a s ...

2004

Very low bit rate image coding using redundant dictionaries

Pierre Vandergheynst, Lorenzo Granai, Lorenzo Peotta

Very low bit rate image coding is an important problem regarding applications such as storage on low memory devices or streaming data on the internet. The state of the art in image compression is to use 2-D wavelets. The advantages of wavelet bases lie in ...

SPIE2003