A Posteriori Quantization of Progressive Matching Pursuit Streams
Related publications (37)
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.
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 ...
This paper introduces a sparse signal representation algorithm in redundant dictionaries, called the M-Term Pursuit (MTP), with an application to image representation and scalable coding. The MTP algorithm belongs to the framework of the matching pursuit ( ...
The ability to design efficient distributed communications systems heavily depends on a proper understanding of the distortion incurred by their constituting elements. To this end, we study the mean squared reconstruction error behavior of the distributed ...
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 ...
In this paper, we address the problem of finding image decompositions that allow good compression performance, and that are also efficient for face authentication. We propose to decompose the face image using Matching Pursuit and to perform the face authen ...
Typical tasks in signal processing may be done in simpler ways or more efficiently if the signals to analyze are represented in a proper way. This thesis deals with some algorithmic problems related to signal approximation, more precisely, in the novel fie ...
In the last decade we observed an increasing interaction between data compression and sparse signals approximations. Sparse approximations are desirable because they compact the energy of the signals in few elements and correspond to a structural simplific ...
This paper presents a progressive coding scheme for 3-D objects, based on overcomplete signal expansions on the 2-D sphere. Due to increased freedom in the basis construction, redundant expansions have shown interesting approximation properties in the deco ...
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 ...
Video signals are sequences of natural images, where images are often modeled as piecewise-smooth signals. Hence, video can be seen as a 3D piecewise-smooth signal made of piecewise-smooth regions that move through time. Based on the piecewise-smooth model ...