1. IEEE Signal Processing Magazine
2. Signal Processing Digital Library*
3. Inside Signal Processing Newsletter
4. SPS Resource Center
5. Career advancement & recognition
6. Discounts on conferences and publications
7. Professional networking
8. Communities for students, young professionals, and women
9. Volunteer opportunities
10. Coming soon! PDH/CEU credits
Click here to learn more.
10 years of news and resources for members of the IEEE Signal Processing Society
Upcoming Webinar! November 18, 2019
Webinar Topic: "Network Topology Inference from Spectral Templates"
Presented by Dr. Santiago Segarra and based on an IEEE Xplore article
published in IEEE Transactions on Signal and Information Processing over Networks
|Presenter: Dr. Santiago Segarra
|Date: November 18, 2019
Time: 11:00 am EDT (New York time)
Duration: Approximately 1 hour
Register: Attendee Registration
About this Topic:
The IEEE Signal Processing Society (SPS) is dedicated to promoting webinars on technical and technological innovations (and their applications) in signal processing from top researchers and thought leaders in academia and industry. In this series of upcoming webinars, we are featuring the most highly cited and most-downloaded SPS articles of 2018, and this webinar, based on the article “Network Topology Inference from Spectral Templates,” originally appeared in the IEEE Transactions on Signal and Information Processing over Networks, in 2017. This article will be made publicly available as open access and free to download on the day of the webinar.
This webinar will address the problem of identifying the structure of an undirected graph from the observation of signals defined on its nodes. Fundamentally, the unknown graph encodes direct relationships between signal elements, which we aim to recover from observable indirect relationships generated by a diffusion process on the graph. This approach leverages concepts from convex optimization and stationarity of graph signals, in order to identify the graph shift operator (a matrix representation of the graph) given only its eigenvectors. These spectral templates can be obtained, e.g., from the sample covariance of independent graph signals diffused on the sought network. The novel idea is to find a graph shift that, while being consistent with the provided spectral information, endows the network with certain desired properties such as sparsity. To that end, we develop efficient inference algorithms stemming from provably tight convex relaxations of natural non-convex criteria.
About the Presenter:
Dr. Santiago Segarra received his B.Sc. degree in industrial engineering with highest honors (Valedictorian) from the Instituto Tecnológico de Buenos Aires (ITBA), Argentina, in 2011, his M.Sc. degree in electrical engineering from the University of Pennsylvania (U-Penn), Philadelphia, in 2014, and his Ph.D. degree in electrical and systems engineering from U-Penn in 2016.
From September 2016 to June 2018, he was a postdoctoral research associate with the Institute for Data, Systems, and Society at the Massachusetts Institute of Technology, Cambridge. Since July 2018, he has been an Assistant Professor in the Department of Electrical and Computer Engineering at Rice University, Houston, TX. His research interests include network theory, data analysis, machine learning, and graph signal processing.
Dr. Segarra received the ITBA’s 2011 Best Undergraduate Thesis Award in Industrial Engineering, the 2011 Outstanding Graduate Award granted by the National Academy of Engineering of Argentina, the 2017 U-Penn’s Joseph and Rosaline Wolf Award for Best Doctoral Dissertation in Electrical and Systems Engineering, as well as four best conference paper awards.
© Copyright 2022 IEEE – All rights reserved. Use of this website signifies your agreement to the IEEE Terms and Conditions.
A not-for-profit organization, IEEE is the world's largest technical professional organization dedicated to advancing technology for the benefit of humanity.