HMM-based multiresolution image segmentation

A texture segmentation algorithm is developed, utilizing a wavelet-based multi-resolution analysis of general imagery. The wavelet analysis yields a set of quadtrees, each composed of high-high (HH), high-low (HL) and low-high (LH) wavelet coefficients. Hidden Markov trees (HMTs) are designed for the quadtrees. For a given texture we define a set of “hidden” states, and a hidden Markov model (HMM) is developed to characterize the statistics of a given quadtree with respect to the statistics of surrounding quadtrees. Each HMM state is characterized by a unique set of HMTs. An HMM-HMT model is developed for each texture of interest, with which image segmentation is achieved. Several numerical examples are presented to demonstrate the model, with comparisons to alternative approaches.

[1]  Stéphane Marchand-Maillet,et al.  Approximate Viterbi decoding for 2D-hidden Markov models , 2000, 2000 IEEE International Conference on Acoustics, Speech, and Signal Processing. Proceedings (Cat. No.00CH37100).

[2]  Edward J. Delp,et al.  Segmentation of textured images using a multiresolution Gaussian autoregressive model , 1999, IEEE Trans. Image Process..

[3]  Richard G. Baraniuk,et al.  Image segmentation using wavelet-domain classification , 1999, Optics & Photonics.

[4]  Kannan,et al.  ON IMAGE SEGMENTATION TECHNIQUES , 2022 .

[5]  Robert D. Nowak,et al.  Wavelet-based statistical signal processing using hidden Markov models , 1998, IEEE Trans. Signal Process..

[6]  Robert M. Gray,et al.  Image classification by a two-dimensional hidden Markov model , 2000, IEEE Trans. Signal Process..