<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Archiving and Interchange DTD v1.0 20120330//EN" "JATS-archivearticle1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink">
  <front>
    <journal-meta>
      <journal-title-group>
        <journal-title>Burtsev N.: Devel-
opment of a genetic algorithm for placing power supply sources in a distributed electric
network. Eastern European Journal of Enterprise Technologies</journal-title>
      </journal-title-group>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.3103/S1060992X14020039</article-id>
      <title-group>
        <article-title>Application of the Fuzzy Clustering Technique for Processing and Analysis of Medical Images</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author">
          <string-name>rii Oliinyk</string-name>
          <xref ref-type="aff" rid="aff0">0</xref>
        </contrib>
        <aff id="aff0">
          <label>0</label>
          <institution>Department of Software Tools, National University “Zaporizhzhia Polytechnic”</institution>
          ,
          <addr-line>64 Zhukovskoho str., Zaporizhzhia, Ukraine, 69063</addr-line>
        </aff>
      </contrib-group>
      <pub-date>
        <year>2017</year>
      </pub-date>
      <volume>23</volume>
      <issue>5</issue>
      <fpage>89</fpage>
      <lpage>95</lpage>
      <abstract>
        <p>The problem of improving the efficiency of medical diagnostics is continuously present in the medical practice. The feasibility of using the mathematical tools for fuzzy logic as applied to the tasks of medical radiological images analysis is under investigation. The paper considers a new approach to the application of the fuzzy clustering technique for analysis and processing of medical images having various structures. The results of practical application of the new approach with the use of real medical images are shown.</p>
      </abstract>
      <kwd-group>
        <kwd>medical images</kwd>
        <kwd>image recognition</kwd>
        <kwd>segmentation</kwd>
        <kwd>noise</kwd>
        <kwd>fuzzy clustering</kwd>
        <kwd>МССРАО</kwd>
      </kwd-group>
    </article-meta>
  </front>
  <body>
    <sec id="sec-1">
      <title>-</title>
      <p>
        The ultrasonic imagining is one of the main and common methods of medical
diagnostics [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ], which places greater focus on the enhancement of sensitivity and
reliability of the procedure for visualization of ultrasonic pulse-echo image. The paper [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ]
considers the opportunities for the enhancement of sensitivity of detection of the
boundaries of low-contrast structures and neutralization of the impact of multiple
reflection of ultrasonic pulses hindering the visual analysis of pulse-echo images.
However, from the point of view of determination of homogeneity, roughness and
regularity, the procedure for segmentation of the ultrasonic images is of the greatest
interest. The issues of segmentation of different types of images fall within the
domain of computer vision [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], but the presence of modulation speckle noises is the
distinctive feature of ultrasound diagnostics. Therefore, the application of any method
for segmentation of ultrasonic images should take into account the presence of this
factor and come with the use of modulation noise filtering procedure.
      </p>
      <p>Another distinctive feature of ultrasound diagnostics is the fact that the boundaries
of the anatomical regions are “blurred” on the ultrasonic images, since the acoustical
impedances of adjacent biological structures may be close or continuous variable.
This fact necessitates the application of the fuzzy clustering techniques. The fuzzy
clustering introduces the notion of fuzzy clusters and the function of membership of</p>
      <p>
        Copyright © 2020 for this paper by its authors. Use permitted under Creative
Commons License Attribution 4.0 International (CC BY 4.0).
the objects thereto, which varies in the interval [
        <xref ref-type="bibr" rid="ref1">0,1</xref>
        ] and allows to estimate the degree
of membership of the objects to the different classes. The fuzzy clustering is based on
the FCM (Fuzzy C-Means) technique, which has many modifications [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ]. The FCM
technique is based on the use of ideas and mathematical tools for fuzzy logic, and it is
widely used as applied to the tasks of medical radiological imaging analysis [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ].
However, the information capabilities of the method as applied to the analysis of
ultrasonic images have not been previously investigated.
2
      </p>
    </sec>
    <sec id="sec-2">
      <title>Analysis of published data and problem definition</title>
      <p>Recently, one of the urgent directions of the development of computer technology in
medicine is the processing of digital images: improving image quality, restoring
damaged images, recognizing individual elements. Ultrasonic (ultrasound) technique is
the most common and allows you to diagnose a large number of dangerous conditions
of human health.</p>
      <p>To date, many leading research centers and laboratories have developed many
image processing algorithms, including medical ones. When processing and analyzing
images, the following main stages are distinguished: filtering, pre-processing,
segmentation, recognition and diagnostics. The effectiveness of the subsequent stages of
image processing directly depends on the results of filtering and pre-processing.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref2">2</xref>
        ], a clustering algorithm for medical images was proposed — a clustering
algorithm using the dendrogram method. The proposed clustering method is based on
the statistical pattern recognition method - the dendrogram method. This method
consists in the fact that successively a pair of the closest points in the space of images is
replaced by one point (center of gravity). The procedure is repeated as many times as
needed until several points remain — the centers of the clusters. The dendrogram is a
specialized type of diagram. Objects on the dendrogram are arranged in hierarchical
levels to emphasize their mutual affinity. However, since this method was not
previously used for clustering images, the authors made its substantial modification to
solve the problem of distinguishing various image objects. To analyze the
effectiveness of the developed algorithm, the authors of the article compare the proposed
algorithm with the most common algorithm - the k-means clustering algorithm, which is
used in most modern systems for searching images in databases using visual content.
The advantages of the proposed method of dendrograms are: less processor time,
higher quality clustering. However, along with the advantages of the dendrogram
method, in the present work, an obvious drawback of this method is noted - the need
to use RAM for storing the basic structure of the algorithm (matrix of compositional
similarity coefficients).
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref3">3</xref>
        ], the results of segmentation of ultrasound medical images based on the
Canny contouring method are presented. The Canny algorithm consists of four stages:
image blur (the dispersion of additive noise in the image is reduced); differentiating
the blurry image and calculating the gradient values in the x direction and y direction;
not maximum suppression; threshold processing. In fact, this is a set of sequentially
applied algorithms. This approach is resistant to noise and usually gives better results
compared to other methods. But since this is just a set of algorithms, the speed of this
method is inferior to simpler operators.
      </p>
      <p>The advantage of the proposed algorithm is the minimization of the level of errors,
ensuring the finding of most boundaries; maximum accuracy of selection, that is,
ensuring a minimum distance between the detected and actual boundaries; the only
response in a place where there is only one border.</p>
      <p>The Canny algorithm has a two-level threshold for trimming redundant
information. This drawback does not allow the Canny algorithm to be used in automatic
mode, since the required participation of the user in setting the upper and lower
thresholds is required.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref4">4</xref>
        ], a method for analyzing medical images based on the Laplassian contouring
was proposed. 1st and 2nd order Laplacian - the method is focused on sharpening
graphic data. The main goal of sharpening is to emphasize small details or to improve
those details that were out of focus due to errors or imperfections in the method of
digitizing medical data. The method is based on the application of the first or second
derivatives.
      </p>
      <p>Proposed by the authors, the method has high speed image processing and
relatively low computational complexity. In addition, for this method, parallelization of
calculation processes is easily applicable. High speed, ease of calculation,
parallelization of processes gives a great advantage in the application of this method for
processing data in layers.</p>
      <p>
        The disadvantage of this method is that the value of the relative number of
erroneously determined contour pixels of this method decreases nonlinearly. A
mathematical model of noise is proposed in [
        <xref ref-type="bibr" rid="ref5">5</xref>
        ], and then the result of removing artificially
added noise using various filters is compared. The proposed noise model is essentially a
multiplicative noise that changes not 1 pixel, but a group of adjacent pixels in the
range from 0 to 9 along each axis. The authors compare the developed model with
standard multiplicative noise. Real ultrasound image is processed by averaging filter.
Multiplicative noise is applied to one copy of the resulting image filtering, and
multiplicative noise proposed by the authors is applied to another. Artificially noisy copies
of the filtered image are compared with the original image by the standard deviation
criterion (MSE).
      </p>
      <p>Based on the table of reduced MSE values for 5 different images, it is concluded
that the model proposed by the authors is more accurate than standard multiplicative
noise.</p>
      <p>It should be noted that the proposed model does not have a normal distribution, by
technical means, at the moment, it is impossible to completely suppress it, therefore,
the approach to the development of methods based on artificially created images is
theoretically poorly justified.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref6">6</xref>
        ], the authors solve the problems of modern diagnostics based on ultrasound
images, referring to their earlier studies: the human factor, specific noise and the
general low definition of the edges of objects in the image. It is noted in the materials of
the article that, based on research by Shrimadi and others, the authors of the paper
draw conclusions about the percentage error of all ultrasonic measurements, setting it
from 9% to 36%. To solve this problem, the authors developed a system. The system
presented by the authors, on the basis of the proposed method of anisotropic diffusion,
filters the noise of the ultrasound image and then, based on the method of analysis of
global and local histograms, segments the ultrasound image. However, the paper does
not provide a description of the experimental testing of the system, nor does it provide
numerical test results.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref7">7</xref>
        ], a search is made for points on the edge of an object based on polynomial
interpolation of its boundaries on the image that is filtered and filtered by a Gaussian
filter. The boundary point is the point at which both interpolation curves intersect.
The authors do not define the general principle of searching for the points of the
curves used to construct the polynomial, the sizes of the "inter-pixel interval", as well
as cases when the selected curves do not intersect, or intersect at several points. From
this we can conclude that the points should be selected so that in the selected interval
there are no sharp fluctuations in brightness caused by noise. The paper gives
numerical examples using Gaussian filters of various sizes on curves with a length of 5 to 20
pixels. But the main disadvantage of this method is the restriction on the exact
definition of the upper and lower levels. For a signal outside the edge that is not smooth and
also contains some noise, the signal level is calculated as the average of several
points. These points should be symmetrical around the reference level (input, initial)
of the intersection point. The distance and number of pixels from which the average
value is determined depending on the task.
      </p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref8">8</xref>
        ], a method for isolating contours on ultrasound images of the heart was
proposed. The proposed processing algorithm begins with smoothing the image with a 9
× 9 Gaussian filter, and normalizing the result. Then a new image is generated as
follows. For each point of the normalized image, the maximum “polar difference” is
calculated, which is defined as the difference in brightness of diametrically opposite
pixels in a variety of directions (8 neighborhoods are probably used). For the resulting
values, the maximum "polar difference" is again calculated, and it is subtracted from
the values obtained in the previous step. The result is scaled logarithmically for visual
perception. The effectiveness of the algorithm proposed by the authors is determined
on the basis of visual comparison with the result of the expert.
      </p>
      <p>The main advantage is the short processing time, since this algorithm does not
require re-smoothing the image to obtain a pronounced peak. The disadvantage of this
algorithm is that it does not give a single, precisely defined contour of the object, but
makes the boundaries of strong brightness differences more noticeable.</p>
      <p>
        Approaches to binarization of images are no less diverse than to cleaning from
noise. There are a huge number of histogram conversion algorithms, adaptive local
and global threshold filters based on various statistics and parameters. In [
        <xref ref-type="bibr" rid="ref9">9</xref>
        ], the
authors used a morphological dilatation filter to eliminate “narrow troughs” of
brightness values in the image. The authors proceed from the fact that the brightness of the
lumen pixels is characterized by a low average intensity and a low standard deviation,
the adventitious pixel brightness is characterized by a high average intensity and a
low standard deviation, and the remaining pixels must have a high average intensity
and a high standard deviation. As a result, the authors obtained a two-dimensional
histogram of the image of the carotid artery. For each pixel, we considered a 10 × 10
environment by which the mean value and standard deviation were calculated. The
mean and standard deviation were normalized from 0 to 1 and grouped into 50 classes
in the 0.02 interval. The authors in the classification according to the values of 2
parameters attributed: the arterial lumen pixels by the average brightness value to the
first class, and by the standard deviation value to the first to seventh class. Thus, the
work performs segmentation by the threshold of statistical quantities. An important
advantage of this approach is its efficiency in processing low-contrast images, as well
as images for which it is necessary to apply a variable binarization threshold.
      </p>
      <p>The disadvantage of the algorithm is the limited class of application, since the main
requirement for its use is the continuity and smoothness of the contour of the desired
object.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref10">10</xref>
        ], a method for distinguishing the contours of objects in low-contrast blurry
images was proposed. Generalized method is as follows. Two images of one scene
with varying degrees of blur are subtracted from one another. Points obtained by
subtracting the "image" at which the sign will change are considered the contours of the
objects of the original image. A comparative evaluation was carried out by the
standard deviation and peak signal-to-noise ratio. Noise and blurring of test images was
carried out in the Matlab program, using a Gaussian filter and white noise (according
to the Gaussian distribution).
      </p>
      <p>The advantage of the proposed method is that the method allows to reduce the
width of the contour line and increase the accuracy of its localization.</p>
      <p>
        The disadvantage of the proposed method is an increase in processing time and an
increase in memory, since the algorithm works with two images (input and blurry). In
[
        <xref ref-type="bibr" rid="ref11">11</xref>
        ], segmentation of ultrasound medical images based on global and local
histograms. Initially, it is proposed to establish 4 brightness ranges, each of which will
correspond to certain objects in the image: 1 - cavities filled with water; 2,3 - areas of
medium echogenicity (mainly muscle tissue, which can be both hypo-and
hyperechoic); solid inclusions (bones, calculi). The image is preliminarily filtered, then its
histogram is approximated. It does not specify what kind of low-pass filtering yields
an image, nor does it refine the method of approximating the histogram. Then,
according to a principle that is not specified, local minima are determined and threshold
values are set for the above 4 brightness ranges. Then the image is analyzed by a
window of 7x7 or 9x9 pixels, for each of which local histograms are built. Pixels are
excluded from the obtained histograms, the number of which in the window does not
exceed 5% of all pixels in the window. Then, the number of local maxima in the
obtained histograms is calculated. If more than 1 local maximum is found, the
pointcenter of the window is recognized by the contour; if the local maximum is 1, the
point-center of the window refers to the type of object to which the local maximum of
the histogram of its window belongs.
      </p>
      <p>The main advantage is that the algorithm provides high segmentation accuracy
based on the analysis of local histogram statistics, since the obtained limit line has a
less complex shape, does not contain gaps, and there are no random "holes".</p>
      <p>The disadvantage of this method is the low visual information content, which does
not make it possible to widely apply it.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref12">12</xref>
        ], the question of choosing the dimension of the mask of weight coefficients
was solved in the method of sharpening low-contrast images. The authors proposed a
method for sharpening low-contrast two-dimensional images. Differences in
brightness of one pixel wide are obtained by processing the image with a sliding window
with weights that are calculated separately for each pixel in the image. To analyze the
dependences of the accuracy of the sharpening method on the size of the weight mask
used in it, an artificial generated, noisy and blurry image was used. As a result of
experiments with masks of various sizes, it was concluded in the work that the size of
the mask must necessarily coincide with the width of the differences in image
intensities. When choosing a larger mask, the selected contours are more rounded than the
true ones and cover large areas. The advantage of the proposed approach is that it
allows you to work with low-contrast images, sharpen them, while providing a width
of the intensity difference of one pixel, and also to highlight the contours that provide
the determination of geometric parameters with high accuracy.
      </p>
      <p>The disadvantage is that when you select a smaller mask, the image becomes
grainy, erroneous contours appear.</p>
      <p>
        Another algorithmic approach to segmentation was proposed in [
        <xref ref-type="bibr" rid="ref13">13</xref>
        ], namely, an
algorithm for threshold image processing was proposed that calculates the threshold
using a special type of histogram called the “three-peak histogram of the intersection
points of the original and the smoothed image”. A smoothed image is obtained from
the original using Gaussian filters.
      </p>
      <p>An important advantage of the algorithm is that it allows you to automatically
determine the threshold value as a result of approximating a portion of a three-peak
histogram, this indicates its adaptive nature. That is, this allows you to apply it not
only for threshold processing, but also for highlighting the image outline.</p>
      <p>The disadvantage is that the principle of selecting the size of the Gaussian filter
mask is not specified, nor is the formula for obtaining the set of intersection points of
the original and the smoothed image based on which a three-peak histogram
constructed. It is proposed to set the brightness threshold value equal to the brightness
corresponding to the maximum value of the average peak of the three-peak histogram.</p>
      <p>
        An adaptive filter based on the anisotropic diffusion method was proposed in [
        <xref ref-type="bibr" rid="ref14">14</xref>
        ],
which changes the threshold value of the diffusion coefficient and automatically sets
the number of iterations depending on the image noise level. The results presented by
the authors show the effective operation of the filter for images of the noise level up
to 90% of the signal level compared to the anisotropic diffusion filter, which uses a
randomly selected threshold value and the number of iterations, which allows
optimizing the filter parameters.
      </p>
      <p>The advantage of an adaptive filter based on anisotropic diffusion using an
adaptive threshold value and a function of the number of iterations allows you to obtain an
image with preserved edges of small objects even at a noise level of 90% of the signal
amplitude. The disadvantage of the proposed method is the occurrence of
computational complexity in the context of lowering the speed of the algorithm depending on
the number of iterations.</p>
      <p>
        In [
        <xref ref-type="bibr" rid="ref15">15</xref>
        ], a genetic algorithm (GA) was proposed that automates the process of
constructing ultrasound image segmentation methods. GA finds solutions with a
predetermined processing result. A parallel genetic algorithm for finding correspondences
between the values of texture parameters of images and processing methods suitable
for them is also proposed. The result of the two aforementioned GAs is a set of image
processing sequences and the corresponding vectors of texture parameter ranges.
      </p>
      <p>The advantage of the algorithm under consideration is that it allows achieving a
segmentation quality close to expert for a given ultrasound image (90% match).</p>
      <p>The disadvantage of the parallel genetic algorithm is that it allows with a high
degree of certainty (probability ≥ 0.8) to obtain the desired processing result, provided
that the parameters of the given image are close enough to the parameters of any
image from the training sample.</p>
      <p>
        In [16], a method of secondary processing of various types of images is proposed,
which makes it possible to distinguish contours characterized by a maximum value of
the brightness difference. When visualizing ultrasound images, the bulk of the
information is contained in the differences in brightness. In this case, the psychophysical
properties of vision are such that the contrast sensitivity depends on the intensity of
the surrounding background and, therefore, the reaction of the eye to a change in
illumination is non-linear [
        <xref ref-type="bibr" rid="ref1">1</xref>
        ]. The above leads to the fact that when highlighting the
boundaries of objects and conducting geometric measurements, a systematic error
arises related to the peculiarities of human vision. This error can be eliminated using
the secondary processing of ultrasound images.
      </p>
      <p>This method can significantly reduce the systematic errors of the geometric
measurements of the heart associated with the psychophysical features of a person’s vision.</p>
      <p>However, the application of this method in medical practice leads to the fact that
for different types of images characterized by texture features and saturation, the
efficiency of border extraction can be different. In [17], the results of experimental
studies of the influence of features of human vision on the measurement error of the
geometric dimensions of objects with a blurred outline are presented. The study was
conducted in a group of 11 operators. Each participant was asked to choose the point at
which, in their opinion, the maximum value of the brightness difference is observed in
several test images. Images were offered to operators in a loop in order to average the
error value on the same image. The results of the study confirm the need to create
supporting software designed to reduce the subjectivity of expert analysis of
ultrasound images.</p>
      <p>In [18], segmentation is performed on an ultrasound image of layers of artery tissue
in order to measure their thickness. The experiments were carried out on 100
ultrasound longitudinal images of the coronary artery, the results of computer calculations
were compared with the measurements of two experts, and no significant differences
were found in the computer and expert assessment. Testing of the method was carried
out as follows. On each of the images, a region containing the artery wall was
manually selected. The selected area was filtered to eliminate noise using the filters
described in, then it was binarized, the binarized image was dilated over a 3x3 set, the
borders at the bottom of the selected area were eliminated, and a contour was drawn
using B-splines. As a result, selected tissue boundaries were obtained. Statistical
calculations of deviations in computer and expert assessment of tissue thicknesses in
various ultrasound images of the artery are also presented. However, the results of the
proposed method were not presented for less “good” cases of ultrasound of the
arteries, on which there is no such clear difference in the brightness of the layers of the
artery. As a result, selected tissue boundaries were obtained.</p>
      <p>In [19], a GA was proposed for obtaining effective threshold detectors for signal
identification, which is also applicable in image processing and machine vision
problems. GA is used to study compound operators used in the task of identifying objects.
The proposed results show that GA is one of the methods for synthesizing complex
operators that allow recognition of objects. In order to generate noise / target
classification rules and object identification rules, the GA algorithm is also used. The
algorithm is used to extract dependent features from a plurality of predefined sets of
image features. The algorithm is used to obtain automatic object recognizers. In [20], the
statement of the problem of segmentation of medical magnetic resonance images is
presented. A hybrid ant algorithm for its solution is proposed, which allows to
improve the quality and speed of image processing. In solving the problem, the
methodology of swarm intelligence, cluster analysis, the theory of evolutionary calculations,
mathematical statistics, computer modeling and programming are used. The authors
present the results of experiments obtained on the basis of data from a library of
medical MRI images. The optimal values of the parameters determining the behavior and
efficiency of the algorithm are established.</p>
      <p>Advantages of the algorithm: the comparative simplicity of the actions performed,
the possibility of a highly efficient implementation for multiprocessor architectures,
guaranteed convergence (although the convergence time is not defined).</p>
      <p>The disadvantages are mainly associated with not always optimal settings.
Meanwhile, the objects on MRI images have a high degree of complexity and
multifactoriality, which imposes high requirements on the reliability and accuracy of their
research.</p>
      <p>In [21], the implementation and analysis of a mixed algorithm for segmentation of
K-medium and ant colonies was performed, and a software system for visualizing and
testing the developed algorithm was implemented. The developed algorithm was
tested on public benchmarks (Berkeley benchmark was used). The output processed
images are obtained, as well as the values of the heuristic coefficients of the developed
algorithm.</p>
      <p>As can be seen from the results presented by the authors, the proposed method
coped quite well with the task. The advantage of the algorithm is the correct
separation of parts of the image from the background. However, as can be seen from the
presented results, in order to achieve the optimum, the method still needs the correct
selection of heuristic parameters. The study of the functions and features of modern
specialized systems for the analysis and processing of medical images for various
purposes has shown that these systems have several disadvantages. The main
drawback seems to be that most of the systems contain only a wide range of image analysis
and processing methods available to the researcher, without indicating which method
should be applied to achieve the conversion goal. In this regard, the following
problems were identified: it is impossible to guarantee the optimal (in the sense of
achieving the conversion goal) the choice of a method (or combination of methods) for
image processing, since this choice is based only on the knowledge and experience of
the user; it is impossible to search all the methods available to the researcher (and
their combinations) to achieve the best processing result, since it will be too
timeconsuming.
3</p>
    </sec>
    <sec id="sec-3">
      <title>Research method and results</title>
      <p>The result of the Fuzzy C-Means algorithm is that each pixel in an image is assigned a
vector of the function of membership to each class, with reference to which we can
make a conclusion about the nature of the object, but subject to the previous
neutralization of the influence of the noise factors. Currently, there is no single approach to
the task solution. In [22] it is suggested that Wiener filtering is used, and in [23] the
use of adaptive anisotropic filtration is proposed. The main problem is the fact that
apriori knowledge of spectral characteristics of both noise and noise-free (i.e. ideal)
images is required for optimal filtering. In this regard, the method of selective
singular decomposition of automorphic visualization (AVSSDM) [24-26] of noisy images
is of interest, because this method does not require a-priori knowledge of spectral
characteristics, but only approximate knowledge of the noise correlation interval.</p>
      <p>AVSSDM is relating to the image analysis framework methods with the size of the
square frame corresponding to the correlation interval. A multidimensional array is
formed on the basis of AVSSDM, to which a procedure for decorrelation
transformation is applied with the formation of a new array of “own” images. The first “own”
image corresponding to the highest singular value is taken as the filtered image.</p>
      <p>The experimental findings given in [27] were applicable to the analysis of
geophysical fields images. The informational capabilities of the method as applied to the
analysis of ultrasonic pulse-echo images remained unclear.</p>
      <p>Therefore, for the further improvement of efficiency of medical diagnostics, it is
necessary to investigate the information capabilities of AVSSDM and fuzzy FCM
clustering as applied to the tasks of medical ultrasonic pulse-echo image
segmentation.</p>
      <p>The fuzzy clustering is a generalized version of the traditional C-means algorithm
overcoming the constraints of group membership of the samplings. The fuzzy
clustering uses a fuzzy set in order to specify the degree of membership of the samplings to
only one group. The numerical value of the degree of membership lies in the range
[28-30], so that the sum of all values of membership of one element (pixel) to all
groups is equal to unity.</p>
      <p>The fuzzy clustering algorithm is based on the use of procedure for iterative
minimization of the objective function</p>
      <p>J (U , V )  c  N m
i1 n1uin xn  vi
2
where V={ν1,…,νc} – cluster centers; U=[uin] – matrix of order cN, where uin is the
membership function i of n entry xn, m[1,∞) – fuzzification parameter, c – assigned
cluster count. The values of the membership functions should satisfy the following
constraints:
c
i1uin  1 ,</p>
      <p>n  1,2,..., N ;</p>
      <p>N
0  n1uin  N , i  1,2,..., c .</p>
      <p>This iterative algorithm is based on the sequential computation of the following
equations:
uin </p>
      <p>1/(m1) ; i  1,2,..., c , n  1,2,..., N .
1</p>
      <p>N m
m n1uin xin , i  1,2,..., c ;</p>
      <p>1/(m1)
vi  N</p>
      <p>n1uin
 
 1 
 xn  vi 2 </p>
      <p>
c  1

j1 
 xn  v j


2 

</p>
      <p>For each pixel in the ensemble of images, the value of its membership function for
each cluster depends on the distance to the corresponding center of the cluster. The
fuzzification parameter m reduces the influence of low values of the membership
function. The advantages of the Fuzzy C-Means algorithm can include its flexibility,
which allows to work with values of membership functions. The disadvantages
include the need to assign a-priori cluster count and the theoretical uncertainty of the
choice of initial values and fuzzification parameter, resulting in the variant results of
clusterization, as well as noise sensitivity.</p>
      <p>The Figure 1 a-d shows the ultrasonic pulse-echo image of the child’s brain (a) and
the first three “own” AVSSDM images (b-d) in “space-time” coordinates. Such
echoimpulse images are usually considered as a set of signal paths (image columns). It is
apparent that the original image on the Figure 1a is noisy, whereas on the first “own”
AVSSDM image (Fig. 1b) the influence of modulation distortion is virtually
neutralized. When considering the amplitude-time slices (Fig. 2 a and b) of the 50th impulse
line (50th column of the Figures 1a and 1b), one can see removing excessive noise
from a signal (Fig. 2b) (rapidly changing amplitudes in peaks and declines (Fig. .2a)).</p>
      <p>The Figure 2 c and d shows the amplitude-time slices of the second and third
“own” AVSSDM images (Fig. 1c, d) corresponding to the noise components, and
their rejection is actually equivalent to the adaptive filtration effect, since no
assump(2)
(3)
(4)
(5)
(6)
tions were made about the spectral and statistical characteristics of the modulation
noise [31-33].</p>
      <p>The Figure 3 depicts the results of the application of the fuzzy clustering
technique for segmentation of Fig. 1a and Fig. 1b into seven classes</p>
      <p>It follows from the comparison of Fig. 1a and Fig. 3a that the application of the
fuzzy clustering technique for segmentation of the noisy image actually accomplishes
nothing, whereas its application to the filtered image (Fig. 3 b) allows to facilitate the
procedure for visual analysis and interpretation of diagnostic results e.g. by varying
the number of classes [34 - 39].
4</p>
    </sec>
    <sec id="sec-4">
      <title>Conclusion</title>
      <p>The fuzzy clustering technique is a fairly simple and convenient method for
improving the efficiency of the procedure for visual analysis of medical ultrasonic
pulseecho images. The neutralization of the influence of modulation noises is an
indispensable prerequisite for the successful application of the fuzzy clustering technique. The
method of selective singular decomposition of automorphic visualization of noisy
images is an effective method of modulation noise filtering, because this method does
not require a-priori knowledge of spectral and statistical characteristics</p>
    </sec>
    <sec id="sec-5">
      <title>Acknowledgement</title>
      <p>The work was performed within the framework of the research topic named Methods
and Intelligent methods and software for diagnostics and non-destructive quality
control of military and civilian applications (State Registration No. 0119U100360),
Department of Software Tools, National University “Zaporizhzhia Polytechnic”.
16. Lee, Y., Lee, H., Wang, W. Review: The physiological and computational approaches for
atherosclerosis treatment. International Journal of Cardiology, vol. 167(5), pp. 1664-1676
(2013).
17. El-Khatib, S., Rodzin, S., Skobtcov, Y.: Investigation of Optimal Heuristical Parameters
for Mixed ACO-k-means Segmentation Algorithm for MRI Images. Proc. of the Conf. on
Information Technologies in Science, Management, Social Sphere and Medicine, vol. 51,
pp. 216–221 (2016).
18. Kanung, G.K., Singh, N., Dash, J., Mishra, A.: Mammogram Image Segmentation Using
Hybridization of Fuzzy Clustering and Optimization Algorithms. Intelligent Computing,
Communication and Devices. Springer India, vol. 309, pp. 403–413 (2015).
19. Kanungo, G. K., Singh, N., Dash, J., Mishra, A. Mammogram image segmentation using
hybridization of fuzzy clustering and optimization algorithms. Springer India 2015. Intell
gent Computing, Communication and Devices, Advances in Intelligent Systems and
Computing, pp. 309 (2015).
20. Jebathangam, J., Purushothaman, S.: Analysis of segmentation methods for locating
microcalcification in mammogram image. International Journal of Emerging Technologies in
Engineering Research (IJETER), vol. 4, no. 9 (2016).
21. Gopi Raju, N., Nageswara Rao, P. A.: Particle swarm optimization methods for image
segmentation applied in mammography. Int. Journal of Engineering Research and
Application, vol. 3, no. 6, pp. 1572–1579 (2013). ISSN: 2248-9622.
22. Oliinyk, A.A., Subbotin, S.A.: The decision tree construction based on a stochastic search
for the neuro-fuzzy network synthesis. Optical Memory and Neural Networks (Information
Optics), vol. 24(1), 18-27 (2015). doi: 10.1007/s10559-012-9405-z.
23. Fedorchenko, I., Oliinyk, A., Stepanenko, A., Zaiko, T., Shylo, S., Svyrydenko, A.:
Development of the modified methods to train a neural network to solve the task on recognition
of road users. Eastern European Journal of Enterprise Technologies, issue 9/98, pp. 46–55
(2019). DOI: 10.15587/1729-4061.2019.164789
24. Oliinyk A., Fedorchenko I., Stepanenko A., Rud M., Goncharenko D.: Evolutionary
method for solving the traveling salesman problem. Problems of Infocommunications. Science
and Technology: 5th International Scientific-Practical Conference PICST2018, Kharkiv,
9–12 October 2018, Kharkiv, Kharkiv National University of Radioelectronics, pp.
331339 (2018). Doi: 10.1109/INFOCOMMST.2018.8632033.
25. Kotsur, M., Andrienko, P., Kotsur, I., Blyzniakov, O.: Converter for frequency-current
slip-power recovery scheme. Naukovyi Visnyk Natsionalnoho Hirnychoho Universyte-tu,
vol. 4, pp. 49-54 (2017).
26. Oliinyk, A., Fedorchenko, I., Stepanenko, A., Rud, M., Goncharenko, D.: Combinatorial
optimization problems solving based on evolutionary approach. In: 2019 15th International
Conference on the Experience of Designing and Application of CAD Systems (CADSM),
pp. 41-45 (2019). DOI: 10.1109/CADSM.2019.8779290.
27. Kotsur, M., Kotsur, I., Bezverkhnia, Y., Andrienko, D.: Increasing of thermal reliability of
a regulated induction motor in non-standard cycle time conditions. In: 2017 International
Conference on Modern Electrical and Energy Systems (MEES), vol. 2018, pp.
8891(2017). Doi: 10.1109/MEES.2017.8248960.
28. Bruijne, M.: Machine learning approaches in medical image analysis: From detection to
diagnosis. Medical Image Analysis, vol. 33, pp.94-97 (2016). Doi:
10.1016/j.media.2016.06.032.
29. Stathopoulos, S., Kalamboukis, T.: Applying latent semantic analysis to large-scale
medical image databases. Computerized Medical Imaging and Graphics, vol. 39, pp.27-34
(2015). Doi: 10.1016/j.compmedimag.2014.05.009.</p>
    </sec>
  </body>
  <back>
    <ref-list>
      <ref id="ref1">
        <mixed-citation>
          1.
          <string-name>
            <surname>Yang</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Ultrasound Common Carotid Artery Segmentation Based on Active Shape Model</article-title>
          .
          <source>Hindawi Publishing Corporation Computational and Mathematical Methods in Medicine</source>
          , vol.
          <year>2013</year>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref2">
        <mixed-citation>
          2.
          <string-name>
            <surname>Wu</surname>
            ,
            <given-names>Y.</given-names>
          </string-name>
          <article-title>H: Evolutionary Feature Construction for Ultrasound Image Processing and Its Application to Automatic Liver Disease Diagnosis</article-title>
          .
          <source>International Conference on Complex, Intelligent, and Software Intensive Systems</source>
          , pp.
          <fpage>565</fpage>
          -
          <lpage>570</lpage>
          (
          <year>2011</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref3">
        <mixed-citation>
          3.
          <string-name>
            <surname>Molinari</surname>
            ,
            <given-names>F.</given-names>
          </string-name>
          :
          <article-title>Completely automated robust edge snapper for carotid ultrasound IMT measurement on a multi-institutional database of 300 images</article-title>
          .
          <source>Medical &amp; Biological Engineering &amp; Computing</source>
          , vol.
          <volume>49</volume>
          (
          <issue>8</issue>
          ), pp.
          <fpage>935</fpage>
          -
          <lpage>945</lpage>
          .
        </mixed-citation>
      </ref>
      <ref id="ref4">
        <mixed-citation>
          4.
          <string-name>
            <surname>Sassi</surname>
            ,
            <given-names>O.B.</given-names>
          </string-name>
          :
          <article-title>Improved Spatial Gray Level Dependence Matrices For Texture Analysis</article-title>
          .
          <source>International Journal of Computer Science &amp; Information Technology (IJCSIT)</source>
          , vol.
          <volume>4</volume>
          (
          <issue>6</issue>
          ), pp.
          <fpage>209</fpage>
          -
          <lpage>219</lpage>
          (
          <year>2012</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref5">
        <mixed-citation>
          5.
          <string-name>
            <surname>Pattichis</surname>
            ,
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Loizou</surname>
            ,
            <given-names>C.P.</given-names>
          </string-name>
          :
          <article-title>Despeckle Filtering for Ultrasound Imaging and Video, Volume I: Algorithms</article-title>
          and Software, Second. Synthesis Lectures on Algorithms and Software in Engineering, pp.
          <volume>166</volume>
          (
          <year>2015</year>
          ).
          <source>ISBN 9781627057424.</source>
        </mixed-citation>
      </ref>
      <ref id="ref6">
        <mixed-citation>
          6.
          <string-name>
            <surname>Pattichis</surname>
            <given-names>C.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Loizou</surname>
            ,
            <given-names>C.P.</given-names>
          </string-name>
          :
          <article-title>Despeckle Filtering for Ultrasound Imaging and Video: Volume II: Selected Applications</article-title>
          .
          <source>Synthesis Lectures on Algorithms and Software in Engineering</source>
          , pp.
          <volume>180</volume>
          (
          <year>2015</year>
          ).
          <source>ISBN 9781627058155.</source>
        </mixed-citation>
      </ref>
      <ref id="ref7">
        <mixed-citation>
          7.
          <string-name>
            <surname>Nillesen</surname>
            ,
            <given-names>M.</given-names>
          </string-name>
          <article-title>M.: Automated Assessment of Right Ventricular Volumes</article-title>
          and
          <article-title>Function Using Three-dimensional Transesophageal Echocardiography</article-title>
          .
          <source>Ultrasound in Medicine and Biology</source>
          , pp.
          <fpage>1</fpage>
          -
          <lpage>11</lpage>
          (
          <year>2015</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref8">
        <mixed-citation>
          8.
          <string-name>
            <given-names>Harvard</given-names>
            <surname>Medical School Health Topics A-Z. Harvard</surname>
          </string-name>
          Medical School faculty members, (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref9">
        <mixed-citation>
          9.
          <string-name>
            <surname>Prema</surname>
            ,
            <given-names>T.</given-names>
          </string-name>
          <string-name>
            <surname>Badiger</surname>
            ,
            <given-names>S.</given-names>
          </string-name>
          :
          <article-title>Medical Imaging Techniques in Clinical Medicine</article-title>
          .
          <source>International Journal of Medical, Health, Pharmaceutical and Biomedical Engineering</source>
          , vol.
          <volume>8</volume>
          (
          <issue>11</issue>
          ), pp.
          <fpage>797</fpage>
          -
          <lpage>800</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref10">
        <mixed-citation>
          10.
          <string-name>
            <surname>Johnston</surname>
            ,
            <given-names>K. W.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Cronenwett</surname>
            ,
            <given-names>J.L.</given-names>
          </string-name>
          :
          <article-title>Rutherford's Vascular Surgery</article-title>
          .
          <source>Elsevier Saunders</source>
          , vol.
          <volume>2</volume>
          , pp.
          <volume>2688</volume>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref11">
        <mixed-citation>
          11.
          <string-name>
            <surname>Loizou</surname>
            ,
            <given-names>C. P.</given-names>
          </string-name>
          :
          <article-title>Despeckle filtering software toolbox for ultrasound dimaging of the common carotid artery. Computer methods and programs in biomedicine</article-title>
          , vol.
          <volume>114</volume>
          , pp.
          <fpage>109</fpage>
          -
          <lpage>124</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref12">
        <mixed-citation>
          12.
          <string-name>
            <surname>Silva</surname>
            ,
            <given-names>J.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Campilho</surname>
            ,
            <given-names>A.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Rocha</surname>
            ,
            <given-names>R.</given-names>
          </string-name>
          :
          <article-title>Automatic detection of the carotid lumen axis in Bmode ultrasound images</article-title>
          .
          <source>Comput Methods Programs Biomed</source>
          , vol.
          <volume>115</volume>
          (
          <issue>3</issue>
          ), pp.
          <fpage>110</fpage>
          -
          <lpage>118</lpage>
          (
          <year>2014</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref13">
        <mixed-citation>
          13.
          <string-name>
            <surname>Mamou</surname>
          </string-name>
          , J.:
          <source>Quantitative Ultrasound in Soft Tissues</source>
          . Springer Science, pp.
          <volume>444</volume>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref14">
        <mixed-citation>
          14.
          <string-name>
            <surname>Cong</surname>
            ,
            <given-names>Z.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Fei</surname>
            ,
            <given-names>B.</given-names>
          </string-name>
          ,
          <string-name>
            <surname>Qin</surname>
            ,
            <given-names>X.</given-names>
          </string-name>
          :
          <article-title>Automatic segmentation of right ventricular ultrasound images using sparse matrix transform and a level set</article-title>
          .
          <source>Phys Med Biol</source>
          , vol.
          <volume>58</volume>
          (
          <issue>21</issue>
          ), pp.
          <fpage>7609</fpage>
          -
          <lpage>7624</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
      <ref id="ref15">
        <mixed-citation>
          15.
          <string-name>
            <surname>Santos</surname>
            ,
            <given-names>M.A.</given-names>
          </string-name>
          :
          <article-title>A novel automatic algorithm for the segmentation of the lumen of the carotid artery in ultrasound B-mode images</article-title>
          .
          <source>Expert Systems with Applications</source>
          , vol.
          <volume>40</volume>
          , pp.
          <fpage>6570</fpage>
          -
          <lpage>6579</lpage>
          (
          <year>2013</year>
          ).
        </mixed-citation>
      </ref>
    </ref-list>
  </back>
</article>