Discrete lattice wavelet transform

Juuso Olkkonen, H. Olkkonen

Research output: Contribution to journalArticleScientificpeer-review

9 Citations (Scopus)

Abstract

The discrete wavelet transform (DWT) has gained a wide acceptance in denoising and compression coding of images and signals.
In this work we introduce a discrete lattice wavelet transform (DLWT). In the analysis part, the lattice structure contains two parallel transmission channels, which exchange information via two crossed lattice filters. For the synthesis part we show that the similar lattice structure yields a perfect reconstruction (PR) property.
The PR condition can be used to design half-band filters, which effectively eliminate aliasing in decimated tree structured wavelet transform.
The DLWT can be implemented directly to any of the existing DWT algorithms
Original languageEnglish
Pages (from-to)71-75
JournalIEEE Transactions on Circuits and Systems II: Express Briefs
Volume54
Issue number1
DOIs
Publication statusPublished - 2007
MoE publication typeA1 Journal article-refereed

Fingerprint

Wavelet transforms
Discrete wavelet transforms
Trees (mathematics)

Keywords

  • FIR filters
  • data compression
  • discrete wavelet transforms
  • filtering theory
  • image coding
  • lattice filters
  • QMF
  • finite-impulse response filters
  • image denoising
  • lattice structure
  • parallel transmission channels
  • perfect reconstruction property
  • quadrature mirror filters
  • signal denoising

Cite this

Olkkonen, Juuso ; Olkkonen, H. / Discrete lattice wavelet transform. In: IEEE Transactions on Circuits and Systems II: Express Briefs. 2007 ; Vol. 54, No. 1. pp. 71-75.
@article{17ed62b4414f453daff749161f7dd9bc,
title = "Discrete lattice wavelet transform",
abstract = "The discrete wavelet transform (DWT) has gained a wide acceptance in denoising and compression coding of images and signals. In this work we introduce a discrete lattice wavelet transform (DLWT). In the analysis part, the lattice structure contains two parallel transmission channels, which exchange information via two crossed lattice filters. For the synthesis part we show that the similar lattice structure yields a perfect reconstruction (PR) property. The PR condition can be used to design half-band filters, which effectively eliminate aliasing in decimated tree structured wavelet transform. The DLWT can be implemented directly to any of the existing DWT algorithms",
keywords = "FIR filters, data compression, discrete wavelet transforms, filtering theory, image coding, lattice filters, QMF, finite-impulse response filters, image denoising, lattice structure, parallel transmission channels, perfect reconstruction property, quadrature mirror filters, signal denoising",
author = "Juuso Olkkonen and H. Olkkonen",
year = "2007",
doi = "10.1109/TCSII.2006.883097",
language = "English",
volume = "54",
pages = "71--75",
journal = "IEEE Transactions on Circuits and Systems II: Express Briefs",
issn = "1549-7747",
publisher = "Institute of Electrical and Electronic Engineers IEEE",
number = "1",

}

Discrete lattice wavelet transform. / Olkkonen, Juuso; Olkkonen, H.

In: IEEE Transactions on Circuits and Systems II: Express Briefs, Vol. 54, No. 1, 2007, p. 71-75.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Discrete lattice wavelet transform

AU - Olkkonen, Juuso

AU - Olkkonen, H.

PY - 2007

Y1 - 2007

N2 - The discrete wavelet transform (DWT) has gained a wide acceptance in denoising and compression coding of images and signals. In this work we introduce a discrete lattice wavelet transform (DLWT). In the analysis part, the lattice structure contains two parallel transmission channels, which exchange information via two crossed lattice filters. For the synthesis part we show that the similar lattice structure yields a perfect reconstruction (PR) property. The PR condition can be used to design half-band filters, which effectively eliminate aliasing in decimated tree structured wavelet transform. The DLWT can be implemented directly to any of the existing DWT algorithms

AB - The discrete wavelet transform (DWT) has gained a wide acceptance in denoising and compression coding of images and signals. In this work we introduce a discrete lattice wavelet transform (DLWT). In the analysis part, the lattice structure contains two parallel transmission channels, which exchange information via two crossed lattice filters. For the synthesis part we show that the similar lattice structure yields a perfect reconstruction (PR) property. The PR condition can be used to design half-band filters, which effectively eliminate aliasing in decimated tree structured wavelet transform. The DLWT can be implemented directly to any of the existing DWT algorithms

KW - FIR filters

KW - data compression

KW - discrete wavelet transforms

KW - filtering theory

KW - image coding

KW - lattice filters

KW - QMF

KW - finite-impulse response filters

KW - image denoising

KW - lattice structure

KW - parallel transmission channels

KW - perfect reconstruction property

KW - quadrature mirror filters

KW - signal denoising

U2 - 10.1109/TCSII.2006.883097

DO - 10.1109/TCSII.2006.883097

M3 - Article

VL - 54

SP - 71

EP - 75

JO - IEEE Transactions on Circuits and Systems II: Express Briefs

JF - IEEE Transactions on Circuits and Systems II: Express Briefs

SN - 1549-7747

IS - 1

ER -