Results 31 to 40 of about 184,341 (273)
Irregularity-Aware Graph Fourier Transforms
In this paper, we present a novel generalization of the graph Fourier transform (GFT). Our approach is based on separately considering the definitions of signal energy and signal variation, leading to several possible orthonormal GFTs. Our approach includes traditional definitions of the GFT as special cases, while also leading to new GFT designs that ...
Benjamin Girault +2 more
openaire +3 more sources
Spectral Projector-Based Graph Fourier Transforms [PDF]
The paper presents the graph Fourier transform (GFT) of a signal in terms of its spectral decomposition over the Jordan subspaces of the graph adjacency matrix $A$. This representation is unique and coordinate free, and it leads to unambiguous definition of the spectral components ("harmonics") of a graph signal. This is particularly meaningful when $A$
Deri, Joya A., Moura, José M. F.
openaire +2 more sources
INDUCED DRAFT FAN DOMINANT FREQUENCY DETECTION USING SHORT-TIME FOURIER TRANSFORM METHOD
Weak suction and large vibrations indicate an Induced Draft Fan (IDF) problem. The Fast Fourier Transform (FFT) method cannot be applied to non-stationary vibration signals.
Dedik Romahadi
doaj +1 more source
Non-commutative flux representation for loop quantum gravity [PDF]
The Hilbert space of loop quantum gravity is usually described in terms of cylindrical functionals of the gauge connection, the electric fluxes acting as non-commuting derivation operators. It has long been believed that this non-commutativity prevents a
A Baratin +25 more
core +4 more sources
Generic Reversible Visible Watermarking via Regularized Graph Fourier Transform Coding [PDF]
Reversible visible watermarking (RVW) is an active copyright protection mechanism. It not only transparently superimposes copyright patterns on specific positions of digital images or video frames to declare the copyright ownership information, but also completely erases the visible watermark image and thus enables restoring the original host image ...
Wenfa Qi, Sirui Guo, Wei Hu
openaire +3 more sources
Are there approximate fast fourier transforms on graphs? [PDF]
Signal processing on graphs is a recent research domain that seeks to extend classical signal processing tools such as the Fourier transform to irregular domains given by a graph. In such a graph setting, a way to rapidly apply the Fourier transform, i.e. a Fast Fourier Transform (FFT), is lacking.
Le Magoarou, Luc, Gribonval, Rémi
openaire +2 more sources
Chebyshev Polynomial Approximation for Distributed Signal Processing [PDF]
Unions of graph Fourier multipliers are an important class of linear operators for processing signals defined on graphs. We present a novel method to efficiently distribute the application of these operators to the high-dimensional signals collected by ...
Frossard, Pascal +2 more
core +3 more sources
Region Adaptive Graph Fourier Transform for 3D Point Clouds [PDF]
5 pages, 3 figures, accepted ICIP ...
Pavez, Eduardo +3 more
openaire +3 more sources
Short-Time Prediction Model for Urban Traffic Flow Based on Joint Spatio-Temporal Learning [PDF]
A joint spatio-temporal analysis can reflect the changing pattern of a studied object in the spatio-temporal dimension, which is significant for revealing the spatio-temporal interactions and mechanisms of regional processes.With a focus on joint spatio ...
GE Yuran, FU Qiang
doaj +1 more source
Steerable Discrete Cosine Transform [PDF]
In image compression, classical block-based separable transforms tend to be inefficient when image blocks contain arbitrarily shaped discontinuities. For this reason, transforms incorporating directional information are an appealing alternative.
Fosson, Sophie Marie +2 more
core +2 more sources

