Publications related to Matching pursuit

Compressed sensing and redundant dictionaries

This article extends the concept of it compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministic ...

2008

On finding approximate nearest neighbours in a set of compressible signals

Pierre Vandergheynst, Philippe Jost

Numerous applications demand that we manipulate large sets of very high-dimensional signals. A simple yet common example is the problem of finding those signals in a database that are closest to a query. In this paper, we tackle this problem by restricting ...

2008

Semantic coding by supervised dimensionality reduction

Pascal Frossard, Effrosyni Kokiopoulou

This paper addresses the problem of representing multimedia information under a compressed form that permits efficient classification. The semantic coding problem starts from a subspace method where dimensionality reduction is formulated as a matrix factor ...

2008

Average case analysis of sparse recovery with Thresholding: New bounds based on average dictionary coherence

Pierre Vandergheynst, Mohammad Golbabaee

This paper analyzes the performance of the simple thresholding algorithm for sparse signal representations. In particular, in order to be more realistic we introduce a new probabilistic signal model which assumes randomness for both the amplitude and also ...

2008

Balanced multiple description coding in image communications

Ivana Radulovic

Latest developments in video coding technology on one side, and a continuous growth in size and bandwidth in lossy networks on the other side, have undoubtedly created a whole new world of multimedia communications. However, nowadays networks, which are be ...

EPFL2008

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper provides new results on computing simultaneous sparse approximations of multichannel signals over redundant dictionaries using two greedy algorithms. The first one, p-thresholding, selects the S atoms that have the largest

p

-correlation while ...

2008

SURE-Let Multichannel Image Denoising: Undecimated Wavelet Thresholding

Thierry Blu, Florian Luisier

We propose an extension of the recently devised SURE-LET grayscale denoising approach for multichannel images. Assuming additive Gaussian white noise, the unknown linear parameters of a transform-domain pointwise multichannel thresholding are globally opti ...

IEEE2008

Matching Pursuit with Block Incoherent Dictionaries

Pierre Vandergheynst, Lorenzo Peotta

There has been an intense activity recently in the field of sparse approximations with redundant dictionaries, largely motivated by the practical performances of algorithms such as Matching Pursuit and Basis Pursuit. However, most of the theoretical result ...

2007

Algorithms and methods for sparse approximation in structured dictionaries

Lorenzo Peotta

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 ...

EPFL2007

On finding nearest neighbors in a set of compressible signals

Pierre Vandergheynst, Philippe Jost

Numerous applications demand that we manipulate large sets of very high-dimensional signals. A simple yet common example is the problem of finding those signals in a database that are closest to a query. In this paper, we tackle this problem by restricting ...

2007

Matching pursuit

Graph Chatbot

Chat with Graph Search

Compressed sensing and redundant dictionaries

On finding approximate nearest neighbours in a set of compressible signals

Semantic coding by supervised dimensionality reduction

Average case analysis of sparse recovery with Thresholding: New bounds based on average dictionary coherence

Balanced multiple description coding in image communications

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

SURE-Let Multichannel Image Denoising: Undecimated Wavelet Thresholding

Matching Pursuit with Block Incoherent Dictionaries

Algorithms and methods for sparse approximation in structured dictionaries

On finding nearest neighbors in a set of compressible signals

On finding approximate nearest neighbours in a set of compressible signals

Compressed sensing and redundant dictionaries

Matching Pursuit with Block Incoherent Dictionaries

Algorithms and methods for sparse approximation in structured dictionaries

Average case analysis of sparse recovery with Thresholding: New bounds based on average dictionary coherence

Semantic coding by supervised dimensionality reduction

Balanced multiple description coding in image communications

Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms

SURE-Let Multichannel Image Denoising: Undecimated Wavelet Thresholding

On finding nearest neighbors in a set of compressible signals