Related papers: Hilbert Transform, Analytic Signal, and Modulation…
Graph analytics elicits insights from large graphs to inform critical decisions for business, safety and security. Several large-scale graph processing frameworks feature efficient runtime systems; however, they often provide programming…
Constructing appropriate representations of molecules lies at the core of numerous tasks such as material science, chemistry and drug designs. Recent researches abstract molecules as attributed graphs and employ graph neural networks (GNN)…
The graph Laplacian is an important tool in Graph Signal Processing (GSP) as its eigenvalue decomposition acts as an analogue to the Fourier transform and is known as the Graph Fourier Transform (GFT). The line graph has a GFT that is a…
In the past decade, significant progress has been made to generalize classical tools from Fourier analysis to analyze and process signals defined on networks. In this paper, we propose a new framework for constructing Gabor-type frames for…
Can transformers generalize efficiently on problems that require dealing with examples with different levels of difficulty? We introduce a new task tailored to assess generalization over different complexities and present results that…
We argue that Transformers are essentially graph-to-graph models, with sequences just being a special case. Attention weights are functionally equivalent to graph edges. Our Graph-to-Graph Transformer architecture makes this ability…
Gravitational wave astronomy relies on the use of multiple detectors, so that coincident detections may distinguish real signals from instrumental artifacts, and also so that relative timing of signals can provide the sky position of…
This paper describe the features extraction algorithm for electrocardiogram (ECG) signal using Huang Hilbert Transform and Wavelet Transform. ECG signal for an individual human being is different due to unique heart structure. The purpose…
A microwave Hilbert transformer is introduced as a new component for Real-time Analog Processing (RAP). In contrast to its optical counterpart, that resort to optical fiber gratings, this Hilbert transformer is based on the combination of a…
Uncovering meaningful regularities in complex oscillatory signals is a challenging problem with applications across a wide range of disciplines. Here we present a novel approach, based on the Hilbert transform (HT). We show that temporal…
Graph Transformers (GTs) have shown strong empirical performance, yet current architectures vary widely in their use of attention mechanisms, positional embeddings (PEs), and expressivity. Existing expressivity results are often tied to…
We propose the Interferometric Graph Transform (IGT), which is a new class of deep unsupervised graph convolutional neural network for building graph representations. Our first contribution is to propose a generic, complex-valued spectral…
Using projections on the (generalized) eigenvectors associated to matrices that characterize the topological structure, several authors have constructed generalizations of the Fourier transform on graphs. By exploring mappings of the…
Modern compression systems use linear transformations in their encoding and decoding processes, with transforms providing compact signal representations. While multiple data-dependent transforms for image/video coding can adapt to diverse…
Graph signal processing (GSP) is an emerging field developed for analyzing signals defined on irregular spatial structures modeled as graphs. Given the considerable literature regarding the resilience of infrastructure networks using graph…
We propose a recipe on how to build a general, powerful, scalable (GPS) graph Transformer with linear complexity and state-of-the-art results on a diverse set of benchmarks. Graph Transformers (GTs) have gained popularity in the field of…
Graph Transformers (GTs) have demonstrated a strong capability in modeling graph structures by addressing the intrinsic limitations of graph neural networks (GNNs), such as over-smoothing and over-squashing. Recent studies have proposed…
Defining a sound shift operator for signals existing on a certain graph structure, similar to the well-defined shift operator in classical signal processing, is a crucial problem in graph signal processing, since almost all operations, such…
Transformers for graph data are increasingly widely studied and successful in numerous learning tasks. Graph inductive biases are crucial for Graph Transformers, and previous works incorporate them using message-passing modules and/or…
We propose a novel method for constructing Hilbert transform (HT) pairs of wavelet bases based on a fundamental approximation-theoretic characterization of scaling functions--the B-spline factorization theorem. In particular, starting from…