Segmented computation of wavelet transform via lifting scheme

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26220%2F11%3APU94266" target="_blank" >RIV/00216305:26220/11:PU94266 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Segmented computation of wavelet transform via lifting scheme

Popis výsledku v původním jazyce

This paper presents a novel algorithm for segmented (segmentwise) computation of forward and inverse wavelet transform via a lifting scheme, applicable to any type of a lifting scheme representation of wavelets. The main idea is to process segments taken from a long one-dimensional signal so that after reconstruction, no border distortion between segments occurs.This is achieved by means of sophisticated segment overlapping. In this work, arbitrary and possibly varying segment lengths are considered. The derivation of formulas for overlap enumeration is the main concern of this work. The algorithm produces sets of coefficients for each segment. These sets from each segment ordered correctly are exactly the same coefficients the whole signal discrete wavelet transform results in. Similarly, the whole signal inverse discrete wavelet transform is equal to applying the algorithm to sets of coefficients and overlapping the results accordingly. The algorithm makes it possible to process signals in real-time, allows coarse parallelization since the computation on the particular segments is independent and also allows computation of wavelet transform on devices with a limited amount of memory.

Název v anglickém jazyce

Segmented computation of wavelet transform via lifting scheme

Popis výsledku anglicky

This paper presents a novel algorithm for segmented (segmentwise) computation of forward and inverse wavelet transform via a lifting scheme, applicable to any type of a lifting scheme representation of wavelets. The main idea is to process segments taken from a long one-dimensional signal so that after reconstruction, no border distortion between segments occurs.This is achieved by means of sophisticated segment overlapping. In this work, arbitrary and possibly varying segment lengths are considered. The derivation of formulas for overlap enumeration is the main concern of this work. The algorithm produces sets of coefficients for each segment. These sets from each segment ordered correctly are exactly the same coefficients the whole signal discrete wavelet transform results in. Similarly, the whole signal inverse discrete wavelet transform is equal to applying the algorithm to sets of coefficients and overlapping the results accordingly. The algorithm makes it possible to process signals in real-time, allows coarse parallelization since the computation on the particular segments is independent and also allows computation of wavelet transform on devices with a limited amount of memory.

Druh

D - Stať ve sborníku

CEP obor

JA - Elektronika a optoelektronika, elektrotechnika

OECD FORD obor

—

Projekt

—

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Rok uplatnění

2011

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

34rd International Conference on TELECOMMUNICATIONS AND SIGNAL PROCESSING

ISBN

978-1-4577-1409-2

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

1-5

Název nakladatele

ASSZISZTENCIA Congress Bureau

Místo vydání

Budapest

Místo konání akce

Budapest

Datum konání akce

18. 8. 2011

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

—