Recherche

Afficher tous les résultats pour

Accueil

Personne

Pierre Vandergheynst

Cette personne a quitté l’EPFL

À propos
Confidentialité
Mentions légales

Graph Chatbot

Publications associées (214)

Page 6 sur 11

Accelerated MR imaging with spread spectrum encoding

Jean-Philippe Thiran, Rolf Gruetter, Dimitri Nestor Alice Van De Ville, Pierre Vandergheynst, José Pedro Rebelo Ferreira Marques, Yves Wiaux, Gilles Puy

We advocate the use of a novel compressed sensing technique for accelerating the magnetic resonance image acquisition process, coined spread spectrum MR imaging or simply s2MRI. The method resides in pre-modulating the signal of interest by a linear chirp, ...

2011

Compact Low-Power Cortical Recording Architecture for Compressive Multichannel Data Acquisition

Pierre Vandergheynst, Alexandre Schmid, Mahsa Shoaran, Mahdad Hosseini Kamal

This paper introduces an area- and power-efficient approach for compressive recording of cortical signals used in an implantable system prior to transmission. Recent research on compressive sensing has shown promising results for sub-Nyquist sampling of sp ...

2014

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

Spectrally approximating large graphs with smaller graphs

Pierre Vandergheynst, Andreas Loukas

How does coarsening affect the spectrum of a general graph? We provide conditions such that the principal eigenvalues and eigenspaces of a coarsened and original graph Laplacian matrices are close. The achieved approximation is shown to depend on standard ...

2018

A Multiscale Pyramid Transform for Graph Signals

Pierre Vandergheynst, Mohammadjavad Faraji, David Shuman

Multiscale transforms designed to process analog and discrete-time signals and images cannot be directly applied to analyze high-dimensional data residing on the vertices of a weighted graph, as they do not capture the intrinsic topology of the graph data ...

Institute of Electrical and Electronics Engineers2016

Universal and efficient compressed sensing by spread spectrum and application to realistic Fourier imaging techniques

Pierre Vandergheynst, Yves Wiaux, Rémi Gribonval, Gilles Puy

We advocate a compressed sensing strategy that consists of multiplying the signal of interest by a wide bandwidth modulation before projection onto randomly selected vectors of an orthonormal basis. Firstly, in a digital setting with random modulation, con ...

Institute of Electrical and Electronics Engineers2012

Generalised Implicit Neural Representations

Daniele Grattarola, Pierre Vandergheynst

We consider the problem of learning implicit neural representations (INRs) for signals on non-Euclidean domains. In the Euclidean case, INRs are trained on a discrete sampling of a signal over a regular lattice. Here, we assume that the continuous signal e ...

2022

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

IEEE Institute of Electrical and Electronics Engineers2007

Geometric Video Approximation Using Weighted Matching Pursuit

Michel Bierlaire, Pierre Vandergheynst, Gianluca Monaci, Oscar Divorra Escoda

In recent years, many works on geometric image representation have appeared in the literature. Geometric video representation has not received such an important attention so far, and only some initial works in the area have been presented. Works on geometr ...

2009

Locating Temporal Functional Dynamics of Visual Short-Term Memory Binding using Graph Modular Dirichlet Energy

Pierre Vandergheynst, Benjamin Ricaud, Nauman Shahid

Visual short-term memory binding tasks are a promising early marker for Alzheimer's disease (AD). To uncover functional deficits of AD in these tasks it is meaningful to first study unimpaired brain function. Electroencephalogram recordings were obtained f ...

Nature Publishing Group2017

Doubly sparse models for multiple filter estimation in sparse echoic environments

Pierre Vandergheynst, Rémi Gribonval

We consider the estimation of multiple time-domain sparse filters from echoic mixtures of several unknown sources, when the sources are sparse in the time-frequency domain. We propose a sparse filter estimation framework consisting of two steps: a) a clust ...

2012

Graph Signal Processing: Overview, Challenges and Applications

Pascal Frossard, Pierre Vandergheynst

Research in graph signal processing (GSP) aims to develop tools for processing data defined on irregular graph domains. In this paper, we first provide an overview of core ideas in GSP and their connection to conventional digital signal processing, along w ...

2018

Compressed sensing and redundant dictionaries

Pierre Vandergheynst, Karin Schnass

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 the Sparsity of Wavelet Coefficients for Signals on Graphs

Pierre Vandergheynst, Benjamin Ricaud, David Shuman

A number of new localized, multiscale transforms have recently been introduced to analyze data residing on weighted graphs. In signal processing tasks such as regularization and compression, much of the power of classical wavelets on the real line is deriv ...

Spie-Int Soc Optical Engineering2013

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

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

Dictionary Learning Based Dimensionality Reduction for Classification

Pierre Vandergheynst, Karin Schnass

In this article we present a signal model for classification based on a low dimensional dictionary embedded into the high dimensional signal space. We develop an alternate projection algorithm to find the embedding and the dictionary and finally test the c ...

2008

Sparsity Driven People Localization with a Heterogeneous Network of Cameras

Pierre Vandergheynst, Alexandre Massoud Alahi, Laurent Jacques

In this paper, we propose to study the problem of localization of a dense set of people with a network of heterogeneous cameras. We propose to recast the problem as a linear inverse problem. The proposed framework is generic to any scene, scalable in the n ...

Springer Verlag2011

Tensor Robust Pca On Graphs

Pierre Vandergheynst, Nauman Shahid, Francesco Grassi

We propose a graph signal processing framework to overcome the computational burden of Tensor Robust PCA (TRPCA). Our framework also serves as a convex alternative to graph regularized tensor factorization methods. Our method is based on projecting a tenso ...

IEEE2019

Audio-driven Nonlinear Video Diffusion

Pierre Vandergheynst, Anna Llagostera Casanovas

In this paper we present a novel nonlinear video diffusion approach based on the fusion of information in audio and video channels. Both modalities are efficiently combined into a diffusion coefficient that integrates the basic assumption in this domain, i ...

Institute of Electrical and Electronics Engineers2011