2000 character limit reached
On Detecting Low-pass Graph Signals under Partial Observations
Published 16 May 2024 in eess.SP | (2405.10001v1)
Abstract: The application of graph signal processing (GSP) on partially observed graph signals with missing nodes has gained attention recently. This is because processing data from large graphs are difficult, if not impossible due to the lack of availability of full observations. Many prior works have been developed using the assumption that the generated graph signals are smooth or low pass filtered. This paper treats a blind graph filter detection problem under this context. We propose a detector that certifies whether the partially observed graph signals are low pass filtered, without requiring the graph topology knowledge. As an example application, our detector leads to a pre-screening method to filter out non low pass signals and thus robustify the prior GSP algorithms. We also bound the sample complexity of our detector in terms of the class of filters, number of observed nodes, etc. Numerical experiments verify the efficacy of our method.
- A. Ortega, P. Frossard, J. Kovačević, J. M. Moura, and P. Vandergheynst, “Graph signal processing: Overview, challenges, and applications,” Proceedings of the IEEE, vol. 106, no. 5, pp. 808–828, 2018.
- G. Mateos, S. Segarra, A. G. Marques, and A. Ribeiro, “Connecting the dots: Identifying network structure via graph signal processing,” IEEE Signal Processing Magazine, vol. 36, no. 3, pp. 16–43, 2019.
- X. Dong, D. Thanou, M. Rabbat, and P. Frossard, “Learning graphs from data: A signal representation perspective,” IEEE Signal Processing Magazine, vol. 36, no. 3, pp. 44–63, 2019.
- D. Thanou, X. Dong, D. Kressner, and P. Frossard, “Learning heat diffusion graphs,” IEEE Transactions on Signal and Information Processing over Networks, vol. 3, no. 3, pp. 484–499, 2017.
- W. Huang, T. A. Bolton, J. D. Medaglia, D. S. Bassett, A. Ribeiro, and D. Van De Ville, “A graph signal processing perspective on functional brain imaging,” Proceedings of the IEEE, vol. 106, no. 5, pp. 868–885, 2018.
- V. Chandrasekaran, P. A. Parrilo, and A. S. Willsky, “Latent variable graphical model selection via convex optimization,” The Annals of Statistics, pp. 1935–1967, 2012.
- A. Buciulea, S. Rey, and A. G. Marques, “Learning graphs from smooth and graph-stationary signals with hidden variables,” IEEE Transactions on Signal and Information Processing over Networks, vol. 8, pp. 273–287, 2022.
- A. Jalali and S. Sanghavi, “Learning the dependence graph of time series with latent factors,” arXiv preprint arXiv:1106.1887, 2011.
- V. Matta, A. Santos, and A. H. Sayed, “Graph learning under partial observability,” Proceedings of the IEEE, vol. 108, no. 11, pp. 2049–2066, 2020.
- J. M. Hendrickx, M. Gevers, and A. S. Bazanella, “Identifiability of dynamical networks with partial node measurements,” IEEE Transactions on Automatic Control, vol. 64, no. 6, pp. 2240–2253, 2018.
- A. Santos, D. Rente, R. Seabra, and J. M. Moura, “Learning the causal structure of networked dynamical systems under latent nodes and structured noise,” arXiv preprint arXiv:2312.05974, 2023.
- H.-T. Wai, Y. C. Eldar, A. E. Ozdaglar, and A. Scaglione, “Community inference from partially observed graph signals: Algorithms and analysis,” IEEE Transactions on Signal Processing, vol. 70, pp. 2136–2151, 2022.
- Y. He and H.-T. Wai, “Central nodes detection from partially observed graph signals,” in 2023 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2023, pp. 1–5.
- R. Ramakrishna, H.-T. Wai, and A. Scaglione, “A user guide to low-pass graph signal processing and its applications: Tools and applications,” IEEE Signal Processing Magazine, vol. 37, no. 6, pp. 74–85, 2020.
- M. H. DeGroot, “Reaching a consensus,” Journal of the American Statistical association, vol. 69, no. 345, pp. 118–121, 1974.
- C. Zhang, Y. He, and H.-T. Wai, “Detecting low pass graph signals via spectral pattern: Sampling complexity and applications,” arXiv preprint arXiv::2306.01553, 2023.
- M. Girvan and M. E. J. Newman, “Community structure in social and biological networks,” Proceedings of the National Academy of Sciences, vol. 99, no. 12, p. 7821–7826, Jun. 2002.
- N. Perraudin and P. Vandergheynst, “Stationary signal processing on graphs,” IEEE Transactions on Signal Processing, vol. 65, no. 13, pp. 3462–3477, 2017.
- A. G. Marques, S. Segarra, G. Leus, and A. Ribeiro, “Stationary graph processes and spectral estimation,” IEEE Transactions on Signal Processing, vol. 65, no. 22, pp. 5911–5926, 2017.
- A. Sandryhaila and J. M. Moura, “Discrete signal processing on graphs,” IEEE transactions on signal processing, vol. 61, no. 7, pp. 1644–1656, 2013.
- Y. He and H.-T. Wai, “Identifying first-order lowpass graph signals using perron frobenius theorem,” in 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2021, pp. 5285–5289.
- U. von Luxburg, “A tutorial on spectral clustering,” Statistics and Computing, vol. 17, no. 4, p. 395–416, Aug. 2007.
- K. Rohe, S. Chatterjee, and B. Yu, “Spectral clustering and the high-dimensional stochastic blockmodel,” The Annals of Statistics, vol. 39, no. 4, Aug. 2011.
- F. Bunea and L. Xiao, “On the sample covariance matrix estimator of reduced effective rank population matrices, with applications to fPCA,” Bernoulli, vol. 21, no. 2, pp. 1200 – 1230, 2015.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.