# Advanced F-Transform-Based Image Fusion

Authors: Marek Vajgl; Irina Perfilieva; Petra Hod'áková
Journal: Advances in Fuzzy Systems
 (2012)

---

## Abstract

We propose to use the modern technique of the F-transform in order to show that it can be successfully applied to the image fusion. We remind two working algorithms (SA—the simple algorithm, and CA—the complete algorithm) which are based on the F-transform and discuss, how they can be improved. We propose a new algorithm (ESA—the enhanced simple algorithm) which is effective in time and free of frequently encountered shortcomings.


---

## Body

## 1. Introduction

Image processing is nowadays one of the most interesting research areas where traditional and new approaches are applied together and bring significant advantages. In this contribution, we consider the image fusion, which is one of many subjects of image processing. The image fusion aims at integration of complementary distorted multisensor, multitemporal, and/or multiview scenes into one new image which contains the “best” parts of each scene. Thus, the main problem in the area of image fusion is to find the less undistorted scene for every given pixel.A local focus measure is traditionally used for selection of an undistorted scene. The scene which maximizes the focus measure is selected. Usually, the focus measure is a measure of high frequency occurrences in the image spectrum. This measure is used when a source of distortion is connected with blurring which suppresses high frequencies in an image. In this case, it is desirable that a focus measure decreases with an increase of blurring.There are various fusion methodologies currently in use. The methodologies differ according to different mathematical fields: statistical methods (e.g., using aggregation operators, such as the MinMax method [1]), estimation theory [2], fuzzy methods (see [3, 4]), optimization methods (e.g., neural networks, genetic algorithms [5]), and multiscale decomposition methods, which incorporate various transforms, for example, discrete wavelet transforms (for a classification of these methods see [6], a classification of wavelet-based image fusion methods can be found in [7], and for applications for blurred and unregistered images, refer to [8]).In our approach, we propose to use the modern technique of the F-transform and to show that it can be successfully applied to the image fusion. Our previous attempts have been reported in [9–12]. The original motivation for the F-transform (a short name for the fuzzy transform) came from fuzzy modeling [13, 14]. Similarly to traditional transforms (Fourier and wavelet), the F-transform performs a transformation of an original universe of functions into a universe of their “skeleton models” (vectors of F-transform components) in which further computation is easier. Moreover, sometimes, the F-transform can be more efficient than its counterparts. The F-transform proves to be a successful methodology with various applications: image compression and reconstruction [15, 16], edge detection [17, 18], numeric solution of differential equations [19], and time-series procession [20].The F-transform-based approach to the image fusion has been proposed in [11, 12]. The main idea is a combination of (at least) two fusion operators, both are based on the F-transform. The first fusion operator is applied to F-transform components of scenes and is based on a robust partition of the scene domain. The second fusion operator is applied to the residuals of scenes with respect to inverse F-transforms with fused components and is based on a finer partition of the same domain. Although this approach is not explicitly based on focus measures, it uses the fusion operator which is able to choose an undistorted scene among available blurred. In this contribution, we analyze two methods of fusion that have been discussed in [11, 12] and propose a new method which can be characterized as a weighted combination of those two. We show that  •
the new method is computationally more effective than the complete algorithm of fusion and has better quality than the simple algorithm of fusion, both have been proposed in [11, 12].


## 2.   F-Transform

Before going into the details of image fusion, we give a brief characterization of the F-transform technique applied herein (we refer to [13] for a complete description).Generally speaking, the F-transform is a linear mapping from a set of ordinary continuous/discrete functions over domainP onto a set of discrete functions (vectors) defined on a fuzzy partition of P. We assume that the reader is familiar with the notion of fuzzy set and the way(s) of its representation. In this paper, we identify fuzzy sets with their membership functions. In the below given explanation, we will speak about the F-transform of an image function u which is a discrete function u:P→ℝ of two variables, defined over the set of pixels P={(i,j)∣i=1,…,N,j=1,…,M} and taking value from the set of reals ℝ. Throughout this text, we will always assume that M,N, and u have the same meaning as above.Let[1,N]={x∣1≤x≤N} be an interval on the real line ℝ, n≥2, a number of fuzzy sets in a fuzzy partition of [1,N], and h=(N-1)/(n-1) the distance between nodes x1,…,xn∈[1,N], where x1=1, xk=x1+(k-1)h, k=1,…,n. Fuzzy sets A1,…,An:[1,N]→[0,1] establish an h-uniformfuzzy partition of [1,N] if the following requirements are fulfilled. (1)
For everyk=1,…,n, Ak(x)=0 if x∈[1,N]∖[xk-1,xk+1], where x0=x1, xN+1=xN;(2)
for everyk=1,…,n, Ak is continuous on [xk-1,xk+1], where x0=x1, xN+1=xN;(3)
for everyi=1,…,N, ∑k=1n‍Ak(i)=1;(4)
for everyk=1,…,n, ∑i=1N‍Ak(i)>0;(5)
for everyk=2,…,n-1, Ak is symmetrical with respect to the line x=xk.The membership functions of the respective fuzzy sets in a fuzzy partition are calledbasic functions. The example of triangular basic functions A1,…,An, n≥2 on the interval [1,N] is given below:
(1)A1(x)={1-(x-x1)h,x∈[x1,x2],0,otherwise,Ak(x)={|x-xk|h,x∈[xk-1,xk+1],0,otherwise,An(x)={(x-xn-1)h,x∈[xn-1,xn],0,otherwise.
Let us remark that(1)
the shape (e.g., triangular or sinusoidal) of a basic function in a fuzzy partition is not predetermined and can be chosen according to additional requirements, for example, smoothness, and so forth, see [13];(2)
if the shape of a basic function of a uniform fuzzy partition of[1,N] is chosen, then the basic function can be uniquely determined by the number np of points, which are “covered” by every “full” basic function Ak where
(2)np=|{i∈[1<n]∣Ak(i)>0}|,k=2,…,n-1, (in this case, we assume that n≥3).Similarly, a uniform fuzzy partition of the interval[1,M] with m≥2 basic functions B1,…,Bm can be defined. Then the fuzzy partition of P=[1,N]×[1,M] is obtained by n×m fuzzy sets A1·B1,…,An·Bm. Below, we will always assume that n,m denote quantities of fuzzy sets in fuzzy partitions of [1,N] and [1,M], respectively.Letu:P→ℝ and fuzzy sets Ak·Bl, k=1,…,n, l=1,…,m, establish a fuzzy partition of [1,N]×[1,M]. The (direct) F-transform of u (with respect to the chosen partition) is an image of the map F[u]:{A1,…,An}×{B1,…,Bm}→ℝ defined by
(3)F[u](Ak·Bl)=∑i=1N∑j=1Mu(i,j)Ak(i)Bl(j)∑i=1N∑j=1MAk(i)Bl(j),
where k=1,…,n,l=1,…,m. The value F[u](Ak·Bl) is called an F-transform component of u and is denoted by F[u]kl. The components F[u]kl can be arranged into the matrix representation as follows:
(4)Fnm[u]=(F[u]11…F[u]1m⋮⋮⋮F[u]n1…F[u]nm).The inverse F-transform ofu is a function on P, which is represented by the following inversion formula, where i=1,…,N,j=1,…,M:
(5)unm(i,j)=∑k=1n‍∑l=1m‍F[u]klAk(i)Bl(j).
It can be shown that the inverse F-transform unm approximates the original function u on the domain P. The proof can be found in [13, 14].


## 3.  The Problem of Image Fusion

Image fusion aims at the integration of various complementary image data into a single, new image with the best possible quality. The term “quality” depends on the demands of the specific application, which is usually related to its usefulness for human visual perception, computer vision, or further processing. More formally, ifu is an ideal image (considered as a function of two variables) and c1,…,cK are acquired (input) images, then the relation between each ci and u can be expressed by
(6)ci(x,y)=di(u(x,y))+ei(x,y),i=1,…,K,
where di is an unknown operator describing the image degradation, and ei is an additive random noise. The problem of fusion consists in finding an image u^ such that it is close to u and it is better (in terms of a chosen quality) than any of c1,…,cK. This problem occurs, for example, if multiple photos with focuses on different objects of the same scene are taken.


## 4.  Image Decomposition for Image Fusion

Let us explain the mechanism of fusion with the help of the F-transform. It is based on a chosen decomposition of an image. We distinguish a one-level and a higher-level decomposition. We assume that the imageu is a discrete real function u=u(x,y) defined on the N×M array of pixels P={(i,j)∣i=1,…,N,j=1,…,M} so that u:P→ℝ. Moreover, let fuzzy sets Ak·Bl, k=1,…,n, l=1,…,m, where 2≤n≤N,2≤m≤M establish a fuzzy partition of [1,N]×[1,M].We begin with the following representation ofu on P:
(7)u(x,y)=unm(x,y)+e(x,y),0<n≤N,0<m≤M,(8)e(x,y)=u(x,y)-unm(x,y),
where unm is the inverse F-transform of u and e is the respective first difference. If we replace e in (7) by its inverse F-transform eNM with respect to the finest partition of [1,N]×[1,M], the above representation can then be rewritten as follows:
(9)u(x,y)=unm(x,y)+eNM(x,y),∀(x,y)∈P,
We call (9) a one-level decomposition of u on P.If functionu is smooth, then the function eNM is small, and the one-level decomposition (9) is sufficient for our fusion algorithm. However, images generally contain various types of degradation that disrupt their smoothness. As a result, the function eNM in (9) is not negligible, and the one-level decomposition is insufficient for our purpose. In this case, we continue with the decomposition of the first difference e in (7). We decompose e into its inverse F-transform en'm' (with respect to a finer fuzzy partition of [1,N]×[1,M] with n':n<n'≤N and m':m<m'≤M basic functions, resp.) and the second difference e'. Thus, we obtain the second-level decomposition of u on P:
(10)u(x,y)=unm(x,y)+en′m′(x,y)+e′(x,y),e′(x,y)=e(x,y)-en′m′(x,y).
In the same manner, we can obtain a higher-level decomposition of u on P:
(11)u(x,y)=un1m1(x,y)+en2m2(1)(x,y)+⋯+enk-1mk-1(k-2)(x,y)+e(k-1)(x,y),
where
(12)0<n1≤n2≤⋯≤nk-1≤N,0<m1≤m2≤⋯≤mk-1≤M,e(1)(x,y)=u(x,y)-un1m1(x,y),e(i)(x,y)=e(i-1)(x,y)-enimi(i-1)(x,y),i=2,…,k-1.
Below, we will be working with the two decompositions of u that are given by (9) and (11).


## 5.   Two Algorithms for Image Fusion

In [12], we proposed two algorithms: (i)
the simple F-transform-based fusion algorithm (SA) and(ii)
the complete F-transform-based fusion algorithm (CA). These algorithms are based on the decompositions (9) and (11), respectively.The principal role in fusion algorithms CA and SA is played by thefusion operatorκ:ℝK→ℝ, defined as follows:
(13)κ(x1,…,xK)=xp,if|xp|=max(|x1|,…,|xK|).


### 5.1.  Simple F-Transform-Based Fusion Algorithm

In this section, we give a “block” description of the SA without technical details which can be found in [12] and not be repeated here. We assume that K≥2 input images c1,…,cK with various types of degradation are given. Our aim is to recognize undistorted parts in the given images and to fuse them into one image.(i)
Choose valuesn, m such that 2≤n≤N,2≤m≤M and create a fuzzy partition of [1,N]×[1,M] by fuzzy sets Ak·Bl,k=1,…,n,l=1,…,m.(ii)
Decompose input imagesc1,…,cK into inverse F-transforms and error functions according to the one-level decomposition (9).(iii)
Apply the fusion operator (13) to the respective F-transform components of c1,…,cK and obtain the fused F-transform components of a new image.(iv)
Apply the fusion operator to the to the respective F-transform components of the error functionsei, i=1,…,K, and obtain the fused F-transform components of a new error function.(v)
Reconstruct the fused image from the inverse F-transforms with the fused components of the new image and the fused components of the new error function.The SA-based fusion is very efficient if we can guess valuesn,m, that characterize a proper fuzzy partition. Usually, this is done manually according to user's skills. The dependence on fuzzy partition parameters can be considered as a main shortcoming of this otherwise effective algorithm. Two recommendations follow from our experience. (i)
For complex images (with many small details), higher values ofn, m give better results.(ii)
If a triangular shape of a basic function is chosen, then the generic choice ofn, m is such that the corresponding values of np,mp are equal to 3 (recall that np is a number of points, which are covered by every full basic function Ak).In this section, the algorithm SA is illustrated on examples “Table” and “Castle,” see Figures2 and 4 below. There are two inputs of the image “Table” (Figure 1) and four ones of the image “Castle” (Figure 3).Two inputs of the image “Table.” The toy is blurred in the left image, and vice versa, it is the only sharp part in the right one.
(a)
(b)Figure 2
The SA fusion of the image “Table,” approximate run time: 1,6 sec.Four inputs (sharp zones vary from the northwest to the southeast quatre) of the image “Castle.”
(a)
(b)
(c)
(d)Figure 4
The SA fusion of the image “Castle,” approximate run time: 1,9 sec.


### 5.2. Complete F-Transform-Based Fusion Algorithm

The CA-based fusion does not depend on one choice of fuzzy partition parameters (as in the case of the SA), because it runs through a sequence of increasing valuesn,m. The description of the CA is similar to that of the SA except for the step 4 which is repeated in a cycle. Therefore, the quality of fusion is high, but the implementation of the CA is rather slow and memory consuming, especially for large images. For illustration, see Figures 5 and 6.Figure 5
Table—the CA fusion of the image “Table,” 2 input images, approximate run time: 111 sec.Figure 6
Table—the CA fusion of the image “Castle,” 4 input images, approximate run time: 359 sec.


### 5.3. Fusion Artefacts

In this section, we characterize input images, for which it is reasonable to apply the SA or CA. By doing this, we put restrictions on inputs which are acceptable by the algorithms SA and CA. First of all, input images should be taken without shifting or rotation. Secondly, blurred parts of input images should not contain many small details like leaves on trees, and so forth. If it is so, then the fusion made by SA or CA can leave “artefacts,” like “ghosts” or “lakes,” see the explanation below where we assume that there are two input images for the fusion.(i)
Ghosts: this happens when a sharp edge of a nondamaged input image is significantly blurred in the other one. As a result of the SA or CA, the edge is perfectly reconstructed, but its neighboring area is affected by the edge presence (see Figure7).(ii)
Lakes: this may happen in both cases when the fusion is performed by the SA or CA. In the case of SA, a “lake” is a result of choosing neighboring areas with significantly different colors from different input images. In the case of SA, a “lake” is a result of rounding off numbers  (see Figure8).Example of “ghost”—the white area around the left button (a) and the doubled edge of the roof (b).
(a)
(b)Figure 8
Example of “lake”—the color of this area is significantly different from the respective colors of input images.


## 5.1.  Simple F-Transform-Based Fusion Algorithm

In this section, we give a “block” description of the SA without technical details which can be found in [12] and not be repeated here. We assume that K≥2 input images c1,…,cK with various types of degradation are given. Our aim is to recognize undistorted parts in the given images and to fuse them into one image.(i)
Choose valuesn, m such that 2≤n≤N,2≤m≤M and create a fuzzy partition of [1,N]×[1,M] by fuzzy sets Ak·Bl,k=1,…,n,l=1,…,m.(ii)
Decompose input imagesc1,…,cK into inverse F-transforms and error functions according to the one-level decomposition (9).(iii)
Apply the fusion operator (13) to the respective F-transform components of c1,…,cK and obtain the fused F-transform components of a new image.(iv)
Apply the fusion operator to the to the respective F-transform components of the error functionsei, i=1,…,K, and obtain the fused F-transform components of a new error function.(v)
Reconstruct the fused image from the inverse F-transforms with the fused components of the new image and the fused components of the new error function.The SA-based fusion is very efficient if we can guess valuesn,m, that characterize a proper fuzzy partition. Usually, this is done manually according to user's skills. The dependence on fuzzy partition parameters can be considered as a main shortcoming of this otherwise effective algorithm. Two recommendations follow from our experience. (i)
For complex images (with many small details), higher values ofn, m give better results.(ii)
If a triangular shape of a basic function is chosen, then the generic choice ofn, m is such that the corresponding values of np,mp are equal to 3 (recall that np is a number of points, which are covered by every full basic function Ak).In this section, the algorithm SA is illustrated on examples “Table” and “Castle,” see Figures2 and 4 below. There are two inputs of the image “Table” (Figure 1) and four ones of the image “Castle” (Figure 3).Two inputs of the image “Table.” The toy is blurred in the left image, and vice versa, it is the only sharp part in the right one.
(a)
(b)Figure 2
The SA fusion of the image “Table,” approximate run time: 1,6 sec.Four inputs (sharp zones vary from the northwest to the southeast quatre) of the image “Castle.”
(a)
(b)
(c)
(d)Figure 4
The SA fusion of the image “Castle,” approximate run time: 1,9 sec.


## 5.2. Complete F-Transform-Based Fusion Algorithm

The CA-based fusion does not depend on one choice of fuzzy partition parameters (as in the case of the SA), because it runs through a sequence of increasing valuesn,m. The description of the CA is similar to that of the SA except for the step 4 which is repeated in a cycle. Therefore, the quality of fusion is high, but the implementation of the CA is rather slow and memory consuming, especially for large images. For illustration, see Figures 5 and 6.Figure 5
Table—the CA fusion of the image “Table,” 2 input images, approximate run time: 111 sec.Figure 6
Table—the CA fusion of the image “Castle,” 4 input images, approximate run time: 359 sec.


## 5.3. Fusion Artefacts

In this section, we characterize input images, for which it is reasonable to apply the SA or CA. By doing this, we put restrictions on inputs which are acceptable by the algorithms SA and CA. First of all, input images should be taken without shifting or rotation. Secondly, blurred parts of input images should not contain many small details like leaves on trees, and so forth. If it is so, then the fusion made by SA or CA can leave “artefacts,” like “ghosts” or “lakes,” see the explanation below where we assume that there are two input images for the fusion.(i)
Ghosts: this happens when a sharp edge of a nondamaged input image is significantly blurred in the other one. As a result of the SA or CA, the edge is perfectly reconstructed, but its neighboring area is affected by the edge presence (see Figure7).(ii)
Lakes: this may happen in both cases when the fusion is performed by the SA or CA. In the case of SA, a “lake” is a result of choosing neighboring areas with significantly different colors from different input images. In the case of SA, a “lake” is a result of rounding off numbers  (see Figure8).Example of “ghost”—the white area around the left button (a) and the doubled edge of the roof (b).
(a)
(b)Figure 8
Example of “lake”—the color of this area is significantly different from the respective colors of input images.


## 6.   Improved F-Transform Fusion

The main purpose of this contribution is to create a method which will be as fast as the SA and as efficient as the CA. The following particular goals should be achieved.(i)
Avoid running through a long sequence of possible partitions (as in the case of CA).(ii)
Automatically adjust parameters of a fusion algorithm according to a level of blurring and a location of a blurred area in input images.(iii)
Eliminate situation which can lead to “ghosts” and “lakes” in a fused image.


### 6.1. Proposed Solution

The main idea of the improved F-transform fusion is to enhance the SA by adding another run of the F-transform over the first difference (7). Our explanation is as follows: the first run of the F-transform is aimed at edge detection in each input image, while the second run propagates only sharp edges (and their local areas) to the fused image. The informal description of the enhanced simple algorithm (ESA) is given in Algorithm 1.Algorithm 1
for allinput images do
Compute theinverse F-transform
Compute thefirst absolute difference between the original image and the
inverse F-transform of it
Compute thesecond absolute differencebetween the first one and its inverse
F-transform and set them as weights of pixels
end for
for allpixels in an image do
Compute the value ofsow—the sum of weights over all input images
for allinput images do
Compute the value ofwr—the ratio between the weight of a current
pixel andsow
end for
Compute the fused value of a pixel in the resulting image as a weighted
(bywr) sum of input image values
end forAlthough the algorithm ESA is written for gray scale input images, there is an easy way how to extend it to color images which are represented in RGB or YUV models. Our tests were performed for both of them. In the case of RGB, the respective R, G, or B channels were processed independently and then combined. In the second case of YUV, the Y-part of the model was used to achieve weights (this part contains the most relevant information about the image intensity), while the U-part and the V-part were processed with the obtained weights.Let us remark that the ESA-fused images are (in general) better than each of the SA or CA. It can be visually seen on the chosen Figures9 and 10. The main advantages of the ESA are as follows.(i)
Time: the executing time is smaller than in the case of the CA (in the examples above it is as follows: 11 versus 111 (“Table”), 18 versus 359 (“Castle”). The quality of the ESA fusion is better than that of the SA. Examples of run times and memory consumption are presented in Table1 (notice that the memory consumption significantly depends on memory management of implementation environment.)(ii)
Ghosts: ghosts effect is reduced. The “ghost” effects (they are seen around the tower roof in the image “Castle” and around the buttons and the clock in the image “Table”) are removed as it can be seen in  Figure11.(iii)
Lakes: lakes effect is eliminated. The “lakes” are almost eliminated as it can be seen from Figures8, 9, and 12.Table 1
Basic characteristics of the three algorithms applied to the tested images.
Image set
Resolution
Time (s)
Memory (MB)
CA
SA
ESA
CA
SA
ESA
Castle
1120
×
840
359
1,9
19,0
160
35
102
Table
852
×
639
111
1,6
11,0
95
3
38
Balls
1600
×
1200
340
1,2
36
270
58
152Figure 9
Table—the ESA fusion of the image “Table,” 2 input images, approximate run time: 10 sec.Figure 10
Table—the ESA fusion of the image “Castle,” 4 input images, approximate run time: 18 sec.Example of  “ghost” artefact reduction by ESA.
(a)
(b)Figure 12
Example of  “lakes” artefact reduction by ESA.


### 6.2. Comparison between Three Algorithms

In this section, we show that in general, the ESA fusion has better execution parameters than the SA or CA fusion. We experimented with numerous images which due to the space limitation cannot be presented in this paper. An exception is made for one image “Balls” with geometric figures to show how the fusion methods reconstruct edges. In Figure13, two inputs of the image “Balls” are given, and in Figure 14, three fusions of the same image are demonstrated.Two inputs of the image “Balls.” The central ball is blurred in (a) and vice versa, it is the only one sharp ball (b).
(a)
(b)The SA (a), CA (b), and ESA (c) fusions of the image “Balls.” The best quality has the ESA fusion (cf. Table2).
(a)
(b)
(c)In Table1, we demonstrate that the complexity (measured by the execution time or by the used memory) of the newly proposed ESA fusion is greater than the complexity of the SA and less than the complexity of the CA.In Table2, we demonstrate that the quality of fusion (measured by the values of MSE and PSNR) of the newly proposed ESA fusion is better (the MSE value is smaller) than the quality of the SA and in some cases (the image “Balls”) is better than the quality of the CA. Table 2 does not contain the values of MSE and PSNR for the image “Table,” because (as it happens in reality) there was no original (nondistorted) image at disposal.Table 2
MSE and PSNR characteristics of the three fusion methods applied to the tested images.
Image set
MSE
PSNR
CA
SA
ESA
CA
SA
ESA
Castle
9,48
42,48
14,15
40,62
37,51
40,61
Balls
1,28
6,03
0,86
48,91
43,81
52,57


## 6.1. Proposed Solution

The main idea of the improved F-transform fusion is to enhance the SA by adding another run of the F-transform over the first difference (7). Our explanation is as follows: the first run of the F-transform is aimed at edge detection in each input image, while the second run propagates only sharp edges (and their local areas) to the fused image. The informal description of the enhanced simple algorithm (ESA) is given in Algorithm 1.Algorithm 1
for allinput images do
Compute theinverse F-transform
Compute thefirst absolute difference between the original image and the
inverse F-transform of it
Compute thesecond absolute differencebetween the first one and its inverse
F-transform and set them as weights of pixels
end for
for allpixels in an image do
Compute the value ofsow—the sum of weights over all input images
for allinput images do
Compute the value ofwr—the ratio between the weight of a current
pixel andsow
end for
Compute the fused value of a pixel in the resulting image as a weighted
(bywr) sum of input image values
end forAlthough the algorithm ESA is written for gray scale input images, there is an easy way how to extend it to color images which are represented in RGB or YUV models. Our tests were performed for both of them. In the case of RGB, the respective R, G, or B channels were processed independently and then combined. In the second case of YUV, the Y-part of the model was used to achieve weights (this part contains the most relevant information about the image intensity), while the U-part and the V-part were processed with the obtained weights.Let us remark that the ESA-fused images are (in general) better than each of the SA or CA. It can be visually seen on the chosen Figures9 and 10. The main advantages of the ESA are as follows.(i)
Time: the executing time is smaller than in the case of the CA (in the examples above it is as follows: 11 versus 111 (“Table”), 18 versus 359 (“Castle”). The quality of the ESA fusion is better than that of the SA. Examples of run times and memory consumption are presented in Table1 (notice that the memory consumption significantly depends on memory management of implementation environment.)(ii)
Ghosts: ghosts effect is reduced. The “ghost” effects (they are seen around the tower roof in the image “Castle” and around the buttons and the clock in the image “Table”) are removed as it can be seen in  Figure11.(iii)
Lakes: lakes effect is eliminated. The “lakes” are almost eliminated as it can be seen from Figures8, 9, and 12.Table 1
Basic characteristics of the three algorithms applied to the tested images.
Image set
Resolution
Time (s)
Memory (MB)
CA
SA
ESA
CA
SA
ESA
Castle
1120
×
840
359
1,9
19,0
160
35
102
Table
852
×
639
111
1,6
11,0
95
3
38
Balls
1600
×
1200
340
1,2
36
270
58
152Figure 9
Table—the ESA fusion of the image “Table,” 2 input images, approximate run time: 10 sec.Figure 10
Table—the ESA fusion of the image “Castle,” 4 input images, approximate run time: 18 sec.Example of  “ghost” artefact reduction by ESA.
(a)
(b)Figure 12
Example of  “lakes” artefact reduction by ESA.


## 6.2. Comparison between Three Algorithms

In this section, we show that in general, the ESA fusion has better execution parameters than the SA or CA fusion. We experimented with numerous images which due to the space limitation cannot be presented in this paper. An exception is made for one image “Balls” with geometric figures to show how the fusion methods reconstruct edges. In Figure13, two inputs of the image “Balls” are given, and in Figure 14, three fusions of the same image are demonstrated.Two inputs of the image “Balls.” The central ball is blurred in (a) and vice versa, it is the only one sharp ball (b).
(a)
(b)The SA (a), CA (b), and ESA (c) fusions of the image “Balls.” The best quality has the ESA fusion (cf. Table2).
(a)
(b)
(c)In Table1, we demonstrate that the complexity (measured by the execution time or by the used memory) of the newly proposed ESA fusion is greater than the complexity of the SA and less than the complexity of the CA.In Table2, we demonstrate that the quality of fusion (measured by the values of MSE and PSNR) of the newly proposed ESA fusion is better (the MSE value is smaller) than the quality of the SA and in some cases (the image “Balls”) is better than the quality of the CA. Table 2 does not contain the values of MSE and PSNR for the image “Table,” because (as it happens in reality) there was no original (nondistorted) image at disposal.Table 2
MSE and PSNR characteristics of the three fusion methods applied to the tested images.
Image set
MSE
PSNR
CA
SA
ESA
CA
SA
ESA
Castle
9,48
42,48
14,15
40,62
37,51
40,61
Balls
1,28
6,03
0,86
48,91
43,81
52,57


## 7. Conclusion

In this paper, we continued our research started in [9–12] on effective fusion algorithms. We proposed the improved method of the F-transform-based fusion which is free from following imperfections: long running time, dependence on initial parameters which characterize a proper fuzzy partition, and presence of fusion artefacts, like “ghosts” or “lakes”.



---

*Source: 125086-2012-10-04.xml*