gasper (version 1.1.6)

inverse_gft: Compute Inverse Graph Fourier Transform

Description

inverse_gft computes the Inverse Graph Fourier Transform (IGFT) of a given transformed graph signal \(\hat{f}\).

Usage

inverse_gft(L, hatf, U = NULL)

Value

f Numeric vector. Original graph signal obtained from the inverse transform of \(\hat{f}\).

Arguments

L

Laplacian matrix of the graph (matrix).

hatf

Numeric vector. Graph Fourier Transform of the signal to be inverted.

U

Matrix of the eigenvectors of the Laplacian matrix. If NULL (default), the function will compute the eigendecomposition of the Laplacian.

Details

The IGFT enables the reconstruction of graph signals from their frequency domain representation. The "frequency" in the context of graph signal processing refers to the decomposition of the signal using the graph's Laplacian eigenvectors.

The IGFT of a transformed graph signal \(\hat{f}\) is given by: $$ f = U \hat{f} $$ where \(U\) represents the matrix of eigenvectors of the graph's Laplacian.

When the eigenvectors \(U\) are not provided, the function computes them from the Laplacian matrix \(L\).

References

Ortega, A., Frossard, P., Kovačević, J., Moura, J. M., & Vandergheynst, P. (2018). Graph signal processing: Overview, challenges, and applications. Proceedings of the IEEE, 106(5), 808-828.

Shuman, D. I., Narang, S. K., Frossard, P., Ortega, A., & Vandergheynst, P. (2013). The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE signal processing magazine, 30(3), 83-98.

See Also

forward_gft

Examples

if (FALSE) {
# Extract the adjacency matrix from the grid1 and compute the Laplacian
L <- laplacian_mat(grid1$sA)

# Create a sample graph signal
f <- rnorm(nrow(L))

# Compute the forward GFT
hatf <- forward_gft(L, f)

# Compute the forward GFT
recf <- inverse_gft(L, hatf)
}