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.

scholarly journals Dragonfly Algorithm with Opposition-Based Learning for Multilevel Thresholding Color Image Segmentation

Symmetry ◽  
2019 ◽  
Vol 11 (5) ◽  
pp. 716 ◽  
Author(s):  
Xiaoli Bao ◽  
Heming Jia ◽  
Chunbo Lang
Keyword(s):  
Image Segmentation ◽  
Heuristic Algorithms ◽  
Color Image ◽  
Similarity Index ◽  
Search Space ◽  
Color Image Segmentation ◽  
Computational Time ◽  
Multilevel Thresholding ◽  
Dragonfly Algorithm ◽  
Opposition Based Learning

Multilevel thresholding is a very active research field in image segmentation, and has been successfully used in various applications. However, the computational time will increase exponentially as the number of thresholds increases, and for color images which contain more information this is even worse. To overcome the drawback while maintaining segmentation accuracy, a modified version of dragonfly algorithm (DA) with opposition-based learning (OBLDA) for color image segmentation is proposed in this paper. The opposition-based learning (OBL) strategy simultaneously considers the current solution and the opposite solution, which are symmetrical in the search space. With the introduction of OBL, the proposed algorithm has a faster convergence speed and more balanced exploration–exploitation compared with the original DA. In order to clearly demonstrate the outstanding performance of the OBLDA, the proposed method is compared with seven state-of-the-art meta-heuristic algorithms, through experiments on 10 test images. The optimal threshold values are calculated by the maximization of between-class variance and Kapur’s entropy. Meanwhile, some indicators, including peak signal to noise ratio (PSNR), feature similarity index (FSIM), structure similarity index (SSIM), the average fitness values, standard deviation (STD), and computation time are used as evaluation criteria in the experiments. The promising results reveal that proposed method has the advantages of high accuracy and remarkable stability. Wilcoxon’s rank sum test and Friedman test are also performed to verify the superiority of OBLDA in a statistical way. Furthermore, various satellite images are also included for robustness testing. In conclusion, the OBLDA algorithm is a feasible and effective method for multilevel thresholding color image segmentation.

scholarly journals A Chaotic Electromagnetic Field Optimization Algorithm Based on Fuzzy Entropy for Multilevel Thresholding Color Image Segmentation

Entropy ◽  
2019 ◽  
Vol 21 (4) ◽  
pp. 398 ◽  
Author(s):  
Suhang Song ◽  
Heming Jia ◽  
Jun Ma
Keyword(s):  
Electromagnetic Field ◽  
Image Segmentation ◽  
Heuristic Algorithms ◽  
Color Image ◽  
Fitness Function ◽  
Fuzzy Entropy ◽  
Color Image Segmentation ◽  
Superior Performance ◽  
Computational Time ◽  
Multilevel Thresholding

Multilevel thresholding segmentation of color images is an important technology in various applications which has received more attention in recent years. The process of determining the optimal threshold values in the case of traditional methods is time-consuming. In order to mitigate the above problem, meta-heuristic algorithms have been employed in this field for searching the optima during the past few years. In this paper, an effective technique of Electromagnetic Field Optimization (EFO) algorithm based on a fuzzy entropy criterion is proposed, and in addition, a novel chaotic strategy is embedded into EFO to develop a new algorithm named CEFO. To evaluate the robustness of the proposed algorithm, other competitive algorithms such as Artificial Bee Colony (ABC), Bat Algorithm (BA), Wind Driven Optimization (WDO), and Bird Swarm Algorithm (BSA) are compared using fuzzy entropy as the fitness function. Furthermore, the proposed segmentation method is also compared with the most widely used approaches of Otsu’s variance and Kapur’s entropy to verify its segmentation accuracy and efficiency. Experiments are conducted on ten Berkeley benchmark images and the simulation results are presented in terms of peak signal to noise ratio (PSNR), mean structural similarity (MSSIM), feature similarity (FSIM), and computational time (CPU Time) at different threshold levels of 4, 6, 8, and 10 for each test image. A series of experiments can significantly demonstrate the superior performance of the proposed technique, which can deal with multilevel thresholding color image segmentation excellently.

Clustering-Based Color Image Segmentation Using Local Maxima

2018 ◽  
Vol 14 (1) ◽  
pp. 28-47 ◽  
Author(s):  
Kalaivani Anbarasan ◽  
S. Chitrakala
Keyword(s):  
Image Analysis ◽  
Image Segmentation ◽  
Color Image ◽  
Automatic Segmentation ◽  
Input Image ◽  
Color Image Segmentation ◽  
Local Maxima ◽  
User Input ◽  
Texture Property ◽  
Multiple Regions

Color image segmentation has contributed significantly to image analysis and retrieval of relevant images. Color image segmentation helps the end user subdivide user input images into unique homogenous regions of similar pixels, based on pixel property. The success of image analysis is largely owing to the reliability of segmentation. The automatic segmentation of a color image into accurate regions without over-segmentation is a tedious task. Our paper focuses on segmenting color images automatically into multiple regions accurately, based on the local maxima of the GLCM texture property, with pixels spatially clustered into identical regions. A novel Clustering-based Image Segmentation using Local Maxima (CBIS-LM) method is presented. Our proposed approach generates reliable, accurate and non-overlapping multiple regions for the given user input image. The segmented regions can be automatically annotated with distinct labels which, in turn, help retrieve relevant images based on image semantics.

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 Research on color image segmentation

2018 ◽  
Vol 25 (03) ◽  
pp. 138-143
Author(s):  
Wang He Xi Ge Tu ◽  
Bolormaa D
Keyword(s):  
Image Processing ◽  
Image Analysis ◽  
Image Segmentation ◽  
Digital Image Processing ◽  
Color Image ◽  
Color Image Segmentation ◽  
Primary Analysis ◽  
Programming Tools ◽  
Segmentation Methods ◽  
Segmentation Image

The basic foundation for the development of the image processing is image segments. Primary analysis, such as analysis of images and visualization of images, begins with segmentation. Image segmentation is one of the important parts of digital image processing. Depending on the accuracy and accuracy of the segmentation, the results of the image analysis, including the size of the object, the size of the object, and so on. In the first section of this study, briefly describe the types of image segments. Also use Mathlab language's powerful modern programming tools to explore the image segmentation methods and compare the results. As a result of the experiment, it is more accurate to accurately measure the trajectory of the image segmentation of the image as a result of the Otsu-based method of B space. This will apply to further research. Өнгөний мэдээлэлд суурилсан дүрс сегментчлэх аргын судалгаа Хураангуй: Дүрс боловсруулах судалгааны ажлын үндсэн суурь нь дүрс сегментчлэл юм. Дүрсэнд анализ хийх, дүрсийг ойлгох зэрэг анхан шатны боловсруулалт нь дүрс сегментчлэхээс эхэлдэг. Дүрс сегментчлэл нь дижитал дүрс боловсруулалтын чухал хэсгүүдийн нэг юм. Сегментчлэлийг хэр зэрэг үнэн зөв, нарийвчлал сайтай хийснээс шалтгаалан, дараагийн дүрс таних, обьектын хэмжээ зэрэг дүрс шинжлэлийн алхамын үр дүн ихээхэн хамаардаг. Энэхүү судалгааны ажлын эхний хэсэгт дүрс сегментчлэх арга төрлүүдийн талаар товч танилцуулна. Мөн орчин үеийн програмчлалын хүчтэй хэрэгсэл болох Mathlab хэлний функцуудыг ашиглан дүрс сегментчилж гарсан үр дүнгийн харьцуулалтыг танилцууллаа. Туршилтын үр дүнд RGB өнгөний орон зайн B бүрэлдэхүүнд суурилсан Otsu-ийн аргийг ашиглан дүрсийг сементчилэх нь уламжлалт дүрс сегментчилэх аргаас нэн сайн үр дүнтай илүү нарийвчлалтай байна. Үүнийг цаашдын судалгааны ажилдаа хэрэглэх болно. Түлхүүр үг: RGB дүрс, босго (Threshold) утга, гистограм, Otsu-ийн арга, дүрс боловсруулалт

Roughness Measure Approach to Color Image Segmentation

2010 ◽  
Vol 36 (6) ◽  
pp. 807-816 ◽  
Author(s):  
Xiao-Dong YUE ◽  
Duo-Qian MIAO ◽  
Cai-Ming ZHONG
Keyword(s):  
Image Segmentation ◽  
Color Image ◽  
Color Image Segmentation
Sign in / Sign up

Export Citation Format

Share Document