The phaselet transform-an integral redundancy nearly shift-invariant wavelet transform

  • Authors:
  • R.A. Gopinath

  • Affiliations:
  • IBM T. J. Watson Res. Center, Yorktown Heights, NY, USA

  • Venue:
  • IEEE Transactions on Signal Processing
  • Year:
  • 2003

Quantified Score

Hi-index 35.75

Visualization

Abstract

This paper introduces an approximately shift invariant redundant dyadic wavelet transform - the phaselet transform - that includes the popular dual-tree complex wavelet transform of Kingsbury (see Phil. R. Soc. London A, Sept. 1999) as a special case. The main idea is to use a finite set of wavelets that are related to each other in a special way - and hence called phaselets - to achieve approximate shift-redundancy; the bigger the set, the better the approximation. A sufficient condition on the associated scaling filters to achieve this is that they are fractional shifts of each other. Algorithms for the design of phaselets with a fixed number vanishing moments is presented - building on the work of Selesnick (see IEEE Trans. Signal Processing) for the design of wavelet pairs for Kingsbury's dual-tree complex wavelet transform. Construction of two-dimensional (2-D) directional bases from tensor products of one-dimensional (1-D) phaselets is also described. Phaselets as a new approach to redundant wavelet transforms and their construction are both novel and should be interesting to the reader, independent of the approximate shift invariance property that this paper argues they possess.