Publication

On finding nearest neighbors in a set of compressible signals

Publications associées (36)

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

Compressed Sensing of Simultaneous Low-Rank and Joint-Sparse Matrices

Pierre Vandergheynst, Mohammad Golbabaee

In this paper we consider the problem of recovering a high dimensional data matrix from a set of incomplete and noisy linear measurements. We introduce a new model that can efficiently restrict the degrees of freedom of the problem and is generic enough to ...

Institute of Electrical and Electronics Engineers2012

AFFINITY: Efficiently Querying Statistical Measures on Time-Series Data

Karl Aberer, Saket Sathe

Computing statistical measures for large databases of time series is a fundamental primitive for querying and mining time-series data [1–6]. This primitive is gaining importance with the increasing number and rapid growth of time series databases. In this ...

2012

On Accelerated Hard Thresholding Methods for Sparse Approximation

Volkan Cevher

We propose and analyze acceleration schemes for hard thresholding methods with applications to sparse approximation in linear inverse systems. Our acceleration schemes fuse combinatorial, sparse projection algorithms with convex optimization algebra to pro ...

Spie-Int Soc Optical Engineering, Po Box 10, Bellingham, Wa 98227-0010 Usa2011

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

Compressed sensing for radio interferometry: spread spectrum imaging techniques

Pierre Vandergheynst, Yves Wiaux, Gilles Puy

We consider the problem of reconstruction of astrophysical signals probed by radio interferometers with baselines bearing a non-negligible component in the pointing direction. The visibilities measured essentially identify with a noisy and incomplete Fouri ...

2009

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

Dictionary preconditioning for greedy algorithms

Pierre Vandergheynst, Karin Schnass

This article presents an alteration of greedy algorithms like thresholding or (Orthogonal) Matching Pursuit which improves their performance in finding sparse signal representations in redundant dictionaries. These algorithms can be split into a sensing an ...

2008

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