ON THE ACCURACY OF SELECTED IMAGE TEXTURE SEGMENTATION METHODS

Author(s):  
Michal Strzelecki ◽  
Andrzej Materka
Author(s):  
Jianfeng Li ◽  
Jinhuan Shi ◽  
Hongzhi Zhang ◽  
Yanlai Li ◽  
Naimin Li ◽  
...  

2012 ◽  
Vol 468-471 ◽  
pp. 2720-2723
Author(s):  
Yang Zhang ◽  
You Cheng Tong ◽  
Jun Zhou Yao

To improve the accuracy and efficiency of fabric design CAD, a wavelet-domain Markov model to image texture segmentation from a natural framework for intergrating both local and global information of jacquard fabric image behavior, together with contextual information.Firstly the Daubechies wavelet and tree-structure is selected, then the approach decomposes the low frequency part of the jacquard fabric image. Secondly within the theoretical framework of Markov random field, we construct the grey field distribution model and label field prior model with finite Gaussian mixture algorithm and multi-level logistic algorithm respectively. The experiments for almost 30 warp knitting jacquard fabric images show that this approach is a feasible way for jacquard fabric, and it supplies a theoretical platform for subsequent research.


Author(s):  
M. K. BASHAR ◽  
N. OHNISHI

Despite extensive research on image texture analysis, it is still problematic to characterize and segment texture images especially in the presence of complex patterns. Upon tremendous advancement of the internet and the digital technology, there is also a need for the development of simple but efficient algorithms, which can be adaptable to real-time systems. In this study, we propose such an approach based on multiresolution discrete wavelet transform (DWT). After the transform, we compute salient energy points from each directional sub-band (LH, HL, and HH) in the form of binary image by thresholding intermittency indices of wavelet coefficients. We then propose and extract two new texture features namely Salient Point Density (SPD) and Salient Point Distribution Nonuniformity (SPDN) based on the number and the distribution of salient pixels in the local neighborhood of every pixel of the multiscale binary images. We thus obtain a set of feature images, which are subsequently applied to the popular K-means algorithm for the unsupervised segmentation of texture images. Though the above representation appear simple and infrequent in the literature, it proves useful in the context of texture segmentation. Experimental results with the standard texture (Brodatz) and natural images demonstrate the robustness and potentiality of the proposed approach.


1994 ◽  
Vol 33 (8) ◽  
pp. 2617 ◽  
Author(s):  
Trygve Randen

Sign in / Sign up

Export Citation Format

Share Document