ChapterPDF Available

A Study on Image Segmentation Method for Image Processing

Authors:

Abstract

Image processing techniques are essential part of the current computer technologies and that it plays vital role in various applications like medical field, object detection, video surveillance system, computer vision etc. The important process of Image processing is Image Segmentation. Image Segmentation is the process of splitting the images into various tiny parts called segments. Image processing makes to simplify the image representation in order to analyze the images. So many algorithms are developed for segmenting images, based on the certain feature of the pixel. In this paper different algorithms of segmentation can be reviewed, analyzed and finally list out the comparison for all the algorithms. This comparison study is useful for increasing accuracy and performance of segmentation methods in various image processing domains.
A Study on Image Segmentation Method
for Image Processing
S. PRABUa 1 and J.M. GNANASEKARb
a
Associate Professor Department of Computer Science & Engineering, VI Institute of
Technology Sirunkundram-603108, Chengleput Distirct, TamilNadu, India
b
Professor, Department of Computer Science & Engineering, SriVenkateswara
College of Engineering, Sriperumbadur, TamilNadu, India
Abstract. Image processing techniques are essential part of the current computer
technologies and that it plays vital role in various applications like medical field,
object detection, video surveillance system, computer vision etc. The important
process of Image processing is Image Segmentation. Image Segmentation is the
process of splitting the images into various tiny parts called segments. Image
processing makes to simplify the image representation in order to analyze the
images. So many algorithms are developed for segmenting images, based on the
certain feature of the pixel. In this paper different algorithms of segmentation can
be reviewed, analyzed and finally list out the comparison for all the algorithms.
This comparison study is useful for increasing accuracy and performance of
segmentation methods in various image processing domains.
Keywords. Image Segmentation, Digital Image Processing, K-Means Clustering,
Edge detection, histogram.
1. Introduction
Image is binary representation of visual information by means of pixels. It
contains lot of information to perform some useful operations on different area of
applications like medical field, object detection, video surveillance system, computer
vision, pattern recognition, remote sensing etc. With the help of computer algorithms,
we can manipulate the pixels either enhance the quality of image or extract the useful
information from it. Digital image processing has different stages, in which
segmentation is the essential and challenging part in the operation of image processing.
Image segmentation should be segregating the images into meaningful parts that are
having similar features and behaviors. The purpose of segmentation is, to make the
image representation easily, classified meaningfully, and analyzed properly. Using the
image segmentation, we can localize the objects and identifying its boundaries in an
image. Then assign the labels to each pixel in the entire image. Some pixels having the
same labels means they have common characteristics. This paper analyzes the different
methods of segmentation and their algorithms. First, we analyze the segmentation
carried out by means of pixel properties [1] to analyze the local and global properties,
and to tell how speed up the segmentation process by modifying the existing ACM
model along with local and global properties. Expectation of maximization algorithm
[2] needs more iteration to segment the image. Modification can be based on the
1
S. PRABU, Associate Professor Department of Computer Science & Engineering, VI Institute of
Technology Sirunkundram, India
Email: sprabumkm@gmail.com
Recent Trends in Intensive Computing
M. Rajesh et al. (Eds.)
© 2021 The authors and IOS Press.
This article is published online with Open Access by IOS Press and distributed under the terms
of the Creative Commons Attribution Non-Commercial License 4.0 (CC BY-NC 4.0).
doi:10.3233/APC210223
419
likelihood properties we can achieve the minimum number of calculations. EM based
localization and 3D U-Net and EM based attention mechanism will provide the
optimized segmentation results. Color images can be segmented by RGB Histogram [3]
along with firefly algorithm. Combination of SCT-I and SCT-V algorithm and
SAMFO-TH [17] algorithm solves the multilevel threshold problem of RGB color
image. Color hymnographies [6] can be used to identify the color object detection.
Image restoration algorithm [4] can segment the image based on the sample blocks.
This method utilizes the advantages of both Criminisi algorithm & Watershed image
segmentation algorithm. So many factors are affecting while extracting text
information from the image [5]. Noise is more, when the image can be captured from
live video camera. The Encoder Decoder framework resolves the issues in
segmentation for retrieving text information. To speed up the text retrieval process,
Instance Segmentation Network technique can be used. This paper analyze the different
methods and compare it to give the clear idea about image segmentation process.
2.Related Work
2.1 Segmentation by means of properties of pixel
Segmentation operation can be also performed by means of global and local
properties of pixels [1]. It states that, the global properties are calculated by mean
values of various pixels and successive edges of objects, and the local properties are
characterized by interaction of successive pixels and the boundary of the image.
Image entropy can be done by improved weighting function that can be adapt the
weight between local term and global term, so the segmentation speed can be improved
significantly.
2.1.1 Thresholding Method
Based on the pixel’s intensity, this method partitions the image, into two
parts, they are intensity of pixel value lower than threshold and intensity of pixel value
greater than threshold. Multi stage thresholding approach is necessary for color image
segmentation in many applications [10]. To segment the color components Red, Green
and Blue, more than two optimal thresholds can be needed. In future a greater number
of thresholds is necessary. But a greater number of thresholds can decrease the
performance of segmentation process. The main drawback of multi-level thresholding
leads long execution time [11]. During the processing of low-quality images, cause the
wrong prediction of threshold values. The improved salp swarm algorithm can
minimize the number of thresholds to ensure effective segmentation process. Modified
grasshopper optimization algorithm [16], metaheuristic algorithm, firefly algorithm,
novel population-based bee foraging algorithm [18] are also used for optimized
threshold values.
2.1.2 Edge detection
An edge is a set of connected pixels that creates the boundary between the
two successive regions. The edge detection is basically a process of segmenting the
image into discontinuity of regions. The perfectness of the image-by-image processing
and computer vision can be depending on identifying meaningful edges. Out of all the
edge detection techniques, ‘Canny Edge Detector’ produces good results than other
edge detection methods. The basic limitations of edge detection are edge connectivity
and edge thickness [7]. Multiple values of Threshold approaches need to solve the
above two issues. To find the optimized thresholding values Genetic algorithm can be
S. Prabu and J.M. Gnanasekar / A Study on Image Segmentation Method for Image Processing420
applied which optimize the coefficient of filter [8]. This kind of optimization improves
the quality of segmenting edges in MR scan images.
2.1.3 Clustering methods
Clustering is the process of image information can be replaced by clusters.
Cluster is the collection of similar attribute data points. Pixels, which have common
attributes like same color, same texture or any related attribute. Main issues in
Clustering are identify the correct inter cluster distance and identify the total number of
Clusters. Robust self-sparse fuzzy clustering algorithm improves the clustering result
by reducing the noisy features. The main drawback of K means clustering method is
image segments are disconnected and disseminated with wide distance. To find the
optimal number of clusters is very hard without knowing the initial parameters. The
unsupervised K-means clustering technique is needed to achieve this [9]. To solve the
initialization problem, UK-means algorithm uses number of points to determine the
initial number of clusters. To avoid overlapping, kernel K-means clustering can be
proposed [13]. In which kernel functions are transformed into feature space, to estimate
the correct number of clusters. The combination of depth and semantic information of
images [20] improve the accurate identification of initial center value.
2.2 Optimized Segmentation
Segmentation operation can be improved effectively by applying small
changes in the existing segmentation algorithm called Expectation of maximization; it
has a greater number of iterations and takes more computing power [2]. Compression
based segmentation methods express the approximation of actual pixel values with
some of the sample pixels, so that the size of the image can be tremendously reduced.
To improve the efficiency of compression, the original image can be pre quantized with
higher bits [15]. But sometimes the predictions may not work properly when using high
bit rates.
2.3 Color Image Segmentation
Segmentation operation can be achieved in a color images by RGB
Histogram [3]. By applying firefly algorithm, the optimal multi-level image
segmentation can be achieved. The two new algorithms called SCT-I and SCT-V for
image and video input data. For each frame SCT-V algorithm locate the target of
interest (TOI) for object tracking and SCT-I algorithm maintain the original color in the
target of interest. SAMFO-TH algorithm [17] based on moth flame optimization.
Histogram is developed by dividing the range of the data into same sized classes. Then
for each class, those data set points which present into the class are calculated. The key
parameter of this method is the selection of the threshold value, which can be computed
manually or automatically by some algorithms. The basic concept of this method is, to
identify the mean or median value, so that pixels of the object are brighter than the
background. By applying color hymnographies to increase the color fidelity and
improve the color object detection [6].
2.4 Segmentation based on the sample blocks
Segmentation operation can be achieved by improved image restoration
algorithm based on the sample blocks [4]. It resolves the image repairing problems
occurred when the image restoration process. Criminisi algorithm and watershed image
algorithm is applied to the large amount of image set. Then identify the matching pixel
S. Prabu and J.M. Gnanasekar / A Study on Image Segmentation Method for Image Processing 421
blocks in image segmentation. So that excessive extension of texture blocks for the
process of restoration of images can be avoided.
2.4.1 Region-based methods
This kind of segmentation groups the pixels that have similar properties. It
segregates the pixel, those having the similar characteristics and dissimilar
characteristics. It compares the properties of neighboring pixels and produces the result.
The main objective is to differentiate the homogeneity of the image. That can be
achieved by improved image restoration algorithm based on the sample blocks [4]. A
new method using region of interest for segmenting images, having less computation
complexity, to preprocess the training sets so that to reduce the redundant information.
For color region segmentation, hue division based selective color transfer algorithm
can be used. In which HSV color model transferred into luminance and saturation
integrity.
2.5 Text-Based Segmentation
Segmentation operation can be achieved only in a text-based images, to
retrieve the necessary text information from the whole image [5]. The information may
be single or multiple line, words, or even one or more characters. This paper proposes
different methodologies at the various segmentation stages. It first justifies the
segmentation process in the text context based on the information retrieval. This paper
also discusses different factors affecting the process of segmentation. The Captured
images from camera have more background noise [12]. The main issues are symbols
having several separate primitives with complex background and distortions from
camera. To extract the text information from natural scenes are also complex process.
The encoder decoder framework [17] is proposed. It is used by the combination of
attention mechanism and connection time classification. To reduce the more processing
time the new technique called Instance Segmentation Network (ISNet) to detect the text
content by generating prototype masks simultaneously.
2.6 Motion & Interactive Segmentation
Motion Segmentation means pixels are grouping together in a particular
movement of the object. The main objective of this technique is to segment the images
for object that are in moving condition. To make the image analysis, and understanding
the image properties, to analyze the motion sequence is important. First Identify the
background and foreground objects, and then make analysis these objects
independently, this model is commonly called ‘variation Model’ which takes two
successive video frames, evaluate the movement ranges between each frame. The main
aim of this method is to identify the object boundaries with minimal user interventions.
3.Survey Discussion
Various segmentation algorithms are discussed and each method has its own
advantages and disadvantages within a particular context. Some methods need the
modification and improvement. The following table 1 compares the various factors of
different segmentation methods.
S. Prabu and J.M. Gnanasekar / A Study on Image Segmentation Method for Image Processing422
Table 1: Comparison of different segmentation techniques
Method Descripti
on Characteristics Advantages Issues
Threshold
ing
Method
Segmentation
done by value
of pixel
Intensity
Types:
Local & Global
Thresholding
Simple & Effective
Processing.
Single Threshold value
not give accurate
result. More Threshold
values leads more
processing time
Edge
detection
Segmentation
based on
discontinuity of
regions
Steps
Filtering
Enhancement
Detection
Using probability for
finding error rate,
Improving signal to
noise ratio.
Highly sensitive to
noise.
More possible for
inaccuracy.
Clustering
methods
Segmentation
by means of
collection of
similar attribute
data points
They are
unsupervised
algorithms
Applicable for real
time problems
1.Identify the correct
inter cluster distance
2. Identify the total
number of Clusters.
Not suitable for wide
distances.
K-means
Clustering
This method is
used when you
have unlabeled
data (i.e. data
without defined
any category)
It clusters, he
given data into
K-clusters or
parts based on
the K-centroids.
Simple to implement.
scalable for large data
sets
image segments are
disconnected and
disseminated with
wide distance
dependant on initial
values.
Region-
based
methods
Segmentation
based on
similar
properties of
pixels
Partitioning an
image into
homogeneous
regions.
Accurately segment
the regions that have
the same properties we
define. It works well
with respect to noise
Expensive
Computation.
Variation of intensity
will affect the result.
Motion &
Interactive
Segmentat
ion
pixels are
grouping
together in a
particular
movement of
t
he objec
t
Criminisi
algorithm &
Watershed
algorithm
The pixels that have
high intensity variation
can be clearly
classified as moving
objects.
If registration of
background pixels are
not perfect, leads false
prediction of moving
objects. More
computation cost.
Compress
ion-based
methods
approximation
of actual pixel
values with
some of the
sample pixels
Types:
Lossless,
Compression
Lossy
Compression
Best suited in storage
and transmission of
images
More computation
complexity.
Histogram
-based
methods
each region’s
pixels are
having similar
properties, like
intensity, color
values, texture.
Best suited for
image
enhancement
Directly process the
color images
Requires high number
of operations on each
pixel. Computationally
slow. Over
segmentation occurred
since no spatial
information.
4. Conclusion
This paper discusses about various image segmentation techniques and
different image segmentation approaches are illustrated and correlated. All these
methodologies are suitable for many applications in medical field, object detection,
computer vision, surveillance system, computer vision etc. From this study, each
segmentation methods are desirable for specific image types. So, the combination of
multiple segmentation methods is needed to get good result. To improve the accuracy
of the segmentation result, need to apply machine learning techniques. The important
parameters of image segmentation are accuracy, complexity, efficiency and
S. Prabu and J.M. Gnanasekar / A Study on Image Segmentation Method for Image Processing 423
interactivity. No particular methods are comfortable for all the types of images. For this
reason, segmentation of images in various applications has high demand in future.
References
[1] ZhenZhou Wang, “Image segmentation by combining the global and local properties”, Elsevier, Expert
Systems With Applications (2017), Vol-87, PP- 30-40.
[2] Lahouaoui Lalaoui, Tayeb. Mohamadi and Abdelhak Djaalab, “New Method for Image Segmentation”,
Elsevier, Procedia - Social and Behavioral Sciences (2015), Vol-195, PP- 1971–1980.
[3] V. Rajinikanth, and M. S. Couceiro, “RGB Histogram based Color Image Segmentation Using Firefly
Algorithm”, Elsevier, Procedia Computer Science(2015), Vol-46, PP- 1449–1457.
[4] Huang Ying, Li Kai, and Yang Ming, “An Improved Image Inpainting Algorithm based on Image
Segmentation”, Elsevier, Procedia Computer Science(2017), Vol-107, PP- 796–801.
[5] Gupta Mehul, Patel Ankita, Dave Namrata, Goradia Rahul and Saurin Sheth, ”Text-Based Image
Segmentation Methodology”, Elsevier, Procedia Computer Science (2014), Vol-14, PP- 465–472.
[6] Gupta Mehul, Patel Ankita, Dave Namrata, Goradia Rahul and Saurin Sheth, “Text-Based Image
Segmentation Methodology”, Elsevier, Procedia Computer Science (2014), Vol-14, PP- 465–472.
[7] Mamta Mittal, Amit Verma, Iqbaldeep Kaur, Bhavneet Kaur, Meenakshi Sharma, Lalit Mohan Goyal,
Sudipta Roy and Tai-Hoon Kim, “An Efficient Edge Detection Approach to Provide Better Edge
Connectivity for Image Analysis”, IEEE Access (2019), Vol-7, PP- 33240–33255.
[8] Ahmed H. Abdel-Gawad, Lobna A. Said, Dave Namrata, and Ahmed G. Radwan, “Optimized Edge
Detection Technique for Brain Tumor Detection in MR Images”, IEEE Access (2020), Vol-8, PP-
136243–136259.
[9] Kristina P. Sinaga and Miin-Shen Yang, “Unsupervised K-Means Clustering Algorithm”, IEEE Access
(2020), Vol-8, PP- 80716–80727.
[10] Heming Jia Jun Ma and Wenlong Song, “Multilevel Thresholding Segmentation for Color Image Using
Modified Moth-Flame Optimization”, IEEE Access (2019), Vol-7, PP- 44097–44134.
[11] Heming Jia Jun Ma and Wenlong Song, “Multilevel Thresholding Segmentation for Color Image Using
Modified Moth-Flame Optimization”, IEEE Access (2019), Vol-7, PP- 44097–44134.
[12] Ahmed A. Ewees, Mohamed Abd Elaziz, Mohammed A. A. Al-Qaness, Hassan A. Khalil and
Sunghwan Kim,“ Two-Step CNN Framework for Text Line Recognition in Camera-Captured Images”,
IEEE Access (2020), Vol-8, PP- 26304–26315.
[13] Soosan Beheshti, Edward Nidoy, and Faizan Rahman, “K-MACE and Kernel K-MACE
Clustering”,IEEE Access (2020), Vol-8, PP- 17390–17403.
[14] Dan Wang, Guoqing Hu, Qianbo Liu, Chengzhi Lyu, and Md Mojahidul Islam, “Region-Based
Nonparametric Model for Interactive Image Segmentation”, IEEE Access (2019), Vol-7, PP- 111124–
111134.
[15] Jianyu Lin,“A New Perspective on Improving the Lossless Compression Efficiency for Initially
Acquired Images”, IEEE Access (2019), Vol-7, PP- 144895–144906.
[16] Hongnan Liang, Heming Jia, Zhikai Xing, Jun Ma, And Xiaoxu Peng, “Modified Grasshopper
Algorithm-Based Multilevel Thresholding for Color Image Segmentation”, IEEE Access (2019), Vol-7,
PP- 11258–11295.
[17] Heming Jia, Jun Ma, And Wenlong Song, “Multilevel Thresholding Segmentation for Color Image
Using Modified Moth-Flame Optimization”, IEEE Access (2019), Vol-7, PP- 44097–44134.
[18] Zhicheng Zhang And Jianqin Yin, “Bee Foraging Algorithm Based Multi-Level Thresholding For
Image Segmentation”, IEEE Access (2020), Vol-8, PP- 16269–16280.
[19] Zhen Zheng , Bingting Zha, Hailu Yuan, Youshi Xuchen, Yanliang Gao, And He Zhang, “Adaptive
Edge Detection Algorithm Based on Improved Grey Prediction Model”, IEEE Access (2020), Vol-8,
PP- 102165–102176.
[20] Hanxiao Rong, Alex Ramirez-Serrano, Lianwu Guan, And Yanbin Gao, “Image Object Extraction
Based on Semantic Detection and Improved K-Means Algorithm”, IEEE Access (2020), Vol-8, PP-
171129–171139.
S. Prabu and J.M. Gnanasekar / A Study on Image Segmentation Method for Image Processing424
... Натомість об'єктивні спекли формуються та записуються безпосередньо реєструючим пристроєм, без проміжного екрану. Ця різниця визначає характер подальшого аналізу та застосування кожного типу спеклів [12][13][14][15][16][17][18]. ...
Article
В сучасній біомедичній інженерії та медичній діагностиці спостерігається стрімкий розвиток методів аналізу біологічних структур, зокрема, для вивчення властивостей крові. Одним із ефективних підходів є використання спекл-інтерферометрії, яка дозволяє отримувати інтерференційні зображення різноманітних мікроструктур, таких як клітини крові. Метод спекл-аналізу базується на просвічуванні зразків крові когерентним лазерним випромінюванням, що дозволяє отримати спекл-зображення, які аналізуються за допомогою розробленої комп'ютерної моделі. Мікроскопічний аналіз, у свою чергу, передбачає отримання фотографій зразків за допомогою мікроскопа з подальшим візуальним або програмним аналізом. Відомо, що під час циркуляції крові по судинах, еритроцити взаємодіють з іншими клітинами крові (лімфоцити, лейкоцити тощо), що неможливо дослідити при вимірюванні перфузії крові в умовах in vivo. Саме тому особливий інтерес викликає використання нових методів для дослідження агрегації еритроцитів та інших клітин крові в умовах in vitro, оскільки такі умови досліджень носять більш точний характер та запобігають виникненню різноманітних відхилень через стабільність середовища досліджень. У дослідженні оцінено точність обох методів у контексті виявлення мікроструктурних змін крові, таких як агрегація та кількість еритроцитів через їх переважність у досліджуваних зразках крові. Спекл-аналіз продемонстрував можливий потенціал у швидкому виявленні змін у зразках, дозволяючи автоматизувати процес обробки даних. Водночас мікроскопічний метод забезпечує високодеталізовані зображення, що є важливим для якісного аналізу, але вимагає більше часу та ручної обробки. Результати дослідження показують, що поєднання обох підходів може значно підвищити точність діагностичних процедур. Запропонована комп’ютерна модель відповідає сучасним тенденціям впровадження інформаційних цифрових технологій доказової медицини і може допомогти в удосконаленні діагностики захворювань, пов'язаних із змінами у морфології еритроцитів крові.
Article
Full-text available
Sugarcane, as a widely cultivated agricultural product with diverse applications, particularly in sugar production, holds significant economic and industrial importance. This study investigates the feasibility of producing powdered sugarcane pith and its application as a partial sugar substitute in cake production. Samples of the CP69-1062 sugarcane variety, harvested in 2023 from the Haft-Tappeh Sugarcane Agro-Industry Company in Shush, Iran, were processed into powder following separation. Comprehensive physical and chemical analyses were performed on the sugarcane powder, which was then incorporated at substitution levels of 25%, 50%, 75%, and 100% to replace sugar in cake formulations. The cakes were evaluated based on sensory attributes (color, aroma, flavor, texture, and overall acceptability) and economic feasibility. The results indicated that sugarcane pith contains 2.00% protein, 3.20% fat, 30.67% crude fiber, 30.20% dry matter, and 1.97% ash. Additionally, sugarcane rind exhibited higher concentrations of protein (2.56%), fat (4.63%), fiber (63%), and minerals, whereas the pith contained a higher sucrose content (25.25%) and lower levels of toxic compounds. Consequently, sugarcane pith is recommended for powder production due to its higher sugar content and nutritional benefits. Sensory analysis revealed that 25% sugar substitution with sugarcane powder did not cause significant color changes in the cake; however, at higher substitution levels, significant differences were observed (P < 0.05). Regarding aroma and flavor, significant differences were detected between the test samples and the control, particularly at higher substitution levels. Texture analysis showed that the cake with 25% sugar substitution exhibited no significant differences from the control sample, while at 75% and 100% substitution, texture firmness increased significantly. From an economic perspective, the production cost of the cake with 25% sugar substitution was 2.457,representinga37.632.457, representing a 37.63% increase compared to the conventional sugar-based cake. Similarly, the cost of producing a cake with 50% substitution was 3.148, reflecting a 76.3% increase. This cost escalation is attributed to the non-industrialized nature of sugarcane powder production, which could be mitigated through process optimization and industrial scaling. Overall, the findings suggest that sugarcane powder substitution up to 50% is technologically and economically feasible without compromising the sensory attributes of the cakes.
Article
Full-text available
This work explains the use of invariants in robotic perception and control skills. An “invariant” is a mathematical constraint that remains unchanged under a particular transformation in a system. This property makes robotic functionalities more robust against “disturbances” that cause these transformation. These invariants are stored in a world model (WM), which has a central role in the information architecture of the robot to share information between components. A “robotic” football table serves as an example to illustrate the effectiveness of invariants. Despite looking different, all standard football tables satisfy the same set of invariants; the common layout of the field, line markings and puppets, which are not identical but satisfy the same set of constraints, such as parallelism, partial ordering, and relative colour and intensity differences between objects. During initialization, the invariants are actively identified and saved to the world model. During game play this world model is used by the perception and action skills and is updated when necessary. This work shows how the use of invariants creates robustness against variation in placement of the perception system and against variation in table dimensions and colours. When the camera is misaligned or moved mid-play, the world model is updated to ensure a smooth continuation of the game. The approach is tested on three standard football tables, with different dimensions and colours, showing that the approach is robust on standard tables that adhere to the invariants.
Article
The prompt detection of early decay in the pavement could be an auspicious technique in road maintenance. Admittedly, early crack detection allows preventive measures to be taken to avoid damage and possible failure. With regards to the advancement in computer vision and image processing in civil engineering, traditional visual inspection has been replaced by semi-automatic/automatic techniques. The process of detecting objects from the images is a fundamental stage of any image processing technique since the accuracy rate of the classification will depend heavily on the quality of the results obtained from the segmentation step. The major challenge of pavement image segmentation is the detection of thin, irregular dark lines cracks that are buried into the textured backgrounds. Although the pioneering works on image processing methodologies have proven great merit of such techniques in detecting pavement surface distresses, there is still a need for further improvement. The academic community is already working on image-based identification of pavement cracks, but there is currently no standard structure. This literature review establishes the history of development and interpretation of existing studies before conducting new research; and focuses heavily on three major types of approaches in the field of image segmentation, namely thresholding-based, edge-based, and data driven-based methods. With comparison and analysis of various image segmentation algorithms, this research provides valuable information for researchers working on enhanced segmentation strategies that potentially yield a fully automated distress detection process for pavement images with varying conditions.
Article
Full-text available
Object extraction is an important tool in many applications within the image processing and computer vision communities. You Only Look Once version 3 (YOLOv3) has been extensively applied to many fields as a state-of-the-art technique for object semantic detection. Despite its numerous characteristics, YOLOv3 has to be combined with appropriate image segmentation technologies to achieve effective 2D object extraction in real-time monitoring, robot navigation, and target search. In this article, the K-means algorithm is applied to the segmentation of depth images. Considering the inherent sensitivity to the randomness of the initial cluster center and the uncertainty of cluster number K in the initialization phase of the K-means algorithm, this article proposes a new method that combines the semantic image information with the image depth information. Specifically, this method proposed to pre-classify the center depth of the object to determine the appropriate value of K required in the K-means algorithm. At the same time, the proposed algorithm improves the selection of the initial center via the maximin method. This article introduces a multi-parameter extraction method to enable to correctly identify the object of interest after image segmentation. The technique considers three parameters to achieve this: i) the elements of size, ii) the connected domain, and iii) the diagonal detection. Experiments using open-source datasets demonstrate that the average processing time and the segmentation accuracy of the improved K-means algorithm are 20.36% faster and 3.12% higher than the conventional K-means algorithm, respectively. The extraction accuracy of the proposed method is 6.69% higher than that of the SuperCut extraction method.
Article
Full-text available
Genetic algorithms (GAs) are intended to look for the optimum solution by eliminating the gene strings with the worst fitness. Hence, this paper proposes an optimized edge detection technique based on a genetic algorithm. A training dataset that consists of simple images and their corresponding optimal edge features is employed to obtain the optimum filter coefficients along with the optimum thresholding algorithm. Qualitative and quantitative performance analyses are investigated based on several well-known metrics. The performance of the proposed genetic algorithm-based cost minimization technique is compared to the classical edge detection techniques, fractional-order edge detection filters, and threshold-optimized fractional-order filters. As an application for the proposed algorithm, a strategy to detect the edges of the brain tumour from a patient’s MR scan image of the brain is proposed. First, Balance Contrast Enhancement Technique (BCET) is applied to improve the image features to provide better characteristics of medical images. Then the proposed GA edge detection method is employed, with the appropriate training dataset, to detect the fine edges. A comparative analysis is performed on the number of MR scan images as well. The study indicates that the proposed GA edge detection method performs pretty well compared to both classical and fractional-order edge detection methods.
Article
Full-text available
Existing edge detection algorithms suffer from inefficient edge localization, noise sensitivity, and/or relatively poor automatic detection capability. Contemporary edge detection algorithms can be improved by targeting these problems to help bolster their performance. Grey system theory can be used to resolve the small data and poor information issues in the local information of uncertain systems. An automatic edge detection algorithm was developed in this study based on a grey prediction model to remedy these problems. Noise characteristics in grey images are used to deploy a noise-filtering algorithm based on local features. A mask with twenty-four edge direction information points (345°) was established based on edge line texture features. By compressing the amplitude of the sequence, the randomly oscillated grey prediction sequence can be converted into a smooth, new sequence. The discrete grey model (1,1) (DGM(1,1)) was established based on this new grey prediction sequence to obtain the grey prediction maximum value. A grey prediction image with enhanced edges was obtained by replacing the pixel value in the original image with the maximum grey prediction value. A grey prediction subtraction image with edges separated from non-edge points was also obtained by subtracting the original image from the grey prediction image. The optimal separation threshold in the grey prediction subtraction image can be determined via the global adaptive threshold selection method. The neighborhood search method was then deployed to remove stray points and burrs from the image after the target was separated from the background, creating the final edge image. Experiments were performed on a computer-simulated phantom to find that both the subjective visual effects and objective evaluation criteria are better under the proposed method than several other competitive methods. The proposed edge detection algorithm shows excellent edge detection ability and is highly robust to noise, though the grey prediction model needs further improvement to optimize the run time.
Article
Full-text available
The k-means algorithm is generally the most known and used clustering method. There are various extensions of k-means to be proposed in the literature. Although it is an unsupervised learning to clustering in pattern recognition and machine learning, the k-means algorithm and its extensions are always influenced by initializations with a necessary number of clusters a priori. That is, the k-means algorithm is not exactly an unsupervised clustering method. In this paper, we construct an unsupervised learning schema for the k-means algorithm so that it is free of initializations without parameter selection and can also simultaneously find an optimal number of clusters. That is, we propose a novel unsupervised k-means (U-k-means) clustering algorithm with automatically finding an optimal number of clusters without giving any initialization and parameter selection. The computational complexity of the proposed U-k-means clustering algorithm is also analyzed. Comparisons between the proposed U-k-means and other existing methods are made. Experimental results and comparisons actually demonstrate these good aspects of the proposed U-k-means clustering algorithm.
Article
Full-text available
Multi-level thresholding is one of the essential approaches for image segmentation. Determining the optimal thresholds for multi-level thresholding needs exhaustive searching which is timeconsuming. To improve the searching efficiency, a novel population based bee foraging algorithm (BFA) for multi-level thresholding is presented in this paper. The proposed algorithm provides different flying trajectories for different types of bees and takes both single-dimensional and multi-dimensional search aiming to maintain a proper balance between exploitation and exploration. The bee swarm is divided into a number of sub-swarms to enhance the diversity. A neighbourhood shrinking strategy is applied to mitigate stagnation and accelerate convergence. Experiments have been performed on eight benchmark images using between-class variance as the thresholding criterion. The performance of the proposed algorithm is compared with some state-of-art meta-heuristic algorithms. The results show that BFA is efficient and robust, produces excellent results with few control parameters, and outperforms other algorithms investigated in this consideration on most of the tested images.
Article
Full-text available
A new lossless compression scheme of compressing the initially-acquired continuous-intensity images with a lossy compression algorithm to obtain higher compression efficiency is proposed. Even if a lossy algorithm is employed, for decoded original images, there is no loss of data in the same sense as the conventional lossless scheme. To realize the new idea, the compression efficiency of the existing lossy subband compression algorithm is improved at high bitrates. For the entropy coding part, a run-length based, symbol-grouping entropy coding method is introduced. For the quantization part, the entropy-constrained scalar quantization is implemented using a novel and simple thresholding method. Coding results show that bit savings of the proposed lossless scheme, which employs a lossy algorithm, over the conventional lossless scheme achieve a maximum of 27.2% and an average of 11.4% in our test.
Article
Full-text available
In this paper, we present a novel framework for interactive segmentation problems. It integrates a nonparametric model into the Conditional Random Field (CRF) framework, which can effectively combine high-level features with low-level features to represent image information. In the nonparametric model, multiple region layers are used to estimate data likelihood terms to overcome the bad regions generated by unsupervised methods. The likelihood values of each layer are calculated separately to reduce the computational cost. In addition, we analyze that the pixel layer has little effect on data estimation, so we remove it to further reduce the complexity of the algorithm. We employ the label consistency between pixels and their corresponding regions in smooth term estimation, which can be regard as a higher order potential for pixels. The data term and the smooth term are then performed together in Conditional Random Fields (CRFs) as a fine-tuning of the results. Experimental results show that the proposed method can segment images efficiently and accurately with fewer user inputs.
Article
Full-text available
Multilevel thresholding has got more attention in the field of image segmentation recently. However, it is still challenging and complicated for color image segmentation in many applications. To mitigate the above conditions, a novel multilevel thresholding algorithm consists of two innovative strategies is proposed on the basis of Moth-flame optimization (MFO) to develop the SAMFO-TH algorithm. On the one hand, a creative self-adaptive inertia weight scheme is used to enhance both the exploration and exploitation, on the other hand, a newly proposed thresholding (TH) heuristic is embedded into MFO to improve the global performance in multilevel thresholding. To find the optimal threshold values of an image, Otsu's variance and Kapur's entropy criteria are employed as fitness functions. Experiments have been performed on ten color images including six natural images and four satellite images at different threshold levels with a comparison of other eight meta-heuristic algorithms: multi-verse optimizer (MVO), whale optimization algorithm (WOA), standard MFO, etc. The experimental results are presented in terms of computational time (CPU Time), mean value to reach (MVTR), standard deviation (STD), mean square error (MSE), peak signal to noise ratio (PSNR), structural similarity (SSIM), feature similarity (FSIM), probability rand index (PRI), variation of information (VoI), and threshold value distortion (TVD). The results demonstrate that the proposed SAMFO-TH outperforms other competitive algorithms and has superiority concerning stability, accuracy, and convergence rate, which can be applied to practical engineering problems.
Article
Full-text available
An edge detection is important for its reliability and security that delivers a better understanding of object recognition in applications of computer vision such as pedestrian detection, face detection, and video surveillance. This paper introduced two fundamental limitations encountered in edge detection: edge connectivity and edge thickness, those have been used by various developments in the state-of-the-art. An optimal selection of the threshold for effectual edge detection has constantly been a key challenge in computer vision. Therefore, a robust edge detection algorithm using multiple threshold approach (B-Edge) is proposed to cover both the limitations. The majorly used canny edge operator focuses on two thresholds selections and still witnesses few gaps for optimal results. To handle the loopholes of canny edge operator our method selects the simulated triple thresholds that targets to the prime issues of edge detection: image contrast, effective edge pixels selection, errors handling and similarity to the ground truth. The qualitative and quantitative experimental evaluation demonstrates that our edge detection method outperforms competing algorithms for mentioned issues. The proposed approach endeavors an improvement for both grayscale and colored images. fails using local information around edge terminals for effective edge linking.
Article
Full-text available
Multilevel thresholding is an important approach for image segmentation which has drawn much attention during the past few years. The Tsallis entropy method is implemented for its effectiveness and simplicity. Although it is efficient and gives excellent result in the case of bi-level thresholding, but its evaluation becomes complexity when the number of threshold increases. To overcome the problem, the metaheuristic algorithms are applied in this search area for searching the optimal thresholds. In this paper, a modified grasshopper optimization algorithm (GOA) is adopted to render multilevel Tsallis cross entropy more practical and reduce the complexity. The Levy flight algorithm is employed to modify the original GOA and balance the exploration and exploitation of the GOA. Experiments are conducted between five state-of-the-art metaheuristic algorithms and the proposed one. In addition, the proposed approach is compared with thresholding techniques depending on between-class variance (Otsu) method and Renyi entropy function. In both real life images and plant stomata images are used in the experiments to test the performance of the algorithms involved. Qualitative experimental results show that the proposed segmentation approach has fewer iterations and higher segmentation accuracy.