Signal Processing on Graphs: Estimating the Structure of a Graph讲座通知

上传时间 :2015-06-03    浏览次数 :2606    发布者:系统管理员     部门:shenmin

时间:2015年6月9日,上午10:00

地点:玉泉校区曹主208

讲座题目:Signal Processing on Graphs: Estimating the Structure of a Graph

演讲人:Dr. Jonathan Mei,美国卡内基梅隆大学(CMU)在读博士,美国麻省理工学院(MIT)硕士

讲座摘要:

This paper presents a computationally tractable algorithm for estimating the graph structure of graph signals. The algorithm is demonstrated on simulated and real network time series datasets, and the performance of the new method is compared to that of related methods for estimating graph structure. The adjacency matrices estimated using the new method are shown to be close to the true graph in the simulated data and consistent with prior physical knowledge in the real dataset.

演讲人简历:

Jonathan Mei received his BS and MEng degrees from the Massachusetts Institute of Technology in 2013 from the Department of Electrical Engineering and Computer Science. His Master's thesis focused on Algorithms for 3D Time-of-Flight Imaging and won the 2nd place David Adler Memorial Best Thesis Award. He is currently a PhD candidate at Carnegie Mellon University in the Department of Electrical and Computer Engineering​ working with professor José Moura​. ​Jonathan was recently the recipient of the David Barakat and LaVerne Owen-Barakat ​Carnegie Institute of Technology ​Fellowship. His current work is in the areas of ​graph ​signal processing and time-series analysis.