CIF:Small:Theoretical Foundations for Robust Signal Processing on Spatial Networks

NSF Award Search · 01002526DB NSF RESEARCH & RELATED ACTIVIT · $287,125 · view on nsf.gov ↗

Abstract

Many complex and interconnected phenomena in the world - such as social media, sensor grids, and brain connectivity - can be modeled using graphs or networks. Unlike classical signal processing, which works with data regularly arranged in a homogeneous space (like audio or images), graph signal processing (GSP) analyzes signals that lie on irregular graphs or networks. Important outcomes of such analysis include detecting patterns, detecting and reducing noise, and visualizing the network. GSP has become a vibrant field of research in engineering and mathematics due to its applicability to a wide range of real-world problems, such as data analysis on sensor networks, biological networks, and neural networks. In this project, the investigator uses a blend of mathematical theories and techniques to develop the theoretical underpinning and possible new applications of GSP, especially for the case of large dynamic networks that evolve over time. The investigator plans to couple this research with graduate student mentoring, organizing scientific workshops, and outreach in the scientific community. In this project, the investigator aims to leverage a blend of techniques from harmonic analysis, functional analysis, and graph-limit theory to address challenges in information processing, particularly in the theoretical underpinning of GSP. The goal is to develop a theory that is applicable to a wide range of large dynamic networks. The relatively recent theory of graph limits and

Key facts

NSF award ID
2427965
Awardee
University of Delaware (DE)
SAM.gov UEI
T72NHKM259N3
PI
Mahya Ghandehari
Primary program
01002526DB NSF RESEARCH & RELATED ACTIVIT
All programs
SMALL PROJECT, SIGNAL PROCESSING, EXP PROG TO STIM COMP RES
Estimated total
$287,125
Funds obligated
$287,125
Transaction type
Standard Grant
Period
10/01/2025 → 09/30/2028