Results 231 to 240 of about 1,721,122 (260)

FourierMIL: Fourier Filtering-based Multiple Instance Learning for Whole Slide Image Analysis. [PDF]

Int J Comput Vis
Zheng Y, Sharma H, Betke M, Cherry JD, Mez JB, Beane JE, Kolachalama VB.   +6 more
europepmc   +1 more source

A Windowed Graph Fourier Transform [PDF]

2012 IEEE Statistical Signal Processing Workshop (SSP), 2012
The prevalence of signals on weighted graphs is increasing; however, because of the irregular structure of weighted graphs, classical signal processing techniques cannot be directly applied to signals on graphs. In this paper, we define generalized translation and modulation operators for signals on graphs, and use these operators to adapt the ...
David I Shuman, Benjamin Ricaud, Pierre Vandergheynst   +2 more
exaly   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

The Fractional Fourier Transform on Graphs

2017 Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA ASC), 2017
The 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 ...
Bing-Zhao Li
exaly   +3 more sources

Discrete Signal Processing on Graphs: Graph Fourier Transform

2013 IEEE International Conference on Acoustics, Speech and Signal Processing, 2013
We 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 ...
José M. F. Moura, Aliaksei Sandryhaila
exaly   +2 more sources

Graph Fractional Fourier Transform: A Unified Theory

IEEE Transactions on Signal Processing
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aykut Koç, Tuna Alikasifoglu, Bunyamin Kartal   +2 more
exaly   +3 more sources

A Parallel Algorithm for Computing Fourier Transforms on the Star Graph

IEEE Transactions on Parallel and Distributed Systems, 1994
The n-star graph, denoted by S/sub n/, is one of the graph networks that have been recently proposed as attractive alternatives to the n-cube topology for interconnecting processors in parallel computers. We present a parallel algorithm for the computation of the Fourier transform on the star graph. The algorithm requires O(n/sup 2/) multiply-add steps
Paraskevi Fragopoulou, S G Akl
exaly   +4 more sources

On factor graphs and the Fourier transform

Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), 2002
We introduce the concept of convolutional factor graphs, which represent convolutional factorizations of multivariate functions, just as conventional (multiplicative) factor graphs represent multiplicative factorizations. Convolutional and multiplicative factor graphs arise as natural Fourier transform duals.
Yongyi Mao, Frank R. Kschischang
openaire   +1 more source

Redundant graph Fourier transform

2015 IEEE 2nd International Conference on Cybernetics (CYBCONF), 2015
Signal processing on graphs is a new emerging field that processing high-dimensional data by spreading samples on networks or graphs. The new introduced definition of graph Fourier transform shows its importance in establishing the theory of frequency analysis or computational harmonic analysis on graph signal processing. We introduce the definition of
Xianwei Zheng, Yuan Yan Tang, Jiantao Zhou 0001, Lina Yang, Haoliang Yuan, Yulong Wang 0002, Chunli Li   +6 more
openaire   +1 more source