1 |
D. Shuman, S. Narang, P. Frossard, A. Ortega, 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.
DOI
|
2 |
A. Ortega, P. Frossard, J. Kovaevic, J. M. F. Moura, P. Vandergheynst, "Graph signal processing: overview, challenges and applications," Proceedings of the IEEE, vol. 106, no. 5, pp. 808-828, 2018.
DOI
|
3 |
A. Anis, A. Gadde, A. Ortega, "Towards a sampling theorem for signals on arbitrary graphs," IEEE International Conference on Acoustic, Speech, and Signal Processing (ICASSP), Florence, Italy, pp. 3864-3858, 2014.
|
4 |
A. Anis, A. Gadde, 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.
DOI
|
5 |
S. Chen, R. Varma, A. Sandryhaila, J. Kovaevic, "Discrete signal processing on graphs: sampling theory," IEEE Transactions on Signal Processing, vol. 63, no. 24, pp.6510- 6523, 2015.
DOI
|
6 |
N. Perraudin, B. Ricaud, D. Shuman and P. Vandergheynst, "Global and local uncertainty principles for signals on graphs," APSIPA Transactions. On Signal and Information Processing, vol. 7, Apr. 2018.
|
7 |
A. Sakiyama, Y. Tanaka, T. Tanaka, A. Ortega, "Eigendecompostion-free sampling set selection for graph signals," IEEE Transactions on Signal Processing, vol.67, no. 10, pp. 2679-2692, 2019.
DOI
|
8 |
F. Wang, G. Cheung, Y. Wang, "Low-complexity graph sampling with noise and signal reconstruction via Neumann series," IEEE Transactions. On Signal Processing, vol. 67, no. 21, pp. 5511-5526, 2019.
DOI
|
9 |
N. Perraudin, J. Paratte, D. Shuman, L. Martin, V. Kalofolias, P. Vandergheynst, and D. K. Hammond, "GSPBOX: A toolbox for signal processing on graphs," ArXiv e-prints arXiv:1408.5781, Aug. 2014.
|