Construct · 1 fields · 1 citations

graph Fourier transform: a standalone construct

One name. One construct. A landmark on the map.

● anchor · a standalone construct Nearest construct by meaning·not indexed

A single standalone construct; nearby constructs are located against it in the Collider. Tap a field for its definition, unit, and measures.

Signal processing

the extension of Fourier analysis and filtering to data on the vertices of a graph, using the eigenvectors of a graph shift operator as frequencies.

In signal processing, graph Fourier transform refers to the extension of Fourier analysis and filtering to data on the vertices of a graph, using the eigenvectors of a graph shift operator as frequencies. This meaning comes from Sandryhaila (2013) in IEEE Transactions on Signal Processing.[1]

Unit
Recovery means
Measured by

Run it through the Collider, or take the citations with you.

See how graph Fourier transform sits against neighbouring constructs in the Collider, or export every reference on this page in one click.

Open in Collider Export BibTeX Report this entry

Nearby constructs

extension3 fields · 3 citationsjingle · one word, three constructs filtering1 fields · 1 citationsanchor · one word, several carriers Fourier transform1 fields · 3 citationsanchor · a standalone construct

References

Sandryhaila, A., & Moura, J. M. F. (2013). Discrete Signal Processing on Graphs. IEEE Transactions on Signal Processing, 61(7), 1644-1656. https://doi.org/10.1109/tsp.2013.2238935

Cited on this page?

Confirm your construct, or correct us.

If your work is cited behind one of these entries, you know better than we do whether we captured the meaning right. Confirm it, suggest an edit, or dispute it, and your name goes on the entry as an author who has checked it, linked to your ORCID.

Claim your construct