Time-varying graph learning from smooth and stationary graph signals with hidden nodes

IF 1.9 4区 工程技术 Q2 Engineering EURASIP Journal on Advances in Signal Processing Pub Date : 2024-03-13 DOI:10.1186/s13634-024-01128-0
{"title":"Time-varying graph learning from smooth and stationary graph signals with hidden nodes","authors":"","doi":"10.1186/s13634-024-01128-0","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>Learning graph structure from observed signals over graph is a crucial task in many graph signal processing (GSP) applications. Existing approaches focus on inferring static graph, typically assuming that all nodes are available. However, these approaches ignore the situation where only a subset of nodes are available from spatiotemporal measurements, and the remaining nodes are never observed due to application-specific constraints, resulting in time-varying graph estimation accuracy declines dramatically. To handle this problem, we propose a framework that consider the presence of hidden nodes to identify time-varying graph. Specifically, we assume that the graph signals are smooth and stationary on the graphs and only a small number of edges are allowed to change between two consecutive graphs. With these assumptions, we present a challenging time-varying graph inference problem, which models the influence of hidden nodes in terms of estimating the graph-shift operator matrices that have a form of graph Laplacian. Moreover, we emphasize similar edge pattern (column-sparsity) between different graphs. Finally, our method is evaluated on both synthetic and real-world data. The experimental results demonstrate the advantage of our method when compared to existing benchmarking methods.</p>","PeriodicalId":11816,"journal":{"name":"EURASIP Journal on Advances in Signal Processing","volume":"168 1","pages":""},"PeriodicalIF":1.9000,"publicationDate":"2024-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"EURASIP Journal on Advances in Signal Processing","FirstCategoryId":"5","ListUrlMain":"https://doi.org/10.1186/s13634-024-01128-0","RegionNum":4,"RegionCategory":"工程技术","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 0

Abstract

Learning graph structure from observed signals over graph is a crucial task in many graph signal processing (GSP) applications. Existing approaches focus on inferring static graph, typically assuming that all nodes are available. However, these approaches ignore the situation where only a subset of nodes are available from spatiotemporal measurements, and the remaining nodes are never observed due to application-specific constraints, resulting in time-varying graph estimation accuracy declines dramatically. To handle this problem, we propose a framework that consider the presence of hidden nodes to identify time-varying graph. Specifically, we assume that the graph signals are smooth and stationary on the graphs and only a small number of edges are allowed to change between two consecutive graphs. With these assumptions, we present a challenging time-varying graph inference problem, which models the influence of hidden nodes in terms of estimating the graph-shift operator matrices that have a form of graph Laplacian. Moreover, we emphasize similar edge pattern (column-sparsity) between different graphs. Finally, our method is evaluated on both synthetic and real-world data. The experimental results demonstrate the advantage of our method when compared to existing benchmarking methods.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
从带有隐藏节点的平滑和静态图信号中学习时变图
摘要 在许多图信号处理(GSP)应用中,从图上观测到的信号中学习图结构是一项重要任务。现有方法侧重于推断静态图,通常假设所有节点都可用。然而,这些方法忽略了这样一种情况,即只有一部分节点可以从时空测量中获得,而其余节点由于特定应用的限制从未被观测到,从而导致时变图估计精度急剧下降。为了解决这个问题,我们提出了一个考虑隐藏节点存在的框架来识别时变图。具体来说,我们假设图信号在图上是平滑和静止的,并且只允许少量的边在两个连续的图之间发生变化。基于这些假设,我们提出了一个具有挑战性的时变图推理问题,该问题通过估算具有图拉普拉奇形式的图移动算子矩阵来模拟隐藏节点的影响。此外,我们还强调了不同图之间相似的边缘模式(列稀疏性)。最后,我们在合成数据和实际数据上对我们的方法进行了评估。实验结果表明,与现有的基准方法相比,我们的方法更具优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
EURASIP Journal on Advances in Signal Processing
EURASIP Journal on Advances in Signal Processing 工程技术-工程:电子与电气
CiteScore
3.50
自引率
10.50%
发文量
109
审稿时长
2.6 months
期刊介绍: The aim of the EURASIP Journal on Advances in Signal Processing is to highlight the theoretical and practical aspects of signal processing in new and emerging technologies. The journal is directed as much at the practicing engineer as at the academic researcher. Authors of articles with novel contributions to the theory and/or practice of signal processing are welcome to submit their articles for consideration.
期刊最新文献
Double-layer data-hiding mechanism for ECG signals Maximum radial pattern matching for minimum star map identification Optimized power and speed of Split-Radix, Radix-4 and Radix-2 FFT structures Performance analysis of unconstrained partitioned-block frequency-domain adaptive filters in under-modeling scenarios Maximum length binary sequences and spectral power distribution of periodic signals
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1