A didactic introduction to Graph Signal Processing techniques and applications

• Ano de defesa: 2019
• Autor(a) principal: Fonini, Pedro Angelo Medeiros
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: eng
• Instituição de defesa: Universidade Federal do Rio de Janeiro; Brasil; Instituto Alberto Luiz Coimbra de Pós-Graduação e Pesquisa de Engenharia; Programa de Pós-Graduação em Engenharia Elétrica; UFRJ
• Palavras-chave em Português: Gráficos; Filtragem adaptável; Processamento de sinal; CNPQ::ENGENHARIAS
• Link de acesso: http://hdl.handle.net/11422/21242

Traditional signal processing thrives when applied to uniform, euclidean domains. Even though most DSP tools are built around the fact that signal domains are expected to be uniform e.g. continuous time or an equally spaced discrete domain, many in- teresting problems are defined on top of more irregular structures. When dealing with applications such as social networks, arbitrarily distributed arrays of sensors, neuronal networks, and power grids, one of the mathematical strategies to acknowledge the irregular structure is to interpret the data as being defined on the vertices of a weighted graph. Since these subjacent structures usually carry valueable information, the field of signal processing on graphs, or graph signal processing (GSP), has been active in the recent decade. In this work, we review some of the advances made possible by this new field. We give special focus to time-varying signals in which each graph vertex rep- resents a time-series and the adaptive algorithms designed for this new kind of signal processing. By applying to GSP techniques borrowed from adaptive filtering, one is able to de- rive processing algorithms that learn from the statistics of a graph signal. When the subjacent structure of the irregular domain on which the data reside is accounted for, the results are higher inference power, and better-informed decisions.