scholarly journals Segmentation d'une image couleur par les critères d'information et la théorie des ensembles flous

2006 ◽  
Vol Volume 5, Special Issue TAM... ◽  
Author(s):  
H. Hamzaouil ◽  
A. Elmatouat ◽  
P. Martin
Keyword(s):  
Image Segmentation ◽  
Color Image ◽  
Fuzzy Theory ◽  
Information Criteria ◽  
Color Image Segmentation ◽  
Computational Time ◽  
Nous Montrons ◽  
International Audience ◽  
Image Segmentation Algorithm ◽  
Optimal Radius

International audience In this paper we present an unsupervised color image segmentation algorithm using the information criteria and a fuzzy theory. We propose this method to estimate the number of color image clusters and the optimal radius associated with minimizing the value of the proposed criteria. The experimental results demonstrate that this approach compresses the image in a small number of clusters without losing the informational contents of the image and we reduce the number of parameters using the process of segmentation, we also decrease the computational time. The color image segmentation system has been tested on some usual color images; "House", "Lena", "Monarch" and "Peppers". Nous nous intéressons dans cet article à ladétermination du nombre de classes d'une image couleur par les critères d'information et la théorie des ensembles flous. Nous montrons que ces critères servent à estimer le nombre de régions d'une image couleur ainsi que le rayon optimal associé. Cette démarche est classée dans la catégorie des méthodes de segmentation non supervisée. Elle entraîne une compression de l'image en un nombre de couleurs représentatif sans perdre le contenu nformationnel de cette dernière. Elle réduit ainsi le nombre de paramètres considérés dans le systéme de la segmentation. Dans la dernière partie de cet article, nous montrons la performance et l'efficacité du nouvel algorithme en segmentant des images couleur tests: "House", "Lena", "Monarch" et "Peppers

scholarly journals A Semiautomatic Multi-Label Color Image Segmentation Coupling Dirichlet Problem and Colour Distances

2021 ◽  
Vol 7 (10) ◽  
pp. 208
Author(s):  
Giacomo Aletti ◽  
Alessandro Benfenati ◽  
Giovanni Naldi
Keyword(s):  
Image Analysis ◽  
Image Segmentation ◽  
Random Walk ◽  
Dirichlet Problem ◽  
Color Image ◽  
Color Image Segmentation ◽  
Computational Time ◽  
Random Walker ◽  
Segmentation Process ◽  
Colour Distance

Image segmentation is an essential but critical component in low level vision, image analysis, pattern recognition, and now in robotic systems. In addition, it is one of the most challenging tasks in image processing and determines the quality of the final results of the image analysis. Colour based segmentation could hence offer more significant extraction of information as compared to intensity or texture based segmentation. In this work, we propose a new local or global method for multi-label segmentation that combines a random walk based model with a direct label assignment computed using a suitable colour distance. Our approach is a semi-automatic image segmentation technique, since it requires user interaction for the initialisation of the segmentation process. The random walk part involves a combinatorial Dirichlet problem for a weighted graph, where the nodes are the pixel of the image, and the positive weights are related to the distances between pixels: in this work we propose a novel colour distance for computing such weights. In the random walker model we assign to each pixel of the image a probability quantifying the likelihood that the node belongs to some subregion. The computation of the colour distance is pursued by employing the coordinates in a colour space (e.g., RGB, XYZ, YCbCr) of a pixel and of the ones in its neighbourhood (e.g., in a 8–neighbourhood). The segmentation process is, therefore, reduced to an optimisation problem coupling the probabilities from the random walker approach, and the similarity with respect the labelled pixels. A further investigation involves an adaptive preprocess strategy using a regression tree for learning suitable weights to be used in the computation of the colour distance. We discuss the properties of the new method also by comparing with standard random walk and k−means approaches. The experimental results carried on the White Blood Cell (WBC) dataset and GrabCut datasets show the remarkable performance of the proposed method in comparison with state-of-the-art methods, such as normalised random walk and normalised lazy random walk, with respect to segmentation quality and computational time. Moreover, it reveals to be very robust with respect to the presence of noise and to the choice of the colourspace.

Color Image Segmentation Based on Self-Organizing Maps

2011 ◽  
Vol 214 ◽  
pp. 693-698
Author(s):  
Rui Geng
Keyword(s):  
Image Segmentation ◽  
Optimization Problems ◽  
Color Image ◽  
Optimal Solution ◽  
Implementation Process ◽  
Segmentation Algorithm ◽  
Color Image Segmentation ◽  
Combinatorial Optimization Problems ◽  
Bee Colony ◽  
Image Segmentation Algorithm

The colony intellectual behavior performed by many organisms in nature can solve various kinds of problems on scientific and technological research. Bees are a socialized insect colony, which perform different types of activities according to their different divisions of labor, and achieve information sharing and exchanges among the bee colony to find the optimal solution for problems. According to this characteristic, researchers have proposed the algorithm of bee colony for solving combinatorial optimization problems. In this paper, it will describe the implementation process of such an image segmentation algorithm, and the result shows that this method is a potential image segmentation algorithm.

Fuzzy Clustering Color Image Segmentation Algorithm Based on CPSO

2012 ◽  
Vol 461 ◽  
pp. 526-531
Author(s):  
Xiao Hong Zhang ◽  
Hong Mei Ning
Keyword(s):  
Image Segmentation ◽  
Color Image ◽  
Segmentation Algorithm ◽  
Color Image Segmentation ◽  
Local Optimum ◽  
Fcm Clustering ◽  
Clustering Center ◽  
Membership Matrix ◽  
Image Segmentation Algorithm

Fuzzy C-mean algorithm (FCM) has been well used in the field of color image segmentation. But it is sensitive to initial clustering center and membership matrix, and likely converges into the local minimum, which causes the quality of image segmentation lower. By use of the properties-ergodicity, randomicity of chaos, a new image segmentation algorithm is proposed, which combines the chaos particle swarm optimization (CPSO) and FCM clustering. Some experimental results are shown that this method not only has the ability to prevent the particles to convergence to local optimum, but also has faster convergence and higher accuracy for segmentation. Using the feature distance instead of Euclidian distance, robustness of this method is enhanced.

Sign in / Sign up

Export Citation Format

Share Document