# Automatic Change Detection Method of Multitemporal Remote Sensing Images Based on 2D-Otsu Algorithm Improved by Firefly Algorithm

Authors: Liang Huang; Yuanmin Fang; Xiaoqing Zuo; Xueqin Yu
Journal: Journal of Sensors
 (2015)

---

## Abstract

This paper presents a new automatic change detection method of multitemporal remote sensing images based on 2D-Otsu algorithm improved by Firefly algorithm. The proposed method is designed to automatically extract the changing area between two temporal remote sensing images. First, two different temporal remote sensing images were acquired through difference value method of remote sensing images; then, the 2D-Otsu threshold segmentation principles are analyzed and the optimal threshold of 2D-Otsu threshold segmentation method is figured out by using the Firefly algorithm, where the difference images are conducted with binary classification to obtain the changing category and the nonchanging category; finally, the proposed method is used to carry out change detection experiments on the two selected areas, where a variety of methods are compared. Experimental results show that the proposed method can effectively and quickly extract the changing area between the two temporal remote sensing images; thus, it is an effective method of change detection for remote sensing images.


---

## Body

## 1. Introduction

With the development of society and technology, human activities are changing the landscape of ground surface and its utilization mode every day. The rapid population growth and frequent natural disasters have also accelerated the speed of such changes. Therefore, quickly and effectively monitoring the information of such changes and analyzing the characteristics, causes, impacts and results of the changes have great significance to the global sustainable development [1]. Emergence and development of remote sensing technology have provided technical support for quickly and effectively monitoring the information of these changes. Detection of remote sensing image changes aims to acquire the changing information of desired surface features by analyzing and processing two or multiple remote sensing images of the same area at different times [2, 3]. Currently, the change detection technology of remote sensing image has been widely used in many fields, such as disaster assessment [4], land use/coverage monitoring [5], environmental change monitoring [6], agricultural survey [7], and urban planning [8].Currently, a number of methods have been proposed for the change detection of remote sensing image. At present, change detection mainly includes two strategies: direct comparison and postclassification comparison, of which the postclassification comparison strategy is an approach to classifying (supervised or unsupervised method) different temporal images of the same area to compare and analyze the classified results in order to obtain the location and type of changing information. The advantage of this strategy is to minimize the impact of nonfeature change factors, but the change detection accuracy through this strategy is substantially equal to the product of the two classification accuracy values, and the classification error of each temporal classification result will be amplified in the process of comparison, thus inevitably exaggerating the extent of changes. Meanwhile, it is often more complex and difficult to get high-accuracy classification results, resulting in low-accuracy and uncertain change detection results [9]. Therefore, the strategy of direct comparison has always been highlighted in researches on change detection. Direct comparison is a strategy to obtain difference images by directly operating and alternating the pixel values of different temporal remote sensing images of the same area that have been calibrated so as to figure out the changing area by analyzing the difference images. In analyzing these difference images, it would be the most simple thing to directly use one-dimensional threshold processing methods, but the processing accuracy of threshold is not high [10, 11]. In order to improve the processing accuracy of threshold, many scholars have proposed to extend the one-dimensional threshold selection method to two dimensions (2D). Currently, a number of two-dimensional threshold selection methods have been raised, such as 2D entropy (2D maximum entropy, 2D minimum cross entropy) [12], 2D-Otsu [13], and 2D maximum fuzzy entropy [14], but it is still difficult to select the threshold values of the two-dimensional histogram, for which unremitting exploration efforts have been made by many scholars. To solve this problem, many scholars attempt to achieve fast optimization for the 2D threshold by combining 2D threshold segmentation method and optimization algorithm. Shen et al. [15], Zheng et al. [16], and Alim et al. [17] sought to figure out the optimal threshold of 2D maximum entropy, respectively, through genetic algorithm, ant colony algorithm, PSO (Particle Swarm Optimization) algorithm, and ABCO (Artificial Bee Colony Optimization). Qian used PSO algorithm to find the optimal threshold of 2D-Otsu [18]. Tian and Zeng used QPSO (Quantum-behaved Particle Swam Optimization) algorithm to carry out image threshold segmentation in combination with 2D maximum fuzzy entropy [19]. The applications of PSO algorithm, QPSO algorithm, bee colony algorithm, ant colony algorithm, and genetic algorithm have improved the speed of figuring out thresholds, but the optimization results may be inaccurate as these algorithms are prone to falling into local extremum.The Firefly algorithm [20] is a global optimization algorithm proposed by Yang, which can overcome the problem of easily falling into local optimum. Chen et al. [21] and Alomoush et al. [22], respectively, applied the Firefly algorithm to find optimal threshold and then used for image segmentation and achieved good segmentation results. Given the fast global search capability of the Firefly algorithm and the good segmentation result of 2D-Otsu threshold segmentation method, this paper segments the thresholds of difference images by combing the Firefly algorithm and 2D-Otsu threshold method to obtain the binary change detection map.


## 2. Architecture of the Proposed Method and Problem Formulation

AssumeT1={T1(i,j),1≤i≤M,1≤j≤N} and T2={T2(i,j),1≤i≤M,1≤j≤N} are the remote sensing images of the same area at different times t1 and t2 that underwent standard product preprocessing and coregistration; the remote sensing image sizes are M×N. The ultimate aim of the proposed method is to generate the binary change map. The proposed method consists of three steps: (1) construction of difference image; (2) threshold optimization based on Firefly algorithm; and (3) generation of final binary change map.First, it is construction of difference images. Currently, there are two methods, namely, image algebraic operation and image transformation, to construct difference images. The method based on image algebraic operation includes difference method, ratio method, and the combination of difference method and ratio method; the method based on image transformation includes principal component analysis, change vector analysis and correlation analysis. Since the image algebraic operation method requires simple algorithm but can obtain high accuracy, this paper applied the image difference method of the image algebraic operation, which can be expressed below:(1)DIx,y=T1i,j-T2i,j,where DI(x,y) is the difference image constructed.Second, it is optimization of Firefly threshold. After acquiring the difference images, the difference images need to be analyzed so as to obtain the binary change map. Binary classification through threshold segmentation is one of the most frequently used methods. Selecting thresholds via one-dimensional histogram is the easiest method, of which the main method is OTSU algorithm. However, as OTSU algorithm does not use local spatial data of the image, the segmentation will be ineffective when the image is subject to noise disturbance or gray scale distribution intersection. Therefore, many scholars have expanded it to two-dimensional approach, and better segmentation results have been achieved [23]. To this end, this paper used the 2D-Otsu algorithm to analyze difference images acquired. However, compared with the thresholds selected in one-dimensional histogram, 2D-Otsu algorithm requires a large amount and a long time of computation. To solve the above problem, the Firefly algorithm is introduced to optimize the threshold of 2D-Otsu algorithm.Third, it is generation of the final binary change map. After figuring out the optimal threshold of 2D-Otsu algorithm, threshold segmentation is given to difference images to obtain the binary change detection map of the two temporal remote sensing images.


## 3. Change Detection Based on 2D-Otsu Algorithm Improved by Firefly Algorithm

### 3.1. 2D-Otsu Threshold Segmentation Method

The size of the difference imageDI(x,y) is M×N, where 1≤x≤M, 1≤y≤N, the gray scale of the image is L, and the average gray-scale of pixel neighborhood is also divided into L level. A binary group is obtained by calculating the average gray scale of its neighborhood at each pixel point, that is, the gray-scale value of the pixel point and the average gray-scale value of its neighborhood. Assume the probability of the binary group (i,j) is fij; the corresponding joint probability density pij can be defined as [13, 24](2)pij=fijM×N,where M×N is the number of pixels of the difference image, i,j=1,2,…,L, and(3)∑i=1L∑j=1Lpij=1.Assume that there are two categories, namely,C0 (changing category) and C1 (nonchanging category) in the 2D histogram, as well as two different probability density distribution functions. Set the threshold value as (s,t); then, the probabilities of C0 and C1 are shown below: (4)ω0=∑i=1s∑j=1tpij,ω1=∑i=s+1L∑j=t+1Lpij.The corresponding mean vectors ofC0 and C1 are (5)μ¯0=μ0i,μ0jT=∑i=1s∑j=1tipijω0,∑i=1s∑j=1tjpijω0T,(6)μ¯1=μ1i,μ1jTμ¯1=∑i=s+1L∑j=t+1Lipijω1,∑i=s+1L∑j=t+1Ljpijω1T.The total mean vector of 2D histogram is(7)μ¯T=μTi,μTjT=∑i=1L∑j=1Lipij,∑i=1L∑j=1LjpijT.Usually, the probability away from the histogram diagonal can be negligible; then, it can be assumed in the two areas:i=s+1,…,L; j=1,…,t and i=1,…,s; j=t+1,…,L have pij≈0, where(8)ω0+ω1≈1,μ¯T=ω0μ¯0+ω1μ¯1.Define a between-class dispersion matrix:(9)SB=ω0μ0i-μTiμ0j-μTjSB=+ω1μ1i-μTiμ1j-μTj.Use the trace ofSB as a measure of the between-class dispersion matrix; then, the 2D-Otsu function of the threshold value (s,t) corresponding to the difference image can be defined as(10)trσBs,t=ω0μ0i-μTi2+μ0j-μTj2trσBs,t=+ω1μ1i-μTi2+μ1j-μTj2.By using Formula (8), it can be simplified into(11)trσBs,t=ω0μTi-μ¯i2+ω0μTj-μ¯j2ω01-ω0,where μ¯i=∑i=1s∑j=1tipij, μ¯j=∑i=1s∑j=1tjpij.The segmentation criteria corresponding to the 2D-Otsu threshold segmentation method has to maximize the 2D-Otsu functiontrσB(s,t) for the purpose of obtaining the optimal threshold (s*,t*).


### 3.2. 2D-Otsu Threshold Segmentation Method Based on Firefly Algorithm

In order to solve the problem that 2D-Otsu threshold segmentation method requires a large amount and long time of computation, this paper applied the Firefly algorithm to the threshold optimization for 2D-Otsu threshold segmentation method and proposed the 2D-Otsu threshold segmentation method based on the firefly algorithm, so as to convert the threshold value selection of 2D-Otsu threshold segmentation method into the optimization of 2D-Otsu functiontrσB(s,t) based on the Firefly algorithm.The Firefly algorithm [25], proposed by Yang in the Cambridge University, is a bionic swarm intelligent optimization algorithm by simulating the natural behaviors of fireflies. The algorithm is characterized by simple parameter setting, high-accuracy optimization, and powerful global optimization [20]. The principle of Firefly algorithm is to simulate firefly individuals in nature by searching for space dots. In the optimization process, by using the phototaxis characteristics of firefly, the searching and optimization process is simulated into the attraction and movement process of firefly individuals, where the target function of the problem is measured by the merits of the position of firefly individuals. In other words, the target function of the problem is converted into the firefly seeking maximum brightness. The process of survival of the fittest among firefly individuals is also the iterative process of feasible solutions in the course of target function optimization. Therefore, the Firefly algorithm can rapidly conduct global optimization [21].Firefly algorithm consists of two main elements: brightness and attraction, where brightness reflects the merits of the position of fireflies and determines the movement direction of firefly individuals, while attraction determines the movement distance of firefly individuals. Through the continuous updating and iteration of brightness and attraction, the optimal solution to the target function will be achieved [21, 26, 27]. In the Firefly algorithm, the relative fluorescence brightness of firefly individuals is defined as(12)I=I0×e-γrij2,where I0 is the maximum fluorescence brightness of the firefly, γ is the attraction coefficient of light intensity, which is usually set to a constant; rij is the spatial distance between Fireflies i and j, that is, rij=xi-xj, where xi and xj are, respectively, the spatial position of Fireflies i and j.The attraction degree of firefly is defined as(13)β=β0×e-γrij2,where β0 is the biggest attraction of the firefly.In the case that Fireflyi is attracted by Firefly j and moves towards the position of Firefly j, it can be defined in the formula below: (14)xi=xi+β×xj-xi+α×rand-12,where α is the step size factor which is a constant between [0,1]; rand is the uniformly distributed random factor between [0,1]; α×(rand-1/2) is the random disturbance to avoid untimely falling into local optimum.By setting the 2D-Otsu functiontrσB(s,t) as the target function of the Firefly algorithm, the optimization result of the Firefly algorithm is the position trσB(s*,t*) of the firefly with maximum brightness and (s*,t*) is the desired threshold. The implementation process is as follows:(1)
initialize the basic parameters of the Firefly algorithm. Set the number of fireflies asn, of which the maximum attraction is β0, the light intensity attraction coefficient is γ, the step factor is α, and the maximum number of iterations is T;(2)
by randomly initializing the position of fireflies, calculate the 2D-Otsu function valuetrσB(si,ti) corresponding to each firefly and take the target function as their brightness to get the position of the firefly with maximum brightness;(3)
calculate the relative brightnessI and attraction degree β of fireflies based on (12) and (13), and determine their movement direction according to the relative brightness;(4)
update the spatial position of fireflies based on Formula (14), and carry out random disturbance on fireflies in the best position;(5)
recalculate the brightness of fireflies based on the updated position of fireflies;(6)
when the maximum number of searches is reached, go to (6); otherwise, the number of searches should plus 1; then, go to (3) for the next search;(7)
output the position and brightness of the firefly with maximum brightness, and segment the difference images by taking(s*,t*) as a threshold.


## 3.1. 2D-Otsu Threshold Segmentation Method

The size of the difference imageDI(x,y) is M×N, where 1≤x≤M, 1≤y≤N, the gray scale of the image is L, and the average gray-scale of pixel neighborhood is also divided into L level. A binary group is obtained by calculating the average gray scale of its neighborhood at each pixel point, that is, the gray-scale value of the pixel point and the average gray-scale value of its neighborhood. Assume the probability of the binary group (i,j) is fij; the corresponding joint probability density pij can be defined as [13, 24](2)pij=fijM×N,where M×N is the number of pixels of the difference image, i,j=1,2,…,L, and(3)∑i=1L∑j=1Lpij=1.Assume that there are two categories, namely,C0 (changing category) and C1 (nonchanging category) in the 2D histogram, as well as two different probability density distribution functions. Set the threshold value as (s,t); then, the probabilities of C0 and C1 are shown below: (4)ω0=∑i=1s∑j=1tpij,ω1=∑i=s+1L∑j=t+1Lpij.The corresponding mean vectors ofC0 and C1 are (5)μ¯0=μ0i,μ0jT=∑i=1s∑j=1tipijω0,∑i=1s∑j=1tjpijω0T,(6)μ¯1=μ1i,μ1jTμ¯1=∑i=s+1L∑j=t+1Lipijω1,∑i=s+1L∑j=t+1Ljpijω1T.The total mean vector of 2D histogram is(7)μ¯T=μTi,μTjT=∑i=1L∑j=1Lipij,∑i=1L∑j=1LjpijT.Usually, the probability away from the histogram diagonal can be negligible; then, it can be assumed in the two areas:i=s+1,…,L; j=1,…,t and i=1,…,s; j=t+1,…,L have pij≈0, where(8)ω0+ω1≈1,μ¯T=ω0μ¯0+ω1μ¯1.Define a between-class dispersion matrix:(9)SB=ω0μ0i-μTiμ0j-μTjSB=+ω1μ1i-μTiμ1j-μTj.Use the trace ofSB as a measure of the between-class dispersion matrix; then, the 2D-Otsu function of the threshold value (s,t) corresponding to the difference image can be defined as(10)trσBs,t=ω0μ0i-μTi2+μ0j-μTj2trσBs,t=+ω1μ1i-μTi2+μ1j-μTj2.By using Formula (8), it can be simplified into(11)trσBs,t=ω0μTi-μ¯i2+ω0μTj-μ¯j2ω01-ω0,where μ¯i=∑i=1s∑j=1tipij, μ¯j=∑i=1s∑j=1tjpij.The segmentation criteria corresponding to the 2D-Otsu threshold segmentation method has to maximize the 2D-Otsu functiontrσB(s,t) for the purpose of obtaining the optimal threshold (s*,t*).


## 3.2. 2D-Otsu Threshold Segmentation Method Based on Firefly Algorithm

In order to solve the problem that 2D-Otsu threshold segmentation method requires a large amount and long time of computation, this paper applied the Firefly algorithm to the threshold optimization for 2D-Otsu threshold segmentation method and proposed the 2D-Otsu threshold segmentation method based on the firefly algorithm, so as to convert the threshold value selection of 2D-Otsu threshold segmentation method into the optimization of 2D-Otsu functiontrσB(s,t) based on the Firefly algorithm.The Firefly algorithm [25], proposed by Yang in the Cambridge University, is a bionic swarm intelligent optimization algorithm by simulating the natural behaviors of fireflies. The algorithm is characterized by simple parameter setting, high-accuracy optimization, and powerful global optimization [20]. The principle of Firefly algorithm is to simulate firefly individuals in nature by searching for space dots. In the optimization process, by using the phototaxis characteristics of firefly, the searching and optimization process is simulated into the attraction and movement process of firefly individuals, where the target function of the problem is measured by the merits of the position of firefly individuals. In other words, the target function of the problem is converted into the firefly seeking maximum brightness. The process of survival of the fittest among firefly individuals is also the iterative process of feasible solutions in the course of target function optimization. Therefore, the Firefly algorithm can rapidly conduct global optimization [21].Firefly algorithm consists of two main elements: brightness and attraction, where brightness reflects the merits of the position of fireflies and determines the movement direction of firefly individuals, while attraction determines the movement distance of firefly individuals. Through the continuous updating and iteration of brightness and attraction, the optimal solution to the target function will be achieved [21, 26, 27]. In the Firefly algorithm, the relative fluorescence brightness of firefly individuals is defined as(12)I=I0×e-γrij2,where I0 is the maximum fluorescence brightness of the firefly, γ is the attraction coefficient of light intensity, which is usually set to a constant; rij is the spatial distance between Fireflies i and j, that is, rij=xi-xj, where xi and xj are, respectively, the spatial position of Fireflies i and j.The attraction degree of firefly is defined as(13)β=β0×e-γrij2,where β0 is the biggest attraction of the firefly.In the case that Fireflyi is attracted by Firefly j and moves towards the position of Firefly j, it can be defined in the formula below: (14)xi=xi+β×xj-xi+α×rand-12,where α is the step size factor which is a constant between [0,1]; rand is the uniformly distributed random factor between [0,1]; α×(rand-1/2) is the random disturbance to avoid untimely falling into local optimum.By setting the 2D-Otsu functiontrσB(s,t) as the target function of the Firefly algorithm, the optimization result of the Firefly algorithm is the position trσB(s*,t*) of the firefly with maximum brightness and (s*,t*) is the desired threshold. The implementation process is as follows:(1)
initialize the basic parameters of the Firefly algorithm. Set the number of fireflies asn, of which the maximum attraction is β0, the light intensity attraction coefficient is γ, the step factor is α, and the maximum number of iterations is T;(2)
by randomly initializing the position of fireflies, calculate the 2D-Otsu function valuetrσB(si,ti) corresponding to each firefly and take the target function as their brightness to get the position of the firefly with maximum brightness;(3)
calculate the relative brightnessI and attraction degree β of fireflies based on (12) and (13), and determine their movement direction according to the relative brightness;(4)
update the spatial position of fireflies based on Formula (14), and carry out random disturbance on fireflies in the best position;(5)
recalculate the brightness of fireflies based on the updated position of fireflies;(6)
when the maximum number of searches is reached, go to (6); otherwise, the number of searches should plus 1; then, go to (3) for the next search;(7)
output the position and brightness of the firefly with maximum brightness, and segment the difference images by taking(s*,t*) as a threshold.


## 4. Experiments and Results

### 4.1. Description of Experimental Data

In order to verify the validity and reliability of the proposed method as well as the advantages of the proposed method on the operating speed, the paper selected two groups of experimental data set, both of which were Landsat5 TM remote sensing images, with a spatial resolution of 30 m. The data set is provided by International Scientific & Technical Data Mirror Site, Computer Network Information Center, and Chinese Academy of Sciences (http://www.gscloud.cn/).The first group of data set consists of two Landsat5 TM remote sensing images of the local area of Poyang Lake in Jiangxi Province, as shown in Figures1(a) and 1(b). Figures 1(a) and 1(b) were, respectively, acquired on July 15, 1989, and on January 14, 2010, and the size of two remote sensing images was 510 × 510 pixels, with a gray-scale of 256; their reference changing map is shown in Figure 1(c), where the black area is the changing area, and 69,413 pixels were changed and 190,687 pixels were unchanged.Figure 1
Multitemporal remote sensing images of Poyang Lake in Jiangxi Province.
(a)
July 15, 1989
(b)
January 14, 2010
(c)
Reference map of changed areaThe second group of data set consists of two Landsat5 TM remote sensing images of the local area of Dongting Lake in Hunan Province, as shown in Figures4(a) and 4(b). Figures 4(a) and 4(b) were, respectively, acquired on July 19, 1991, and on October 24, 2009, and the size of two remote sensing images was 610 × 610 pixels, with a gray-scale of 256; their reference changing map is shown in Figure 4(c), where the black area is the changing area, and 102,096 pixels were changed and 270,004 pixels were unchanged.


### 4.2. Change Detection Results and Analysis

The proposed method was verified by two experimental schemes. The first experimental scheme, respectively, applied difference method, ratio method, and the combination of difference method and ratio method to construct difference images and used the improved 2D-Otsu algorithm based on Firefly algorithm for segmentation to get the binary change map, where, after several experiments, the parameters of the Firefly algorithm were set below: the number of firefliesn = 50, the initial attraction degree β0=0.2, light intensity coefficient γ=1, step factor α=0.25, and the maximum number of iterations T=100. The second experimental scheme, respectively, applied the proposed 2D-Otsu improved by Firefly algorithm, two-dimensional maximum entropy and two-dimensional maximum fuzzy entropy to process the difference images obtained from the image difference method to get the binary change map. In order to quantitatively evaluate the accuracy of the proposed method, the false detection rate, missed detection rate, and overall error rate were taken as evaluation factors [2].In the first experimental scheme, the 2D-Otsu algorithm improved by the proposed Firefly algorithm based on the two groups of data set, respectively, processed the difference images constructed through difference method, ratio method, and the combination of difference method and ratio method to get the binary change map, of which the detection results are shown in Figures2 and 5, and the change detection accuracy is shown in Tables 1 and 3. As can be seen from Tables 1 and 3, the difference method led to the minimum number of pixel errors, followed by the result produced by the combination method, and the ratio method led to the maximum number of pixel errors. According to the three evaluation factors, namely, overall false detection rate, missed detection rate, and overall error rate, the difference image resulting from the image difference method can get better change detection results. In addition, as can be seen from Figure 5, the detection results from the ratio method produced a number of missed and false changed pixel elements; although the detection resulting from the combination method reduced the number of false detections, it led to a huge number of missed detections; the detection results from difference method did not produce a number of false or missed detections; thus, it was much closer to the reference map.Table 1
False alarms, missed alarms, and total errors for three difference methods in Poyang Lake.
Difference image acquisition methods
False alarms
Missed alarms
Total errors
Pixels
%
Pixels
%
Pixels
%
Difference operator
4945
2.59%
8636
12.44%
13581
5.22%
Ratio operator
10142
5.32%
7670
11.05%
17812
6.85%
IMTF operator
3204
1.68%
12499
18.01%
15703
6.04%Figure 2
The first set of experiments of Poyang Lake in Jiangxi Province.
(a)
Image differencing
(b)
Image ratioing
(c)
Mixed methodIn the second experimental scheme, the 2D-Otsu algorithm, two-dimensional maximum entropy and two-dimensional maximum fuzzy entropy improved by the Firefly algorithm based on the two groups of data set processed the difference images obtained from the image difference method to get the binary change map, of which the detection results are shown in Figures3 and 6, and the comparison results among the change detection accuracy based on the three methods are shown in Tables 2 and 4. As can be seen from Tables 2 and 4, although the detection results based on the two-dimensional maximum entropy and the two-dimensional maximum fuzzy entropy had a very low false detection rate, a number of changed pixel elements were missed. The missed detection rate based on the two-dimensional maximum entropy method was above 80%, while the missed detection rate based on the two-dimensional maximum fuzzy rate was between 55% and 65%. The false detection rate and the missed detection rate based on the proposed method were lower, of which the false detection rate was maintained below 3%, and the missed detection rate was maintained below 13%. As can also be seen from Figures 3 and 6, compared with the reference change map, the binary change detection results based on the two-dimensional maximum entropy and the two-dimensional fuzzy maximum entropy showed a number of changed pixel elements.Table 2
False alarms, missed alarms, and total errors for three change detection methods in Poyang Lake.
Change detection methods
False alarms
Missed alarms
Total errors
Pixels
%
Pixels
%
Pixels
%
Proposed method
4945
2.59%
8636
12.44%
13581
5.22%
2D maximum entropy
28
0.01%
58870
84.81%
58898
22.64%
2D maximum fuzzy entropy
164
0.09%
39906
57.49%
40070
15.41%Table 3
False alarms, missed alarms, and total errors for three difference methods in Dongting Lake.
Difference image acquisition methods
False alarms
Missed alarms
Total errors
Pixels
%
Pixels
%
Pixels
%
Difference operator
4548
1.68%
11268
11.04%
15816
4.25%
Ratio operator
85119
31.53%
29885
29.27%
115004
30.91%
IMTF operator
1295
0.47%
36496
35.75%
37791
10.16%Table 4
False alarms, missed alarms, and total errors for three change detection methods in Dongting Lake.
Change detection methods
False alarms
Missed alarms
Total errors
Pixels
%
Pixels
%
Pixels
%
Proposed method
4548
1.68%
11268
11.04%
15816
4.25%
2D maximum entropy
27
0.01%
83949
82.23%
83976
22.57%
2D maximum fuzzy entropy
183
0.07%
63810
62.50%
63993
17.20%Figure 3
The second set of experiments of Poyang Lake in Jiangxi Province.
(a)
Proposed method
(b)
2D maximum entropy
(c)
2D maximum fuzzy entropyFigure 4
Multitemporal remote sensing images of Dongting Lake in Hunan Province.
(a)
July 19, 1991
(b)
October 24, 2009
(c)
Reference map of changed areaFigure 5
The first set of experiments of Dongting Lake in Hunan Province.
(a)
Image differencing
(b)
Image ratioing
(c)
Mixed methodFigure 6
The second set of experiments of Dongting Lake in Hunan Province.
(a)
Proposed method
(b)
2D maximum entropy
(c)
2D maximum fuzzy entropyAs can be seen from the two experimental schemes, the proposed method is an effective and reliable change detection method for multitemporal remote sensing images.


## 4.1. Description of Experimental Data

In order to verify the validity and reliability of the proposed method as well as the advantages of the proposed method on the operating speed, the paper selected two groups of experimental data set, both of which were Landsat5 TM remote sensing images, with a spatial resolution of 30 m. The data set is provided by International Scientific & Technical Data Mirror Site, Computer Network Information Center, and Chinese Academy of Sciences (http://www.gscloud.cn/).The first group of data set consists of two Landsat5 TM remote sensing images of the local area of Poyang Lake in Jiangxi Province, as shown in Figures1(a) and 1(b). Figures 1(a) and 1(b) were, respectively, acquired on July 15, 1989, and on January 14, 2010, and the size of two remote sensing images was 510 × 510 pixels, with a gray-scale of 256; their reference changing map is shown in Figure 1(c), where the black area is the changing area, and 69,413 pixels were changed and 190,687 pixels were unchanged.Figure 1
Multitemporal remote sensing images of Poyang Lake in Jiangxi Province.
(a)
July 15, 1989
(b)
January 14, 2010
(c)
Reference map of changed areaThe second group of data set consists of two Landsat5 TM remote sensing images of the local area of Dongting Lake in Hunan Province, as shown in Figures4(a) and 4(b). Figures 4(a) and 4(b) were, respectively, acquired on July 19, 1991, and on October 24, 2009, and the size of two remote sensing images was 610 × 610 pixels, with a gray-scale of 256; their reference changing map is shown in Figure 4(c), where the black area is the changing area, and 102,096 pixels were changed and 270,004 pixels were unchanged.


## 4.2. Change Detection Results and Analysis

The proposed method was verified by two experimental schemes. The first experimental scheme, respectively, applied difference method, ratio method, and the combination of difference method and ratio method to construct difference images and used the improved 2D-Otsu algorithm based on Firefly algorithm for segmentation to get the binary change map, where, after several experiments, the parameters of the Firefly algorithm were set below: the number of firefliesn = 50, the initial attraction degree β0=0.2, light intensity coefficient γ=1, step factor α=0.25, and the maximum number of iterations T=100. The second experimental scheme, respectively, applied the proposed 2D-Otsu improved by Firefly algorithm, two-dimensional maximum entropy and two-dimensional maximum fuzzy entropy to process the difference images obtained from the image difference method to get the binary change map. In order to quantitatively evaluate the accuracy of the proposed method, the false detection rate, missed detection rate, and overall error rate were taken as evaluation factors [2].In the first experimental scheme, the 2D-Otsu algorithm improved by the proposed Firefly algorithm based on the two groups of data set, respectively, processed the difference images constructed through difference method, ratio method, and the combination of difference method and ratio method to get the binary change map, of which the detection results are shown in Figures2 and 5, and the change detection accuracy is shown in Tables 1 and 3. As can be seen from Tables 1 and 3, the difference method led to the minimum number of pixel errors, followed by the result produced by the combination method, and the ratio method led to the maximum number of pixel errors. According to the three evaluation factors, namely, overall false detection rate, missed detection rate, and overall error rate, the difference image resulting from the image difference method can get better change detection results. In addition, as can be seen from Figure 5, the detection results from the ratio method produced a number of missed and false changed pixel elements; although the detection resulting from the combination method reduced the number of false detections, it led to a huge number of missed detections; the detection results from difference method did not produce a number of false or missed detections; thus, it was much closer to the reference map.Table 1
False alarms, missed alarms, and total errors for three difference methods in Poyang Lake.
Difference image acquisition methods
False alarms
Missed alarms
Total errors
Pixels
%
Pixels
%
Pixels
%
Difference operator
4945
2.59%
8636
12.44%
13581
5.22%
Ratio operator
10142
5.32%
7670
11.05%
17812
6.85%
IMTF operator
3204
1.68%
12499
18.01%
15703
6.04%Figure 2
The first set of experiments of Poyang Lake in Jiangxi Province.
(a)
Image differencing
(b)
Image ratioing
(c)
Mixed methodIn the second experimental scheme, the 2D-Otsu algorithm, two-dimensional maximum entropy and two-dimensional maximum fuzzy entropy improved by the Firefly algorithm based on the two groups of data set processed the difference images obtained from the image difference method to get the binary change map, of which the detection results are shown in Figures3 and 6, and the comparison results among the change detection accuracy based on the three methods are shown in Tables 2 and 4. As can be seen from Tables 2 and 4, although the detection results based on the two-dimensional maximum entropy and the two-dimensional maximum fuzzy entropy had a very low false detection rate, a number of changed pixel elements were missed. The missed detection rate based on the two-dimensional maximum entropy method was above 80%, while the missed detection rate based on the two-dimensional maximum fuzzy rate was between 55% and 65%. The false detection rate and the missed detection rate based on the proposed method were lower, of which the false detection rate was maintained below 3%, and the missed detection rate was maintained below 13%. As can also be seen from Figures 3 and 6, compared with the reference change map, the binary change detection results based on the two-dimensional maximum entropy and the two-dimensional fuzzy maximum entropy showed a number of changed pixel elements.Table 2
False alarms, missed alarms, and total errors for three change detection methods in Poyang Lake.
Change detection methods
False alarms
Missed alarms
Total errors
Pixels
%
Pixels
%
Pixels
%
Proposed method
4945
2.59%
8636
12.44%
13581
5.22%
2D maximum entropy
28
0.01%
58870
84.81%
58898
22.64%
2D maximum fuzzy entropy
164
0.09%
39906
57.49%
40070
15.41%Table 3
False alarms, missed alarms, and total errors for three difference methods in Dongting Lake.
Difference image acquisition methods
False alarms
Missed alarms
Total errors
Pixels
%
Pixels
%
Pixels
%
Difference operator
4548
1.68%
11268
11.04%
15816
4.25%
Ratio operator
85119
31.53%
29885
29.27%
115004
30.91%
IMTF operator
1295
0.47%
36496
35.75%
37791
10.16%Table 4
False alarms, missed alarms, and total errors for three change detection methods in Dongting Lake.
Change detection methods
False alarms
Missed alarms
Total errors
Pixels
%
Pixels
%
Pixels
%
Proposed method
4548
1.68%
11268
11.04%
15816
4.25%
2D maximum entropy
27
0.01%
83949
82.23%
83976
22.57%
2D maximum fuzzy entropy
183
0.07%
63810
62.50%
63993
17.20%Figure 3
The second set of experiments of Poyang Lake in Jiangxi Province.
(a)
Proposed method
(b)
2D maximum entropy
(c)
2D maximum fuzzy entropyFigure 4
Multitemporal remote sensing images of Dongting Lake in Hunan Province.
(a)
July 19, 1991
(b)
October 24, 2009
(c)
Reference map of changed areaFigure 5
The first set of experiments of Dongting Lake in Hunan Province.
(a)
Image differencing
(b)
Image ratioing
(c)
Mixed methodFigure 6
The second set of experiments of Dongting Lake in Hunan Province.
(a)
Proposed method
(b)
2D maximum entropy
(c)
2D maximum fuzzy entropyAs can be seen from the two experimental schemes, the proposed method is an effective and reliable change detection method for multitemporal remote sensing images.


## 5. Conclusion

Thresholding processing is an effective method to detect changes in multitemporal remote sensing images. One-dimensional thresholding can be simply implemented, but the thresholding accuracy is not high. In order to improve the accuracy of detection change, the 2D-Otsu algorithm is used for the change detection of multitemporal remote sensing images. However, the 2D-Otsu algorithm has difficult threshold selection and requires a large amount of computation; thus, the Firefly algorithm is introduced to conduct threshold optimization for 2D-Otsu algorithm, from which the automatic change detection method of multitemporal remote sensing images based on 2D-Otsu algorithm improved by Firefly algorithm has been proposed. First, this paper first applied the image difference method to construct the difference images, and conducted threshold optimization for 2D-Otsu algorithm by using Firefly algorithm; then, the 2D-Otsu algorithm was used to segment the threshold values on the difference images to get the binary change map, and finally the false detection rate, missed detection rate, and overall error rate were separately used to evaluate the accuracy of detection results.In order to verify the effectiveness, reliability, and operating speed advantages of the proposed method, several change detection experiments were made to the two groups of data set, and the results were compared with the change detection methods based on the two-dimensional maximum entropy and the two-dimensional maximum fuzzy entropy. Experimental results showed that the change detection accuracy (overall error rate) of the proposed method averaged 4.74%, better than the detection accuracies based on the two-dimensional maximum entropy method (22.61%) and the two-dimensional maximum fuzzy entropy method (16.31%). Therefore, the proposed method can efficiently and accurately identify the changing area of multitemporal remote sensing images. Of course, further researches are still required in terms of how to set the initial parameters of fireflies so as to reduce the impacts of nonoptimal initial parameters on threshold optimization.



---

*Source: 327123-2015-07-29.xml*