logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Fast continuous wavelet transform: A least-squares formulation

delete1997-03-01
delete8
PRE
AI
M
M. J. Vrhel *
C
C. Lee
M
Michaël Unser
DOI：10.1016/S0165-1684(96)00189-2delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
We introduce a general framework for the efficient computation of the real continuous wavelet transform (CWT) using a filter bank. The method allows arbitrary sampling along the scale axis, and achieves O(N) complexity per scale where N is the length of the signal. Previous algorithms that calculated non-dyadic samples along the scale axis had O(N log(N)) computations per scale. Our approach approximates the analyzing wavelet by its orthogonal projection (least-squares solution) onto a space defined by a compactly supported scaling function. We discuss the theory which uses a duality principle and recursive digital filtering for rapid calculation of the CWT. We derive error bounds on the wavelet approximation and show how to obtain any desired level of accuracy through the use of longer filters. Finally, we present examples of implementation for real symmetric and anti-symmetric wavelets. (C) 1997 Published by Elsevier Science B.V.
Keywords:
wavelet transform
approximation theory
B-splines
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

Signal Processing cover
Signal Processing
IF:
3.6
Papers:
9.9K
Citations:
1.7W

Organization

No organization information available