# Artificial Neural Network in Classification of Multisource Remote Sensing Images

Authors: Li Feng; Weiling Liao; Jiawei Pang; Ronghao Hu; Lei Feng
Journal: International Transactions on Electrical Energy Systems
 (2022)

---

## Abstract

How to solve multi-category image recognition and meet a certain accuracy is a key issue in the research of high-resolution remote sensing images, and it is of great significance. This article mainly studies artificial neural network in the classification of multi-source remote sensing images. This paper improves the efficiency and accuracy of image segmentation by studying the principle and implementation process of image segmentation algorithm from the two aspects of initial segmentation and region merging; secondly, it studies the method of object feature quantization and the image of different object features on the classification results; and finally, it selects BP neural network. The network classification method classifies the image objects and realizes the extraction and classification of high-resolution remote sensing images. Experiments in this paper show that for multi-source remote sensing image data, the overall accuracy of the two parallel classification algorithms is very similar, and both are close to 85%, which has a good classification effect. When performing large-scale image classification, the terrain types in the image will be more complicated. In this case, the extraction accuracy relative to the artificial neural network classification method will decrease, and the classification time will also become longer. This paper proves through experiments that the classification method of multi-source remote sensing images based on artificial neural network is feasible and has certain advantages.


---

## Body

## 1. Introduction

Remote sensing image classification is to analyze the spectral information and spatial information of various features in the remote sensing image, select the characteristic variables that can reflect the spectral and spatial information of the feature, and can be used for the classification processing of the remote sensing image, and use a certain discriminant function and corresponding. The process of discriminating the feature space into nonoverlapping subspaces, and then classifying each pixel in the image into each subspace. The traditional classification method uses a single pixel as the research object, and the classification results in the form of output vectors are mostly based on the classification result map after editing by vectorizing the classification results to obtain the final vector classification map. The classification method can output the desired classification results in the form of vectors. However, because the classification results are based on a single pixel, they have large defects and shortcomings. It is difficult to obtain a large use value for the final vectorized classification results.Object-oriented classification technology is a classification algorithm that many scholars are interested in recent years. Compared with the previous classification algorithm, the biggest difference is that the classification unit is based on regional objects, rather than a single pixel. The formation of an object-oriented classification unit should be divided to form a pixel cluster with high homogeneity, that is, to segment the object, enhance the signal-to-noise ratio capability of the image object, expand the difference between the target features, and enhance the separability of the features. Furthermore, the classification accuracy of the image is improved and the classification effect is improved.The classification of high-resolution remote sensing images is a challenging problem. In recent years, the classification algorithm based on BOW has achieved good performance. However, how the program of the BOW framework affects the classification results is still an open question. Yue et al. proposed three visualization algorithms to reconstruct images from BOW. After visualization, we can see what the computer actually sees in the image function. He will also analyze in detail the process of the BOW framework, namely, descriptor extraction and histogram generation. The discovery descriptor should not be attributed to the wrong classification. The histogram generation strategy should be improved to make it robust to image conversion. Then put forward some suggestions to further improve the BOW-based remote sensing image classification algorithm [1]. But his method is not good for the classification of high-resolution remote sensing images. With the development of deep learning, supervised learning has been widely adopted to classify remote sensing images using convolutional networks. However, due to the limited amount of labeled data available, it is often difficult to perform supervised learning. Therefore, Lin et al. proposed an unsupervised model called multi-layer feature matching generation adversarial network (MARTA GAN) to use only unlabeled data to learn the representation [2]. His method takes a long time to classify multi-source remote sensing images and cannot guarantee accuracy. Maggiori et al. proposed an end-to-end framework for dense pixel-level classification of satellite images using convolutional neural networks (CNN). In his framework, directly training CNN can generate classification maps from input images. He first designed a fully convolutional architecture and proved its relevance to dense classification problems. Then, he solves the problem of imperfect training data through a two-step training method: first, the CNN is initialized with a large number of potentially inaccurate reference data, and then optimized on a small amount of accurately labeled data. In order to perfect the framework, they designed a multi-scale neuron module to alleviate the common trade-off between recognition and precise positioning [3]. If an artificial neural network is used for image classification research, the effect may be better. Aiming at the problem that traditional remote sensing image classification methods cannot achieve good results, Liang et al. proposed deep learning-inspired classification method based on a stacked noise reduction automatic encoder (SDAE). Then the unsupervised greedy layered training algorithm is used in turn for each layer of noisy input training to achieve a more robust expression and supervised feature learning through backpropagation (BP) neural network. Finally, he uses the error to reverse propagation and optimizes the entire network [4]. Although his method can effectively improve the accuracy of traditional remote sensing image classification, it does not make a good classification study for high-resolution remote sensing images.This paper first implements the standard BP neural network classification method under MATLAB software, discusses the selection and parameter determination of the number of hidden layer neurons, and proposes a new training sample construction method-non-pixel removal method, on this basis, implements the LM algorithm BP neural network. In order to overcome the problems related to data redundancy and high bands, the combination of principal component analysis and LM algorithm BP neural network was used. At the same time, the maximum likelihood method was used for classification with the same training area. Then make a comparative analysis of the accuracy of each classification result and select the best classification method.


## 2. Multisource Remote Sensing Image Classification Method

### 2.1. Remote Sensing Image Segmentation Technology

In the application and research of image segmentation, people are often only interested in certain parts of the image. These parts are generally called “objects” or “targets,” which correspond to specific areas with unique properties in the image. These areas need to be separated. Image segmentation is an image processing technique that divides an image into characteristic regions and segments out interesting objects. It is a basic content of image understanding and analysis [5, 6]. The area in the image can be represented by a collection, which refers to a collection of connected pixels with consistent “meaningful” attributes. The so-called “meaningful” attributes depend on the specific conditions of the image to be analyzed, such as the grayscale, color, statistical characteristics, or texture characteristics of the image element field. “Consistency” requires that each region has the same or similar characteristic attributes.Image engineering, as a new subject in the field of image research applications, can be divided into three hierarchical structures: processing layer, analysis layer, and understanding layer according to the differences between the overall level and the analysis method. As shown in Figure1, the first link in image analysis is image segmentation, which fully embodies the importance of image segmentation. The main point of image segmentation is to connect pixel units with the same physical meaning in the image as connected regions. Generally, image segmentation is achieved by using feature information such as the spectrum, texture, and shape of the object unit. The next step of image segmentation is often target tracking, remote sensing interpretation, and pattern recognition based on the segmentation results. The quality of the segmentation directly affects the subsequent application analysis and determines the quality and effectiveness of the segmentation application. It is of great importance [7].Figure 1
The location of image segmentation in image processing.In recent years, a new field of research has emerged in the analysis of remote sensing images, that is, the realization of remote sensing applications based on object-oriented thinking. The most fundamental problem of object-oriented thinking is image segmentation. From the perspective of overall development and research, research on object-oriented remote sensing image-related technologies is still in its infancy, and it is relatively difficult to study how to efficiently achieve high-quality segmentation of remote sensing images. However, the quality of image segmentation is directly related to the application of later images, such as analysis and interpretation. Therefore, the selection of a suitable remote sensing image segmentation algorithm is the key to the success and failure of remote sensing image analysis and understanding [8,9].


### 2.2. Image Segmentation Preprocessing

#### 2.2.1. Noise Category and Mathematical Model

Various noises are introduced during the acquisition, transmission, and recording of images, which leads to the degradation of image quality. Generally speaking, there is noise in the actual image. In order to ensure the accuracy and reliability of the detection, recognition, and segmentation of degraded images, it is necessary to improve the quality of the image and perform some necessary preprocessing before the target detection, target recognition, and image segmentation of the image. The main purpose of preprocessing is to eliminate some irrelevant information in the image and restore and enhance some useful real information [10, 11]. Noise reduction is a common method of image preprocessing, and its filtering result directly affects the processing effect of subsequent algorithms.(1) Gaussian noise. The probability density of Gaussian noise is shown in formula (1), where z represents the pixel gray value, μ represents the expected value of z, σ is the standard deviation of z. The characteristics of Gaussian noise: the position of occurrence is fixed, but the amplitude changes randomly [12].(1)pz=12πσexp−z−μ22σ2.(2) Rayleigh noise. The probability density of Rayleigh noise is as in formula (2), where z represents the pixel gray value. The envelope of the sum of two orthogonal Gaussian noise signals follows the Rayleigh distribution [13].(2)pz=2bz−aexp−z−a2b,z≥a,0,z<a.(3) Gamma noise. The probability density of gamma noise is shown in formula (3), where z represents the pixel gray value, where a>0 represents the displacement from the origin; b is a positive integer. The function curve deforms to the right [14].(3)pz=abzb−1b−1!e−az,z≥0,0,z<0.(4) Exponential noise. The probability density of exponential noise is as shown in formula (4), where z represents the pixel gray value, a>0. The probability density function of this exponential distribution is a special case of gamma distribution when b=1 [15].(4)pz=az−az,z≥0,0,z<0.(5) Uniform noise. The probability density of uniform noise is as in formula (5), where a>0 and b are positive integers. It shows that the probability that a,b falls within the subinterval is only related to the length of the subinterval, and has nothing to do with the position of the subinterval, that is, a possibility that the probability of falling within the subinterval is equal [16].(5)pz=1b−a,a≤z≤b,0,Other.According to the pollution method of the image signal, it can be divided into three types: additive noise, impulsive noise, and multiplicative noise:The degradation model of images contaminated by additive noise is:(6)xi,j=si,j+ni,j.The degradation model of images contaminated by impulsive noise is:(7)xi,j=ni,j,p,si,j,1−p.The degradation model of the image polluted by multiplicative noise is:(8)xi,j=si,j+fsi,j⋅ni,j,Where xi,j is an image contaminated by noise, si,j is the original image, ni,j is noise, and p is the probability of impulsive noise.


#### 2.2.2. Principle and Comparison of Denoising Filtering

There are two types of image filtering and denoising methods: the spatial domain method and the frequency domain method. The spatial domain method operates on each pixel in the image, and the frequency domain method operates on the entire image in a certain transform domain of the image. Simultaneously modify the transformed coefficients, such as Fourier transform, DCT transform, and then inverse transform to obtain the processed image [17, 18].(1) Spatial filtering. Spatial filtering includes linear filtering and nonlinear filtering. The mechanism of spatial filtering is shown in Figure 2. This processing is to move the mask point by point in the image to be processed.Figure 2
Spatial filtering mechanism. (a) Coordinate values of template coefficients. (b) Image pixels under the template.
(a)(b)As shown in Figure2, (a) it is a 3 × 3 mask and (b) is the image pixel under the template. At the point x,y in the image, the response R linearly filtered with this mask is:(9)R=w−1,−1fx−1,y−1+w−1,0fx−1,y+⋯+w0,0fx,y+⋯+w1,0fx+1,y+w1,1fx+1,y+1.It can be generalized to the general situation, and the simplified expression of the responseR obtained by performing m×n mask processing on any point x,y in the image is as formula (10):(10)R=w1z1+w2z2+⋯+wmnzmn=∑i=1mnwizi,where wi is the mask coefficient, zi is the pixel gray value corresponding to the coefficient, and mn is the total number of pixels included in the mask. Nonlinear spatial filtering processing is also based on neighborhood processing, but the processing is to limit the movement range of the center point of the mask to not less than n−1/2 pixels from the edge of the image. This approach makes the processed image slightly smaller than the original image, so it is also necessary to filter all pixels with the mask part included in the image [19].Mean filter is a more commonly used linear filter, which is a local spatial domain processing algorithm. The basic idea is to replace the gray of each pixel with the average of the gray of several pixels [20]. Suppose there is an N×N pixel image fx,y, and after smoothing, an image gx,y is obtained. gx,y is determined by(11)gx,y=1M∑m⋅n∈Sfm⋅n.In the formula,x,y=0,1,2,⋯N−1; S is the set of coordinates including x,y points in the neighborhood of x,y; M is the total number of coordinate points in the set. The average filtering of 3×3 is more commonly used in image pre-processing. It is to add the gray value of a pixel in the original image and the gray values of 8 neighboring pixels around it, and then divide the average value obtained by 9 as the new image [21, 22].Median filtering is a more commonly used nonlinear filtering. The basic principle is to replace the value of a point in a digital image or digital sequence with the median of each point in a neighborhood of the point so that the surrounding pixel values are close to the true value. In order to eliminate isolated noise points, the specific process example is shown in Figure3. The two-dimensional median filter output is gx,y=medfx−k,y−l,k,l∈W, where fx,y and gx,y are the original image and the processed image, respectively. W is a two-dimensional template, usually 2 × 2, 3 × 3 areas, or different shapes, such as linear, circular, cross, circular, and so on.Figure 3
Median filter example flows chart.When using the mean filtering principle to de-noise the image, the Gaussian noise filtering effect is very good; but the salt and pepper noise suppression effect is not good, many noise points in the image have not been effectively filtered, but are blurred and dispersed in the image, even there are cases, where edge details are destroyed. When using nonlinear median filter processing, the median filter is less capable of suppressing random noise than the average filter, but for pulse (narrow pulse) interference and salt and pepper noise, the median filter effect is obvious [23, 24]. The median filter is different from the average filter in that it attenuates noise while not blurring the boundaries of the image.


#### 2.2.3. Frequency Domain Filtering

The frequency domain filtering of the image is to transform the image from the spatial domain to the frequency domain first. This step can use Fourier transform, Walsh–Hadamard (WH) transform, Cosine transform, Karhunen–Loeve transform, ridgelet transform, wavelet transform, etc., and then filter the image by convolution operation in the frequency domain space of the image.The system block diagram of the frequency domain filtering method taking Fourier transform as an example is shown in Figure4:Figure 4
Frequency filter system block diagram.As shown in Figure4, gi,j represents the result of the convolution operation between the function fi,j and the linear shift-invariant operator hi,j, i.e.,(12)gi,j=fi,j⊗hi,j.Fourier transform (12) to obtain(13)Gu,v=Fu,vHu,v.Hu,v is called the filter function or transfer function, Fu,v which is obtained by the Fourier transform of the image function to be processed fi,j. In actual use, first, determine Hu,v to obtain Gu,v, and then inverse Fourier transform Gu,v to get the filtered image gi,j.


### 2.3. BP Neural Network

The BP neural network can make the training signal pass forward, and the error passes backward. The core idea is that the expected output cannot be obtained at the output layer of the BP neural network, then the neural network is turned to backpropagation, and the weights and thresholds of the network are adjusted through the prediction error. Because of its simple structure and convenient training, it is widely used [25, 26]. Figure 5 shows the structure of the BP neural network.Figure 5
BP neural network.As shown in Figure5, (x)1, (x)2,..., Xn are the input signals of the neural network, Y1, Y2,..., Ym are the predicted values of the neural network, wij and wjk are the weights of the neural network. During training, the signal enters from the input layer, passes through the hidden layer, and finally reaches the output layer. At the end of the training, observe the difference between the predicted values Y1, Y2,..., Ym, and the expected value. If the error is within the expected range, the training is completed; if the error is large and not within the expected range, the error signal is converted to backpropagation, the weights and thresholds are readjusted, and then the network continues to be trained. Stop training until the error is within the expected range.


## 2.1. Remote Sensing Image Segmentation Technology

In the application and research of image segmentation, people are often only interested in certain parts of the image. These parts are generally called “objects” or “targets,” which correspond to specific areas with unique properties in the image. These areas need to be separated. Image segmentation is an image processing technique that divides an image into characteristic regions and segments out interesting objects. It is a basic content of image understanding and analysis [5, 6]. The area in the image can be represented by a collection, which refers to a collection of connected pixels with consistent “meaningful” attributes. The so-called “meaningful” attributes depend on the specific conditions of the image to be analyzed, such as the grayscale, color, statistical characteristics, or texture characteristics of the image element field. “Consistency” requires that each region has the same or similar characteristic attributes.Image engineering, as a new subject in the field of image research applications, can be divided into three hierarchical structures: processing layer, analysis layer, and understanding layer according to the differences between the overall level and the analysis method. As shown in Figure1, the first link in image analysis is image segmentation, which fully embodies the importance of image segmentation. The main point of image segmentation is to connect pixel units with the same physical meaning in the image as connected regions. Generally, image segmentation is achieved by using feature information such as the spectrum, texture, and shape of the object unit. The next step of image segmentation is often target tracking, remote sensing interpretation, and pattern recognition based on the segmentation results. The quality of the segmentation directly affects the subsequent application analysis and determines the quality and effectiveness of the segmentation application. It is of great importance [7].Figure 1
The location of image segmentation in image processing.In recent years, a new field of research has emerged in the analysis of remote sensing images, that is, the realization of remote sensing applications based on object-oriented thinking. The most fundamental problem of object-oriented thinking is image segmentation. From the perspective of overall development and research, research on object-oriented remote sensing image-related technologies is still in its infancy, and it is relatively difficult to study how to efficiently achieve high-quality segmentation of remote sensing images. However, the quality of image segmentation is directly related to the application of later images, such as analysis and interpretation. Therefore, the selection of a suitable remote sensing image segmentation algorithm is the key to the success and failure of remote sensing image analysis and understanding [8,9].


## 2.2. Image Segmentation Preprocessing

### 2.2.1. Noise Category and Mathematical Model

Various noises are introduced during the acquisition, transmission, and recording of images, which leads to the degradation of image quality. Generally speaking, there is noise in the actual image. In order to ensure the accuracy and reliability of the detection, recognition, and segmentation of degraded images, it is necessary to improve the quality of the image and perform some necessary preprocessing before the target detection, target recognition, and image segmentation of the image. The main purpose of preprocessing is to eliminate some irrelevant information in the image and restore and enhance some useful real information [10, 11]. Noise reduction is a common method of image preprocessing, and its filtering result directly affects the processing effect of subsequent algorithms.(1) Gaussian noise. The probability density of Gaussian noise is shown in formula (1), where z represents the pixel gray value, μ represents the expected value of z, σ is the standard deviation of z. The characteristics of Gaussian noise: the position of occurrence is fixed, but the amplitude changes randomly [12].(1)pz=12πσexp−z−μ22σ2.(2) Rayleigh noise. The probability density of Rayleigh noise is as in formula (2), where z represents the pixel gray value. The envelope of the sum of two orthogonal Gaussian noise signals follows the Rayleigh distribution [13].(2)pz=2bz−aexp−z−a2b,z≥a,0,z<a.(3) Gamma noise. The probability density of gamma noise is shown in formula (3), where z represents the pixel gray value, where a>0 represents the displacement from the origin; b is a positive integer. The function curve deforms to the right [14].(3)pz=abzb−1b−1!e−az,z≥0,0,z<0.(4) Exponential noise. The probability density of exponential noise is as shown in formula (4), where z represents the pixel gray value, a>0. The probability density function of this exponential distribution is a special case of gamma distribution when b=1 [15].(4)pz=az−az,z≥0,0,z<0.(5) Uniform noise. The probability density of uniform noise is as in formula (5), where a>0 and b are positive integers. It shows that the probability that a,b falls within the subinterval is only related to the length of the subinterval, and has nothing to do with the position of the subinterval, that is, a possibility that the probability of falling within the subinterval is equal [16].(5)pz=1b−a,a≤z≤b,0,Other.According to the pollution method of the image signal, it can be divided into three types: additive noise, impulsive noise, and multiplicative noise:The degradation model of images contaminated by additive noise is:(6)xi,j=si,j+ni,j.The degradation model of images contaminated by impulsive noise is:(7)xi,j=ni,j,p,si,j,1−p.The degradation model of the image polluted by multiplicative noise is:(8)xi,j=si,j+fsi,j⋅ni,j,Where xi,j is an image contaminated by noise, si,j is the original image, ni,j is noise, and p is the probability of impulsive noise.


### 2.2.2. Principle and Comparison of Denoising Filtering

There are two types of image filtering and denoising methods: the spatial domain method and the frequency domain method. The spatial domain method operates on each pixel in the image, and the frequency domain method operates on the entire image in a certain transform domain of the image. Simultaneously modify the transformed coefficients, such as Fourier transform, DCT transform, and then inverse transform to obtain the processed image [17, 18].(1) Spatial filtering. Spatial filtering includes linear filtering and nonlinear filtering. The mechanism of spatial filtering is shown in Figure 2. This processing is to move the mask point by point in the image to be processed.Figure 2
Spatial filtering mechanism. (a) Coordinate values of template coefficients. (b) Image pixels under the template.
(a)(b)As shown in Figure2, (a) it is a 3 × 3 mask and (b) is the image pixel under the template. At the point x,y in the image, the response R linearly filtered with this mask is:(9)R=w−1,−1fx−1,y−1+w−1,0fx−1,y+⋯+w0,0fx,y+⋯+w1,0fx+1,y+w1,1fx+1,y+1.It can be generalized to the general situation, and the simplified expression of the responseR obtained by performing m×n mask processing on any point x,y in the image is as formula (10):(10)R=w1z1+w2z2+⋯+wmnzmn=∑i=1mnwizi,where wi is the mask coefficient, zi is the pixel gray value corresponding to the coefficient, and mn is the total number of pixels included in the mask. Nonlinear spatial filtering processing is also based on neighborhood processing, but the processing is to limit the movement range of the center point of the mask to not less than n−1/2 pixels from the edge of the image. This approach makes the processed image slightly smaller than the original image, so it is also necessary to filter all pixels with the mask part included in the image [19].Mean filter is a more commonly used linear filter, which is a local spatial domain processing algorithm. The basic idea is to replace the gray of each pixel with the average of the gray of several pixels [20]. Suppose there is an N×N pixel image fx,y, and after smoothing, an image gx,y is obtained. gx,y is determined by(11)gx,y=1M∑m⋅n∈Sfm⋅n.In the formula,x,y=0,1,2,⋯N−1; S is the set of coordinates including x,y points in the neighborhood of x,y; M is the total number of coordinate points in the set. The average filtering of 3×3 is more commonly used in image pre-processing. It is to add the gray value of a pixel in the original image and the gray values of 8 neighboring pixels around it, and then divide the average value obtained by 9 as the new image [21, 22].Median filtering is a more commonly used nonlinear filtering. The basic principle is to replace the value of a point in a digital image or digital sequence with the median of each point in a neighborhood of the point so that the surrounding pixel values are close to the true value. In order to eliminate isolated noise points, the specific process example is shown in Figure3. The two-dimensional median filter output is gx,y=medfx−k,y−l,k,l∈W, where fx,y and gx,y are the original image and the processed image, respectively. W is a two-dimensional template, usually 2 × 2, 3 × 3 areas, or different shapes, such as linear, circular, cross, circular, and so on.Figure 3
Median filter example flows chart.When using the mean filtering principle to de-noise the image, the Gaussian noise filtering effect is very good; but the salt and pepper noise suppression effect is not good, many noise points in the image have not been effectively filtered, but are blurred and dispersed in the image, even there are cases, where edge details are destroyed. When using nonlinear median filter processing, the median filter is less capable of suppressing random noise than the average filter, but for pulse (narrow pulse) interference and salt and pepper noise, the median filter effect is obvious [23, 24]. The median filter is different from the average filter in that it attenuates noise while not blurring the boundaries of the image.


### 2.2.3. Frequency Domain Filtering

The frequency domain filtering of the image is to transform the image from the spatial domain to the frequency domain first. This step can use Fourier transform, Walsh–Hadamard (WH) transform, Cosine transform, Karhunen–Loeve transform, ridgelet transform, wavelet transform, etc., and then filter the image by convolution operation in the frequency domain space of the image.The system block diagram of the frequency domain filtering method taking Fourier transform as an example is shown in Figure4:Figure 4
Frequency filter system block diagram.As shown in Figure4, gi,j represents the result of the convolution operation between the function fi,j and the linear shift-invariant operator hi,j, i.e.,(12)gi,j=fi,j⊗hi,j.Fourier transform (12) to obtain(13)Gu,v=Fu,vHu,v.Hu,v is called the filter function or transfer function, Fu,v which is obtained by the Fourier transform of the image function to be processed fi,j. In actual use, first, determine Hu,v to obtain Gu,v, and then inverse Fourier transform Gu,v to get the filtered image gi,j.


## 2.2.1. Noise Category and Mathematical Model

Various noises are introduced during the acquisition, transmission, and recording of images, which leads to the degradation of image quality. Generally speaking, there is noise in the actual image. In order to ensure the accuracy and reliability of the detection, recognition, and segmentation of degraded images, it is necessary to improve the quality of the image and perform some necessary preprocessing before the target detection, target recognition, and image segmentation of the image. The main purpose of preprocessing is to eliminate some irrelevant information in the image and restore and enhance some useful real information [10, 11]. Noise reduction is a common method of image preprocessing, and its filtering result directly affects the processing effect of subsequent algorithms.(1) Gaussian noise. The probability density of Gaussian noise is shown in formula (1), where z represents the pixel gray value, μ represents the expected value of z, σ is the standard deviation of z. The characteristics of Gaussian noise: the position of occurrence is fixed, but the amplitude changes randomly [12].(1)pz=12πσexp−z−μ22σ2.(2) Rayleigh noise. The probability density of Rayleigh noise is as in formula (2), where z represents the pixel gray value. The envelope of the sum of two orthogonal Gaussian noise signals follows the Rayleigh distribution [13].(2)pz=2bz−aexp−z−a2b,z≥a,0,z<a.(3) Gamma noise. The probability density of gamma noise is shown in formula (3), where z represents the pixel gray value, where a>0 represents the displacement from the origin; b is a positive integer. The function curve deforms to the right [14].(3)pz=abzb−1b−1!e−az,z≥0,0,z<0.(4) Exponential noise. The probability density of exponential noise is as shown in formula (4), where z represents the pixel gray value, a>0. The probability density function of this exponential distribution is a special case of gamma distribution when b=1 [15].(4)pz=az−az,z≥0,0,z<0.(5) Uniform noise. The probability density of uniform noise is as in formula (5), where a>0 and b are positive integers. It shows that the probability that a,b falls within the subinterval is only related to the length of the subinterval, and has nothing to do with the position of the subinterval, that is, a possibility that the probability of falling within the subinterval is equal [16].(5)pz=1b−a,a≤z≤b,0,Other.According to the pollution method of the image signal, it can be divided into three types: additive noise, impulsive noise, and multiplicative noise:The degradation model of images contaminated by additive noise is:(6)xi,j=si,j+ni,j.The degradation model of images contaminated by impulsive noise is:(7)xi,j=ni,j,p,si,j,1−p.The degradation model of the image polluted by multiplicative noise is:(8)xi,j=si,j+fsi,j⋅ni,j,Where xi,j is an image contaminated by noise, si,j is the original image, ni,j is noise, and p is the probability of impulsive noise.


## 2.2.2. Principle and Comparison of Denoising Filtering

There are two types of image filtering and denoising methods: the spatial domain method and the frequency domain method. The spatial domain method operates on each pixel in the image, and the frequency domain method operates on the entire image in a certain transform domain of the image. Simultaneously modify the transformed coefficients, such as Fourier transform, DCT transform, and then inverse transform to obtain the processed image [17, 18].(1) Spatial filtering. Spatial filtering includes linear filtering and nonlinear filtering. The mechanism of spatial filtering is shown in Figure 2. This processing is to move the mask point by point in the image to be processed.Figure 2
Spatial filtering mechanism. (a) Coordinate values of template coefficients. (b) Image pixels under the template.
(a)(b)As shown in Figure2, (a) it is a 3 × 3 mask and (b) is the image pixel under the template. At the point x,y in the image, the response R linearly filtered with this mask is:(9)R=w−1,−1fx−1,y−1+w−1,0fx−1,y+⋯+w0,0fx,y+⋯+w1,0fx+1,y+w1,1fx+1,y+1.It can be generalized to the general situation, and the simplified expression of the responseR obtained by performing m×n mask processing on any point x,y in the image is as formula (10):(10)R=w1z1+w2z2+⋯+wmnzmn=∑i=1mnwizi,where wi is the mask coefficient, zi is the pixel gray value corresponding to the coefficient, and mn is the total number of pixels included in the mask. Nonlinear spatial filtering processing is also based on neighborhood processing, but the processing is to limit the movement range of the center point of the mask to not less than n−1/2 pixels from the edge of the image. This approach makes the processed image slightly smaller than the original image, so it is also necessary to filter all pixels with the mask part included in the image [19].Mean filter is a more commonly used linear filter, which is a local spatial domain processing algorithm. The basic idea is to replace the gray of each pixel with the average of the gray of several pixels [20]. Suppose there is an N×N pixel image fx,y, and after smoothing, an image gx,y is obtained. gx,y is determined by(11)gx,y=1M∑m⋅n∈Sfm⋅n.In the formula,x,y=0,1,2,⋯N−1; S is the set of coordinates including x,y points in the neighborhood of x,y; M is the total number of coordinate points in the set. The average filtering of 3×3 is more commonly used in image pre-processing. It is to add the gray value of a pixel in the original image and the gray values of 8 neighboring pixels around it, and then divide the average value obtained by 9 as the new image [21, 22].Median filtering is a more commonly used nonlinear filtering. The basic principle is to replace the value of a point in a digital image or digital sequence with the median of each point in a neighborhood of the point so that the surrounding pixel values are close to the true value. In order to eliminate isolated noise points, the specific process example is shown in Figure3. The two-dimensional median filter output is gx,y=medfx−k,y−l,k,l∈W, where fx,y and gx,y are the original image and the processed image, respectively. W is a two-dimensional template, usually 2 × 2, 3 × 3 areas, or different shapes, such as linear, circular, cross, circular, and so on.Figure 3
Median filter example flows chart.When using the mean filtering principle to de-noise the image, the Gaussian noise filtering effect is very good; but the salt and pepper noise suppression effect is not good, many noise points in the image have not been effectively filtered, but are blurred and dispersed in the image, even there are cases, where edge details are destroyed. When using nonlinear median filter processing, the median filter is less capable of suppressing random noise than the average filter, but for pulse (narrow pulse) interference and salt and pepper noise, the median filter effect is obvious [23, 24]. The median filter is different from the average filter in that it attenuates noise while not blurring the boundaries of the image.


## 2.2.3. Frequency Domain Filtering

The frequency domain filtering of the image is to transform the image from the spatial domain to the frequency domain first. This step can use Fourier transform, Walsh–Hadamard (WH) transform, Cosine transform, Karhunen–Loeve transform, ridgelet transform, wavelet transform, etc., and then filter the image by convolution operation in the frequency domain space of the image.The system block diagram of the frequency domain filtering method taking Fourier transform as an example is shown in Figure4:Figure 4
Frequency filter system block diagram.As shown in Figure4, gi,j represents the result of the convolution operation between the function fi,j and the linear shift-invariant operator hi,j, i.e.,(12)gi,j=fi,j⊗hi,j.Fourier transform (12) to obtain(13)Gu,v=Fu,vHu,v.Hu,v is called the filter function or transfer function, Fu,v which is obtained by the Fourier transform of the image function to be processed fi,j. In actual use, first, determine Hu,v to obtain Gu,v, and then inverse Fourier transform Gu,v to get the filtered image gi,j.


## 2.3. BP Neural Network

The BP neural network can make the training signal pass forward, and the error passes backward. The core idea is that the expected output cannot be obtained at the output layer of the BP neural network, then the neural network is turned to backpropagation, and the weights and thresholds of the network are adjusted through the prediction error. Because of its simple structure and convenient training, it is widely used [25, 26]. Figure 5 shows the structure of the BP neural network.Figure 5
BP neural network.As shown in Figure5, (x)1, (x)2,..., Xn are the input signals of the neural network, Y1, Y2,..., Ym are the predicted values of the neural network, wij and wjk are the weights of the neural network. During training, the signal enters from the input layer, passes through the hidden layer, and finally reaches the output layer. At the end of the training, observe the difference between the predicted values Y1, Y2,..., Ym, and the expected value. If the error is within the expected range, the training is completed; if the error is large and not within the expected range, the error signal is converted to backpropagation, the weights and thresholds are readjusted, and then the network continues to be trained. Stop training until the error is within the expected range.


## 3. Multisource Remote Sensing Image Classification Experiment Design

### 3.1. System Hardware and Software Environment

This experiment was conducted on a PC, the operating environment was Win7, and the development environment was MATLAB R2014b. The camera parameters are 1.3 million pixels, the resolution is 320 × 240, 24 bit true color, and 30FPS.The GUI program is an event-driven program in MATLAB. Each control in the GUI is related to a user-defined statement. When you click the operation that needs to be performed on the designed interface, the relevant statement starts to execute. GUI interface design has the advantage that other software cannot compare: it is supported by powerful MATLAB.


### 3.2. Source of Remote Sensing Data

Remote sensing image data are a very important source of geoscience information, and its basic attribute is its multi-source nature. Different types of remote sensing image data have different physical attributes, namely, different spatial resolution, spectral resolution, and temporal resolution, which are also the three criteria for evaluating remote sensing image data. This study received strong support from a planning and design institute to provide SPOT5 remote sensing images for this study.


### 3.3. Preprocessing of Remote Sensing Images

SPOT5 images have 4 multi-spectral bands and 1 panchromatic band. The 1 and 2 bands of SPOT5 are in the visible light region, which can reflect the different degrees of plant pigments. The 1 band of SPOT5 obtains the reflection information of plants in the green light area, but the size of the reflection peak depends on the absorption of light energy by the chlorophyll in the blue and red light areas. How much, it can be seen that the 1 band of SPOT5 cannot essentially reflect the chlorophyll situation of the reflection spectrum characteristics of plants in the visible light region. The 2 band of SPOT5 obtains the information of the red light area, which not only reflects the plant chlorophyll information but also reflects the pigment information such as chlorophyll and lutein during the color change period of autumn plants. The remote sensing information can make different types of vegetation have different colors. Conducive to the identification of vegetation types.In this study, through the analysis of forestry information thematic maps, forest type plot survey data, text data, etc., in the study area, combined with the interpretation results of remote sensing images, using the accuracy evaluation function of ERDAS software, 200 points were randomly selected in layers to carry out the classification of remote sensing images. Evaluation of classification accuracy.


## 3.1. System Hardware and Software Environment

This experiment was conducted on a PC, the operating environment was Win7, and the development environment was MATLAB R2014b. The camera parameters are 1.3 million pixels, the resolution is 320 × 240, 24 bit true color, and 30FPS.The GUI program is an event-driven program in MATLAB. Each control in the GUI is related to a user-defined statement. When you click the operation that needs to be performed on the designed interface, the relevant statement starts to execute. GUI interface design has the advantage that other software cannot compare: it is supported by powerful MATLAB.


## 3.2. Source of Remote Sensing Data

Remote sensing image data are a very important source of geoscience information, and its basic attribute is its multi-source nature. Different types of remote sensing image data have different physical attributes, namely, different spatial resolution, spectral resolution, and temporal resolution, which are also the three criteria for evaluating remote sensing image data. This study received strong support from a planning and design institute to provide SPOT5 remote sensing images for this study.


## 3.3. Preprocessing of Remote Sensing Images

SPOT5 images have 4 multi-spectral bands and 1 panchromatic band. The 1 and 2 bands of SPOT5 are in the visible light region, which can reflect the different degrees of plant pigments. The 1 band of SPOT5 obtains the reflection information of plants in the green light area, but the size of the reflection peak depends on the absorption of light energy by the chlorophyll in the blue and red light areas. How much, it can be seen that the 1 band of SPOT5 cannot essentially reflect the chlorophyll situation of the reflection spectrum characteristics of plants in the visible light region. The 2 band of SPOT5 obtains the information of the red light area, which not only reflects the plant chlorophyll information but also reflects the pigment information such as chlorophyll and lutein during the color change period of autumn plants. The remote sensing information can make different types of vegetation have different colors. Conducive to the identification of vegetation types.In this study, through the analysis of forestry information thematic maps, forest type plot survey data, text data, etc., in the study area, combined with the interpretation results of remote sensing images, using the accuracy evaluation function of ERDAS software, 200 points were randomly selected in layers to carry out the classification of remote sensing images. Evaluation of classification accuracy.


## 4. Multisource Remote Sensing Image Classification Discussion

### 4.1. Classification Accuracy Analysis of Multisource Remote Sensing Images

After the remote sensing classification is completed, classification accuracy analysis is required. Precision analysis is also an indispensable task in the process of remote sensing data classification. Through accuracy analysis, the classifier can determine the effectiveness of the classification mode, improve the classification mode, and improve the classification accuracy; the user can accurately and effectively obtain the information in the classification result according to the accuracy of the classification result. The evaluation of classification accuracy of remote sensing images is usually done by comparing the classification map with standard data (maps or ground measured values) and expressing the accuracy as a percentage of correct classification. The evaluation methods of classification accuracy of remote sensing images can be divided into nonpositional accuracy and positional accuracy. Nonpositional accuracy refers to the classification accuracy by area or number of pixels, and positional accuracy is to checking the classification category and the spatial location, where it is located. Accuracy evaluation is best to compare the consistency between each pixel in the two images. But in most cases, it is impossible to select all the pixels for inspection. We can only select a certain number of pixels for inspection by sampling. At present, the error matrix method (error matrix, also known as confusion matrix) is commonly used to evaluate the accuracy of remote sensing image classification. As shown in Table1, error analysis can be performed with a matrix L which is an r × r matrix (r is the ground Number of class types), the elements in the matrix represent the number of samples pixels.Table 1
Classification error matrix.
GenreReference dataLand type12...rRow sum1X11X12...X1rX1+2X21X22...X2rX2+..................RXr1Xr2...XrrXr+Column sumX+1X+2...X+ rNXi+ andX + i are the total number of row samples and column samples of the classification error matrix, N is the total number of samples; Ki is the conditional Kappa coefficient of the i-th category. Because the Kappa coefficient makes full use of the classification error matrix information, it is often used as a comprehensive index for classification accuracy evaluation. The study believes that the Kappa coefficient and classification accuracy have the relationship shown in Table 2.Table 2
Classification quality and Kappa statistics.
K (Kappa coefficient)Classification quality<0.00Very bad0.00∼0.20Difference0.20∼0.40Commonly0.40∼0.60Good0.60∼0.80Very good0.80∼1.00Very niceAs shown in Table3 and Figure 6, the total accuracy of unsupervised classification of remote sensing images in the study area is 66.72%, but the Kappa coefficient is only 0.2473, indicating that the classification effect is general. In the unsupervised classification images, the classification effect of non-forest land is relatively good, the user accuracy is 70.11%, and the conditional Kappa coefficient is 0.6712, indicating that the spectral value of non-forest land is quite different from other land types. The accuracy of the coniferous forest users is 31.37%, the conditional Kappa coefficient is 0.2759, and 6 of the 16 coniferous forest sampling points are misclassified into broad-leaved forests, and 4 are misclassified into coniferous and broad-leaved mixed forests difference. The user accuracy of the broad-leaved forest reaches 84.35%, but the conditional Kappa coefficient is only 0.3151, and the classification effect is not good. There are 37 other types of sampling points that are misclassified into broad-leaved forests, indicating that the high user accuracy of broad-leaved forests is caused by a large number of sampling points of other types being classified into broad-leaved forests. Among all categories, the classification accuracy of the coniferous and broad-leaved mixed forests is the lowest, indicating that the unsupervised classification has poor recognition effect on coniferous and broad-leaved mixed forests.Table 3
Evaluation table of unsupervised classification accuracy in the study area.
TerrestrialProducer’s accuracy (%)User accuracy (%)KappaNon-forest land70.1170.110.6712Coniferous forest50.0031.370.2759Broad-leaved forest75.5084.350.3151Needle and broad mixture14.9711.84−0.0139Figure 6
Evaluation of classification accuracy.


### 4.2. Classification Accuracy Analysis Based on His Fusion Image

As shown in Table4 and Figure 7, compared with the conventional classification based on multi-spectral information, when the CON texture feature is added, the overall accuracy and Kappa coefficient of the classification are obtained for both the maximum likelihood method and the BP neural network method improvement. For study area 1, the overall accuracy increased from 92.34% and 92.29% to 92.88% and 94.75%, and the Kappa coefficient also increased from 0.912 and 0.911 to 0.914 and 0.937, respectively, while in study area 2 the overall accuracy also increased from 82.47% and 86.78% to 93.49% and 94.83%, and the Kappa coefficient increased from 0.772 and 0.835 to 0.914 and 0.933, respectively. In addition, the overall accuracy and Kappa coefficient of the combined image of spectral and texture features classified by the BP neural network method are the highest. The overall accuracy of the two research subregions reached 94.84% and 94.76%, respectively, and the Kappa coefficient also reached 0.937 and 0.932. The overall accuracy and Kappa coefficient of the BP neural network classification are slightly larger than the parameters corresponding to the maximum likelihood classification. Therefore, on the whole, the classification result of the BP neural network method in this study area is better than the maximum likelihood method. Compared with the maximum likelihood method, the BP neural network method is more suitable for classification research and information extraction in this study area: The combined image of spectral and texture features is used as the classification source image, which fully utilizes the spectral and spatial information of the high-resolution image, which can effectively improve the classification accuracy.Table 4
Analysis of classification accuracy based on HIS fusion image.
Source imageCategory and accuracyRoadResidential areaSpaceGreen spaceUser precision (%)HIS fusion imageRoad168690071.79Residential area381129069.53Space233187086.12Green space000207100Production accuracy80.58%53.49%95.43%100%Overall accuracy82.42%Kappa coefficient0.772Figure 7
Classification accuracy of fused images.The collection of test samples adopts the method of random sampling and is evenly distributed on the remote sensing image. A total of 15478 pixels are obtained to obtain the test sample set. Because random sampling is very random, in order to avoid the influence of different test samples on the verification of classification accuracy, the confusion matrix verified by the various classification methods listed in this article all uses the same test sample.As shown in Figures8 and 9, part of the cultivated land is divided into residential areas, which is due to the fact that many vegetable greenhouses are embedded in the cultivated land. Judging from the comparison of the confusion matrices, the maximum likelihood method has the smallest misclassification rate; from the pixel statistics, the classification results are also closer to the results of visual interpretation, but because many small pieces of grassland and for woodland, the maximum likelihood method and visual interpretation method cannot be extracted, and the extracted cultivated land area is slightly larger than the actual cultivated land area, so the classification results based on BP neural network are more in line with the actual situation.Figure 8
BP neural network classification confusion.Figure 9
BP neural network classification correct rate.The classification effect of the BP neural network adopted this time is better than that of the maximum likelihood method in general, and it is improved compared with the traditional classification method. Because neural network classification is not based on a certain assumed probability distribution, but by learning the training samples, the weights of the network are obtained to form a classifier. Using a neural network algorithm for remote sensing image classification can eliminate the ambiguity and uncertainty brought by the traditional remote sensing image classification to a certain extent. However, there are still many problems to be solved when using the neural network model.


## 4.1. Classification Accuracy Analysis of Multisource Remote Sensing Images

After the remote sensing classification is completed, classification accuracy analysis is required. Precision analysis is also an indispensable task in the process of remote sensing data classification. Through accuracy analysis, the classifier can determine the effectiveness of the classification mode, improve the classification mode, and improve the classification accuracy; the user can accurately and effectively obtain the information in the classification result according to the accuracy of the classification result. The evaluation of classification accuracy of remote sensing images is usually done by comparing the classification map with standard data (maps or ground measured values) and expressing the accuracy as a percentage of correct classification. The evaluation methods of classification accuracy of remote sensing images can be divided into nonpositional accuracy and positional accuracy. Nonpositional accuracy refers to the classification accuracy by area or number of pixels, and positional accuracy is to checking the classification category and the spatial location, where it is located. Accuracy evaluation is best to compare the consistency between each pixel in the two images. But in most cases, it is impossible to select all the pixels for inspection. We can only select a certain number of pixels for inspection by sampling. At present, the error matrix method (error matrix, also known as confusion matrix) is commonly used to evaluate the accuracy of remote sensing image classification. As shown in Table1, error analysis can be performed with a matrix L which is an r × r matrix (r is the ground Number of class types), the elements in the matrix represent the number of samples pixels.Table 1
Classification error matrix.
GenreReference dataLand type12...rRow sum1X11X12...X1rX1+2X21X22...X2rX2+..................RXr1Xr2...XrrXr+Column sumX+1X+2...X+ rNXi+ andX + i are the total number of row samples and column samples of the classification error matrix, N is the total number of samples; Ki is the conditional Kappa coefficient of the i-th category. Because the Kappa coefficient makes full use of the classification error matrix information, it is often used as a comprehensive index for classification accuracy evaluation. The study believes that the Kappa coefficient and classification accuracy have the relationship shown in Table 2.Table 2
Classification quality and Kappa statistics.
K (Kappa coefficient)Classification quality<0.00Very bad0.00∼0.20Difference0.20∼0.40Commonly0.40∼0.60Good0.60∼0.80Very good0.80∼1.00Very niceAs shown in Table3 and Figure 6, the total accuracy of unsupervised classification of remote sensing images in the study area is 66.72%, but the Kappa coefficient is only 0.2473, indicating that the classification effect is general. In the unsupervised classification images, the classification effect of non-forest land is relatively good, the user accuracy is 70.11%, and the conditional Kappa coefficient is 0.6712, indicating that the spectral value of non-forest land is quite different from other land types. The accuracy of the coniferous forest users is 31.37%, the conditional Kappa coefficient is 0.2759, and 6 of the 16 coniferous forest sampling points are misclassified into broad-leaved forests, and 4 are misclassified into coniferous and broad-leaved mixed forests difference. The user accuracy of the broad-leaved forest reaches 84.35%, but the conditional Kappa coefficient is only 0.3151, and the classification effect is not good. There are 37 other types of sampling points that are misclassified into broad-leaved forests, indicating that the high user accuracy of broad-leaved forests is caused by a large number of sampling points of other types being classified into broad-leaved forests. Among all categories, the classification accuracy of the coniferous and broad-leaved mixed forests is the lowest, indicating that the unsupervised classification has poor recognition effect on coniferous and broad-leaved mixed forests.Table 3
Evaluation table of unsupervised classification accuracy in the study area.
TerrestrialProducer’s accuracy (%)User accuracy (%)KappaNon-forest land70.1170.110.6712Coniferous forest50.0031.370.2759Broad-leaved forest75.5084.350.3151Needle and broad mixture14.9711.84−0.0139Figure 6
Evaluation of classification accuracy.


## 4.2. Classification Accuracy Analysis Based on His Fusion Image

As shown in Table4 and Figure 7, compared with the conventional classification based on multi-spectral information, when the CON texture feature is added, the overall accuracy and Kappa coefficient of the classification are obtained for both the maximum likelihood method and the BP neural network method improvement. For study area 1, the overall accuracy increased from 92.34% and 92.29% to 92.88% and 94.75%, and the Kappa coefficient also increased from 0.912 and 0.911 to 0.914 and 0.937, respectively, while in study area 2 the overall accuracy also increased from 82.47% and 86.78% to 93.49% and 94.83%, and the Kappa coefficient increased from 0.772 and 0.835 to 0.914 and 0.933, respectively. In addition, the overall accuracy and Kappa coefficient of the combined image of spectral and texture features classified by the BP neural network method are the highest. The overall accuracy of the two research subregions reached 94.84% and 94.76%, respectively, and the Kappa coefficient also reached 0.937 and 0.932. The overall accuracy and Kappa coefficient of the BP neural network classification are slightly larger than the parameters corresponding to the maximum likelihood classification. Therefore, on the whole, the classification result of the BP neural network method in this study area is better than the maximum likelihood method. Compared with the maximum likelihood method, the BP neural network method is more suitable for classification research and information extraction in this study area: The combined image of spectral and texture features is used as the classification source image, which fully utilizes the spectral and spatial information of the high-resolution image, which can effectively improve the classification accuracy.Table 4
Analysis of classification accuracy based on HIS fusion image.
Source imageCategory and accuracyRoadResidential areaSpaceGreen spaceUser precision (%)HIS fusion imageRoad168690071.79Residential area381129069.53Space233187086.12Green space000207100Production accuracy80.58%53.49%95.43%100%Overall accuracy82.42%Kappa coefficient0.772Figure 7
Classification accuracy of fused images.The collection of test samples adopts the method of random sampling and is evenly distributed on the remote sensing image. A total of 15478 pixels are obtained to obtain the test sample set. Because random sampling is very random, in order to avoid the influence of different test samples on the verification of classification accuracy, the confusion matrix verified by the various classification methods listed in this article all uses the same test sample.As shown in Figures8 and 9, part of the cultivated land is divided into residential areas, which is due to the fact that many vegetable greenhouses are embedded in the cultivated land. Judging from the comparison of the confusion matrices, the maximum likelihood method has the smallest misclassification rate; from the pixel statistics, the classification results are also closer to the results of visual interpretation, but because many small pieces of grassland and for woodland, the maximum likelihood method and visual interpretation method cannot be extracted, and the extracted cultivated land area is slightly larger than the actual cultivated land area, so the classification results based on BP neural network are more in line with the actual situation.Figure 8
BP neural network classification confusion.Figure 9
BP neural network classification correct rate.The classification effect of the BP neural network adopted this time is better than that of the maximum likelihood method in general, and it is improved compared with the traditional classification method. Because neural network classification is not based on a certain assumed probability distribution, but by learning the training samples, the weights of the network are obtained to form a classifier. Using a neural network algorithm for remote sensing image classification can eliminate the ambiguity and uncertainty brought by the traditional remote sensing image classification to a certain extent. However, there are still many problems to be solved when using the neural network model.


## 5. Conclusions

Compared with the traditional unsupervised classification and supervised classification, BP neural network has obvious advantages. In both the total classification accuracy and the total Kappa coefficient, the BP neural network classification method is superior to the traditional classification method, in which the Kappa coefficient of the image classification result of the BP neural network is 0.59, which is 0.37 higher than the unsupervised classification method and 0.14 higher than the supervised classification method. By comparing the Kappa coefficient of different vegetation types with different classification methods, it is found that the classification accuracy of different vegetation types can be greatly improved by using BP neural network classification method.In this study, after adding the CON texture image as the classification source image to the multi-spectral fusion image, the BP network method was used for classification, and the verification data was selected for accuracy evaluation. The classification accuracy of each research subarea obtained is high. The overall accuracy is above 93.2%, and the Kappa coefficient exceeds 0.9.After the experimental verification of the research area data, when the learning rate of the hidden layer is greater than the learning rate of the output layer and there is a certain difference between the two learning rates during BP network training, the network training speed is fast and the training is stable. Therefore, according to the specific, the situation sets the corresponding learning rate value.



---

*Source: 5439941-2022-08-30.xml*