Feature Based Segmentation of Colour Textured Images using Markov Random Field Model

The problem of image segmentation has been investigated with a focus on colored textured image segmentation.Texture is a substantial feature for the analysis of different types of images. Texture segmentation has an assortment of important applications ranging from vision guided autonomous robotics and remote sensing to medical diagnosis and retrieval in large image databases. But the main problem with the textured images is that they contain texture elements of various sizes and in some cases each of which can itself be textured.Thus the texture image segmentation is widely discerned as a difficult and thought-provoking problem.In this thesis an attempt has been made to devise methodologies for automated color textured image segmentation scheme. This problem has been addressed in the literature, still many key open issues remain to be investigated. As an initial step in this direction, this thesis proposes two methods which address the problem of color texture image segmentation through feature extraction approach in partially supervised approach.The feature extraction approaches can be classified into feature based and model based techniques.In feature based technique features are assessed without any model in mind. But in case of model based approach an inherent mathematical model lets eatures to be measured by fitting the model to the texture.The inherent features of the texture are captured in a set of parameters in order to understand the properties generating the texture. Nevertheless, a clear distinction can not be made between the two approaches and hence a combination of approaches from different categories is frequently adopted. In textured image segmentation, image model assumes a significant role and is developed by capturing salient spatial properties of an image. Markov random field (MRF)theory provides a convenient and consistent way to model context dependent entities.In this context a new scheme is proposed using Gaussian MRF model where the segmentation problem is formulated as a pixel labeling problem.The a priori class labels are modeled as Markov random field model and the number of classes is known a priori in partially supervised framework.The image label estimation problem is cast in Bayesian framework using Maximum a Posteriori (MAP)criterion and the MAP estimates of the image labels are obtained using iterated conditional modes (ICM) algorithm. Though the MRF model takes into account the local spatial interactions, it has a limitation in modeling natural scenes of distinct regions. Hence in our formulation, the first scheme takes into account within and between color plane interactions to incorporate spectraland contextual features. Genetic algorithm is employed for the initialization of ICM algorithm to obtain MAP estimates of image labels. The faster convergence property of the ICM algorithm and global convergence property of genetic algorithm are hybridized to obtain segmentation with better accuracy as well as faster convergence

An Extended Review on Fabric Defects and Its Detection Techniques

In Textile Industry, Quality of the Fabric is the main important factor. At the initial stage, it is very essential to identify and avoid the fabrics faults/defects and hence human perception consumes lot of time and cost to reveal the fabrics faults. Now-a-days Automated Inspection Systems are very useful to decrease the fault prediction time and gives best visualizing clarity- based on computer vision and image processing techniques. This paper made an extended review about the quality parameters in the fiber-to-fabric process, fabrics defects detection terminologies applied on major three clusters of fabric defects knitting, woven and sewing fabric defects. And this paper also explains about the statistical performance measures which are used to analyze the defect detection process. Also, comparison among the methods proposed in the field of fabric defect detection

Supervised and unsupervised segmentation of textured images by efficient multi-level pattern classification

This thesis proposes new, efficient methodologies for supervised and unsupervised image segmentation based on texture information. For the supervised case, a technique for pixel classification based on a multi-level strategy that iteratively refines the resulting segmentation is proposed. This strategy utilizes pattern recognition methods based on prototypes (determined by clustering algorithms) and support vector machines. In order to obtain the best performance, an algorithm for automatic parameter selection and methods to reduce the computational cost associated with the segmentation process are also included. For the unsupervised case, the previous methodology is adapted by means of an initial pattern discovery stage, which allows transforming the original unsupervised problem into a supervised one. Several sets of experiments considering a wide variety of images are carried out in order to validate the developed techniques.Esta tesis propone metodologías nuevas y eficientes para segmentar imágenes a partir de información de textura en entornos supervisados y no supervisados. Para el caso supervisado, se propone una técnica basada en una estrategia de clasificación de píxeles multinivel que refina la segmentación resultante de forma iterativa. Dicha estrategia utiliza métodos de reconocimiento de patrones basados en prototipos (determinados mediante algoritmos de agrupamiento) y máquinas de vectores de soporte. Con el objetivo de obtener el mejor rendimiento, se incluyen además un algoritmo para selección automática de parámetros y métodos para reducir el coste computacional asociado al proceso de segmentación. Para el caso no supervisado, se propone una adaptación de la metodología anterior mediante una etapa inicial de descubrimiento de patrones que permite transformar el problema no supervisado en supervisado. Las técnicas desarrolladas en esta tesis se validan mediante diversos experimentos considerando una gran variedad de imágenes

AN OVERVIEW OF IMAGE SEGMENTATION ALGORITHMS

Image segmentation is a puzzled problem even after four decades of research. Research on image segmentation is currently conducted in three levels. Development of image segmentation methods, evaluation of segmentation algorithms and performance and study of these evaluation methods. Hundreds of techniques have been proposed for segmentation of natural images, noisy images, medical images etc. Currently most of the researchers are evaluating the segmentation algorithms using ground truth evaluation of (Berkeley segmentation database) BSD images. In this paper an overview of various segmentation algorithms is discussed. The discussion is mainly based on the soft computing approaches used for segmentation of images without noise and noisy images and the parameters used for evaluating these algorithms. Some of these techniques used are Markov Random Field (MRF) model, Neural Network, Clustering, Particle Swarm optimization, Fuzzy Logic approach and different combinations of these soft techniques

Genetic-Based Multiresolution Noisy Color Image Segmentation

Segmentation of a color image composed of different kinds of regions can be a hard problem, namely to compute for an exact texture fields and make a decision of the optimum number of segmentation areas in an image when it contains similar and/or unstationary texture fields. A local novel neighborhood-based segmentation approach is proposed. Genetic algorithm is used in the proposed limited segment-pass optimization process. In this pass, an energy function, which is defined based on Markov Random Fields, is minimized. The proposed system uses an adaptive threshold estimation method for image thresholding in the wavelet domain based on the Generalized Gaussian Distribution (GGD) modeling of sub band coefficients. This method called Normal Shrink is computationally more efficient and adaptive because the parameters required for estimating the threshold depend on sub band data energy that used in the pre-stage of segmentation. A quadtree is utilized to implement the fast clustering segments for multiresolution framework analysis, which enables the use of different strategies at different resolution levels, and hence, the omputation can be accelerated. The experimental results of the proposed segmentation approach are very encouragin

Texture analysis and Its applications in biomedical imaging: a survey

Texture analysis describes a variety of image analysis techniques that quantify the variation in intensity and pattern. This paper provides an overview of several texture analysis approaches addressing the rationale supporting them, their advantages, drawbacks, and applications. This survey’s emphasis is in collecting and categorising over five decades of active research on texture analysis.Brief descriptions of different approaches are presented along with application examples. From a broad range of texture analysis applications, this survey’s final focus is on biomedical image analysis. An up-to-date list of biological tissues and organs in which disorders produce texture changes that may be used to spot disease onset and progression is provided. Finally, the role of texture analysis methods as biomarkers of disease is summarised.Manuscript received February 3, 2021; revised June 23, 2021; accepted September 21, 2021. Date of publication September 27, 2021; date of current version January 24, 2022. This work was supported in part by the Portuguese Foundation for Science and Technology (FCT) under Grants PTDC/EMD-EMD/28039/2017, UIDB/04950/2020, PestUID/NEU/04539/2019, and CENTRO-01-0145-FEDER-000016 and by FEDER-COMPETE under Grant POCI-01-0145-FEDER-028039. (Corresponding author: Rui Bernardes.)info:eu-repo/semantics/publishedVersio

Modeling of evolving textures using granulometries

This chapter describes a statistical approach to classification of dynamic texture images, called parallel evolution functions (PEFs). Traditional classification methods predict texture class membership using comparisons with a finite set of predefined texture classes and identify the closest class. However, where texture images arise from a dynamic texture evolving over time, estimation of a time state in a continuous evolutionary process is required instead. The PEF approach does this using regression modeling techniques to predict time state. It is a flexible approach which may be based on any suitable image features. Many textures are well suited to a morphological analysis and the PEF approach uses image texture features derived from a granulometric analysis of the image. The method is illustrated using both simulated images of Boolean processes and real images of corrosion. The PEF approach has particular advantages for training sets containing limited numbers of observations, which is the case in many real world industrial inspection scenarios and for which other methods can fail or perform badly. [41] G.W. Horgan, Mathematical morphology for analysing soil structure from images, European Journal of Soil Science, vol. 49, pp. 161–173, 1998. [42] G.W. Horgan, C.A. Reid and C.A. Glasbey, Biological image processing and enhancement, Image Processing and Analysis, A Practical Approach, R. Baldock and J. Graham, eds., Oxford University Press, Oxford, UK, pp. 37–67, 2000. [43] B.B. Hubbard, The World According to Wavelets: The Story of a Mathematical Technique in the Making, A.K. Peters Ltd., Wellesley, MA, 1995. [44] H. Iversen and T. Lonnestad. An evaluation of stochastic models for analysis and synthesis of gray-scale texture, Pattern Recognition Letters, vol. 15, pp. 575–585, 1994. [45] A.K. Jain and F. Farrokhnia, Unsupervised texture segmentation using Gabor filters, Pattern Recognition, vol. 24(12), pp. 1167–1186, 1991. [46] T. Jossang and F. Feder, The fractal characterization of rough surfaces, Physica Scripta, vol. T44, pp. 9–14, 1992. [47] A.K. Katsaggelos and T. Chun-Jen, Iterative image restoration, Handbook of Image and Video Processing, A. Bovik, ed., Academic Press, London, pp. 208–209, 2000. [48] M. K¨oppen, C.H. Nowack and G. R¨osel, Pareto-morphology for color image processing, Proceedings of SCIA99, 11th Scandinavian Conference on Image Analysis 1, Kangerlussuaq, Greenland, pp. 195–202, 1999. [49] S. Krishnamachari and R. Chellappa, Multiresolution Gauss-Markov random field models for texture segmentation, IEEE Transactions on Image Processing, vol. 6(2), pp. 251–267, 1997. [50] T. Kurita and N. Otsu, Texture classification by higher order local autocorrelation features, Proceedings of ACCV93, Asian Conference on Computer Vision, Osaka, pp. 175–178, 1993. [51] S.T. Kyvelidis, L. Lykouropoulos and N. Kouloumbi, Digital system for detecting, classifying, and fast retrieving corrosion generated defects, Journal of Coatings Technology, vol. 73(915), pp. 67–73, 2001. [52] Y. Liu, T. Zhao and J. Zhang, Learning multispectral texture features for cervical cancer detection, Proceedings of 2002 IEEE International Symposium on Biomedical Imaging: Macro to Nano, pp. 169–172, 2002. [53] G. McGunnigle and M.J. Chantler, Modeling deposition of surface texture, Electronics Letters, vol. 37(12), pp. 749–750, 2001. [54] J. McKenzie, S. Marshall, A.J. Gray and E.R. Dougherty, Morphological texture analysis using the texture evolution function, International Journal of Pattern Recognition and Artificial Intelligence, vol. 17(2), pp. 167–185, 2003. [55] J. McKenzie, Classification of dynamically evolving textures using evolution functions, Ph.D. Thesis, University of Strathclyde, UK, 2004. [56] S.G. Mallat, Multiresolution approximations and wavelet orthonormal bases of L2(R), Transactions of the American Mathematical Society, vol. 315, pp. 69–87, 1989. [57] S.G. Mallat, A theory for multiresolution signal decomposition: the wavelet representation, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 11, pp. 674–693, 1989. [58] B.S. Manjunath and W.Y. Ma, Texture features for browsing and retrieval of image data, IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 18, pp. 837–842, 1996. [59] B.S. Manjunath, G.M. Haley and W.Y. Ma, Multiband techniques for texture classification and segmentation, Handbook of Image and Video Processing, A. Bovik, ed., Academic Press, London, pp. 367–381, 2000. [60] G. Matheron, Random Sets and Integral Geometry, Wiley Series in Probability and Mathematical Statistics, John Wiley and Sons, New York, 1975

Discrete Visual Perception

International audienceComputational vision and biomedical image have made tremendous progress of the past decade. This is mostly due the development of efficient learning and inference algorithms which allow better, faster and richer modeling of visual perception tasks. Graph-based representations are among the most prominent tools to address such perception through the casting of perception as a graph optimization problem. In this paper, we briefly introduce the interest of such representations, discuss their strength and limitations and present their application to address a variety of problems in computer vision and biomedical image analysis

Smoothing parameter estimation for Markov random field classification of non-Gaussian distribution image

International audienceIn the context of remote sensing image classification, Markov random fields (MRFs) have been used to combine both spectral and contextual information. The MRFs use a smoothing parameter to balance the contribution of the spectral versus spatial energies, which is often defined empirically. This paper proposes a framework to estimate the smoothing parameter using the probability estimates from support vector machines and the spatial class co-occurrence distribution. Furthermore, we construct a spatially weighted parameter to preserve the edges by using seven different edge detectors. The performance of the proposed methods is evaluated on two hyperspectral datasets recorded by the AVIRIS and ROSIS and a simulated ALOS PALSAR image. The experimental results demonstrated that the estimated smoothing parameter is optimal and produces a classified map with high accuracy. Moreover, we found that the Canny-based edge probability map preserved the contours better than others

Novel pattern recognition methods for classification and detection in remote sensing and power generation applications

Novel pattern recognition methods for classification and detection in remote sensing and power generation application