Publication

Multichannel thresholding with sensing dictionaries

Publications associées (43)

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 Approximation Using M-Term Pursuit and Application in Image and Video Coding

Pascal Frossard, Pierre Vandergheynst, Adel Rahmoune

This paper introduces a novel algorithm for sparse approximation in redundant dictionaries called the M-term pursuit (MTP). This algorithm decomposes a signal into a linear combination of atoms that are selected in order to represent the main signal compon ...

Institute of Electrical and Electronics Engineers2012

Dictionary learning in stereo imaging

Pascal Frossard, Ivana Tosic

This paper presents a new method for learning overcomplete dictionaries adapted to efficient joint representation of stereo images. We first formulate a sparse stereo image model where the multi-view correlation is described by local geometric transforms o ...

Institute of Electrical and Electronics Engineers2011

Greedy Dictionary Selection for Sparse Representation

Volkan Cevher, Andreas Krause

We develop an efficient learning framework to construct signal dictionaries for sparse representation by selecting the dictionary columns from multiple candidate bases. By sparse, we mean that only a few dictionary elements, compared to the ambient signal ...

2011

Fast orthogonal sparse approximation algorithms over local dictionaries

Pierre Vandergheynst, Rémi Gribonval

In this work we present a new greedy algorithm for sparse approximation called LocOMP. LocOMP is meant to be run on local dictionaries made of atoms with much shorter supports than the signal length. This notably encompasses shift-invariant dictionaries an ...

2011

Ultrasound Tomography with Learned Dictionaries

Martin Vetterli, Pascal Frossard, Ivana Tosic, Ivana Jovanovic

We propose a new method for imaging sound speed in breast tissue from measurements obtained by ultrasound tomography (UST) scan- ners. Given the measurements, our algorithm finds a sparse image representation in an overcomplete dictionary that is adapted t ...

2010

Spread spectrum for imaging techniques in radio interferometry

Pierre Vandergheynst, Yves Wiaux, Gilles Puy

We consider the probe of astrophysical signals through radio interferometers with small field of view and baselines with non-negligible and constant component in the pointing direction. In this context, the visibilities measured essentially identify with a ...

Wiley-Blackwell2009

Spread spectrum for imaging techniques in radio interferometry and strings detection

Yves Wiaux, Gilles Puy

This poster is a summary of recent work published in: Spread spectrum for imaging techniques in radio interferometry, Y. Wiaux, G. Puy, Y. Boursier, and P. Vandergheynst, Mon. Not. R. Astron. Soc., 2009, Preprint arXiv:0907.0944v1. We consider the probe of ...

2009

Sparsity & [and] dictionaries - algorithms & [and] design

Karin Schnass

With the flood of information available today the question how to deal with high dimensional data/signals, which are cumbersome to handle, to calculate with and to store, is highly important. One approach to reducing this flood is to find sparse signal rep ...

EPFL2009