Translator Disclaimer
9 September 2019 The extended generalized Haar-Walsh transform and applications
Author Affiliations +
Extending computational harmonic analysis tools from the classical setting of regular lattices to the more general setting of graphs and networks is very important and much research has been done recently. Our previous Generalized Haar-Walsh Transform (GHWT) is a multiscale transform for signals on graphs, which is a generalization of the classical Haar and Walsh-Hadamard Transforms. This article proposes the extended Generalized HaarWalsh Transform (eGHWT). The eGHWT and its associated best-basis selection algorithm for graph signals will significantly improve the performance of the previous GHWT with the similar computational cost, O(N log N) where N is the number of nodes of an input graph. While the previous GHWT/best-basis algorithm seeks the most suitable orthonormal basis for a given task among more than (1.5)N possible bases, the eGHWT/best-basis algorithm can find a better one by searching through more than 0.618 · (1.84)N possible bases. This article describes the details of the eGHWT/basis-basis algorithm and demonstrates its superiority using several examples including genuine graph signals as well as conventional digital images viewed as graph signals.
© (2019) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yiqun Shao and Naoki Saito "The extended generalized Haar-Walsh transform and applications", Proc. SPIE 11138, Wavelets and Sparsity XVIII, 111380C (9 September 2019);


Piecewise linear source separation
Proceedings of SPIE (November 13 2003)
Fast approximate Fourier transform via wavelets transform
Proceedings of SPIE (October 23 1996)
Wavelet packets frames in multiresolution structures
Proceedings of SPIE (September 20 2007)

Back to Top