Results 21 to 30 of about 1,423,064 (275)

Graph Analysis Using Fast Fourier Transform Applied on Grayscale Bitmap Images

open access: yesInformation, 2021
There is spiking interest in graph analysis, mainly sparked by social network analysis done for various purposes. With social network graphs often achieving very large size, there is a need for capable tools to perform such an analysis.
Pawel Baszuro, Jakub Swacha
doaj   +1 more source

Graph signal processing based underwater image enhancement techniques

open access: yesEngineering Science and Technology, an International Journal, 2022
This paper presents two new methods based on graph signal processing (GSP) techniques to enhance underwater images. The proposed schemes utilize the graph Fourier transform (GFT) and graph wavelet filterbanks in place of the conventional Fourier and ...
Shobha Sharma, Tarun Varma
doaj   +1 more source

Graph Neural Network for Traffic Flow Situation Prediction

open access: yesJisuanji kexue yu tansuo, 2021
Road network structure integrated traffic flow situation prediction is a highly nonlinear and complexly spatial-temporal dynamic correlation time-series data prediction problem. However, traditional traffic flow situation forecasting methods cannot model
JIANG Shan, DING Zhiming, XU Xinrun, YAN Jin
doaj   +1 more source

Are there approximate fast fourier transforms on graphs? [PDF]

open access: yes2016 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2016
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   +3 more sources

Fast Discrete Fourier Transform Computations Using the Reduced Adder Graph Technique

open access: yesEURASIP Journal on Advances in Signal Processing, 2007
It has recently been shown that the n-dimensional reduced adder graph (RAG-n) technique is beneficial for many DSP applications such as for FIR and IIR filters, where multipliers can be grouped in multiplier blocks.
Andrew G. Dempster   +2 more
doaj   +2 more sources

Geary’s c and Spectral Graph Theory

open access: yesMathematics, 2021
Spatial autocorrelation, of which Geary’s c has traditionally been a popular measure, is fundamental to spatial science. This paper provides a new perspective on Geary’s c.
Hiroshi Yamada
doaj   +1 more source

Graph Fourier Transform Based Audio Zero-Watermarking [PDF]

open access: yesIEEE Signal Processing Letters, 2021
The frequent exchange of multimedia information in the present era projects an increasing demand for copyright protection. In this work, we propose a novel audio zero-watermarking technology based on graph Fourier transform for enhancing the robustness with respect to copyright protection.
Longting Xu   +4 more
openaire   +4 more sources

Fast Incremental Spectral Clustering in Titanate Application via Graph Fourier Transform

open access: yesIEEE Access, 2020
In numerous applications the rapid increase of data size with time makes classical clustering algorithms too slow because of the high computational cost.
Gao Shu-Juan
doaj   +1 more source

Graph Fourier Transform: A Stable Approximation

open access: yesIEEE Transactions on Signal Processing, 2020
In Graph Signal Processing (GSP), data dependencies are represented by a graph whose nodes label the data and the edges capture dependencies among nodes. The graph is represented by a weighted adjacency matrix $A$ that, in GSP, generalizes the Discrete Signal Processing (DSP) shift operator $z^{-1}$.
João Domingos, José M. F. Moura
openaire   +2 more sources

Graph Fourier transform based on directed Laplacian [PDF]

open access: yes2016 International Conference on Signal Processing and Communications (SPCOM), 2016
5 ...
Rahul Singh 0002   +2 more
openaire   +2 more sources

Home - About - Disclaimer - Privacy