Admissible Perturbation of Demicontractive Operators within Ant Algorithms for Medical Images Edge Detection

Abstract

Nowadays, demicontractive operators in terms of admissible perturbation are used to solve difficult tasks. The current research uses several demicontractive operators in order to enhance the quality of the edge detection results when using ant-based algorithms. Two new operators are introduced, $\chi$-operator and $KH$-operator, the latter one is a Krasnoselskij admissible perturbation of a demicontractive operator. In order to test the efficiency of the new operators, a comparison is made with a trigonometric operator. Ant Colony Optimization (ACO) is the solver chosen for the images edge detection problem. Demicontractive operators in terms of admissible perturbation are used during the construction phase of the matrix of ants artificial pheromone, namely the edge information of an image. The conclusions of statistical analysis on the results shows a positive influence of proposed operators for image edge detection of medical images.

1. Introduction

Admissible perturbation theory is a direction of research which unifies the main aspects of iterative approximating. The theory of admissible perturbations of an operator introduced by Rus in [1] opens a new direction of research and unifies major aspects of the iterative approximation of fixed point for single valued self operators. The admissible perturbation of a nonlinear operator was studied in detail in [2] and extended for the generalized pseudocontractive operators by Berinde, Khan and Fukhar-ud-din [3].

Demicontractive operators are still a very recent object of study [4,5,6]. In [6] the authors solve split common fixed point problems for demicontractive mappings in Hilbert spaces as an extension of the Halpern type algorithm from [7] to a viscosity iteration. In [8] are shown the approximated solutions for variational inequalities in terms of admissible perturbations. Furthermore, in [9] a weak convergence theorem in Hilbert spaces using admissible perturbations is introduced. A standard approach for admissible perturbations of demicontractive operators is provided in [10].

Difficult problems needs highly-efficient algorithms to obtain feasible results. Nowadays, Ant Colony Optimization (ACO) [11,12] is a successfully probabilistic technique for solving complex problems as routing, assignment, scheduling problems [13,14,15,16] and some generalized versions as [17,18,19]. In 2019 Chowdhury did a case study with drones for wildlife surveillance [20].

In order to solve the image edge detection, a problem of identifying discontinuities in brightness and therefore enhancing edges of objects in an image, different ant algorithms were involved during last years. From the most recent ones, Shi et al. [21] with Canny Edge and ACO, make use of a fuzzy triangle membership function in the neighborhood of the gray value, and Mahalingam and Subramoniam [22] used ACO for an optimized object detection and tracking.

In [23] ACO is implemented by the memristor crossbar array and uses parallel computing; threshold generates edges as mean of the final conductance matrix; the results are comparatively better than neural networks models and while using Sobel operator. A recent survey on nature-inspired medical image in biomedical data [24] includes the behavior of swarm intelligence. In order to combine capabilities of several independent exact or meta-heuristics, an integrative cooperative search framework was proposed in [25].

As a part of swarm intelligence heuristics categories, ant colonies algorithms are inspired by real ants’ behavior in finding shortest paths while using as information the trail of a chemical substance, deposited by ants, called pheromone. Ants pheromone sensitivity was proposed in [26,27]; in order to process medical images, Pintea and Ticala proposed the first theoretical ACO approach involving pheromone sensitivity in [28].

A heuristic value making use of two admissible perturbation operators was applied in [29] to a demicontractive mapping in order to solve the image edge detection problem with ACO. The current work makes a step forward and uses admissible perturbations of demicontractive mappings as test functions. The agents have different roles in the image edge detection: some are explorers, and others exploiters; in time they change their roles based on the environment dynamics.

The paper is further structured as follows. Methodologies including a preview of the theory of admissible perturbations and the Ant Colony Optimization are described in Section 2. The case study of the ACO algorithm for edge detection in medical images, with all processes involved from initialization to the decision follows in Section 3. Further, Section 4 includes: experimental results and comparison of ant-based algorithms and operators involved, the representation of results medical images, statistical analysis and final discussions. The paper concludes in a positive manner, as the proposals of the current work obtain promising results for the tested set of the medical images.

2. Methodology

2.1. Theory of Admissible Perturbations

Rus proposed in [1] the theory of admissible perturbations of an operator and succeeded to unify iterative approximation of fixed point for single valued self operators. The following are the main related definitions and specific examples.

Definition 1.

The operator $T:C\to C$ is demicontractive if there exists a constant $k<1$ such that, for each fixed point p of T and each $x\in C$, the following inequality is true [30].

$${\parallel Tx-p\parallel }^2\le {\parallel x-p\parallel }^2+k{\parallel x-Tx\parallel }^2.$$

(1)

The constant k from Equation (1) is called the contraction coefficient.

Example 1.

An example of demicontractive mapping is $T:\mathbb{R}\to \mathbb{R}$, defined by Equation (2) as in [31].

$$Tx=\left\{\begin{array}{c}\frac{2}{3}xsin\frac{1}{x},\mathrm{if}x\ne 0\hfill \\ 0,\mathrm{if}x=0\hfill \end{array}\right.$$

(2)

Definition 2.

Let X be a nonempty set. A mapping $G:X\times X\to X$ is called admissible if it satisfies the following two conditions, (A1) with Equation (3) and (A2) with Equation (4) as in [1].

$$\left(A1\right):G(x,x)=x,for allx\in X;$$

(3)

$$\left(A2\right):G(x,y)=x,impliesy=x.$$

(4)

Definition 3.

Let $f:X\to X$ be an operator. Then the admissible mapping $f_G:X\to X$ defined by Equation (5) is called the admissible perturbation of f.

$$f_G\left(x\right):=G\left(x,f\left(x\right)\right),$$

(5)

Definition 4.

Let $f:X\to X$ be a nonlinear operator and $G:X\times X\to X$ be an admissible mapping. The iterative algorithm ${\left\{x_n\right\}}_{n\in \mathbb{N}}$ given by Equation (6), as in [1], is called the Krasnoselskij algorithm corresponding to G, or the GK-algorithm.

$$\left\{\begin{array}{c}{x}_0\in X,\hfill \\ x_{n+1}=G\left(x_n,f\left(x_n\right)\right),n\ge 0\hfill \end{array}\right.$$

(6)

Example 2.

Let $\left(V,+,\mathbb{R}\right)$ be a real vector space, $X\subset V$ a convex subset, $\lambda \in \left(0,1\right)$ and $G:X\times X\to X$ defined by Equation (7), then $f_G$ is an admissible perturbation of f, further called the Krasnoselskij perturbation of f.

$$G\left(x,y\right):=\left(1-\lambda \right)x+\lambda y,x,y\in X.$$

(7)

Example 3.

Let $\left(V,+,\mathbb{R}\right)$ be a real vector space, $X\subset V$ a convex subset, $\chi :X\times X\to \left(0,1\right)$ a mapping and $G:X\times X\to X$ defined by Equation (8), then $f_G$ is an admissible perturbation of f.

$$G\left(x,y\right):=\left(1-\chi \left(x,y\right)\right)x+\chi \left(x,y\right)y.$$

(8)

We recall that an admissible perturbation is an operator with the properties (A1) Equation (3) and (A2) Equation (4). Admissible perturbations are thoroughly studied in respect to different types of operators.

2.2. Ant Colony Optimization for Edge Detection Using Proposed Operators

From meta-heuristics we choose Ant Colony Optimization (ACO) which keeps high standards for solving complex problems including images edge detection. ACO builds optimal solution of the target problem using artificial ants while searching the best path in the search space. The ants deposits pheromones during this process. The “memory” of ants is the artificial pheromone trail, which is updated during the search process.

The quality of a partial solution is given by the amount of pheromone modified along the way. The global solution is found after all ants, based on the previous pheromone information, are guided to more promising regions in the search space. For the K ants engaged in the search, in a space $\mathcal{X}$, with $M_1\times M_2$ nodes, ACO is summarized as follows:

• Initiate all K ants, the pheromone matrix, ${\tau }^{\left(0\right)}$.
• For every solution construction step index $n=1:N$

  –

  For every ant $k=1:K$ successively move the k-th ant for L movement steps based on the transition probability matrix, Equation (9).

  –

  Update the pheromone matrix ${\tau }^{\left(n\right)}$, Equation (10).

• Make the solution decision based on the final pheromone matrix ${\tau }^{\left(N\right)}$.

There are two fundamental problems which ACO has to solve, and will be further detailed.

• At first, ACO will build the transition probability matrix. $p^{\left(n\right)}$.
• Secondly, ACO will update the pheromone matrix ${\tau }^{\left(n\right)}$.

At the n-th construction step, k-th ant moves from node I to J (Equation (9)), where ${\tau }_{IJ}$ is the pheromone value of arc (I,J).

The heuristic value of (I,J) with the same value for all the N construction steps is ${\eta }_{IJ}$; the weighting factors for pheromone and heuristic are $\alpha$, $\beta$, and the neighborhood of node I is ${\mathsf{\Omega }}_I$.

$$p_{IJ}^n=\frac{{\left({\tau }_{IJ}^{(n-1)}\right)}^{\alpha }{\left({\eta }_{IJ}\right)}^{\beta }}{{\sum }_{J\in {\mathsf{\Omega }}_I}{\left({\tau }_{IJ}^{(n-1)}\right)}^{\alpha }{\left({\eta }_{IJ}\right)}^{\beta }},\mathrm{if}J\in {\mathsf{\Omega }}_I,$$

(9)

The information in the pheromone matrix is updated twice during ACO. First, a local update is performed after each ant moves within each construction step, the second, global update is made after the move of all K ants within each construction step.

Local update. The local update of the pheromone matrix is performed after the move of the k-th ant in the n-th construction step as in Equation (10).

$${\tau }_{IJ}^{\left(n\right)}=\left\{\begin{array}{cc}{\tau }_{IJ}^{n-1}·\left(1-\rho \right)+\rho ·{\Delta }_{IJ},\hfill & \mathrm{if}(I,J)\mathrm{is}\mathrm{on}\hfill \\ \hfill & \mathrm{the}\mathrm{best}\mathrm{tour},\hfill \\ {\tau }_{IJ}^{(n-1)},\hfill & \mathrm{otherwise}.\hfill \end{array}\right.$$

(10)

In Equation (10) $\rho$ is the pheromone evaporation rate, ${\Delta }_{IJ}$ is the quantity of pheromone laid on edge $(I,J)$. The best tour is considered the best tour found in a current step of an iteration.

Global Update. The exploration is enhanced to further obtain better global and best solution. The global update uses Equation (11). The pheromone decay coefficient is denoted by $\psi$.

$${\tau }^{\left(n\right)}=(1-\psi )·{\tau }^{(n-1)}+\psi ·{\tau }^{\left(0\right)},$$

(11)

3. Case Study: ACO Algorithm for Edge Detection in Medical Images

The proposed edge detection algorithm uses artificial ants which move in a bi-dimensional image in order to build the pheromone matrix, each element of the matrix represents the edge information for every pixel in the image. The new ant technique starts with the initialization process, runs for N construction steps when it creates and updates pheromone matrix and at last, performs the decision process to determine the edge.

—

Initialization process. In the initialization process, all the K ants are placed randomly on the image. Each pixel of the image is viewed as a node. Each value of the initial pheromone matrix ${\tau }^{\left(0\right)}$ is set to a constant ${\tau }^{init}$. A constant value L used to define the number of movement steps in the construction process is defined.

—

Construction process. At the n-th construction step, one ant is randomly chosen from all K ants, this ant will be consecutively moving for L movement steps. The ant will move from node i to j based on the transition probability, Equation (9).

There are two main aspects in the construction process.

• First, it is the issue of establishing the heuristic ${\eta }_{ij}$ from Equation (9).
• The second issue is to establish the domain in which one ant found in node $(l,m)$ can make moves, i.e., ${\mathsf{\Omega }}_{l,m}$ from Equation (9).

The connectivity domain is based on the matrix notation of neighbors nodes: the 8-connectivity domain, the eight closest neighbors of $I_{ij}$ gray square from Figure 1. We propose to compute the heuristic value based on the local statistic of the pixel $(i,j)$, Equation (12) where $Z={\displaystyle \sum _{i=1}^{M_1}}{\displaystyle \sum _{j=1}^{M_2}}{V}_c\left(I_{i,j}\right)$, is a normalization factor, $I_{i,j}$ is the intensity value of the pixel at the position $(i,j)$ from the image, the function $V_c\left(I_{i,j}\right)$ is a function which processes $c{I}_{i,j}$ called “clique”, defined in [32], as in Figure 1.

$${\eta }_{i,j}=\frac{1}{Z}·V_c\left(I_{i,j}\right),$$

(12)

The value of $V_c\left(I_{i,j}\right)$ depends on the variation of image’s intensity values on $c{I}_{i,j}$. More specifically, the value of $V_c\left(I_{i,j}\right)$ at the pixel $I_{i,j}$ is considered in Equation (13).

$$\begin{array}{cc}{V}_c\left(I_{i,j}\right)=\hfill & f\left(\left|I_{i-2,j-1}-I_{i+2,j+1}\right|+\left|I_{i-2,j+1}-I_{i+2,j-1}\right|\right.\hfill \\ \hfill & +\left|I_{i-1,j-2}-I_{i+1,j+2}\right|+\left|I_{i-1,j-1}-I_{i+1,j+1}\right|\hfill \\ \hfill & +\left|I_{i-1,j}-I_{i+1,j}\right|+\left|I_{i-1,j+1}-I_{i+1,j-1}\right|\hfill \\ \hfill & \left.+\left|I_{i-1,j+2}-I_{i+1,j-2}\right|+\left|I_{i,j-1}-I_{i,j+1}\right|\right).\hfill \end{array}$$

(13)

As prerequisites for operators, $\chi :\mathbb{R}\times \mathbb{R}⟶[0,1)$, is defined as in Equation (14) and $y:\mathbb{R}\to \mathbb{R}$ as in Equation (15).

$$\chi (x,y)=\frac{x^2·y^2}{(1+x^2)·(1+y^2)}.$$

(14)

$$y\left(x\right)=\left\{\begin{array}{c}\frac{2}{3}xsin\frac{1}{x},\mathrm{if}x\ne 0\hfill \\ 0,\mathrm{if}x=0\hfill \end{array}\right.$$

(15)

The considered operators for $f(·)$ from Equation (13) are illustrated in Figure 2 and further detailed.

$$f\left(x\right)=\left\{\begin{array}{cc}sin\left(\frac{\pi x}{2\lambda }\right),\hfill & 0\le x\le \lambda ;\hfill \\ 0,\hfill & \mathrm{otherwise}.\hfill \end{array}\right.$$

(16)

$$f\left(x\right)=\left\{\begin{array}{cc}(1-\lambda )·x+\lambda ·\frac{2}{3}xsin\frac{1}{x}\hfill & \mathrm{if}x\ne 0;\hfill \\ 0,\hfill & \mathrm{if}x=0.\hfill \end{array}\right.$$

(17)

$$f\left(x\right)=\left\{\begin{array}{cc}\left(1-\chi \left(x,y\left(x\right)\right)\right)·x+\chi \left(x,y\left(x\right)\right)·y\left(x\right)\hfill & \mathrm{if}x\ne 0\hfill \\ 0\hfill & \mathrm{if}x=0.\hfill \end{array}\right.$$

(18)

The parameter $\lambda$ from Equation (16) adjusts the shape of the operators. This operator is the same test function used in [32]. The research on admissible perturbations of demicontractive operators, by using Krasnoselskij perturbation on the demicontractive mapping Equation (2), lead us to define the $KH$-operator, Equation (17). The proposed $KH$-operator can be used in the same way as the other operators when constructing heuristic value during ACO.

Another proposal included is the admissible perturbation operator, the $Chi$, $\chi$-operator based on [1] and described by Equation (7). The $Chi$, $\chi$-operator from Equation (18) is an admissible perturbation operator obtained by applying the function $\chi$ defined by Equation (14), to the demicontractive mapping, Equation (2).

—

Update process. The algorithm uses two update operations for the pheromone matrix.

–

First update is made as in Equation (10) after each ant moves within each construction step. Each element of the matrix is updated.

–

The second update is made after the movement of all ants within each construction step, Equation (11).

—

Decision process

At this point of the algorithm, a binary decision is made for each pixel in order to establish if it is edge or not, by applying a threshold T on the final pheromone matrix ${\tau }^{\left(N\right)}$. The threshold is computed as stated in [33].

4. Results and Discussion

The section includes description of the experiments in Section 4.1, representation of the results in Section 4.2, statistical analysis Section 4.3 and related discussions about ant-based algorithm.

4.1. Experimental Results

Experimental work for is further described in detail.

A.

Preliminary settings for Ant Colony Optimization:

—

Data-set. The experimental data set includes the medical images for the experiments as in Figure 3. The current study makes use of four medical images, as shows Figure 3. The medical image Brain CT with 128 × 128 resolution could be provided for free by request from authors for scientific reasons; Hand X-ray from [34] with original 225 × 225 resolution was reduced to 128 × 128 resolution to make a valid comparison with the other images, as Head CT from [35] has originally also 128 × 128 resolution; these two medical-images are available online for free.

—

Software used. The ACO-based edge detection approach was implemented using MatLab and run on a computer with an AMD Rysen 5 2500U, 2 GHz processor.

—

Parameter settings for Ant Colony Optimization.

The majority of parameters values used are based on [32]. Figure 4 illustrates the way we tested the parameters: $\beta \in \{0.1,0.6,1.2\}$ and $\rho \in \{0.1,0.6,1.0\}$ for $Sin$, $KH$ and $Chi$ operators on all data-set of medical images: Brain CT, Hand X-ray and Head CT. As a result we used the best parameters found during tests.

—

Parameters considered for Ant Colony Optimization

–

the number of ants is based on the dimension of the image $K=\lfloor \sqrt{M1\times M2}\rfloor$: where ⌊ and ⌋ are the left and right rounded values to the nearest integers less than or equal to x; for the particular case of the $128\times 128$ image resolution, 128 is the number of ants.

–

each ant makes 300 movements in each of the $L=100$ steps; therefore in the particular case of 128 ants, 38,400 movements are made during each of the L steps.

–

the connectivity neighborhood $\mathsf{\Sigma }=8$ is based on the ant’s movement range in Equation (9);

–

the value of each component of the pheromone matrix, ${\tau }_{init}=0.0001$;

–

weighting factors of the pheromone information, $\alpha =1$ and heuristic information, $\beta =0.1$, in Equation (9);

–

the evaporation rate, $\rho =0.1$, Equation (10);

–

the pheromone decay coefficient, $\psi$ = 0.001, Equation (11);

–

the adjusting factor of the functions, $\lambda =10$, as in Equations (16)–(18);

–

tolerance $\epsilon =0.1$ used in the decision process of the proposed method.

–

termination criteria is given by reaching the maximal number of steps L.

B.

Numerical results and running time:

—

ACO Numerical Results.

Table 1. The standardized value of correctly identified edges with values in the unit interval for the medical images Brain CT, Hand X-ray and Head CT with every considered operator on ACO.

Operator/Image	Brain_CT	Hand X-ray	Head_CT
Ant Colony Optimization
Sin	0.2933	0.2942	0.3302
KH	0.2932	0.2539	0.2832
Chi	0.2782	0.2450	0.2788

shows that more pixels are correctly identified on the edge of the image, more precise is the edge detection of an medical image. The results are decimal scaled, and are standard values of correctly identified edges with values in the unit interval for an accurate visibility.

—

ACO Running Time. Based on the computing characteristics, the average running time was 4500 seconds for each medical image. Furthermore, the running time increases as Denoise Convolutional Neural Network (DnCNN) to enhance each image as follows.

C.

Software:

—

We make use of the Tian et al. [32] software from the 2008 CEC conference, an image edge detection using Ant Colony Optimization MatLab software [36]. The existing software was at first modified for the use of the operators from [32] and described in Equation (16) (Sin-operator) and the proposed operators given in Equation (17) (KH-operator) and Equation (18) (Chi-operator).

—

Denoise Convolutional Neural Network (DnCNN) a pretrained network [37] is used to improve the quality of the resulting medical image. Image Processing Toolbox and Deep Learning Toolbox from Matlab are used.

4.2. Representation of Results

The following is the representation of medical images provided with identified edges on the data-set of medical images using each considered operator from Equations (16)–(18). Figure 5, Figure 6 and Figure 7 show respectively the Brain CT, Hand X-ray and Head CT results of all considered operators when using Ant Colony Optimization before and after Denoise Convolutional Neural Network (DnCNN).

4.3. Discussions

The main purpose of the current work is to study how the proposed operators influence the results of the edge detection problem; thus, the impact during ACO solver is discussed. Furthermore the influence of using the Denoise Convolutional Neural Network (DnCNN) for the quality of the final medical images is presented.

Table 2. Statistical values of the standardized value of correctly identified edges, with values in the unit interval, based on Table 1: mean, median, standard deviation (Std.Dev.), maximal (High), minimal (Low) and Average Absolute Deviation from median (Ave.Dev.) of overall results for ACO considering operators Sin Equation (16), proposed KH-operator Equation (17) and proposed operator $Chi$-operator Equation (18).

		Mean	Std.Dev.	High	Low	Median	Ave.Dev.
ACO-Sin		0.3059	0.0211	0.3302	0.2933	0.2942	0.0123
ACO-KH		0.2768	0.0204	0.2932	0.2539	0.2832	0.0131
ACO-Chi		0.2673	0.0193	0.2788	0.2450	0.2782	0.0113

with the results of ACO and its specified operators when image edge detection problem is solved shows the following: the highest values for means, $0.3059$ is obtained for $Sin$ and the same for the lowest best value $0.2933$. Nevertheless, $ACO$ for edge detection shows its robustness as with the $Chi$ operator provides the lowest values for deviations results: standard deviations $0.0193$ for the average absolute deviation from median $0.0113$. The $KH$ operator shows stability during testing.

In order to compare ACO operators’ results we make use of a similarity test. The higher similarity is shown by the smaller value. As similarity, the norm of images differences, the norm() function from MatLab is considered.

Table 3. Similarity comparison of the standardized value of correctly identified edges for medical images (Brain CT, Hand X-ray and Head CT with Sin, KH and Chi operators on ACO.

Operator/Image	Brain_CT	Hand X-ray	Head_CT
Ant Colony Optimization
$\mathit{KH}-\mathit{Chi}$	0.1047	0.0726	0.0900
$\mathit{Sin}-\mathit{Chi}$	0.1090	0.1773	0.1774
$\mathit{Sin}-\mathit{KH}$	0.0867	0.1640	0.1745

and Figure 8 illustrate similarities when comparing the similarities between ACO operators: Sin, KH and Chi.

The most similar operators are $Chi$ and $KH$-operator with the two lowest values out of the three medical image results, $0.0726$ for Hand X-ray and $0.0900$ for Head CT. Less similar operators are $Sin$ and $KH$.

Table 4. Similarity comparison of the standardized value of correctly identified edges for medical images (Brain CT, Hand X-ray and Head CT with Sin, KH and Chi operators on ACO, before and after Denoise Convolutional Neural Network (DnCNN).

Operator/Image	Brain_CT	Hand X-ray	Head_CT
Ant Colony Optimization
$\mathit{Sin}-\mathit{Sin}\_\mathit{DnCNN}$	0.0670	0.0748	0.0808
$\mathit{KH}-\mathit{KH}\_\mathit{DnCNN}$	0.0668	0.0762	0.0719
$\mathit{Chi}-\mathit{Chi}\_\mathit{DnCNN}$	0.0612	0.0770	0.0712

and Figure 9 illustrate the medical image similarities within the initial ACO methods and after using the pretrained Denoise Convolutional Neural Network (DnCNN) [37].

The most efficient operator, $Chi$, obtains the least changed image after DnCNN for Brain CT, $0.0612$ value. The less efficient in this case was the $Sin$ operator for Head CT, $0.0808$.

Table 5. Similarity ranks comparison of the standardized value of correctly identified edges with values in the unit interval for the medical images (Brain CT, Hand X-ray and Head CT with Sin, KH and Chi operators on Ant Colony Optimization using the norm diference, before and after using Denoise Convolutional Neural Network (DnCNN) [37].

Similarities Rank
ACO		ACO with DnCNN
$\mathit{KH}$, $\mathit{Chi}$	rank 1: most similar	$Chi-Chi\_DnCNN$	rank 1: most similar
$\mathit{Sin}$, $\mathit{Chi}$	rank 2	$KH-KH\_DnCNN$	rank 2
$\mathit{Sin}$, $\mathit{KH}$	rank 3: less similar	$Sin-Sin\_DnCNN$	rank 3: less similar

shows the ranks of operators when using Ant Colony Optimization to identify medical edges and the most similar are $KH$ and $Chi$.

As the results suggested, the main advantages of the operators are the following:

• The $Chi$ operator has the results similar with the $Sin$ operator, so between $Chi$ and $KH$, $Chi$ operator performs better for image edge detection with ACO (Table 5).
• $Chi$ operator provides the best results for standard deviations and the average absolute deviation from median when compared with $Sin$ and $KH$ operators The $KH$ operator keeps its stability during all the tests including with DnCNN (Table 2 and Table 5).
• The best paper results is that the newly introduced operators $KH$ and $Chi$ preserve better the edges of the medical image during the image denoising process with DnCNN (Table 5).

Overall, the medical images edges obtained with the considered ACO operators shows reliability.

5. Conclusions

The health of people will be always a priority. In order to find out faster and with a high precision bone injuries within medical images, frequently made through X-rays, different types of software were implemented. Here, the meta-heuristic Ant Colony Optimization, ACO is used to identify edges of medical images. The current study introduces two new operators. One of the proposals is the $KH$-operator based on the Krasnoselskij admissible perturbation of a demicontractive operator. The other one, is the admissible perturbation operator, the $Chi$, $\chi$-operator obtained by applying a function $\chi$ to an demicontractive mapping as specified by Rus in his work [1].

The use of different operators enhance the solution of the image edge detection problem. The motivation of the study was to see the behavior of demicontractive operators in edge detection algorithms, in particular with ACO. The results show the beneficent stability of the ACO operators and especially when using Denoise Convolutional Neural Network, DnCNN, to obtain medical images. An analysis is provided for both perspectives based on the imaged edge detection problem results: from operators perspective for ACO with and without using DnCNN denoise technique.

The promising results of the proposed operators could further empower other techniques, in order to identify better solutions not only just for medical image edge detection but as well as for other similar difficult problems. The study hopefully opens new directions for further studies in this area.