scispace - formally typeset
Search or ask a question
Journal ArticleDOI

A Multi-Class Fisher Linear Discriminant Approach for the Improvement in the Accuracy of Complex Texture Discrimination

01 Jul 2019-Vol. 9, Iss: 4, pp 5108-5121
TL;DR: An elaborated Fisher Linear Discriminant (FLD) based semi-supervised approach for improving the accuracy of segmentation of multi-class complex fine textures achieves the second rank for 21 benchmark images among the ten state-of-the-art algorithms.
Abstract: Texture segmentation has a wide spectrum of applications in diverse fields. This paper presents an elaborated Fisher Linear Discriminant (FLD) based semi-supervised approach for improving the accuracy of segmentation of multi-class complex fine textures. Gabor filter and local statistics (local variance) are used for feature extraction of texture images. Texture segments in the image are separated using K-means clustering. The results obtained using K-means clustering are refined by multi-class Fisher Linear Discriminant (MFLD). The algorithm is tested on wide varieties of several hundred homogenous and complex textures from five texture databases viz. Outex texture database, vision texture database (Vistex), Brodatz textures, Prague textures and Pertex texture database. Fisher distance (FD) is a measure of texture separability. Segmentation of complex textures is relatively a difficult task. The improvement in the segmentation accuracy of complex textures is achieved simply by the termination of MFLD based algorithm when Fisher distance (FD) ceases to increase with the increasing iterations of MFLD. After a quantitative analysis of the experimentation, it is concluded that the segmentation accuracy of complex textures and the combination of complex and homogeneous fine textures (with small texture primitives) increases as high as 29.83% with the increasing iterations of MFLD resulting in a significant improvement at the boundaries. Detailed results are provided in the experimentation and results section of the paper. The results achieve the second rank for 21 benchmark images among the ten state-of-the-art algorithms.

Content maybe subject to copyright    Report

Citations
More filters
Proceedings ArticleDOI
01 May 2020
TL;DR: The present study offers the restoration of Prague texture database benchmark images corrupted with Gaussian noise with different variance values, using the state-of-the-art algorithm viz.
Abstract: Texture segmentation is a well-known research domain and a large number of researchers are working on it across the globe due to its wide varieties of applications in various domains such as medical imaging, shape extraction, product inspection, remote sensing, and segmentation of natural images Many times, images are corrupted by various types of noises such as Gaussian, speckle, and salt-pepper noise Most often Gaussian noise is a source of corruption in many applications Prague texture dataset is extensively used by researchers due to wide varieties of multi-class textures in it The present study offers the restoration of Prague texture database benchmark images These images are corrupted with Gaussian noise with different variance values The state-of-the-art algorithm viz Colour Block Matching 3D (C-BM3D) filter, which achieves the first rank among 15 algorithms reported in the most recent literature, is used for the restoration of noisy texture benchmark images Image restoration performance metrics used are peak signal to noise ratio (PSNR) and structural similarity index (SSIM)

1 citations


Cites background or methods from "A Multi-Class Fisher Linear Discrim..."

  • ...Gabor filter-based texture segmentation using classic classifiers is reported in [3, 11, 13, 20, 22, 23, 24]....

    [...]

  • ...According to the literature reviewed here for the past three decades, it is found that texture benchmark images are not yet degraded with noise before segmentation [3, 8, 9, 13, 14, 17, 19, 20, 21, 22, 23, 24]....

    [...]

Journal ArticleDOI
TL;DR: In this article , a three-phase approach is developed for the segmentation of textures contaminated by noise, in the first phase, these contaminated images are restored using techniques with excellent performance as per the recent literature, and the remaining two phases, segmentation is carried out by a novel technique developed using Markov Random Fields (MRF) and objective customization of the median filter based on segmentation performance metrics.
Abstract: Texture segmentation plays a crucial role in the domain of image analysis and its recognition. Noise is inextricably linked to images, just like it is with every signal received by sensing, which has an impact on how well the segmentation process performs in general. Recent literature reveals that the research community has started recognizing the domain of noisy texture segmentation for its work towards solutions for the automated quality inspection of objects, decision support for biomedical images, facial expressions identification, retrieving image data from a huge dataset and many others. Motivated by the latest work on noisy textures, during our work being presented here, Brodatz and Prague texture images are contaminated with Gaussian and salt-n-pepper noise. A three-phase approach is developed for the segmentation of textures contaminated by noise. In the first phase, these contaminated images are restored using techniques with excellent performance as per the recent literature. In the remaining two phases, segmentation of the restored textures is carried out by a novel technique developed using Markov Random Fields (MRF) and objective customization of the Median Filter based on segmentation performance metrics. When the proposed approach is evaluated on Brodatz textures, an improvement of up to 16% segmentation accuracy for salt-n-pepper noise with 70% noise density and 15.1% accuracy for Gaussian noise (with a variance of 50) has been made in comparison with the benchmark approaches. On Prague textures, accuracy is improved by 4.08% for Gaussian noise (with variance 10) and by 2.47% for salt-n-pepper noise with 20% noise density. The approach in the present study can be applied to a diversified class of image analysis applications spanning a wide spectrum such as satellite images, medical images, industrial inspection, geo-informatics, etc.
References
More filters
Proceedings ArticleDOI
01 Dec 2008
TL;DR: The Prague texture segmentation data-generator and benchmark is a Web based service designed to mutually compare and rank different texture segmenters, and to support new segmentation and classification methods development.
Abstract: The Prague texture segmentation data-generator and benchmark is a Web based (http://mosaic.utia.cas.cz) service designed to mutually compare and rank different texture segmenters, and to support new segmentation and classification methods development. The benchmark verifies their performance characteristics on monospectral, multispectral, bidirectional texture function (BTF) data and enables to test their noise robustness, scale, and rotation or illumination invariance. It can easily be used for other applications such as feature selection, image compression, and query by pictorial example, etc. The benchmark functionalities are demonstrated on five previously published image segmentation algorithms evaluation.

75 citations


"A Multi-Class Fisher Linear Discrim..." refers methods in this paper

  • ...Experimentation and Results The proposed algorithm is exhaustively tested on five databases [14, 18] viz....

    [...]

  • ...Kiechle M et al [22] performed unsupervised texture segmentation using Mumford-Shah model on Prague texture database benchmark images [14, 22]....

    [...]

Journal ArticleDOI
TL;DR: A new method to estimate initial mean vectors effectively even if the histogram does not have clearly distinguishable peaks is proposed, using a Markov random field (MRF) pixel classification model.

66 citations


"A Multi-Class Fisher Linear Discrim..." refers background or methods in this paper

  • ...5108 © 2019 The Author (s); Helix E-ISSN: 2319-5592; P-ISSN: 2277-3495 5109 © 2019 The Author (s); Helix E-ISSN: 2319-5592; P-ISSN: 2277-3495 The texture segmentation using Gabor filters and Markov Random Field Modeling [1, 7, 21, 22, 23, 27, 28, 35, 36] by different researchers has been reviewed in the second section of the paper....

    [...]

  • ...The algorithm provides computationally and theoretically simple approach for the segmentation of highly complex textures using Gabor filters [5, 6] and iterative multiclass Fisher discriminant compared to segmentation of textures performed using Markov Random Fields [7, 22, 28, 36]....

    [...]

  • ...5109 © 2019 The Author (s); Helix E-ISSN: 2319-5592; P-ISSN: 2277-3495 The texture segmentation using Gabor filters and Markov Random Field Modeling [1, 7, 21, 22, 23, 27, 28, 35, 36] by different researchers has been reviewed in the second section of the paper....

    [...]

  • ...The approach elaborated in this paper uses Gabor filters [3, 4, 5, 6, 9, 10, 20, 24, 25, 28, 29, 31, 36] for feature extraction, which is a slightly improved version of the algorithm proposed in [5]....

    [...]

  • ...These include feature extraction using co-occurrence matrices [15, 30], feature extraction using Gabor filters [5, 6] and Markov random field modeling [1, 21, 23, 28, 36]....

    [...]

Journal ArticleDOI
TL;DR: This elegant survey categorize and critically survey based on many references of the state-of-the-art related to the databases and other texture works so that it becomes helpful for a researcher to choose and evaluate having crucial evaluating aspects in mind.

51 citations


"A Multi-Class Fisher Linear Discrim..." refers background or methods in this paper

  • ...Outex texture database, Brodatz textures, Vistex textures, Prague textures and Pertex texture database [18, 22]....

    [...]

  • ...Brodatz texture database has 112 images with a size of 640x640 [18]....

    [...]

  • ...Experimentation and Results The proposed algorithm is exhaustively tested on five databases [14, 18] viz....

    [...]

  • ...This database contains some textures with good diversity, some with similarity, but some textures are inhomogeneous [18]....

    [...]

Journal ArticleDOI
TL;DR: A novel segmentation algorithm is compared with nonmultiresolution Markov random field-based image segmentation algorithms in the context of synthetic image example problems, and found to be both significantly more efficient and effective.
Abstract: The author formulates a novel segmentation algorithm which combines the use of Markov random field models for image-modeling with the use of the discrete wavepacket transform for image analysis. Image segmentations are derived and refined at a sequence of resolution levels, using as data selected wave-packet transform images or "channels". The segmentation algorithm is compared with nonmultiresolution Markov random field-based image segmentation algorithms in the context of synthetic image example problems, and found to be both significantly more efficient and effective. >

47 citations


"A Multi-Class Fisher Linear Discrim..." refers background or methods in this paper

  • ...5108 © 2019 The Author (s); Helix E-ISSN: 2319-5592; P-ISSN: 2277-3495 5109 © 2019 The Author (s); Helix E-ISSN: 2319-5592; P-ISSN: 2277-3495 The texture segmentation using Gabor filters and Markov Random Field Modeling [1, 7, 21, 22, 23, 27, 28, 35, 36] by different researchers has been reviewed in the second section of the paper....

    [...]

  • ...These include feature extraction using co-occurrence matrices [15, 30], feature extraction using Gabor filters [5, 6] and Markov random field modeling [1, 21, 23, 28, 36]....

    [...]

  • ...5109 © 2019 The Author (s); Helix E-ISSN: 2319-5592; P-ISSN: 2277-3495 The texture segmentation using Gabor filters and Markov Random Field Modeling [1, 7, 21, 22, 23, 27, 28, 35, 36] by different researchers has been reviewed in the second section of the paper....

    [...]

Journal ArticleDOI
TL;DR: In this paper, a new Bayesian estimation technique for hidden Potts-Markov random fields with unknown regularization parameters is presented, with application to fast unsupervised $K$ -class image segmentation.
Abstract: This paper presents a new Bayesian estimation technique for hidden Potts–Markov random fields with unknown regularisation parameters, with application to fast unsupervised $K$ -class image segmentation. The technique is derived by first removing the regularisation parameter from the Bayesian model by marginalisation, followed by a small-variance-asymptotic (SVA) analysis in which the spatial regularisation and the integer-constrained terms of the Potts model are decoupled. The evaluation of this SVA Bayesian estimator is then relaxed into a problem that can be computed efficiently by iteratively solving a convex total-variation denoising problem and a least-squares clustering ( $K$ -means) problem, both of which can be solved straightforwardly, even in high-dimensions, and with parallel computing techniques. This leads to a fast fully unsupervised Bayesian image segmentation methodology in which the strength of the spatial regularisation is adapted automatically to the observed image during the inference procedure, and that can be easily applied in large 2D and 3D scenarios or in applications requiring low computing times. Experimental results on synthetic and real images, as well as extensive comparisons with state-of-the-art algorithms, confirm that the proposed methodology offer extremely fast convergence and produces accurate segmentation results, with the important additional advantage of self-adjusting regularisation parameters.

38 citations