Learning Laplacian Matrix in Smooth Graph Signal Representations

DOI10.1109/TSP.2016.2602809zbMath1414.94172arXiv1406.7842OpenAlexW2964012239MaRDI QIDQ4621072

Dorina Thanou, Xiaowen Dong, Pierre Vandergheynst, Pascal Frossard

Publication date: 8 February 2019

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1406.7842

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (12)

Approximation theorems on graphs ⋮ Generalizing Graph Signal Processing: High Dimensional Spaces, Models and Structures ⋮ Signal Processing on Simplicial Complexes ⋮ Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications ⋮ Extending compositional data analysis from a graph signal processing perspective ⋮ Fault detection and isolation of multi-variate time series data using spectral weighted graph auto-encoders ⋮ Fractional spectral graph wavelets and their applications ⋮ Semisupervised Dictionary Learning with Graph Regularized and Active Points ⋮ Unnamed Item ⋮ The dual graph shift operator: identifying the support of the frequency domain ⋮ Local smoothness of graph signals ⋮ Estimate the spectrum of affine dynamical systems from partial observations of a single trajectory data

This page was built for publication: Learning Laplacian Matrix in Smooth Graph Signal Representations