Detail publikace

Real-Time lifting wavelet transform algorithm

Originální název

Real-Time lifting wavelet transform algorithm

Anglický název

Real-Time lifting wavelet transform algorithm

Jazyk

en

Originální abstrakt

When performing a wavelet transform of one-dimensional signals, it is often impractical or even impossible to load whole input signal at once. This is the case of long audio files or live performances, when real-time processing is necessary. The algorithm presented in this paper allows computation of the forward and inverse lifting wavelet transform of independent segments of the input signal much like well known overlap-add or overlap-save algorithms works for convolution. The goal of the algorithm is to find such overlaps between segments so there is no border distortion which may occur when no overlaps are used due to the difference of wavelet coefficients at the segment borders.

Anglický abstrakt

When performing a wavelet transform of one-dimensional signals, it is often impractical or even impossible to load whole input signal at once. This is the case of long audio files or live performances, when real-time processing is necessary. The algorithm presented in this paper allows computation of the forward and inverse lifting wavelet transform of independent segments of the input signal much like well known overlap-add or overlap-save algorithms works for convolution. The goal of the algorithm is to find such overlaps between segments so there is no border distortion which may occur when no overlaps are used due to the difference of wavelet coefficients at the segment borders.

Dokumenty

BibTex


@article{BUT75054,
  author="Zdeněk {Průša} and Pavel {Rajmic}",
  title="Real-Time lifting wavelet transform algorithm",
  annote="When performing a wavelet transform of one-dimensional signals, it is often impractical or even impossible to load whole input signal at once. This is the case of long audio files or live performances, when real-time processing is necessary. The algorithm presented in this paper allows computation of the forward and inverse lifting wavelet transform of independent segments of the input signal much like well known overlap-add or overlap-save algorithms works for convolution. The goal of the algorithm is to find such overlaps between segments so there is no border distortion which may occur when no overlaps are used due to the difference of wavelet coefficients at the segment borders.",
  chapter="75054",
  number="3",
  volume="2011",
  year="2011",
  month="september",
  pages="53--59",
  type="journal article - other"
}