Texture Classification Using Noncausal Hidden Markov Models

This paper addresses the problem of using noncausal hidden Markov models (HMMs) for texture classification. In noncausal models, the state of each pixel may be dependent on its neighbors in all directions. New algorithms are given to learn the parameters of a noncausal HMM of a texture and to classify it into one of several learned categories. Texture classification results using these algorithms are provided. >

[1]  Georgios B. Giannakis,et al.  Object and Texture Classification Using Higher Order Statistics , 1992, IEEE Trans. Pattern Anal. Mach. Intell..

[2]  J. Besag.  Statistical Analysis of Non-Lattice Data , 1975 .

[3]  Anil K. Jain,et al.  Markov Random Field Texture Models , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[4]  Ramesh Jain,et al.  The analysis of oriented textures through phase portraits , 1990 .

[5]  J. Besag.  On the Statistical Analysis of Dirty Pictures , 1986 .

[6]  Pierre A. Devijver,et al.  Image Segmentation Using Causal Markov Random Field Models , 1988, Pattern Recognition.

[7]  Rama Chellappa,et al.  Texture synthesis and compression using Gaussian-Markov random field models , 1985, IEEE Transactions on Systems, Man, and Cybernetics.

[8]  Laveen N. Kanal,et al.  Classification of binary random patterns , 1965, IEEE Trans. Inf. Theory.