Evolutionary Multiresolution Matching Pursuit and its Relations with the Human Visual System
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.
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 ...
Recent results have underlined the importance of incoherence in redundant dictionaries for a good behavior of decomposition algorithms like Matching and Basis Pursuits. However, appropriate dictionaries for a given application may not necessarily be able t ...
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 ...
In this project, we investigate the possibility of using the Matching Pursuit algorithm to generate image representations of a pair of correlated images for distributed source coding. We propose to use constrained dictionaries by appropriately selecting ne ...
The extension of multiple-input multiple-output (MIMO) sphere decoding from the narrowband case to wideband systems based on orthogonal frequency division multiplexing (OFDM) requires the computation of a QR decomposition for each of the data-carrying OFDM ...
Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2005
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 ...
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 ...
In many applications - such as compression, de-noising and source separation - a good and efficient signal representation is characterized by sparsity. This means that many coefficients are close to zero, while only few ones have a non-negligible amplitude ...
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 ...
This paper describes a novel video coding scheme based on a three-dimensional Matching Pursuit algorithm. In addition to good compression performance at low bit rate, the proposed coder allows for flexible spatial, temporal and rate scalability thanks to i ...