Results 11 to 20 of about 1,423,064 (275)
Graph Fourier Transform Enhancement Through Envelope Extensions [PDF]
Many real-world networks are characterized by directionality; however, the absence of an appropriate Fourier basis hinders the effective implementation of graph signal processing techniques. Inspired by discrete signal processing, where embedding a line digraph into a cycle digraph facilitates the powerful Discrete Fourier Transform for signal ...
Ali Bagheri Bardi +3 more
openaire +4 more sources
A reverse of the Cauchy-Bunyakovsky-Schwarz integral inequality for complex-valued functions and applications for Fourier transform [PDF]
A reverse of the Cauchy-Bunyakovsky-Schwarz integral inequality for complex-valued functions and applications for the finite Fourier transform are ...
Hanna, George T +5 more
core +5 more sources
Radar matched filtering using the fractional fourier transform [PDF]
-A matched filter is the optimal linear filter for maximizing the signal to noise ratio (SNR) in the presence of additive noise. Matched filters are commonly used in radar systems where the transmitted signal is known and may be used as a replica to be ...
Clemente, Carmine +2 more
core +4 more sources
From Time–Frequency to Vertex–Frequency and Back
The paper presents an analysis and overview of vertex–frequency analysis, an emerging area in graph signal processing. A strong formal link of this area to classical time–frequency analysis is provided.
Ljubiša Stanković +5 more
doaj +1 more source
A graph-based narrowband matched-field source localization method [PDF]
Matched field processing (MFP) has been regarded as one of the most successful acoustical methods for positioning underwater sources. In this paper, the narrowband MFP method is combined with a recently developed framework—the graph signal processing ...
Peng Xiao, Jianmin Yang
doaj +1 more source
Fokas Method for the Heat Equation on Metric Graphs
The paper presents a method for constructing solutions to initial-boundary value problems for the heat equation on simple metric graphs such as a star-shaped graph, a tree, and a triangle with three converging edges.
Z. A. Sobirov, M. R. Eshimbetov
doaj +1 more source
On the Graph Fourier Transform for Directed Graphs [PDF]
To appear in IEEE Journal of Selected Topics in Signal Processing ...
Sardellitti, Stefania +2 more
openaire +2 more sources
A Fast Fourier Transform for the Johnson Graph
21 pages, 8 figures.
Rodrigo Iglesias, Mauro Natale
openaire +2 more sources
Graph Fourier transforms on directed product graphs
Graph Fourier transform (GFT) is one of the fundamental tools in graph signal processing to decompose graph signals into different frequency components and to represent graph signals with strong correlation by different modes of variation effectively. The GFT on undirected graphs has been well studied and several approaches have been proposed to define
Cheng Cheng 0003 +3 more
openaire +3 more sources
Fast Spectral Approximation of Structured Graphs with Applications to Graph Filtering
To analyze and synthesize signals on networks or graphs, Fourier theory has been extended to irregular domains, leading to a so-called graph Fourier transform.
Mario Coutino +3 more
doaj +1 more source

