We propose a superfast discrete Haar wavelet transform (SFHWT) as well as its inverse, using the low-rank Quantics-TT (QTT) representation for the Haar transform matrices and input-output vectors. Though the Haar matrix itself does not have a low QTT rank approximation, we show that factor matrices used at each step of the traditional multilevel Haar wavelet transform algorithm have explicit QTT representations of low rank. The SFHWT applies to a vector representing a signal sampled on a uniform grid of size = 2 . We develop two algorithms which roughly require square logarithmic time complexity (log 2 ) with respect to the grid size, hence outperforming the traditional fast Haar wavelet transform (FHWT) of linear complexity ( ). Our approach also applies to the FHWT inverse as well as to the multidimensional wavelet transform. Numerical experiments demonstrate that the SFHWT algorithm is robust in keeping low rank of the resulting output vector and it outperforms the traditional FHWT for grid sizes larger than a certain value depending on the spacial dimension.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.