Frequency-shift-invariant orthonormal wavelet packet representations

Brian S. Krongold, Kannan Ramchandran, Douglas L. Jones

Research output: Contribution to conferencePaper

Abstract

It is commonly known that wavelet expansions are very sensitive to translation of an input signal due to their dyadic structure. Without proper time alignment of the signal to the decomposition basis vectors, a compact expansion may be unattainable. Recently, work has been done to combat translation sensitivity by determining the best translation-invariant expansion of a signal with respect to a set of bases. However, the dyadic structure of wavelet expansions also results in frequency alignment sensitivity. In this work, we introduce a frequency-shifted wavelet packet library as well as an efficient best basis algorithm for determining the best signal representation among all frequency shifts of a signal.

Original languageEnglish (US)
Pages628-631
Number of pages4
StatePublished - Dec 1 1997
EventProceedings of the 1997 International Conference on Image Processing. Part 2 (of 3) - Santa Barbara, CA, USA
Duration: Oct 26 1997Oct 29 1997

Other

OtherProceedings of the 1997 International Conference on Image Processing. Part 2 (of 3)
CitySanta Barbara, CA, USA
Period10/26/9710/29/97

ASJC Scopus subject areas

  • Hardware and Architecture
  • Computer Vision and Pattern Recognition
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Frequency-shift-invariant orthonormal wavelet packet representations'. Together they form a unique fingerprint.

  • Cite this

    Krongold, B. S., Ramchandran, K., & Jones, D. L. (1997). Frequency-shift-invariant orthonormal wavelet packet representations. 628-631. Paper presented at Proceedings of the 1997 International Conference on Image Processing. Part 2 (of 3), Santa Barbara, CA, USA, .