Texture Classification Using Noncasual Hidden Markov Models
Abstract
The problem of using noncausal hidden Markov models (HMMs) for texture classification is addressed. 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. The efficacy of these algorithms for texture classification is determined by classification experiments involving both synthetically generated and natural textures. A comparison to recent results in autocorrelation modeling demonstrates that similar classification accuracy can be achieved using noncausal HMMs that learn fewer parameters.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
Cite
Text
Povlow and Dunn. "Texture Classification Using Noncasual Hidden Markov Models." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993. doi:10.1109/CVPR.1993.341048Markdown
[Povlow and Dunn. "Texture Classification Using Noncasual Hidden Markov Models." IEEE/CVF Conference on Computer Vision and Pattern Recognition, 1993.](https://mlanthology.org/cvpr/1993/povlow1993cvpr-texture/) doi:10.1109/CVPR.1993.341048BibTeX
@inproceedings{povlow1993cvpr-texture,
title = {{Texture Classification Using Noncasual Hidden Markov Models}},
author = {Povlow, Bennett R. and Dunn, Stanley M.},
booktitle = {IEEE/CVF Conference on Computer Vision and Pattern Recognition},
year = {1993},
pages = {642-643},
doi = {10.1109/CVPR.1993.341048},
url = {https://mlanthology.org/cvpr/1993/povlow1993cvpr-texture/}
}