Publication

Fast Continuous Wavelet Transform Based on B-Splines

Michaël Unser
2001
Journal Articles

Abstract

The Continuous Wavelet Transform (CWT) is an effective way to analyze nonstationary signals and to localize and characterize singularities. Fast algorithms have already been developed to compute the CWT at integer time points and dyadic or integer scales. We propose here a new method that is based on a B-spline expansion of both the signal and the analysis wavelet and that allows the CWT computation at arbitrary scales. Its complexity is O(N), where N represents the size of the input signal; in other words, the cost is independent of the scale factor. Moreover, the algorithm lends itself well to a parallel implementation.

Official source

https://infoscience.epfl.ch/entities/publication/e8f222a3-90a7-4a17-8bf5-c1aed862adb7

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Michaël Unser
2001
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/e8f222a3-90a7-4a17-8bf5-c1aed862adb7

About this result

Related concepts (32)

Wavelet

A wavelet is a wave-like oscillation with an amplitude that begins at zero, increases or decreases, and then returns to zero one or more times. Wavelets are termed a "brief oscillation". A taxonomy of wavelets has been established, based on the number and direction of its pulses. Wavelets are imbued with specific properties that make them useful for signal processing. For example, a wavelet could be created to have a frequency of Middle C and a short duration of roughly one tenth of a second.

Discrete wavelet transform

In numerical analysis and functional analysis, a discrete wavelet transform (DWT) is any wavelet transform for which the wavelets are discretely sampled. As with other wavelet transforms, a key advantage it has over Fourier transforms is temporal resolution: it captures both frequency and location information (location in time). Haar wavelet The first DWT was invented by Hungarian mathematician Alfréd Haar. For an input represented by a list of numbers, the Haar wavelet transform may be considered to pair up input values, storing the difference and passing the sum.

Wavelet transform

In mathematics, a wavelet series is a representation of a square-integrable (real- or complex-valued) function by a certain orthonormal series generated by a wavelet. This article provides a formal, mathematical definition of an orthonormal wavelet and of the integral wavelet transform. A function is called an orthonormal wavelet if it can be used to define a Hilbert basis, that is a complete orthonormal system, for the Hilbert space of square integrable functions.

Related publications (10)

Fast Continuous Wavelet Transform Based on B-Splines

Chat with Graph Search

Revisiting PSF models: Unifying framework and high‐performance implementation

DESI DR1 Lyα 1D power spectrum: the optimal estimator measurement

Rainfall Forecasting in Burkina Faso Using Bayesian-Wavelet Neural Networks