Hidden Markov tree modeling of complex wavelet transforms

  • Authors:
  • Hyeokho Choi;J. Romberg;R. Baraniuk;N. Kingsbury

  • Affiliations:
  • Dept. of Electr. & Comput. Eng., Rice Univ., Houston, TX, USA;-;-;-

  • Venue:
  • ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01
  • Year:
  • 2000

Quantified Score

Hi-index 0.00

Visualization

Abstract

Multiresolution signal and image models such as the hidden Markov tree aim to capture the statistical structure of smooth and singular (edgy) regions. Unfortunately, models based on the orthogonal wavelet transform suffer from shift-variance, making them less accurate and realistic. We extend the HMT modeling framework to the complex wavelet transform, which features near shift-invariance and improved angular resolution compared to the standard wavelet transform. The model is computationally efficient (with linear-time computation and processing algorithms) and applicable to general Bayesian inference problems as a prior density for the data. In a simple estimation experiment, the complex wavelet HMT model outperforms a number of high-performance denoising algorithms, including redundant wavelet thresholding (cycle spinning) and the redundant HMT.