Concept

Matching pursuit

Publications associées (175)

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

Algorithmic aspects of sparse approximations

Philippe Jost

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

EPFL2007

Multichannel thresholding with sensing dictionaries

Pierre Vandergheynst, Rémi Gribonval, Karin Schnass

This paper shows introduces the use sensing dictionaries for p-thresholding, an algorithm to compute simultaneous sparse approximations of multichannel signals over redundant dictionaries. We do both a worst case and average case recovery analyses of this ...

2007

Acoustic multi target tracking using direction-of-arrival batches

Volkan Cevher

In this paper, we propose a particle filter acoustic direction-of-arrival (DOA) tracker to track multiple maneuvering targets using a state space approach. The particle filter determines its state vector using a batch of DOA estimates. The filter likelihoo ...

Institute of Electrical and Electronics Engineers2007

Average Performance Analysis for Thresholding

Pierre Vandergheynst, Karin Schnass

In this article is shown that with high probability the thresholding algorithm can recover signals that are sparse in a redundant dictionary as long as the {\it 2-Babel function} is growing slowly. This implies that it can succeed for sparsity levels up to ...

2007

Dimensionality Reduction with Adaptive Approximation

Pascal Frossard, Effrosyni Kokiopoulou

In this paper, we propose the use of (adaptive) nonlinear approximation for dimensionality reduction. In particular, we propose a dimensionality reduction method for learning a parts based representation of signals using redundant dictionaries. A redundant ...

2007

A Generalization of the Finite-Length Scaling Approach Beyond the BEC

Rüdiger Urbanke, Jérémie Ezri

We want to extend the approximation of the error probability via a scaling approach from the BEC to general binary-input memoryless output-symmetric (BMS) channels. In particular, we consider such scaling laws for regular LDPC ensembles and message-passing ...

2007

On the modelling of multi-modal data using redundant dictionaries

Gianluca Monaci

Real-world phenomena involve complex interactions between multiple signal modalities. As a consequence, humans are used to integrate at each instant perceptions from all their senses in order to enrich their understanding of the surrounding world. This par ...

EPFL2007

Slowness and Sparseness Lead to Place, Head-Direction, and Spatial-View Cells

We present a model for the self-organized formation of place cells, head-direction cells, and spatial-view cells in the hippocampal formation based on unsupervised learning on quasi-natural visual stimuli. The model comprises a hierarchy of Slow Feature An ...

Public Library of Science2007

On the exponential convergence of Matching Pursuits in quasi-incoherent dictionaries

Pierre Vandergheynst, Rémi Gribonval

The purpose of this paper is to extend results by Villemoes and Temlyakov about exponential convergence of Matching Pursuit with some structured dictionaries for ``simple'' functions in finite or infinite dimension. Our results are based on an extension of ...

2006

Progressive Coding of 3-D Objects Based on Overcomplete Decompositions

Pascal Frossard, Pierre Vandergheynst, Ivana Tosic

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

2006