This book introduces new methods to analyze vertex-varying graph signals. In many real-world scenarios, the data sensing domain is not a regular grid, but a more complex network that consists of sensing points (vertices) and edges (relating the sensing points). Furthermore, sensing geometry or signal properties define the relation among sensed signal points. Even for the data sensed in the well-defined time or space domain, the introduction of new relationships among the sensing points may produce new insights in the analysis and result in more advanced data processing techniques. The data domain, in these cases and discussed in this book, is defined by a graph. Graphs exploit the fundamental relations among the data points. Processing of signals whose sensing domains are defined by graphs resulted in graph data processing as an emerging field in signal processing. Although signal processing techniques for the analysis of time-varying signals are well established, the corresponding graph signal processing equivalent approaches are still in their infancy. This book presents novel approaches to analyze vertex-varying graph signals. The vertex-frequency analysis methods use the Laplacian or adjacency matrix to establish connections between vertex and spectral (frequency) domain in order to analyze local signal behavior where edge connections are used for graph signal localization. The book applies combined concepts from time-frequency and wavelet analyses of classical signal processing to the analysis of graph signals. Covering analytical tools for vertex-varying applications, this book is of interest to researchers and practitioners in engineering, science, neuroscience, genome processing, just to name a few. It is also a valuable resource for postgraduate students and researchers looking to expand their knowledge of the vertex-frequency analysis theory and its applications. The book consists of 15 chapters contributed by 41 leading researches in the field.

****

Introduces graph signal processing Provides novel algorithms that can be used to analyse vertex-varying graph signals Explains how these new methods can be applied to increase our understanding of the human brain, social networks, and genomics

Autorentext
Ljubia Stankovic received the B.S.and the Ph.D degree in Electrical Engineering from the University of Montenegro, and the M.S. degree from the University of Belgrade. He is a professor at the University of Montenegro. He has been visiting academic at several universities, including the Ruhr University Bochum, Technische Universiteit Eindhoven, and the Imperial College, London. He is a member and vice-president of the National Academy of Science and Arts of Montenegro and a member of the European Academy of Sciences and Arts. He is a senior area editor of the IEEE Transactions on Image Processing, a member of the Editorial Board of Signal Processing, and an associate editor of the IET Signal Processing. He was an associate editor of the IEEE Signal Processing Letters and the IEEE Transactions on Signal Processing. His current interests are in Signal Processing. He published several books and about 400 papers, more than 150 of them in the leading journals. He was awarded the best Signal Processing journal award in 2017 by the European Association for Signal Processing. Stankovic is a Fellow of the IEEE since 2012 for contributors to time-frequency signal analysis.

Ervin Sejdic received the B.E.Sc. and Ph.D. degrees in electrical engineering from the University of Western Ontario, London, ON, Canada, in 2002 and 2008, respectively. He was a Postdoctoral Fellow with Holland Bloorview Kids Rehabilitation Hospital/University of Toronto and a Research Fellow in medicine with Beth Israel Deaconess Medical Center/Harvard Medical School. He is currently an Associate Professor with the Department of Electrical and Computer Engineering (Swanson School of Engineering), the Department of Bioengineering (Swanson School of Engineering), the Department of Biomedical Informatics (School of Medicine), and the Intelligent Systems Program (School of Computing andInformation) at the University of Pittsburgh, Pittsburgh, PA, USA. His research interests include biomedical and theoretical signal processing, swallowing difficulties, gait and balance, assistive technologies, rehabilitation engineering, anticipatory medical devices, and advanced information systems in medicine.

Inhalt
Introduction to Graph Signal Processing.- Oversampled Graph Laplacian Matrix for Graph Filter Banks.- Toward an Uncertainty Principle for Weighted Graphs.- Graph Theoretic Uncertainty and Feasibility.- Signal-Adapted Tight Frames on Graphs.- Local Spectral Analysis of the Cerebral Cortex: New Gyrification Indices.- Intrinsic Geometric Information Transfer Learning on Multiple Graph-Structured Datasets.