268 citations · 1.1k across the 40 of their papers we have counts for
4 papers · 1 filter
Random sampling of bandlimited signals on graphs
Gilles Puy, Nicolas Tremblay, Rémi Gribonval +1
We study the problem of sampling k-bandlimited signals on graphs. We propose two sampling strategies that consist in selecting a small subset of nodes at random. The first strategy…
Accelerated Spectral Clustering Using Graph Filtering Of Random Signals
Nicolas Tremblay, Gilles Puy, Pierre Borgnat +2
We build upon recent advances in graph signal processing to propose a faster spectral clustering algorithm. Indeed, classical spectral clustering is based on the computation of the…
Recipes for stable linear embeddings from Hilbert spaces to R^m
Gilles Puy, Mike Davies, Rémi Gribonval
We consider the problem of constructing a linear map from a Hilbert space (possibly infinite dimensional) to that satisfies a restricted isometry prope…
Fast Robust PCA on Graphs
Nauman Shahid, Nathanael Perraudin, Vassilis Kalofolias +2
Mining useful clusters from high dimensional data has received significant attention of the computer vision and pattern recognition community in the recent years. Linear and non-li…