pygsp.operators.
adj2vec
Prepare the graph for the gradient computation.
div
Compute Graph divergence of a signal.
G : Graph structure
s : ndarray
Signal living on the nodes
di : float
The graph divergence
grad
Compute the Graph gradient.
gr : ndarray
Gradient living on the edges
grad_mat
Gradient sparse matrix of the graph G.
D : ndarray
Gradient sparse matrix
generalized_wft
Graph windowed Fourier transform
G : Graph
g : ndarray or Filter
Window (graph signal or kernel)
f : ndarray
Graph signal
lowmemory : bool
use less memory (default=True)
C : ndarray
Coefficients
gabor_wft
k : #TODO
kernel
C : Coefficient.
gwft_frame_matrix
Create the matrix of the GWFT frame
g : window
F : ndarray
Frame
igft
Compute inverse graph Fourier transform.
G : Graph or Fourier basis
f_hat : ndarray
Signal
Inverse graph Fourier transform of f_hat
ngwft
Normalized graph windowed Fourier transform
g : ndarray
Window
Use less memory. (default = True)
ngwft_frame_matrix
Output parameters:
compute_cheby_coeff
cheby_op
Chebyshev polynomial of graph Laplacian applied to vector.
c : ndarray or list of ndarrays
Chebyshev coefficients for a Filter or a Filterbank
signal : ndarray
Signal to filter
r : ndarray
Result of the filtering
localize
Localize a kernel g to the node i.
g : Filter
kernel (or filterbank)
i : int
Index of vertex
gt : ndarray
Translated signal
modulate
Tranlate the signal f to the node i.
Signal (column)
k : int
Index of frequencies
fm : ndarray
Modulated signal
translate
Tranlate the signal f to the node i
Indices of vertex
ft : translate signal