Prime Coset Sum

A Systematic Method for Designing Multi-D Wavelet Filter Banks with Fast Algorithms

Youngmi Hur, Fang Zheng

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

As constructing multi-D wavelets remains a challenging problem, we propose a new method called prime coset sum to construct multi-D wavelets. Our method provides a systematic way to construct multi-D non-separable wavelet filter banks from two 1-D lowpass filters, with one of which being interpolatory. Our method has many important features including the following: 1) it works for any spatial dimension, and any prime scalar dilation, 2) the vanishing moments of the multi-D wavelet filter banks are guaranteed by certain properties of the initial 1-D lowpass filters, and furthermore, 3) the resulting multi-D wavelet filter banks are associated with fast algorithms that are faster than the existing fast tensor product algorithms.

Original languageEnglish
Article number7565569
JournalIEEE Transactions on Information Theory
VolumePP
Issue number99
DOIs
Publication statusPublished - 2016 Jan 1

Fingerprint

Filter banks
bank
Tensors

All Science Journal Classification (ASJC) codes

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Cite this

@article{856d567d10f74887a00ae0f6b85d4d45,
title = "Prime Coset Sum: A Systematic Method for Designing Multi-D Wavelet Filter Banks with Fast Algorithms",
abstract = "As constructing multi-D wavelets remains a challenging problem, we propose a new method called prime coset sum to construct multi-D wavelets. Our method provides a systematic way to construct multi-D non-separable wavelet filter banks from two 1-D lowpass filters, with one of which being interpolatory. Our method has many important features including the following: 1) it works for any spatial dimension, and any prime scalar dilation, 2) the vanishing moments of the multi-D wavelet filter banks are guaranteed by certain properties of the initial 1-D lowpass filters, and furthermore, 3) the resulting multi-D wavelet filter banks are associated with fast algorithms that are faster than the existing fast tensor product algorithms.",
author = "Youngmi Hur and Fang Zheng",
year = "2016",
month = "1",
day = "1",
doi = "10.1109/TIT.2016.2608896",
language = "English",
volume = "PP",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "99",

}

Prime Coset Sum : A Systematic Method for Designing Multi-D Wavelet Filter Banks with Fast Algorithms. / Hur, Youngmi; Zheng, Fang.

In: IEEE Transactions on Information Theory, Vol. PP, No. 99, 7565569, 01.01.2016.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Prime Coset Sum

T2 - A Systematic Method for Designing Multi-D Wavelet Filter Banks with Fast Algorithms

AU - Hur, Youngmi

AU - Zheng, Fang

PY - 2016/1/1

Y1 - 2016/1/1

N2 - As constructing multi-D wavelets remains a challenging problem, we propose a new method called prime coset sum to construct multi-D wavelets. Our method provides a systematic way to construct multi-D non-separable wavelet filter banks from two 1-D lowpass filters, with one of which being interpolatory. Our method has many important features including the following: 1) it works for any spatial dimension, and any prime scalar dilation, 2) the vanishing moments of the multi-D wavelet filter banks are guaranteed by certain properties of the initial 1-D lowpass filters, and furthermore, 3) the resulting multi-D wavelet filter banks are associated with fast algorithms that are faster than the existing fast tensor product algorithms.

AB - As constructing multi-D wavelets remains a challenging problem, we propose a new method called prime coset sum to construct multi-D wavelets. Our method provides a systematic way to construct multi-D non-separable wavelet filter banks from two 1-D lowpass filters, with one of which being interpolatory. Our method has many important features including the following: 1) it works for any spatial dimension, and any prime scalar dilation, 2) the vanishing moments of the multi-D wavelet filter banks are guaranteed by certain properties of the initial 1-D lowpass filters, and furthermore, 3) the resulting multi-D wavelet filter banks are associated with fast algorithms that are faster than the existing fast tensor product algorithms.

UR - http://www.scopus.com/inward/record.url?scp=85027317489&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85027317489&partnerID=8YFLogxK

U2 - 10.1109/TIT.2016.2608896

DO - 10.1109/TIT.2016.2608896

M3 - Article

VL - PP

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 99

M1 - 7565569

ER -