no code implementations • 15 Nov 2016 • Nauman Shahid, Francesco Grassi, Pierre Vandergheynst
We propose a new framework for the analysis of low-rank tensors which lies at the intersection of spectral graph theory and signal processing.
no code implementations • 4 Oct 2016 • Faisal Mahmood, Nauman Shahid, Ulf Skoglund, Pierre Vandergheynst
Sparsity exploiting image reconstruction (SER) methods have been extensively used with Total Variation (TV) regularization for tomographic reconstructions.
no code implementations • 18 May 2016 • Nauman Shahid, Nathanael Perraudin, Pierre Vandergheynst
Many real world datasets subsume a linear or non-linear low-rank structure in a very low-dimensional space.
no code implementations • 14 Mar 2016 • Faisal Mahmood, Nauman Shahid, Pierre Vandergheynst, Ulf Skoglund
This makes the sinogram an ideal candidate for graph based denoising since it generally has a piecewise smooth structure.
no code implementations • 5 Feb 2016 • Nauman Shahid, Nathanael Perraudin, Gilles Puy, Pierre Vandergheynst
We introduce a novel framework for an approxi- mate recovery of data matrices which are low-rank on graphs, from sampled measurements.
no code implementations • 29 Jul 2015 • Nauman Shahid, Nathanael Perraudin, Vassilis Kalofolias, Gilles Puy, Pierre Vandergheynst
Clustering experiments on 7 benchmark datasets with different types of corruptions and background separation experiments on 3 video datasets show that our proposed model outperforms 10 state-of-the-art dimensionality reduction models.
no code implementations • ICCV 2015 • Nauman Shahid, Vassilis Kalofolias, Xavier Bresson, Michael Bronstein, Pierre Vandergheynst
Principal Component Analysis (PCA) is the most widely used tool for linear dimensionality reduction and clustering.