Fetching the paper…
Reading the bibliography…
We propose an interpretable graph neural network framework to denoise single or multiple noisy graph signals.
“Nonlinear total variation based noise removal algorithms,”
L. I. Rudin, S. Osher, and E. Fatemi, · 1992
Earlier work this paper cites.
Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92)
F. R. K. Chung, · 1996
Earlier work this paper cites.
“On spectral clustering: Analysis and an algorithm,”
A. Y. Ng, M. I. Jordan, and Y. Weiss, · 2001
Earlier work this paper cites.
“Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions,”
X. Zhu, J. Lafferty, and Z. Ghahramani, · 2003
Earlier work this paper cites.
“An algorithm for total variation minimization and applications,”
A. Chambolle, · 2004
Earlier work this paper cites.
“A new alternating minimization algorithm for total variation image reconstruction,”
Y. Wang, J. Yang, W. Yin, and Y. Zhang, · 2008
Earlier work this paper cites.
“Learning fast approximations of sparse coding,”
K. Gregor and Y. LeCun, · 2010
Earlier work this paper cites.
“Wavelets on graphs via spectral graph theory,”
D. K. Hammond, P. Vandergheynst, and R. Gribonval, · 2011
Earlier work this paper cites.
“Distributed optimization and statistical learning via the alternating direction method of multipliers,”
S. Boyd, N. Parikh, E. Chu, B. Peleato, and J. Eckstein, · 2011
Earlier work this paper cites.
Compressed Sensing: Theory and Applications
Y. C. Eldar and G. Kutyniok, · 2012
Earlier work this paper cites.
“Perfect reconstruction two-channel wavelet filter banks for graph structured data,”
S. K. Narang and A. Ortega, · 2012
Earlier work this paper cites.
“The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,”
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, · 2013
Earlier work this paper cites.
“Discrete signal processing on graphs,”
A. Sandryhaila and J. M. F. Moura, · 2013
Earlier work this paper cites.
“Signal denoising on graphs via graph filtering,”
S. Chen, A. Sandryhaila, J. M. F. Moura, and J. Kovačević, · 2014
Earlier work this paper cites.
Foundations of Signal Processing
M. Vetterli, J. Kovačević, and V. K. Goyal, · 2014
Earlier work this paper cites.
“Spectral networks and locally connected networks on graphs,”
J. Bruna, W. Zaremba, A. Szlam, and Y. LeCun, · 2014
Earlier work this paper cites.
“Deepwalk: online learning of social representations,”
B. Perozzi, R. Al-Rfou, and S. Skiena, · 2014
Earlier work this paper cites.
“Discrete signal processing on graphs: Sampling theory,”
S. Chen, R. Varma, A. Sandryhaila, and J. Kovačević, · 2015
Earlier work this paper cites.
“Signal recovery on graphs: Variation minimization,”
S. Chen, A. Sandryhaila, J. M. F. Moura, and J. Kovačević, · 2015
Earlier work this paper cites.
“Spectrum-adapted tight graph wavelet and vertex-frequency frames,”
D. I. Shuman, C. Wiesmeyr, N. Holighaus, and P. Vandergheynst, · 2015
Cited alongside, same era.
Sampling theory: Beyond bandlimited systems
Y. C. Eldar, · 2015
Cited alongside, same era.
“A multiscale pyramid transform for graph signals,”
D. I. Shuman, M. Javad Faraji, and P. Vandergheynst, · 2016
Cited alongside, same era.
“Efficient sampling set selection for bandlimited graph signals using graph spectral proxies,”
A. Anis, A. Gadde, and A. Ortega, · 2016
Cited alongside, same era.
“Trend filtering on graphs,”
Y-X. Wang, J. Sharpnack, A. J. Smola, and R. J. Tibshirani, · 2016
Cited alongside, same era.
Deep Learning
I. Goodfellow, Y. Bengio, and A. Courville, · 2016
Cited alongside, same era.
“Link prediction based on graph neural networks,”
M. Zhang and Y. Chen, · 2018
Later among the works it cites.
“Learning graphs from data: A signal representation perspective,”
X. Dong, D. Thanou, M. Rabbat, and P. Frossard, · 2019
Later among the works it cites.
“Dynamic graph CNN for learning on point clouds,”
Y. Wang, Y. Sun, Z. Liu, S. E. Sarma, M. M. Bronstein, and J. M. Solomon, · 2019
Later among the works it cites.
“A windowed digraph fourier transform,”
R. Shafipour, A. Khodabakhsh, and G. Mateos, · 2019
Later among the works it cites.
“Two-channel critically sampled graph filter banks with spectral domain sampling,”
A. Sakiyama, K. Watanabe, Y. Tanaka, and A. Ortega, · 2019
Later among the works it cites.
“Deep graph infomax,”
P. Velickovic, W. Fedus, W. L. Hamilton, P. Liò, Y. Bengio, and R. Devon Hjelm, · 2019
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“Convolutional neural networks on graphs with fast localized spectral filtering,”
M. Defferrard, X. Bresson, and P. Vandergheynst, · 2016
Cited alongside, same era.
“Representations of piecewise smooth signals on graphs,”
S. Chen, R. Varma, A. Singh, and J. Kovačević, · 2016
Cited alongside, same era.
“Linear network operators using node-variant graph filters,”
S. Segarra, A. G. Marques, and A. Ribeiro, · 2016
Cited alongside, same era.
“Subgraph-based filterbanks for graph signals,”
N. Tremblay and P. Borgnat, · 2016
Cited alongside, same era.
“Geometric deep learning: Going beyond euclidean data,”
M. M. Bronstein, J. Bruna, Y. LeCun, A. Szlam, and P. Vandergheynst, · 2017
Cited alongside, same era.
“Semi-supervised classification with graph convolutional networks,”
T. N. Kipf and M. Welling, · 2017
Cited alongside, same era.
“Simplifying graph convolutional networks,”
F. Wu, A. H. Souza Jr., T. Zhang, C. Fifty, T. Yu, and K. Q. Weinberger, · 2019
Later among the works it cites.
“Algorithm unrolling: Interpretable, efficient deep learning for signal and image processing,”
V. Monga, Y. Li, and Y. C. Eldar, · 2019
Later among the works it cites.
“An algorithm unrolling approach to deep image deblurring,”
Y. Li, M. Tofighi, V. Monga, and Y. C. Eldar, · 2019
Later among the works it cites.
“Convolutional neural network architectures for signals supported on graphs,”
F. Gama, A. G. Marques, G. Leus, and A. Ribeiro, · 2019
Later among the works it cites.
“Dynamic multiscale graph neural networks for 3d skeleton-based human motion prediction,”
M. Li, S. Chen, Y. Zhao, Y. Zhang, Y. Wang, and Q. Tian, · 2020
Closest in time.
“Vector-valued graph trend filtering with non-convex penalties,”
R. Varma, H. Lee, JJ. Kovačević, and Y. Chi, · 2020
Closest in time.
“Deep unfolded robust PCA with application to clutter suppression in ultrasound,”
O. Solomon, R. Cohen, Y. Zhang, Y. Yang, Q. He, J. Luo, R. J. G. van Sloun, and Y. C. Eldar, · 2020
Closest in time.
“Efficient and interpretable deep blind image deblurring via algorithm unrolling,”
Y. Li, M. Tofighi, J. Geng, V. Monga, and Y. C Eldar, · 2020
Closest in time.
“Learning plug-and-play proximal quasi-newton denoisers,”
A. H. Al-Shabili, H. Mansour, and P. T. Boufounos, · 2020
Closest in time.
“Edgenets: Edge varying graph neural networks,”
E. Isufi, F. Gama, and A. Ribeiro, · 2020
Closest in time.
“Graph auto-encoder for graph signal denoising,”
T. Huu Do, D. Minh Nguyen, and N. Deligiannis, · 2020
Closest in time.
“Pairnorm: Tackling oversmoothing in gnns,”
L. Zhao and L. Akoglu, · 2020
Closest in time.
“Graph u-nets,”
H. Gao and S. Ji, · 2092
Closest in time.