Sep 05

Code release: FAuST 1.1 for Approximate Fast Graph Fourier Transforms.

FAµST is a toolbox useful to decompose a given dense matrix into a product of sparse matrices in order to reduce its computational complexity (both for storage and manipulation). Such matrices can be used to speed up iterative algorithms commonly used for solving high dimensional linear inverse problems.

This release (FAuST Matlab version 1.1) includes code to reproduce Graph Signal Processing experiments (Approximate Fast Graph Fourier Transforms) from the paper

  • Le Magoarou L., Gribonval R. and Tremblay N., “Approximate fast graph Fourier transforms via multi-layer sparse approximations”, IEEE Transactions on Signal and Information Processing over Networks,2017. <https://hal.inria.fr/hal-01416110>