Learning Graph ARMA Processes From Time-Vertex Spectra

Creative Commons License

Güneyi E. T., Yaldiz B., CANBOLAT A., VURAL E.

IEEE Transactions on Signal Processing, cilt.72, ss.47-56, 2024 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 72
  • Basım Tarihi: 2024
  • Doi Numarası: 10.1109/tsp.2023.3329948
  • Dergi Adı: IEEE Transactions on Signal Processing
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, PASCAL, Aerospace Database, Applied Science & Technology Source, Business Source Elite, Business Source Premier, Communication Abstracts, Compendex, Computer & Applied Sciences, INSPEC, Metadex, zbMATH, Civil Engineering Abstracts
  • Sayfa Sayıları: ss.47-56
  • Anahtar Kelimeler: graph ARMA models, Graph processes, joint power spectral density, time-varying graph signals, time-vertex processes
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

The modeling of time-varying graph signals as stationary time-vertex stochastic processes permits the inference of missing signal values by efficiently employing the correlation patterns of the process across different graph nodes and time instants. In this study, we propose an algorithm for computing graph autoregressive moving average (graph ARMA) processes based on learning the joint time-vertex power spectral density of the process from its incomplete realizations for the task of signal interpolation. Our solution relies on first roughly estimating the joint spectrum of the process from partially observed realizations and then refining this estimate by projecting it onto the spectrum manifold of the graph ARMA process through convex relaxations. The initially missing signal values are then estimated based on the learnt model. Experimental results show that the proposed approach achieves high accuracy in time-vertex signal estimation problems.