Results 241 to 250 of about 184,341 (273)
Some of the next articles are maybe not open access.
Discrete signal processing on graphs: Graph fourier transform
2013 IEEE International Conference on Acoustics, Speech and Signal Processing, 2013We propose a novel discrete signal processing framework for the representation and analysis of datasets with complex structure. Such datasets arise in many social, economic, biological, and physical networks. Our framework extends traditional discrete signal processing theory to structured datasets by viewing them as signals represented by graphs, so ...
Aliaksei Sandryhaila, Jose M. F. Moura
openaire +1 more source
The fractional Fourier transform on graphs
2017 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC), 2017The emerging field of signal processing on graphs merges algebraic or spectral graph theory with discrete signal processing techniques to process signals on graphs. In this paper, a definition of the fractional Fourier transform on graphs (GFRFT) is proposed and consolidated, which extends the discrete fractional Fourier transform (DFRFT) in the same ...
Yi-qian Wang +2 more
openaire +1 more source
A graph Fourier transform and proportional graphs
Random Structures & Algorithms, 1995AbstractA Fourier transform for (real valued) functions of graphs is denned. This is used to study and characterize some classes of graphs that arise as exceptional cases in limit theorems for subgraph counts in random graphs.
openaire +1 more source
Fourier Transform vs. Graph Fourier Transform for EEG-Based Emotion Recognition
2020Electroencephalogram (EEG)-based feature extraction for emotion recognition is a very challenging task. The vast majority of the feature extraction approaches are based on the frequency characteristics of the EEG signals which are extracted using, e.g., the traditional Fourier Transform approach.
Panagiotis C. Petrantonakis +2 more
openaire +1 more source
A new windowed graph Fourier transform
2017 4th NAFOSTED Conference on Information and Computer Science, 2017Many practical networks can be mathematically modeled as graphs. Graph signal processing (GSP), intersecting graph theory and computational harmonic analysis, can be used to analyze graph signals. Just as short-time Fourier transform (STFT) for time-frequency analysis in classical signal processing, we have windowed graph Fourier transform (WGFT) for ...
Le Trung Thanh +3 more
openaire +1 more source
Graph Fractional Fourier Transform: A Unified Theory
IEEE Transactions on Signal ProcessingzbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tuna Alikaşifoğlu +2 more
openaire +1 more source
Fourier transform for signals on dynamic graphs
2014 48th Asilomar Conference on Signals, Systems and Computers, 2014Signal processing on graphs offers a new way of analyzing multivariate signals. The different relationships among the sources generating the multivariate signals can be captured by weighted graphs where the nodes are the signal sources and the edges correspond to the relationships between these signals.
Arash Golibagh Mahyari, Selin Aviyente
openaire +1 more source
Subspace-sparsifying steerable discrete cosine transform from graph fourier transform
2016 IEEE International Conference on Image Processing (ICIP), 2016In image compression, block-based transforms tend to be inefficient when blocks contain arbitrarily shaped discontinuities. For this reason, transforms incorporating directional information are an appealing alternative. Starting from the graph Fourier transform, in this paper we present a new transform, called Subspace-Sparsifying Steer-able DCT, that ...
FRACASTORO, GIULIA, MAGLI, ENRICO
openaire +1 more source
Slides: Graph Fourier Transform for Directed Graphs
Graph Fourier transform (GFT) is one of the fundamental tools in graph signal processing to decompose graph signals into different frequency components and effectively represent graph signals with strong correlations using various modes of variation.openaire +1 more source
Colorization-based image coding using graph Fourier transform
Signal Processing: Image Communication, 2019Abstract This paper deals with the colorization-based image coding algorithm. In this algorithm, a color image is compressed by encoding its luminance image by a standard coding method such as JPEG coding and by storing several color pixels called as representative pixels (RPs).
Kazunori Uruma +3 more
openaire +1 more source

