# Swarm Optimization Methods in Microwave Imaging

Authors: Andrea Randazzo
Journal: International Journal of Microwave Science and Technology
 (2012)

---

## Abstract

Swarm intelligence denotes a class of new stochastic algorithms inspired by the collective social behavior of natural entities (e.g., birds, ants, etc.). Such approaches have been proven to be quite effective in several applicative fields, ranging from intelligent routing to image processing. In the last years, they have also been successfully applied in electromagnetics, especially for antenna synthesis, component design, and microwave imaging. In this paper, the application of swarm optimization methods to microwave imaging is discussed, and some recent imaging approaches based on such methods are critically reviewed.


---

## Body

## 1. Introduction

Microwave imaging denotes a class of noninvasive techniques for the retrieval of information about unknown conducting/dielectric objects starting from samples of the electromagnetic field they scatter when illuminated by one or more external microwave sources [1]. Such techniques have been acquiring an ever growing interest thanks to their ability of directly retrieving the distributions of the dielectric properties of targets in a safe way (i.e., with nonionizing radiation) and with quite inexpensive apparatuses. In recent years, several works concerned those systems. In particular, their ability to provide excellent diagnostic capabilities has been assessed in several areas, including civil and industrial engineering [2], nondestructive testing and evaluation (NDT&E) [3], geophysical prospecting [4], and biomedical engineering [5].The development of effective reconstruction procedures is, however, still a quite difficult task. The main difficulties are related to the underlying mathematical problem. In fact, the information about the target are contained in a complex way inside the scattered electric field. In particular, the governing equations turn out to be highly nonlinear and strongly ill posed. Consequently, inversion procedures are usually quite complex and time consuming, especially when high resolution images are needed.In the literature several approaches have been proposed for solving this problem. In particular, two main classes of algorithms can be identified. Deterministic [6–21] and stochastic strategies [22–33]. Deterministic methods are usually fast and, when converge, they produce high quality reconstructions. However, their main drawback is that they are local approaches, that is, they usually require to be started with an initial guess “near” enough to the correct solution. Otherwise, such approaches can be trapped in local minima corresponding to false solutions. Moreover, in most cases, it is difficult to introduce a priori information in the reconstruction process. On the contrary, stochastic approaches are global optimization methods, that is, they are able to find the global solution of the problem. Furthermore, thanks to their flexibility, they usually easily allow the introduction of a priori information on the unknowns. The main drawback of this class of approaches is their computational burden. However, it should be noted that with the recent growth of computational resources, it can be envisioned that future generation computers will allow faster reconstructions.Stochastic approaches are usually based on a population of trial solutions that is iteratively updated. Depending on how the population is modified at each iteration, different class of methods can be identified. The “classical” approaches have been developed in order to simulate the evolutionary processes of biological entities. Such kind of methods are now very common in several areas of electromagnetic engineering and, in particular, in nondestructive testing and imaging. Among them, the most successful ones are the genetic algorithm (GA) [34] and the differential evolution (DE) method [35].A new class of stochastic approaches has been recently introduced by mimicking the collective behavior of real entities such as particles, birds, and ants. Such approaches, usually referred as swarm methods [36, 37], have been proven to be quite effective in several applications, where they outperform standard evolutionary methods. Recently, they are becoming very popular in electromagnetics, too. Several applications, ranging from antenna synthesis to microwave component design, have been proposed in the literature. Moreover, several different approaches, such as the particle swarm optimization (PSO) [38, 39] and the ant colony algorithm (ACO) [40, 41], have been successfully applied to microwave imaging.In the present paper, the application of swarm algorithms to microwave imaging is discussed, and some of the recent literature results are critically reviewed. The paper is organized as follows. In Section2, the mathematical framework of optimization problems for microwave imaging is briefly recalled. Section 3 describes the considered swarm methods. Section 4 reviews the applications of such algorithms in the framework of microwave imaging. Finally, conclusions are drawn in Section 5.


## 2. Microwave Imaging as an OptimizationProblem

Microwave imaging approaches aim at retrieving information about unknown objects (e.g., the full distribution of dielectric properties, the shape in the case of conducting targets, the position and size of an inclusion, etc.) starting from measures of the electromagnetic field, they scatter when illuminated by a known incident electric field.Despite different equations are needed for modeling different problems (e.g., two-dimensional or three-dimensional problems, dielectric or perfectly conducting objects, and so on), it is usually possible to write a relationship between the desired unknown quantities and the measured field (at least in implicit form), that is, an equation of the form(1)F(x)=e,
where x is the unknown function describing the searched features of the object (e.g., x=ϵr when dealing with the reconstruction of the distribution of the dielectric permittivity), and e is the measured (vector or scalar) electric field, that is, the known data of the equation. Consequently, the inverse problem can be recast as an optimization problem by defining a cost function of the form
(2)f(x)=w∥e-F(x)∥22,
where w is a constant normalization parameter. In (2), the standard Euclidean 2-norm has been considered. This is often a common choice in microwave imaging and allows the use of widely studied mathematical tools for the analysis of the convergence and regularization behaviors. However, different norms have been recently proposed, too (e.g., the norm of Lp Banach spaces [42]).For illustrative purposes, the case of cylindrical dielectric targets embedded in free space is explicitly described in the following. The cylinder axis is assumed to be parallel to thez-axis. A time-harmonic (with angular frequency ω) transverse magnetic (TM) incident field is assumed. Similar expressions can be derived for other configurations (e.g., half-space and multilayer media, three-dimensional vector problems, etc.).When dealing with inhomogeneous dielectric objects embedded in an infinite and homogeneous medium, the electromagnetic inverse scattering problem is governed by the following two operator equations [1]:
(3)escatt(r)=Gext(cetot)(r),r∈Dobs,einc(r)=etot(r)-Gint(cetot)(r),r∈Dinv,
where Gext(·)(r)=-k2∫Dinv(·)g0(r,r′)dr′, r∈Dobs (being Dobs the observation domain where the scattered electric field is collected), and Gint(·)(r)=-k2∫Dinv(·)g0(r,r′)dr′, r∈Dinv (being Dinv the investigation area where the target is located), are data and state operators whose kernel is the free-space Green’s function g0 (being k=ωϵ0μ0 the free-space wavenumber), c(r)=ϵr(r)-1 is the contrast function (being ϵr the space dependent relative complex dielectric permittivity of the investigation area Dinv), einc and etot are the z-components of the incident and total electric fields inside the investigation area, and escatt is the z-component of the scattered electric field in the points of the observation domain Dobs [1].In discrete setting, the two equations in (3) can be replaced by the following matrix equations:
(4)escatt=Gextdiag(c)etot,einc=etot-Gintdiag(c)etot,
where c is an array containing the N unknown coefficients of the expansion of c in a given set of basis functions, einc and etot are arrays of dimensions N containing the coefficients of the incident and total electric fields, and escatt is an array of M elements containing the coefficients used to represent the known scattered field in the measurement domain.As in the continuous case, the equations in (4) represent an ill-conditioned nonlinear problem. Directly solving this problem is very difficult. However, as previously introduced, it is possible to recast its solution as the minimization of a proper cost function. Usually, the following functional is considered
(5)f(x)=wD∥escatt-Gextdiag(c)etot∥22+wS∥einc-etot+Gintdiag(c)etot∥22,
where wD and wS are weighting parameters, often chosen equal to wD=∥escatt∥2-2 and wS=∥einc∥2-2. In this case, the unknown array x is composed by the elements of c and etot. Clearly, other forms can be used, too. For example, the two equations can be combined together in order to obtain the following cost function:
(6)f(x)=wD∥escatt-Gextdiag(c)(I-Gintdiag(c))-1einc∥22,
which has the advantage of considering only the contrast function coefficients as unknowns. As a drawback, it needs a matrix inversion, leading to a high computational cost.The cost function can be modified by introducing multiview and multifrequency information. In this case, the target is illuminated by several incident fields (e.g., generated byS sources located all around the objects and operating at F different frequencies), and the cost function becomes
(7)f(x)=wD∑f=1F∑s=1S∥escattf,s-Gextf,sdiag(c)etotf,s∥22+wS∑f=1F∑s=1S∥eincf,s-etotf,s+Gintf,sdiag(c)etotf,s∥22,
where the indexes f and s denote that the corresponding quantities are related to the fth operating frequency and the sth illumination.


## 3. Swarm Optimization Algorithms

Swarm algorithms belong to the class of optimization methods, that is, they find the minimum of a given cost functionf(x). Similarly to other evolutionary approaches, they usually allow reaching the global optimum, thus avoiding to find a suboptimal solution corresponding to a local minima. Moreover, they are able to easily incorporate constraints on the search space. However, while evolutionary algorithms are inspired by the genetic adaptation of organisms, swarm methods exploit their collective social behavior.In order to define a general framework for swarm methods, let us consider a cost functionf:S⊆ℝG→[0,+∞) to be minimized (or maximized). For sake of simplicity, the case of bound constraints (i.e., lg≤xg≤ug, being lg and ug the lower and upper bounds on the gth component of x) is considered in the following. However, the unknown array x=[x1,x2,…,xG]t∈S⊆ℝG can be subjected to arbitrary constraints.Swarm algorithms are usually iterative methods based on a population ofP trial solutions ℘k={xp(k),p=1,…,P} (being k the iteration number) representing P agents inspired from real world (e.g., particles, birds, ants, etc.). The population is iteratively modified according to rules aimed at mimicking the natural behavior of those agents.In the framework of electromagnetic imaging, the following swarm algorithms have been mainly considered.(i)
Particle swarm optimization.(ii)
Ant colony optimization.(iii)
Artificial bee colony optimization.Apart from the standard approaches, hybridization with other methods (e.g., local optimization methods, other evolutionary approaches, machine learning algorithms, etc.) has also been proposed in the literature.In the following sections, some information about the basic versions of those methods are briefly recalled.


### 3.1. Particle Swarm Optimization (PSO)

PSO is inspired by the behavior of flocks of birds and shoals of fish [38, 39]. Each entity moves through the space of solutions with a velocity that is related to the locations and cost function values of the members of the swarm. In particular, the basic PSO algorithm [38] considers a set of p=1,…,P “particles” characterized, at each iteration k, by their positions xp(k) and velocity vp(k). If no a priori information is available, usually the algorithm is initialized by using random values, that is,
(8)xp,g(0)=lg+(ug-lg)U(0,1),vp,g(0)=lgv+(ugv-lgv)U(0,1),g=1,…,G,p=1,…,P,
where lg and ug are the lower and upper bounds for the gth component of particles’ positions, lgv and ugv are the lower and upper bounds for the gth component of the particles’ velocities, and U(0,1) is a function returning a random variable uniformly distributed between 0 and 1. Clearly, if some a priori information is available, the initialization scheme can be modified for taking it into account (e.g., in microwave imaging, when the aim is the identification of one or more localized objects, it is possible to generate random targets and use them as starting random solutions).The trial solutions are iteratively updated by using the following two-step scheme (as also shown in the flow chart in Figure1):
(9)vp(k+1)=ω(k)vp(k)+η1U(0,1)(pp-xp(k))+η2U(0,1)(g-xp(k)),xp(k+1)=xp(k)+vp(k),
where ω(k) is the inertia parameter, η1 and η2 are acceleration coefficients, and pp and g are the best solution achieved by the pth particle and by the whole swarm so far, respectively. The two acceleration terms in the velocity update can be thought as two elastic forces with random magnitude attracting the particles to the best solutions achieved so far by each entity and by the whole swarm, respectively. After the new solutions are generated the values of pp and g are updated.Figure 1
Flow chart of thePSO algorithm.The procedure is iterated until some predefined stopping criteria is fulfilled. In particular, the stopping criteria can be composed by several conditions. Some of the most commonly used are the following.(i)
Maximum number of iterations: the method is stopped when a given number of iterationkmax is reached.(ii)
Cost function threshold: the method is stopped when the value of cost function of the best trial solution falls below a given thresholdfth.(iii)
Cost function improvement threshold: the method is stopped if the improvement of the cost function of the best individual afterkth iterations is below a fixed threshold Δfth.


### 3.2. Ant Colony Optimization

Ant colony optimization (ACO) is a recently developed swarm optimization method based on the behavior of ants, and, in particular, on how they find the optimal path for reaching the food starting from their nest [40]. Initially, ants explore the area around their nest in a random manner searching for food. When a food source is found, ants evaluate it and bring back some food to the nest depositing a pheromone trail on the ground during the trip. The amount of pheromone depends on the quantity and quality of the food, and it is used to guide other ants to the food source. It has been found that the pheromone trails allow ants to find the shortest path between nest and food sources. On the basis of such behavior, ACO was initially designed for solving hard combinatorial problems, such as the traveling salesman problem [41]. Successively, the original algorithm has been extended for considering different applications. In particular, several efforts have been devoted to the extension to continuous domains, and some different versions of the algorithm have been proposed [43–45]. In the following, the ACOℝ version [46] is described. Such algorithm can be considered as composed by three functional blocks, as shown in Figure 2: initialization, solution construction, and pheromone update. The algorithm iterates until a predefined stopping criteria is satisfied.Figure 2
Flow chart of theACOℝ algorithm.In the initialization block, the initial population℘0={xp(0),p=1,…,P} is created by generating P random trial solutions xp(0)=[xp,1(0),…,xp,G(0)]t. Similarly to the PSO algorithm, when no a priori information is available and assuming boundary constraints, the gth components of the pth trial solution are generated by sampling a uniform distribution as defined in (8). In this case, too, if additional a priori information is available, it can be included in the initialization procedure.The solution construction block is used to generate new trial solutions. In particular, at thekth iteration, Q new solutions x~q(k), q=1,…,Q are generated by sampling a set of Gaussian mixture probability density functions. In particular, the probability density function of the gth component is built as
(10)Gg(k)(x)=∑p=1P‍wp1sp,g(k)2πe-(x-mp,g(k))2/2(sk,p,g(k))2,
where the weighting parameters wp, p=1,…,P, are given by
(11)wp=1ρP2πe-(p-1)2/2ρ2P2,p=1,…,P,
and the mean, mp,g(k), and standard deviation, sp,g(k), of the Gaussian kernels are given by
(12)mp,g(k)=xp,g(k),p=1,…,P,g=1,…,G,sp,g(k)=ξ∑i=1P‍|xp,g(k)-xi,g(k)|P-1,p=1,…,P,g=1,…,G.In the previous equations,ρ is the pheromone evaporation rate, and ξ is a scaling parameter. Such quantities are key parameters of the ACO algorithm [46], and the best choice for their values depends on the specific application.The pheromone update block is responsible of the population update. In particular, two mechanism are used to build the new population℘k+1 of the (k+1)th iteration:(i)
positive update: a temporary population is created by adding newly created solutions to the solution archive. A pool ofP+Q trial solutions ℘~k+1={xk,p,p=1,…,P}⋃{x~k,q,q=1,…,Q} is then obtained,(ii)
negative update: the worstQ elements of ℘~k+1 (i.e., those characterized by the higher values of the cost function) are discarded. The remaining P solutions constitute the new population ℘k+1.In order to speed up this stage, usually the solution archive is ordered on the basis of the cost function, that is,f(xk,1)≤f(xk,2)≤⋯≤f(xk,P). The two previous blocks are iteratively applied since some predefined stopping criteria is fulfilled. In this case, too, the stopping criteria can be a combination of several different conditions.


### 3.3. Artificial Bee Colony Optimization

The artificial bee colony algorithm is a swarm optimization method introduced by Karaboga [47] and Karaboga and Basturk [48] and inspired by the foraging behavior of honey bees. In particular, ABC is based on the model proposed in [49], which defines two main self-organizing and collective intelligence behaviors: recruitment of foragers for working on rich food sources and abandonment of poor sources. In ABC, a colony of artificial bees search for rich artificial food sources (representing solutions of the considered optimization problem) by iteratively employing the following two strategies: movement towards better solutions by means of a neighbor search mechanism and abandonment of poor solutions that cannot be further improved.In the following, an artificial colony, composed byC entities, is considered. Bees can be classified in three groups: employed (i.e., already working on a known food source), onlooker (i.e., waiting for a food source), and scout (i.e., randomly searching for new sources) bees. The trial solutions are the food sources associated with the employed bees. Let us denote by P the number of employed bees (corresponding to the number of trial solutions). Often, such number is set equal to P=C/2, and the number of onlooker bees is chosen equal to P. A block diagram of the method is shown in Figure 3.Figure 3
Flow chart of theABC algorithm.In the initialization phase, theP trial solution are randomly generated, for example, by using a relationship similar to that in (8). The cost function of all trial solutions is evaluated and stored. In the employed bee phase, the employed bees modify their trial solutions according to
(13)xp,g(k+1)=xp,g(k)+U(0,1)(xp,g(k)-xh,g(k)),
where g and h are randomly chosen.In the onlooker bee phase, each onlooker bee select a food source in a probabilistic way. In particular, the probability of choosing thepth food source is given by
(14)pp=ffit(xp(k))∑p=1Pffit(xp(k)),
where ffit is a fitness function defined as ffit(x)=1/(f(x)+1). The food sources selected by the onlooker bees are further improved by using (13).If a food source is not improved after a predefined number of iterationsKlim (food source limit), that is, f(xp(k))≥f(xp(k-q)) for q=1,…,Klim, it is abandoned by its employed bee. Such bee becomes a scout bee and starts searching for a new food source randomly. Consequently, in the scout bee phase, employed bees working on abandoned sources generate new trial solution in a random way (i.e., by using the same relationship used in the initialization phase). After a new solution is found, the scout bees are reverted to employed bees, and they start working on the new food sources. Clearly, at the beginning of the optimization process, no scout bees are present and consequently, for the first iterations, only the solutions initially discovered in the initialization phase are processed.


## 3.1. Particle Swarm Optimization (PSO)

PSO is inspired by the behavior of flocks of birds and shoals of fish [38, 39]. Each entity moves through the space of solutions with a velocity that is related to the locations and cost function values of the members of the swarm. In particular, the basic PSO algorithm [38] considers a set of p=1,…,P “particles” characterized, at each iteration k, by their positions xp(k) and velocity vp(k). If no a priori information is available, usually the algorithm is initialized by using random values, that is,
(8)xp,g(0)=lg+(ug-lg)U(0,1),vp,g(0)=lgv+(ugv-lgv)U(0,1),g=1,…,G,p=1,…,P,
where lg and ug are the lower and upper bounds for the gth component of particles’ positions, lgv and ugv are the lower and upper bounds for the gth component of the particles’ velocities, and U(0,1) is a function returning a random variable uniformly distributed between 0 and 1. Clearly, if some a priori information is available, the initialization scheme can be modified for taking it into account (e.g., in microwave imaging, when the aim is the identification of one or more localized objects, it is possible to generate random targets and use them as starting random solutions).The trial solutions are iteratively updated by using the following two-step scheme (as also shown in the flow chart in Figure1):
(9)vp(k+1)=ω(k)vp(k)+η1U(0,1)(pp-xp(k))+η2U(0,1)(g-xp(k)),xp(k+1)=xp(k)+vp(k),
where ω(k) is the inertia parameter, η1 and η2 are acceleration coefficients, and pp and g are the best solution achieved by the pth particle and by the whole swarm so far, respectively. The two acceleration terms in the velocity update can be thought as two elastic forces with random magnitude attracting the particles to the best solutions achieved so far by each entity and by the whole swarm, respectively. After the new solutions are generated the values of pp and g are updated.Figure 1
Flow chart of thePSO algorithm.The procedure is iterated until some predefined stopping criteria is fulfilled. In particular, the stopping criteria can be composed by several conditions. Some of the most commonly used are the following.(i)
Maximum number of iterations: the method is stopped when a given number of iterationkmax is reached.(ii)
Cost function threshold: the method is stopped when the value of cost function of the best trial solution falls below a given thresholdfth.(iii)
Cost function improvement threshold: the method is stopped if the improvement of the cost function of the best individual afterkth iterations is below a fixed threshold Δfth.


## 3.2. Ant Colony Optimization

Ant colony optimization (ACO) is a recently developed swarm optimization method based on the behavior of ants, and, in particular, on how they find the optimal path for reaching the food starting from their nest [40]. Initially, ants explore the area around their nest in a random manner searching for food. When a food source is found, ants evaluate it and bring back some food to the nest depositing a pheromone trail on the ground during the trip. The amount of pheromone depends on the quantity and quality of the food, and it is used to guide other ants to the food source. It has been found that the pheromone trails allow ants to find the shortest path between nest and food sources. On the basis of such behavior, ACO was initially designed for solving hard combinatorial problems, such as the traveling salesman problem [41]. Successively, the original algorithm has been extended for considering different applications. In particular, several efforts have been devoted to the extension to continuous domains, and some different versions of the algorithm have been proposed [43–45]. In the following, the ACOℝ version [46] is described. Such algorithm can be considered as composed by three functional blocks, as shown in Figure 2: initialization, solution construction, and pheromone update. The algorithm iterates until a predefined stopping criteria is satisfied.Figure 2
Flow chart of theACOℝ algorithm.In the initialization block, the initial population℘0={xp(0),p=1,…,P} is created by generating P random trial solutions xp(0)=[xp,1(0),…,xp,G(0)]t. Similarly to the PSO algorithm, when no a priori information is available and assuming boundary constraints, the gth components of the pth trial solution are generated by sampling a uniform distribution as defined in (8). In this case, too, if additional a priori information is available, it can be included in the initialization procedure.The solution construction block is used to generate new trial solutions. In particular, at thekth iteration, Q new solutions x~q(k), q=1,…,Q are generated by sampling a set of Gaussian mixture probability density functions. In particular, the probability density function of the gth component is built as
(10)Gg(k)(x)=∑p=1P‍wp1sp,g(k)2πe-(x-mp,g(k))2/2(sk,p,g(k))2,
where the weighting parameters wp, p=1,…,P, are given by
(11)wp=1ρP2πe-(p-1)2/2ρ2P2,p=1,…,P,
and the mean, mp,g(k), and standard deviation, sp,g(k), of the Gaussian kernels are given by
(12)mp,g(k)=xp,g(k),p=1,…,P,g=1,…,G,sp,g(k)=ξ∑i=1P‍|xp,g(k)-xi,g(k)|P-1,p=1,…,P,g=1,…,G.In the previous equations,ρ is the pheromone evaporation rate, and ξ is a scaling parameter. Such quantities are key parameters of the ACO algorithm [46], and the best choice for their values depends on the specific application.The pheromone update block is responsible of the population update. In particular, two mechanism are used to build the new population℘k+1 of the (k+1)th iteration:(i)
positive update: a temporary population is created by adding newly created solutions to the solution archive. A pool ofP+Q trial solutions ℘~k+1={xk,p,p=1,…,P}⋃{x~k,q,q=1,…,Q} is then obtained,(ii)
negative update: the worstQ elements of ℘~k+1 (i.e., those characterized by the higher values of the cost function) are discarded. The remaining P solutions constitute the new population ℘k+1.In order to speed up this stage, usually the solution archive is ordered on the basis of the cost function, that is,f(xk,1)≤f(xk,2)≤⋯≤f(xk,P). The two previous blocks are iteratively applied since some predefined stopping criteria is fulfilled. In this case, too, the stopping criteria can be a combination of several different conditions.


## 3.3. Artificial Bee Colony Optimization

The artificial bee colony algorithm is a swarm optimization method introduced by Karaboga [47] and Karaboga and Basturk [48] and inspired by the foraging behavior of honey bees. In particular, ABC is based on the model proposed in [49], which defines two main self-organizing and collective intelligence behaviors: recruitment of foragers for working on rich food sources and abandonment of poor sources. In ABC, a colony of artificial bees search for rich artificial food sources (representing solutions of the considered optimization problem) by iteratively employing the following two strategies: movement towards better solutions by means of a neighbor search mechanism and abandonment of poor solutions that cannot be further improved.In the following, an artificial colony, composed byC entities, is considered. Bees can be classified in three groups: employed (i.e., already working on a known food source), onlooker (i.e., waiting for a food source), and scout (i.e., randomly searching for new sources) bees. The trial solutions are the food sources associated with the employed bees. Let us denote by P the number of employed bees (corresponding to the number of trial solutions). Often, such number is set equal to P=C/2, and the number of onlooker bees is chosen equal to P. A block diagram of the method is shown in Figure 3.Figure 3
Flow chart of theABC algorithm.In the initialization phase, theP trial solution are randomly generated, for example, by using a relationship similar to that in (8). The cost function of all trial solutions is evaluated and stored. In the employed bee phase, the employed bees modify their trial solutions according to
(13)xp,g(k+1)=xp,g(k)+U(0,1)(xp,g(k)-xh,g(k)),
where g and h are randomly chosen.In the onlooker bee phase, each onlooker bee select a food source in a probabilistic way. In particular, the probability of choosing thepth food source is given by
(14)pp=ffit(xp(k))∑p=1Pffit(xp(k)),
where ffit is a fitness function defined as ffit(x)=1/(f(x)+1). The food sources selected by the onlooker bees are further improved by using (13).If a food source is not improved after a predefined number of iterationsKlim (food source limit), that is, f(xp(k))≥f(xp(k-q)) for q=1,…,Klim, it is abandoned by its employed bee. Such bee becomes a scout bee and starts searching for a new food source randomly. Consequently, in the scout bee phase, employed bees working on abandoned sources generate new trial solution in a random way (i.e., by using the same relationship used in the initialization phase). After a new solution is found, the scout bees are reverted to employed bees, and they start working on the new food sources. Clearly, at the beginning of the optimization process, no scout bees are present and consequently, for the first iterations, only the solutions initially discovered in the initialization phase are processed.


## 4. Application of Swarm Optimization to Microwave Imaging

Swarm algorithms have been used for solving different types of microwave imaging problems. In particular, two-dimensional and three-dimensional dielectric and PEC targets have been considered in the literature. Moreover, both single-frequency, multifrequency, and time-domain incident radiation has been used. An overview of papers proposing swarm optimization methods in microwave imaging is given in Table1. Specific details are provided in the following sections.Table 1
Overview of swarm algorithms applications in microwave imaging.
Object type
Material
Illumination type
Method
Reference
1D profile
Dielectric
Time domain
PSO
[50–52]
2D cylinders
Dielectric
Time domain
PSO
[53, 54]
2D cylinders
Dielectric
Single frequency
PSO
[55–58]
2D cylinders
PEC
Single frequency
PSO
[59, 60]
3D objects
Dielectric
Single frequency
PSO
[58, 61]
3D objects
Dielectric
Single frequency
μPSO
[62]
2D cylinders
Dielectric
Time domain
APSO
[63]
2D cylinders
PEC
Time domain
APSO
[64, 65]
2D cylinders
PEC
Singe frequency
PSO-SA
[66]
2D cylinders
Dielectric
Single frequency
HSPO
[67]
2D cylinders
Dielectric
Single frequency
PSO-RBF
[68]
2D cylinders
Dielectric
Single frequency
IMSA-PSO
[69–73]
3D objects
Dielectric
Single frequency
IMSA-PSO
[74, 75]
2D cylinders
Dielectric
Single frequency
ACO
[28, 76]
2D cylinders
Dielectric
Single frequency
ACO-LSM
[77]
3D objects
Dielectric
Single frequency
ACO-LSM
[78, 79]
3D objects
Dielectric
Time domain
ABC
[80]
2D cylinders
Dielectric
Single frequency
ABC
This paper


### 4.1. PSO

PSO has been extensively used in electromagnetic problems [39]. Several works proposed PSO, also with enhancement to the standard algorithm, for microwave imaging problems. In [50, 51], the reconstruction of one-dimensional dielectric profiles, illuminated by a Gaussian pulse (plane waves are assumed), is considered. Both noiseless and noisy data have been used. Two size of the populations are considered equal and twice the number of unknowns. The acceleration coefficients of the PSO are η1=η2=0.5, and the inertia parameters is initially set to 1 and decreased linearly to 0.7 in 500 iterations (maximum number of iterations). A comparison with the DE is also provided. In the reported numerical results, the PSO shows slightly better convergence rate, but the DE allows obtaining a more precise reconstruction. A similar approach is proposed in [52], too.In [53], the authors propose the use of the PSO for the localization of dielectric circular cylinders under a TM time-domain formulation. The unknowns are the position, size, and dielectric properties of the target. Good reconstructions are obtained by using five particles.In [54], the reconstruction of homogeneous dielectric cylinders is considered. The external shape of the cylinder is described by using a spline representation. The unknowns are the parameters of the spline and the dielectric permittivity. The proposed approach is able to reconstruct such quantities with errors less than about 7% (shape) and 3% (permittivity) for signal-to-noise ratio above 10 dB.In [55], the reconstruction of the distribution of the relative dielectric permittivity of 2D dielectric structures is concerned. A single-frequency multiview TM illumination is considered. The cost function defined in (7) is used. A population size of twice the unknowns number is used; the acceleration coefficients are randomly generated in the range [0,2], and the inertia parameter is set equal to 0.4. The reported results show that the PSO is able to provide good reconstruction of the considered objects. Moreover, comparisons with a genetic algorithm and with the conjugate gradient (CG) method are provided. For the considered case, PSO outperforms both GA and CG (the mean relative reconstruction errors are 1.7%, 1.8%, and 5.7%,  resp.). A similar approach is proposed in [56], too, providing similar conclusions. In [57], the PSO is used to find the parameters of a crack in the outer layer of a two-layer dielectric cylinder. The direct solver is based on a finite difference frequency Domain (FDFD) scheme. Good agreements are obtained for several positions of the cracks. The same approach is also applied in [58] to the detection of a tumor inside a model of breast. Both 2D and 3D simplified configurations are assumed. The unknowns are the position and shape of the malignant inclusion.The reconstruction of the shape of PEC cylinders is considered in [59, 60]. A cubic-spline-based representation is used for defining the shape of the cylinder. The target is illuminated by TM waves impinging from 7 directions uniformly distributed around it and, for each illumination, the scattered field is collected in 32 points. Single-frequency operation is assumed. The maximum radius is approximately 1.5λ (being λ the wavelength in the background medium). Under such assumptions, good reconstructions have been obtained by considering 10 control points for the splines, η1=η2=0.5, and population sizes ranging from 10 to 60. The inertia is initialized to 1.0 and decreased to 0.7 after 200 iterations (maximum number of iterations). A comparison with DE is also performed. Both algorithms provide good results, although DE, for the considered cases, usually produces lower values of the cost function and of the reconstruction error.In [61], 3D objects are reconstructed. The measurement configuration simulates those employed for breast cancer detection, that is, four circular arrays of 36 antennas are located around a cubic investigation domain. In this reference, the PSO-based approach is able to retrieve a small centered inclusions.In [62], a μPSO algorithm is proposed for tackling the high dimensionality of the microwave imaging problems. Satisfactory reconstructions are obtained in the reconstruction of a 3D model of breast with a malignant inclusion by using only 5 particles. Comparisons with the standard PSO (with swarm size of 25 particles) show that the new approach is able to obtain comparable results, but with a smaller population size.In [63], an asynchronous PSO (APSO) is proposed for the reconstruction of the location, shape, and permittivity of a dielectric cylinder illuminated by TM pulses. The direct solver is based on a finite difference time-domain (FDTD) scheme. The main difference with respect to the standard PSO is the population updating mechanism. In the APSO, the new best position is computed after every particle update, and it is used in the following updates immediately. Consequently, the swarm reacts more quickly. The same approach is used in [64, 65] for the identification of the shape of PEC cylinders in free space and inside a dielectric slab. In such cases, the APSO is able to correctly identify the shape of the targets with an error of about 5% (in presence of noise on the data) and it shows better performance with respect to standard PSO.Some hybrid versions of the PSO have also been proposed in the literature. In [66], PSO is combined with simulated annealing (SA) for exploiting the exploration properties of PSO and the exploitation ability of SA. The reported results concern the reconstruction of the external shape of a cylinder under multiview TM illumination and show that the hybrid approach allows reaching better results than the standard one (reconstructions errors were 0.0014 and 0.072,  resp.). In [67], a hybrid PSO (HPSO) is used for reconstructing dielectric cylinders under TM illuminations. The difference from the standard PSO is mainly related to the use of a particle swarm crossover for enhancing trial solutions. In [68], the PSO is combined with radial basis function (RBF) networks. In particular, the RBF is used to obtain an estimate of the dielectric properties of two-dimensional cylinders under single-frequency TM illumination. The PSO is employed to efficiently training the RBF starting from a set of simulated configurations.In [69–71], an integrated multiscaling approach (IMSA) relying upon PSO is presented. In such technique, the investigation area is iteratively reconstructed at different scales. At every scale, the PSO is used to obtain a quantitative reconstruction of the distribution of the dielectric properties. A clustering techniques is used to identify the scatterers, and then the investigation area is refined in order to focus only on the objects. The proposed approach is tested by using several different two-dimensional targets illuminated by monochromatic TM incident waves. The reported results confirm that the integrated strategy is able to outperform its standard counterpart. Moreover, the new approach is also able to provide better results than those obtained by using the CG and GA (both in their standard form and inserted in a IMSA framework). As an example, a square hollow cylinder (ϵr=1.5, sides Lin=0.8λ and Lout=1.6λ) contained in an investigation area of side 2.4λ and illuminated by plane waves impinging from 4 different directions (with the electric field measured in 21 points located on a circumference of radius 1.8λ for every view) is efficiently reconstructed in 4 steps. At each step, the PSO is executed with 20 particles, η1=η2=2.0, ω(k)=0.4, and kmax=2000 (the mesh used to discretized the investigation area has size 36). The obtained reconstruction error is 3.8%. For the same configuration, the multiscaling version of CG provides an error of 4.6%. An experimental validation with the Fresnel data [81] is also provided, confirming the capabilities of the approach when working in real environments. In [72, 73], the IMSA-PSO is tested on phaseless data (i.e., amplitude-only scattered field measures are available). In this case, too, good agreement with the actual profile are obtained. In [74, 75], the IMSA-PSO is also extended to the reconstruction of 3D objects.


### 4.2. Ant Colony Optimization-Based Imaging Algorithms

ACO has been used in several electromagnetic applications, in particular for design of antennas and microwave components [82, 83], for the allocation of base stations [84], and for microwave imaging. Concerning electromagnetic imaging, ACO has been applied both to the reconstruction of 2D cylindrical structures and 3D objects.In [76], the ACO algorithm is applied to the reconstruction of multiple dielectric lossless cylinders under TM illumination. A two-dimensional formulation is assumed. Two representations of the dielectric properties are considered, pixelbased and splinebased. The number of unknowns, in the two cases, are 256 and 169, respectively. The population size is set equal to the number of unknowns and, at every iteration, Q=P/10 new solutions are created. The parameters of the ACO are set equal to ρ=0.1 and ξ=0.85 (according to the suggestions available in the literature). The iterations are stopped when a maximum number of iterations, kmax=2000, is reached. The provided results show that in all cases the ACO-based approach is able to correctly reconstruct the targets with a mean relative error lower than 5%. Moreover, as expected, the spline representation allows for a faster convergence (thanks to the lower number of unknowns).In [28], ACO is applied to a similar configuration (two-dimensional imaging of a two-layer dielectric cylinders). A comparison with GA and DE is provided. The reconstruction results show that in the considered case ACO “reaches a more accurate reconstruction than those obtained by the other two methods” and “requires a lower number of function evaluations.”In [77], a hybrid method is proposed for two-dimensional imaging of multiple homogeneous dielectric targets. First, the shape of the targets is estimated by using the linear sampling method (LSM), which is a fast and efficient qualitative approach able to retrieve the support of the scatterers starting from the scattered field data. After this step, the ACO is applied to retrieve the values of the relative dielectric permittivity and the electric conductivity. In this way, the ACO only needs to find a few parameters (two for every objects identified by the LSM). The approach has been extended to three-dimensional targets in [78, 79], where the full vector problem with arbitrary homogeneous dielectric targets is taken into account. Single and multiple dielectric objects are reconstructed with good accuracy and with low computational efforts. As an example, for a rectangular parallelepiped of dimensions 0.66λ×0.33λ×0.5λ, after the support estimation, mean relative reconstruction errors equal to 2.5% (dielectric permittivity) and 7% (electric conductivity) are obtained with 45.6 cost function evaluations (mean value).


### 4.3. Artificial Bee Colony-Based Imaging Algorithms

The ABC has been applied for breast cancer detection in [80]. A full three-dimensional configuration is considered. The breast is modeled both by using simplified structures and a realistic MRI-based phantom. ABC is employed for the reconstruction of the position, size, and dielectric properties of the malignant inclusion (supposed of spherical size and homogeneous). The problem size is thus G=6. A population of P=10 bees is employed. In the reported test cases, ABC is able to reach the convergence in less than 30 iteration. Moreover, the algorithm is able to estimate the position and size of the tumor with satisfactory accuracy (e.g., in the simplified case, the localization error is less than 10% and the size estimation error is less than 1 mm). A comparison with PSO, DE, and GA is also provided. In the considered case, ABC outperforms the other approaches (GA provided the worst results PSO and DE gave similar results).An example of use of the ABC for the reconstruction of the full distribution of the dielectric properties of unknown objects is reported in the following. Cylindrical scatterers under TM illumination are considered. A multiview configuration is assumed, that is,S=8 line-current sources uniformly spaced on a circumference of radius 1.5λ are sequentially used for illuminating the objects. The scattered electric field is collected in 51 points uniformly spaced on an angular sector of 270 degrees on the same circumference (positioned such that the source lies in the sector without measurement probes). The investigation domain is a square area of side 2λ. The input data (scattered electric field) are computed by using a numerical code based on the method of moments [85] with pulse basis and Dirac’s delta weighting functions. A finer mesh is used for solving the forward problem in order to avoid inverse crimes. Moreover, the computed electric field is corrupted with a Gaussian noise with zero mean value and variance corresponding to a signal-to-noise ratio of 25 dB. In the inversion procedure, the investigation area is discretized into N=256 square subdomains, and the unknowns are the values of the relative dielectric permittivity in such cells. Two separate targets are located in the investigation area: a circular cylinder (radius 0.25λ, center (-0.25λ,0.25λ), relative dielectric permittivity 2.0) and a square cylinder (side 0.5λ, center (0.25λ,-0.5λ), relative dielectric permittivity 1.5). The cost function (6), in its multiview version, is employed. The parameters of the ABC have been set equal to as follows: C=50, P=25, Klim=100, and kmax=2000.Some examples of the behavior of the cost function versus the iteration number are shown in Figure4, which reports five different runs of the algorithms. As can be seen, in all cases, the method converges to a value of about 0.15. The corresponding mean relative reconstruction error is 3%. The same configuration has been considered in [76] and solved by using an ACO-based inversion approach. In the results provided in that paper, a mean relative error of about 4.5% is achieved with the ACO-based approach. Finally, an example of the reconstructed distribution of the dielectric properties obtained by the ABC approach is shown in Figure 5. As can be seen, the two objects are correctly shaped, and their permittivity is identified with quite good accuracy.Figure 4
Cost function versus the iteration number. ABC-based inversion algorithm.Figure 5
Example of reconstructed distribution of the dielectric permittivity. ABC-based inversion algorithm.


## 4.1. PSO

PSO has been extensively used in electromagnetic problems [39]. Several works proposed PSO, also with enhancement to the standard algorithm, for microwave imaging problems. In [50, 51], the reconstruction of one-dimensional dielectric profiles, illuminated by a Gaussian pulse (plane waves are assumed), is considered. Both noiseless and noisy data have been used. Two size of the populations are considered equal and twice the number of unknowns. The acceleration coefficients of the PSO are η1=η2=0.5, and the inertia parameters is initially set to 1 and decreased linearly to 0.7 in 500 iterations (maximum number of iterations). A comparison with the DE is also provided. In the reported numerical results, the PSO shows slightly better convergence rate, but the DE allows obtaining a more precise reconstruction. A similar approach is proposed in [52], too.In [53], the authors propose the use of the PSO for the localization of dielectric circular cylinders under a TM time-domain formulation. The unknowns are the position, size, and dielectric properties of the target. Good reconstructions are obtained by using five particles.In [54], the reconstruction of homogeneous dielectric cylinders is considered. The external shape of the cylinder is described by using a spline representation. The unknowns are the parameters of the spline and the dielectric permittivity. The proposed approach is able to reconstruct such quantities with errors less than about 7% (shape) and 3% (permittivity) for signal-to-noise ratio above 10 dB.In [55], the reconstruction of the distribution of the relative dielectric permittivity of 2D dielectric structures is concerned. A single-frequency multiview TM illumination is considered. The cost function defined in (7) is used. A population size of twice the unknowns number is used; the acceleration coefficients are randomly generated in the range [0,2], and the inertia parameter is set equal to 0.4. The reported results show that the PSO is able to provide good reconstruction of the considered objects. Moreover, comparisons with a genetic algorithm and with the conjugate gradient (CG) method are provided. For the considered case, PSO outperforms both GA and CG (the mean relative reconstruction errors are 1.7%, 1.8%, and 5.7%,  resp.). A similar approach is proposed in [56], too, providing similar conclusions. In [57], the PSO is used to find the parameters of a crack in the outer layer of a two-layer dielectric cylinder. The direct solver is based on a finite difference frequency Domain (FDFD) scheme. Good agreements are obtained for several positions of the cracks. The same approach is also applied in [58] to the detection of a tumor inside a model of breast. Both 2D and 3D simplified configurations are assumed. The unknowns are the position and shape of the malignant inclusion.The reconstruction of the shape of PEC cylinders is considered in [59, 60]. A cubic-spline-based representation is used for defining the shape of the cylinder. The target is illuminated by TM waves impinging from 7 directions uniformly distributed around it and, for each illumination, the scattered field is collected in 32 points. Single-frequency operation is assumed. The maximum radius is approximately 1.5λ (being λ the wavelength in the background medium). Under such assumptions, good reconstructions have been obtained by considering 10 control points for the splines, η1=η2=0.5, and population sizes ranging from 10 to 60. The inertia is initialized to 1.0 and decreased to 0.7 after 200 iterations (maximum number of iterations). A comparison with DE is also performed. Both algorithms provide good results, although DE, for the considered cases, usually produces lower values of the cost function and of the reconstruction error.In [61], 3D objects are reconstructed. The measurement configuration simulates those employed for breast cancer detection, that is, four circular arrays of 36 antennas are located around a cubic investigation domain. In this reference, the PSO-based approach is able to retrieve a small centered inclusions.In [62], a μPSO algorithm is proposed for tackling the high dimensionality of the microwave imaging problems. Satisfactory reconstructions are obtained in the reconstruction of a 3D model of breast with a malignant inclusion by using only 5 particles. Comparisons with the standard PSO (with swarm size of 25 particles) show that the new approach is able to obtain comparable results, but with a smaller population size.In [63], an asynchronous PSO (APSO) is proposed for the reconstruction of the location, shape, and permittivity of a dielectric cylinder illuminated by TM pulses. The direct solver is based on a finite difference time-domain (FDTD) scheme. The main difference with respect to the standard PSO is the population updating mechanism. In the APSO, the new best position is computed after every particle update, and it is used in the following updates immediately. Consequently, the swarm reacts more quickly. The same approach is used in [64, 65] for the identification of the shape of PEC cylinders in free space and inside a dielectric slab. In such cases, the APSO is able to correctly identify the shape of the targets with an error of about 5% (in presence of noise on the data) and it shows better performance with respect to standard PSO.Some hybrid versions of the PSO have also been proposed in the literature. In [66], PSO is combined with simulated annealing (SA) for exploiting the exploration properties of PSO and the exploitation ability of SA. The reported results concern the reconstruction of the external shape of a cylinder under multiview TM illumination and show that the hybrid approach allows reaching better results than the standard one (reconstructions errors were 0.0014 and 0.072,  resp.). In [67], a hybrid PSO (HPSO) is used for reconstructing dielectric cylinders under TM illuminations. The difference from the standard PSO is mainly related to the use of a particle swarm crossover for enhancing trial solutions. In [68], the PSO is combined with radial basis function (RBF) networks. In particular, the RBF is used to obtain an estimate of the dielectric properties of two-dimensional cylinders under single-frequency TM illumination. The PSO is employed to efficiently training the RBF starting from a set of simulated configurations.In [69–71], an integrated multiscaling approach (IMSA) relying upon PSO is presented. In such technique, the investigation area is iteratively reconstructed at different scales. At every scale, the PSO is used to obtain a quantitative reconstruction of the distribution of the dielectric properties. A clustering techniques is used to identify the scatterers, and then the investigation area is refined in order to focus only on the objects. The proposed approach is tested by using several different two-dimensional targets illuminated by monochromatic TM incident waves. The reported results confirm that the integrated strategy is able to outperform its standard counterpart. Moreover, the new approach is also able to provide better results than those obtained by using the CG and GA (both in their standard form and inserted in a IMSA framework). As an example, a square hollow cylinder (ϵr=1.5, sides Lin=0.8λ and Lout=1.6λ) contained in an investigation area of side 2.4λ and illuminated by plane waves impinging from 4 different directions (with the electric field measured in 21 points located on a circumference of radius 1.8λ for every view) is efficiently reconstructed in 4 steps. At each step, the PSO is executed with 20 particles, η1=η2=2.0, ω(k)=0.4, and kmax=2000 (the mesh used to discretized the investigation area has size 36). The obtained reconstruction error is 3.8%. For the same configuration, the multiscaling version of CG provides an error of 4.6%. An experimental validation with the Fresnel data [81] is also provided, confirming the capabilities of the approach when working in real environments. In [72, 73], the IMSA-PSO is tested on phaseless data (i.e., amplitude-only scattered field measures are available). In this case, too, good agreement with the actual profile are obtained. In [74, 75], the IMSA-PSO is also extended to the reconstruction of 3D objects.


## 4.2. Ant Colony Optimization-Based Imaging Algorithms

ACO has been used in several electromagnetic applications, in particular for design of antennas and microwave components [82, 83], for the allocation of base stations [84], and for microwave imaging. Concerning electromagnetic imaging, ACO has been applied both to the reconstruction of 2D cylindrical structures and 3D objects.In [76], the ACO algorithm is applied to the reconstruction of multiple dielectric lossless cylinders under TM illumination. A two-dimensional formulation is assumed. Two representations of the dielectric properties are considered, pixelbased and splinebased. The number of unknowns, in the two cases, are 256 and 169, respectively. The population size is set equal to the number of unknowns and, at every iteration, Q=P/10 new solutions are created. The parameters of the ACO are set equal to ρ=0.1 and ξ=0.85 (according to the suggestions available in the literature). The iterations are stopped when a maximum number of iterations, kmax=2000, is reached. The provided results show that in all cases the ACO-based approach is able to correctly reconstruct the targets with a mean relative error lower than 5%. Moreover, as expected, the spline representation allows for a faster convergence (thanks to the lower number of unknowns).In [28], ACO is applied to a similar configuration (two-dimensional imaging of a two-layer dielectric cylinders). A comparison with GA and DE is provided. The reconstruction results show that in the considered case ACO “reaches a more accurate reconstruction than those obtained by the other two methods” and “requires a lower number of function evaluations.”In [77], a hybrid method is proposed for two-dimensional imaging of multiple homogeneous dielectric targets. First, the shape of the targets is estimated by using the linear sampling method (LSM), which is a fast and efficient qualitative approach able to retrieve the support of the scatterers starting from the scattered field data. After this step, the ACO is applied to retrieve the values of the relative dielectric permittivity and the electric conductivity. In this way, the ACO only needs to find a few parameters (two for every objects identified by the LSM). The approach has been extended to three-dimensional targets in [78, 79], where the full vector problem with arbitrary homogeneous dielectric targets is taken into account. Single and multiple dielectric objects are reconstructed with good accuracy and with low computational efforts. As an example, for a rectangular parallelepiped of dimensions 0.66λ×0.33λ×0.5λ, after the support estimation, mean relative reconstruction errors equal to 2.5% (dielectric permittivity) and 7% (electric conductivity) are obtained with 45.6 cost function evaluations (mean value).


## 4.3. Artificial Bee Colony-Based Imaging Algorithms

The ABC has been applied for breast cancer detection in [80]. A full three-dimensional configuration is considered. The breast is modeled both by using simplified structures and a realistic MRI-based phantom. ABC is employed for the reconstruction of the position, size, and dielectric properties of the malignant inclusion (supposed of spherical size and homogeneous). The problem size is thus G=6. A population of P=10 bees is employed. In the reported test cases, ABC is able to reach the convergence in less than 30 iteration. Moreover, the algorithm is able to estimate the position and size of the tumor with satisfactory accuracy (e.g., in the simplified case, the localization error is less than 10% and the size estimation error is less than 1 mm). A comparison with PSO, DE, and GA is also provided. In the considered case, ABC outperforms the other approaches (GA provided the worst results PSO and DE gave similar results).An example of use of the ABC for the reconstruction of the full distribution of the dielectric properties of unknown objects is reported in the following. Cylindrical scatterers under TM illumination are considered. A multiview configuration is assumed, that is,S=8 line-current sources uniformly spaced on a circumference of radius 1.5λ are sequentially used for illuminating the objects. The scattered electric field is collected in 51 points uniformly spaced on an angular sector of 270 degrees on the same circumference (positioned such that the source lies in the sector without measurement probes). The investigation domain is a square area of side 2λ. The input data (scattered electric field) are computed by using a numerical code based on the method of moments [85] with pulse basis and Dirac’s delta weighting functions. A finer mesh is used for solving the forward problem in order to avoid inverse crimes. Moreover, the computed electric field is corrupted with a Gaussian noise with zero mean value and variance corresponding to a signal-to-noise ratio of 25 dB. In the inversion procedure, the investigation area is discretized into N=256 square subdomains, and the unknowns are the values of the relative dielectric permittivity in such cells. Two separate targets are located in the investigation area: a circular cylinder (radius 0.25λ, center (-0.25λ,0.25λ), relative dielectric permittivity 2.0) and a square cylinder (side 0.5λ, center (0.25λ,-0.5λ), relative dielectric permittivity 1.5). The cost function (6), in its multiview version, is employed. The parameters of the ABC have been set equal to as follows: C=50, P=25, Klim=100, and kmax=2000.Some examples of the behavior of the cost function versus the iteration number are shown in Figure4, which reports five different runs of the algorithms. As can be seen, in all cases, the method converges to a value of about 0.15. The corresponding mean relative reconstruction error is 3%. The same configuration has been considered in [76] and solved by using an ACO-based inversion approach. In the results provided in that paper, a mean relative error of about 4.5% is achieved with the ACO-based approach. Finally, an example of the reconstructed distribution of the dielectric properties obtained by the ABC approach is shown in Figure 5. As can be seen, the two objects are correctly shaped, and their permittivity is identified with quite good accuracy.Figure 4
Cost function versus the iteration number. ABC-based inversion algorithm.Figure 5
Example of reconstructed distribution of the dielectric permittivity. ABC-based inversion algorithm.


## 5. Conclusions

In this paper, the application of swarm intelligence algorithms, that is, stochastic algorithms inspired by the collective social behavior of agents (e.g., birds, ants, etc.), to the solution of microwave imaging problem has been reviewed. Such approaches have been proven to be very effective in several applications. The results available in the literature confirm the suitability of this class of optimization methods for microwave imaging, too.



---

*Source: 491713-2012-10-24.xml*