cs.LGNov 7, 2026
SaveThe Fast Tree Transform
Abstract
The Fast Tree Transform is a locally-aggregated transform defined for arbitrary graph geometries that generalizes both the Hadamard frequency transform and the Haar wavelet transform on the circle. The pure frequency part of the transform approximately diagonalizes the graph Laplacian; this fact makes it useful as a preconditioner in geometric optimization problems. The full transform provides an only slightly-redundant representation of signals on the graph that allows sparse representation of signals that include both edges and textures.
Figures & tables
Figure 4: Tree intersection and wedge product.
Figure 5: Fast Tree Transform for star geometry (where ).
More in this topic
Graph Signal Processing
Graph Signal Processing studies how to represent, filter, sample, and reconstruct data whose relationships are encoded by graphs.
See all 37 papers