Abstract
Graph signal processing (GSP) has emerged as a powerful framework for analyzing data defined on irregular domains. In recent years, many classical techniques in signal processing (SP) have been successfully extended to GSP. Among them, chirp signals play a crucial role in various SP applications. However, graph chirp signals, despite their potential importance, have not yet been formally defined. Here, we define graph chirp signals and establish a comprehensive theoretical framework for their analysis.We propose the graph fractional vertex–frequency energy distribution (GFED), which provides a powerful tool for processing and analyzing graph chirp signals.We introduce the general fractional graph distribution (GFGD), a generalized vertex–frequency distribution, along with the reduced-interference GFED that effectively suppress cross-term interference and enhance signal clarity. Furthermore, we develop a novel GFED domain filtering method for detecting graph chirp signals, enabling robust signal analysis in noisy environments. Moreover, this method demonstrates strong practical potential in real-world denoising tasks, achieving performance superior to several state-of-the-art approaches. Finally, we explore the potential applications of graph chirp signals, highlighting their usefulness in denoising and compression.
Funding Information
  • Open Foundation of Hubei Key Laboratory of Applied Mathematics (HBAM202404)
  • Foundation of Key Laboratory of System Control and Information Processing, Ministry of Education (Scip20240121)

This publication has 46 references indexed in Scilit: