BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Memento EPFL//
BEGIN:VEVENT
SUMMARY:3rd Graph Signal Processing Workshop – GSP’18
DTSTART;VALUE=DATE:20180606
DTSTAMP:20260407T064422Z
UID:01ccbacdef7eb5127ffcc152e6e456a89e0aa9032c3293a68a3509e1
CATEGORIES:Conferences - Seminars
DESCRIPTION:A range of experts from around the world\nSpeakers :\nProf. E
 ric D. Kolaczyk\, Boston University \nProf. Dimitri van de Ville\, EPFL/U
 niversité de Genève \nProf. Gene Cheung\, National Institute of Informa
 tics\, Tokyo \nDr. Gilles Puy\, Technicolor\, Rennes \nProf. Michael Bro
 nstein\, Università della Svizzera Italiana\, Lugano\nA graph\, or networ
 k\, is a structure that encodes pairwise relationships and a graph signal 
 is a function defined on the nodes of the graph. The values of the weights
  on the edges of the graph encode an expectation on the relationship betwe
 en the respective signal components. A large weight indicates that we expe
 ct the signal elements to be similar and a small weight indicates no such 
 expectation except for what is implied by their common proximity to other 
 nodes. The goal of graph signal processing (GSP) is to generalize the clas
 sical signal processing toolbox to graph signals.\n\nGraph signal processi
 ng applications arise whenever we encounter one of the many signals that a
 re supported on a graph. Examples of applications that will be showcased i
 n the workshop include gene expression patterns defined on top of gene net
 works\, the spread of epidemics over a social network\, the congestion lev
 el at the nodes of a telecommunication network\, and patterns of brain act
 ivity defined on top of a brain network.\n\nBesides particular application
 s\, the workshop will also showcase the advancement of the understanding o
 f network data by redesigning traditional tools originally conceived to st
 udy signals defined on regular domains (such as time-varying signals or sp
 atially varying images and fields) and extending them to analyze signals o
 n the more complex graph domain. Examples of topics to be showcased in thi
 s theoretical track include graph transforms\, sampling theorems\, and fil
 ter design.\n\nProgramme and more info: https://gsp18.epfl.ch
LOCATION:ELA 1 https://plan.epfl.ch/?room==ELA%201
STATUS:CONFIRMED
END:VEVENT
END:VCALENDAR