Unsupervised Texture Segmentation Using Markov Random Field Models
IEEE Transactions on Pattern Analysis and Machine Intelligence
A review of recent texture segmentation and feature extraction techniques
CVGIP: Image Understanding
An Experimental Comparison of Range Image Segmentation Algorithms
IEEE Transactions on Pattern Analysis and Machine Intelligence
IEEE Transactions on Pattern Analysis and Machine Intelligence
Markov Random Field Models for Unsupervised Segmentation of Textured Color Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Blobworld: A System for Region-Based Image Indexing and Retrieval
VISUAL '99 Proceedings of the Third International Conference on Visual Information and Information Systems
ICPR '02 Proceedings of the 16 th International Conference on Pattern Recognition (ICPR'02) Volume 4 - Volume 4
Learning to Detect Natural Image Boundaries Using Local Brightness, Color, and Texture Cues
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automatic colour-texture image segmentation using active contours
International Journal of Computer Mathematics - Computer Vision and Pattern Recognition
Hierarchical multiple Markov chain model for unsupervised texture segmentation
IEEE Transactions on Image Processing
A hierarchical texture model for unsupervised segmentation of remotely sensed images
SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Fast detection and recognition of QR codes in high-resolution images
Proceedings of the 28th Spring Conference on Computer Graphics
Hi-index | 0.00 |
A fast and robust type of unsupervised multispectral texture segmentation method with unknown number of classes is presented. Single decorrelated monospectral texture factors are represented by four local autoregressive random field models recursively evaluated for each pixel and for each spectral band. The segmentation algorithm is based on the underlying Gaussian mixture model and starts with an over segmented initial estimation which is adaptively modified until the optimal number of homogeneous texture segments is reached. The performance of the presented method is extensively tested on the Prague segmentation benchmark using nineteen most frequented segmentation criteria.