D
David I Shuman
Researcher at Macalester College
Publications - 47
Citations - 6570
David I Shuman is an academic researcher from Macalester College. The author has contributed to research in topics: Signal processing & Adjacency matrix. The author has an hindex of 22, co-authored 45 publications receiving 5078 citations. Previous affiliations of David I Shuman include University of Michigan & École Polytechnique Fédérale de Lausanne.
Papers
More filters
Journal ArticleDOI
The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains
TL;DR: The field of signal processing on graphs merges algebraic and spectral graph theoretic concepts with computational harmonic analysis to process high-dimensional data on graphs as discussed by the authors, which are the analogs to the classical frequency domain and highlight the importance of incorporating the irregular structures of graph data domains when processing signals on graphs.
Journal ArticleDOI
The Emerging Field of Signal Processing on Graphs: Extending High-Dimensional Data Analysis to Networks and Other Irregular Domains
TL;DR: This tutorial overview outlines the main challenges of the emerging field of signal processing on graphs, discusses different ways to define graph spectral domains, which are the analogs to the classical frequency domain, and highlights the importance of incorporating the irregular structures of graph data domains when processing signals on graphs.
Posted Content
GSPBOX: A toolbox for signal processing on graphs
Nathanaël Perraudin,Johan Paratte,David I Shuman,Lionel Martin,Vassilis Kalofolias,Pierre Vandergheynst,David K. Hammond +6 more
TL;DR: This document introduces the Graph Signal Processing Toolbox (GSPBox) a framework that can be used to tackle graph related problems with a signal processing approach and explains the structure and the organization of this software.
Journal ArticleDOI
Vertex-Frequency Analysis on Graphs
TL;DR: In this article, the authors generalize windowed Fourier analysis to the graph domain and design dictionaries and transform methods to identify and exploit structure in signals on weighted graphs, but they need to account for the intrinsic geometric structure of the underlying graph data domain.
Posted Content
Vertex-Frequency Analysis on Graphs
TL;DR: This paper generalizes one of the most important signal processing tools - windowed Fourier analysis - to the graph setting and designs dictionaries and transform methods to identify and exploit structure in signals on weighted graphs.