Publication

A Dual-Tree Rational-Dilation Complex Wavelet Transform

2011
Journal Articles

Abstract

In this correspondence, we introduce a dual-tree rational-dilation complex wavelet transform for oscillatory signal processing. Like the short-time Fourier transform and the dyadic dual-tree complex wavelet transform, the introduced transform employs quadrature pairs of time-frequency atoms which allow to work with the analytic signal. The introduced wavelet transform is a constant-transform, a property lacked by the short-time Fourier transform, which in turn makes the introduced transform more suitable for models that depend on scale. Also, the frequency resolution can be as high as desired, a property lacked by the dyadic dual-tree complex wavelet transform, which makes the introduced transform more suitable for processing oscillatory signals like speech, audio and various biomedical signals.

Official source

https://infoscience.epfl.ch/entities/publication/a6568ec8-8862-4745-8e08-b577ab64d5c2

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.

2011
Journal Articles

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/a6568ec8-8862-4745-8e08-b577ab64d5c2

About this result

Related concepts (29)

Fourier transform

In physics and mathematics, the Fourier transform (FT) is a transform that converts a function into a form that describes the frequencies present in the original function. The output of the transform is a complex-valued function of frequency. The term Fourier transform refers to both this complex-valued function and the mathematical operation. When a distinction needs to be made the Fourier transform is sometimes called the frequency domain representation of the original function.

Fractional Fourier transform

In mathematics, in the area of harmonic analysis, the fractional Fourier transform (FRFT) is a family of linear transformations generalizing the Fourier transform. It can be thought of as the Fourier transform to the n-th power, where n need not be an integer — thus, it can transform a function to any intermediate domain between time and frequency. Its applications range from filter design and signal analysis to phase retrieval and pattern recognition.

Time–frequency analysis

In signal processing, time–frequency analysis comprises those techniques that study a signal in both the time and frequency domains simultaneously, using various time–frequency representations. Rather than viewing a 1-dimensional signal (a function, real or complex-valued, whose domain is the real line) and some transform (another function whose domain is the real line, obtained from the original via some transform), time–frequency analysis studies a two-dimensional signal – a function whose domain is the two-dimensional real plane, obtained from the signal via a time–frequency transform.

Related publications (30)

A Dual-Tree Rational-Dilation Complex Wavelet Transform

Chat with Graph Search

Stability of the Faber-Krahn inequality for the short-time Fourier transform

Functional-Basis Analysis of Non-Stationary Signals in Modern Power Grids: Theory and Implementation in Embedded Systems

Discrete choice modeling in the era of big data