@article {837, title = {Image Segmentation via Stochastic Regional Texture Appearance Models}, journal = {Computer Vision and Image Understanding}, year = {2015}, abstract = {

An ongoing challenge in the area of image segmentation is in dealing with scenes exhibiting complex textural characteristics. While many approaches have been proposed to tackle this particular challenge, a related topic of interest that has not been fully explored for dealing with this challenge is stochastic texture models, particularly for characterizing textural characteristics within regions of varying sizes and shapes. Therefore, this paper presents a novel method for image segmentation based on the concept of multi-scale stochastic regional texture appearance models. In the proposed method, a multi-scale representation of the image is constructed using an iterative bilateral scale space decomposition. Local texture features are then extracted via image patches and random projections to generate stochastic texture features. A texton dictionary is built from the stochastic features, and used to represent the global texture appearance model. Based on this global texture appearance model, a regional texture appearance model can then be obtained based on the texton occurrence probability given a region within an image. Finally, a stochastic region merging algorithm that allows the computation of complex features is presented to perform image segmentation based on proposed regional texture appearance model. Experimental results using the BDSD300 segmentation dataset showed that the proposed method achieves a Probabilistic Rand Index (PRI) of 0.83 and an F-measure of 0.77@(0.92, 0.68), and provides improved handling of color and luminance variation, as well as strong segmentation performance for images with highly textured regions when compared to a number of previous methods. These results suggest that the proposed stochastic regional texture appearance model is better suited for handling the texture variations of natural scenes, leading to more accurate segmentations, particularly in situations characterized by complex textural characteristics.

}, keywords = {image segmentation, Regional texture appearance models, Stochastic texture models, texture segmentation}, doi = {http://dx.doi.org/10.1016/j.cviu.2015.06.001}, author = {R Sachett Medeiros and J Scharcanski and A Wong} } @inproceedings {366, title = {A medical texture local binary pattern for TRUS prostate segmentation}, booktitle = {29th Annual International Conference of the IEEE Engineering in Medicine and Biology Society}, year = {2007}, abstract = {

Prostate cancer diagnosis and treatment rely on segmentation of Transrectal Ultrasound (TRUS) prostate images. This is a challenging and difficult task dut to weak prostate boundaries, speckle noise and the short range of gray levels. Advances in digital imaging techniques have made it possible the acquisition of large volumes of TRUS prostate images so that there is considerable demand for automated segmentation systems. Local binary pattern (LBP) has been used for texture segmentation and analysis. Despite its promising performance for texture classification it has not yet been considered for TRUS prostate segmentation. In this paper we introduce a medical texture local binary pattern operator designed for applications of medical imaging where different tissues or micro organisms might maintain extremely weak underlying textures that make it impossible or very difficult for ordinary texture analysis approaches to classify them. In the proposed method the deformations of a level set contour are controlled based on the medical texture local binary pattern operator.

}, keywords = {automated segmentation systems, biomedical ultrasonics, cancer, digital imaging techniques, image classification, image segmentation, image texture, LBP, level set contour deformations, medical image processing, medical texture local binary pattern, prostate cancer diagnosis, prostate cancer treatment, short gray level range, speckle noise, texture analysis, Texture classification, texture segmentation, transrectal ultrasound prostate image segmentation, TRUS prostate segmentation}, doi = {http://dx.doi.org/10.1109/IEMBS.2007.4353617}, author = {N Nezamoddin Kachouie and P Fieguth} } @inproceedings {750, title = {A hybrid algorithm using discrete cosine transform and Gabor filter bank}, booktitle = {17th Canadian Conference on Electrical and Computer Engineering}, year = {2006}, abstract = {

Gabor filters have been widely used for texture segmentation and feature extraction, however there are important considerations regarding filter parameters, filter bank coverage in the frequency domain and feature dimensional reduction. In this paper, a texture segmentation algorithm based on a hybrid filter bank is presented. The proposed method uses a Gabor filter bank and discrete cosine transform (GDCT) to extract the optimal features for texture segmentation. To reduce the feature vector dimension a competitive network is trained to estimate the principal components of the extracted features. The feature vectors composing both Gabor and DCT features are quantized by estimated eigenvectors. The proposed method enables the use of multiple filter banks or larger filter banks consisting of a higher number of channels.

}, keywords = {channel bank filters, competitive network training, discrete cosine transform, discrete cosine transforms, eigenvalues and eigenfunctions, eigenvector quantization, feature dimensional reduction, Feature Extraction, filter bank coverage, filter parameters, Gabor filter bank, GDCT, hybrid algorithm, hybrid filter bank, image segmentation, image texture, multiple filter banks, neural nets, neural networks, optimal features, principal component analysis, principal components estimation, texture segmentation, unsupervised learning}, doi = {http://dx.doi.org/10.1109/CCECE.2004.1349767}, author = {N Nezamoddin Kachouie and J Alirezaie and P Fieguth} } @inproceedings {627, title = {Texture segmentation comparison using grey level co-occurrence probabilities and Markov random fields}, booktitle = {17th International Conference on Pattern Recognition (ICPR)}, year = {2004}, month = {08/2004}, address = {Cambridge, United Kingdom}, abstract = {

The discrimination ability of texture features derived from Gaussian Markov random fields (GMRFs) and grey level co-occurrence probabilities (GLCPs) are compared and contrasted. More specifically, the role of window size in feature consistency and separability as well as the role of multiple textures within a window are investigated. GLCPs are demonstrated to have improved discrimination ability relative to MRFs with decreasing window size, an important concept when performing image segmentation. On the other hand, GLCPs are more sensitive to texture boundary confusion than GMRFs.

}, keywords = {discrimination ability, Feature Extraction, Gaussian Markov random fields, Gaussian processes, grey level co-occurrence probabilities, image segmentation, image texture, Markov processes, probability, texture features, texture segmentation}, doi = {http://dx.doi.org/10.1109/ICPR.2004.1334208}, author = {D A. Clausi and B Yue} } @article {589, title = {K-means Iterative Fisher (KIF) unsupervised clustering algorithm applied to image texture segmentation}, journal = {Pattern Recognition}, volume = {35}, year = {2002}, pages = {1959 - 1972}, abstract = {

The K-means Iterative Fisher (KIF) algorithm is a robust, unsupervised clustering algorithm applied here to the problem of image texture segmentation. The KIF algorithm involves two steps. First, K-means is applied. Second, the K-means class assignments are used to estimate parameters required for a Fisher linear discriminant (FLD). The FLD is applied iteratively to improve the solution. This combined K-means and iterative FLD is referred to as the KIF algorithm. Two KIF implementations are presented: a mixture resolving approach is extended to an unsupervised binary hierarchical approach. The same binary hierarchical KIF algorithm is used to properly segment images even though the number of classes, the class spatial boundaries, and the number of samples per class vary. The binary hierarchical KIF algorithm is fully unsupervised, requires no a priori knowledge of the number of classes, is a non-parametric solution, and is computationally efficient compared to other methods used for clustering in image texture segmentation solutions. This unsupervised methodology is demonstrated to be an improvement over other published texture segmentation results using a wide variety of test imagery. Gabor filters and co-occurrence probabilities are used as texture features.

}, keywords = {Binary hierarchical clustering, Co-occurrence probabilities, Computer Vision, Fisher linear discriminant, Gabor filters, image segmentation, K-means, texture segmentation}, issn = {0031-3203}, doi = {http://dx.doi.org/10.1016/S0031-3203(01)00138-8}, url = {http://www.sciencedirect.com/science/article/pii/S0031320301001388}, author = {D A. Clausi} }