Fetching the paper…
Reading the bibliography…
In the field of signal processing on graphs, graph filters play a crucial role in processing the spectrum of graph signals.
P. Erdos and A. Rényi, “On the evolution of random graphs,” Publ. Math. Inst. Hung. Acad. Sci , vol. 5, no. 1, pp. 17–60, 1960
1960
Earlier work this paper cites.
J. H. Wilkinson and J. H. Wilkinson, The algebraic eigenvalue problem . Clarendon Press Oxford, 1965, vol. 87
1965
Earlier work this paper cites.
V. Sinswat and F. Fallside, “Eigenvalue/eigenvector assignment by state-feedback,” International Journal of Control , vol. 26, no. 3, pp. 389–403, 1977
1977
Earlier work this paper cites.
J. R. Shewchuk et al. , “An introduction to the conjugate gradient method without the agonizing pain,” 1994
1994
Earlier work this paper cites.
F. R. Chung, Spectral graph theory . American Mathematical Soc., 1997, no. 92
1997
Earlier work this paper cites.
M. E. Newman, “The structure and function of complex networks,” SIAM review , vol. 45, no. 2, pp. 167–256, 2003
2003
Earlier work this paper cites.
C. H. Edwards, D. E. Penney, and D. T. Calvis, Differential equations and boundary value problems . 清华大学出版社, 2004
2004
Earlier work this paper cites.
C.-I. Chang, “Orthogonal subspace projection (osp) revisited: A comprehensive study and analysis,” IEEE transactions on geoscience and remote sensing , vol. 43, no. 3, pp. 502–518, 2005
2005
Earlier work this paper cites.
F. Zhang and E. R. Hancock, “Graph spectral image smoothing using the heat kernel,” Pattern Recognition , vol. 41, no. 11, pp. 3328–3342, 2008
2008
Earlier work this paper cites.
D. P. Bertsekas, Convex optimization theory . Athena Scientific Belmont, 2009
2009
Earlier work this paper cites.
M. H. Hayes, Statistical digital signal processing and modeling . John Wiley & Sons, 2009
2009
Earlier work this paper cites.
D. K. Hammond, P. Vandergheynst, and R. Gribonval, “Wavelets on graphs via spectral graph theory,” Applied and Computational Harmonic Analysis , vol. 30, no. 2, pp. 129–150, 2011
2011
Earlier work this paper cites.
D. I. Shuman, P. Vandergheynst, and P. Frossard, “Chebyshev polynomial approximation for distributed signal processing,” in Distributed Computing in Sensor Systems and Workshops (DCOSS), 2011 International Conference on . IEEE, 2011, pp. 1–8
2011
Earlier work this paper cites.
S. K. Narang and A. Ortega, “Perfect reconstruction two-channel wavelet filter banks for graph structured data,” IEEE Transactions on Signal Processing , vol. 60, no. 6, pp. 2786–2799, 2012
2012
Earlier work this paper cites.
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE Signal Processing Magazine , vol. 30, no. 3, pp. 83–98, 2013
2013
Earlier work this paper cites.
——, “Discrete signal processing on graphs,” IEEE transactions on signal processing , vol. 61, no. 7, pp. 1644–1656, 2013
2013
Cited alongside, same era.
A. Sandryhaila and J. M. Moura, “Classification via regularization on graphs.” in GlobalSIP , 2013, pp. 495–498
2013
Cited alongside, same era.
S. K. Narang and A. Ortega, “Compact support biorthogonal wavelet filterbanks for arbitrary undirected graphs,” IEEE transactions on signal processing , vol. 61, no. 19, pp. 4673–4685, 2013
2013
Cited alongside, same era.
S. K. Narang, A. Gadde, and A. Ortega, “Signal processing techniques for interpolation in graph structured data,” in Acoustics, Speech and Signal Processing (ICASSP), 2013 IEEE International Conference on . IEEE, 2013, pp. 5445–5449
2013
Cited alongside, same era.
M. Onuki, S. Ono, M. Yamagishi, and Y. Tanaka, “Graph signal denoising via trilateral filter on graph spectral domain,” IEEE Transactions on Signal and Information Processing over Networks , vol. 2, no. 2, pp. 137–148, 2016
2016
Later among the works it cites.
A. Anis, A. Gadde, and A. Ortega, “Efficient sampling set selection for bandlimited graph signals using graph spectral proxies,” IEEE Transactions on Signal Processing , vol. 64, no. 14, pp. 3775–3789, 2016
2016
Later among the works it cites.
N. Tremblay, G. Puy, R. Gribonval, and P. Vandergheynst, “Compressive spectral clustering,” in Machine Learning, Proceedings of the Thirty-third International Conference (ICML 2016), June , 2016, pp. 20–22
2016
Later among the works it cites.
A. Sakiyama, K. Watanabe, and Y. Tanaka, “Spectral graph wavelets and filter banks with low approximation error,” IEEE Transactions on Signal and Information Processing over Networks , vol. 2, no. 3, pp. 230–245, 2016
2016
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2014
Cited alongside, same era.
——, “Discrete signal processing on graphs: Frequency analysis.” IEEE Trans. Signal Processing , vol. 62, no. 12, pp. 3042–3054, 2014
2014
Cited alongside, same era.
S. Chen, A. Sandryhaila, J. M. Moura, and J. Kovacevic, “Signal denoising on graphs via graph filtering,” in Signal and Information Processing (GlobalSIP), 2014 IEEE Global Conference on . IEEE, 2014, pp. 872–876
2014
Cited alongside, same era.
2014
Cited alongside, same era.
Y. Mao, G. Cheung, and Y. Ji, “Image interpolation for dibr viewsynthesis using graph fourier transform,” in 3DTV-Conference: The True Vision-Capture, Transmission and Display of 3D Video (3DTV-CON), 2014 . IEEE, 2014, pp. 1–4
2014
Cited alongside, same era.
S. Chen, A. Sandryhaila, J. M. Moura, and J. Kovačević, “Signal recovery on graphs: Variation minimization,” IEEE Transactions on Signal Processing , vol. 63, no. 17, pp. 4609–4624, 2015
2015
Cited alongside, same era.
D. B. Tay and Z. Lin, “Design of near orthogonal graph filter banks,” IEEE Signal Processing Letters , vol. 22, no. 6, pp. 701–704, 2015
2015
Cited alongside, same era.
D. I. Shuman, C. Wiesmeyr, N. Holighaus, and P. Vandergheynst, “Spectrum-adapted tight graph wavelet and vertex-frequency frames,” IEEE Transactions on Signal Processing , vol. 63, no. 16, pp. 4223–4235, 2015
2015
Cited alongside, same era.
L. Goldsberry, W. Huang, N. F. Wymbs, S. T. Grafton, D. S. Bassett, and A. Ribeiro, “Brain signal analytics from graph signal processing perspective,” in IEEE International Conference on Acoustics, Speech, and Signal Processing, Submitted , 2016
2016
Later among the works it cites.
E. Isufi, A. Loukas, A. Simonetto, and G. Leus, “Separable autoregressive moving average graph-temporal filters,” in Signal Processing Conference (EUSIPCO), 2016 24th European . IEEE, 2016, pp. 200–204
2016
Later among the works it cites.
2016
Later among the works it cites.
S. Segarra, A. Marques, and A. Ribeiro, “Optimal graph-filter design and applications to distributed linear network operators,” IEEE Transactions on Signal Processing , 2017
2017
Closest in time.
M. Coutino, E. Isufi, and G. Leus, “Distributed Edge-Variant Graph Filters,” in International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP) . IEEE, 2017, pp. 1080–1084
2017
Closest in time.
E. Isufi, A. Loukas, A. Simonetto, and G. Leus, “Autoregressive moving average graph filtering,” IEEE Transactions on Signal Processing , vol. 65, no. 2, pp. 274–288, 2017
2017
Closest in time.
Y. Hu and G. Leus, “On a unified framework for linear nuisance parameters,” EURASIP Journal on Advances in Signal Processing , vol. 2017, no. 1, p. 4, 2017
2017
Closest in time.
S. P. Chepuri, S. Liu, G. Leus, and A. O. Hero, “Learning sparse graphs under smoothness prior,” in Acoustics, Speech and Signal Processing (ICASSP), 2017 IEEE International Conference on . IEEE, 2017, pp. 6508–6512
2017
Closest in time.
S. P. Chepuri and G. Leus, “Graph sampling for covariance estimation,” IEEE Transactions on Signal and Information Processing over Networks , vol. 3, no. 3, pp. 451–466, 2017
2017
Closest in time.
D. I. Shuman, P. Vandergheynst, D. Kressner, and P. Frossard, “Distributed signal processing via chebyshev polynomial approximation,” IEEE Transactions on Signal and Information Processing over Networks , 2018
2018
Closest in time.