Forest-Fire Recognition by Sparse and Collaborative Subspace Clustering

Traditional forest-fire recognition based on the characteristics of smoke, temperature and light fails to accurately detect and respond to early fires. By analyzing the characteristics of flame, the methods based on aerial image recognition have been widely used, such as RGB-based and HIS-based methods. However, these methods are susceptible to background factors causing interference and false detection. To alleviate these problems, we investigate two subspace clustering methods based on sparse and collaborative representation, respectively, to detect and locate forest fires. Firstly, subspace clustering segments flame from the whole image. Afterwards, sparse or collaborative representation is employed to represent most of the flame information in a dictionary with l 1 -regularization or l 2 -regularization term, which results in fewer reconstruction errors. Experimental results show that the proposed SSC and CSC substantially outperform the state-of-the art methods.


Introduction
Forest fires destroy forests and undergrowth plants, endanger human beings and wildlife, pollute soil and air, affect water cycle, and so on. In order to protect the ecological environment and human security, early fire detection is a necessary step for forest fire warning. Conventional detection methods use the characteristics of smoke, temperature and light to monitor fires. However, these methods can't respond quickly to early fire when the forest environment is bad, and the fires may not be detected immediately if it is far away from the sensors [1]. The Journal of Applied Mathematics and Physics methods based upon aerial image recognition avoid the adverse effects (e.g. space, height and airflow), by analyzing the characteristics of flame (e.g. color, area and location), to detect and locate forest fires accurately. Arguably, flame recognition has been the key to the success of early fire detection [2]. RGB (red, green, and blue) and HIS (hue, intensity and saturation)-based methods mainly make use of color information in flame recognition recent years [3] [4]. RGB-based methods employ color features to recognize fire areas by segmenting objects in a specified color range in RGB images [5]. In these methods, RGB vector m is used to represent the average color estimation. If the color of some pixels is within a certain range of the vector m, these pixels will be recognized and classified. The following comparation method RGB employs the Euclidean distance [6] as the classification range. On the other hand, HIS-based methods employ hue, light intensity and saturation as features for flame recognition. In general, the flame colors are usually yellow, red and orange, and the flame hue is distributed in 0 -60 degrees. Due to the light intensity of background, the flame saturation may be affected, causing interference and false detection [7].
Since the sparse coefficients can result in fewer reconstruction errors and can represent most of the important information in a dictionary, we investigate sparse subspace clustering (SSC) for flame recognition to improve the recognition accuracy. Given a set of pixels drawn from a union of linear or affine subspaces, the task is to find segmentation of forest-fire images. Because each pixel in a union of subspaces can always be written as a linear or affine combination of all other pixels, the representation of pixels in the same subspace can be obtained by searching for the sparsest combination. Thus, a similarity matrix will be established for flame segmentation by sparse subspace clustering. Since the combinatorial 0 l -norm minimization is NP-hard, SSC estimates similarity matrix by imposing 1 l -norm optimization [8]. We also studied collaborative representation clustering (CSC) [9] whose similarity matrix is employed by imposing 2 l -norm optimization instead of 1 l -norm optimization, which means that the "collaborative" nature is instead of "competitive" nature of forest-fire images.
The main contributions of this paper are summarized as follows. 1) The proposed approaches are unsupervised methods requiring no initialization. 2) Our work is the first one to employ the spare or collaborative representation of vectors in subspace clustering for forest-fire recognition.
3) The proposed approaches, whose objective function is optimized by 1 l -norm optimization or 2 l -norm optimization fully exploiting the internal relationship among pixels, produces stronger ability of discrimination compared with traditional methods (i.e., RGB and HIS) by conducting experiments on three forest-fire images.
The remainder of this paper is organized as follows. In Section 2, we present the proposed approaches. In Section 3, we provide a description of the three forest-fire data for performance evaluation, as well as a detailed comparison with the state-of-the-art methods. Section 4 concludes the presented work.
Z. Ye et al.

Approach
The basic idea of subspace clustering is to extract a set of points from linear or affine subspace and to find the segments of data. Since each data point in the union set of a subspace can always be written as a linear or affine combination of other points, the sparse or collaborative expression-based subspace clustering method uses the low-dimensional representation of the data in the high-dimensional space by searching the most sparse or collaborative combination. This enables us to establish a similarity matrix and segment flame by spectral clustering. Since the combinatorial 0 l -norm minimization is NP-hard, the 1 l -norm minimization and 2 l -norm minimization employed in sparse subspace clustering and collaborative subspace clustering, respectively. Thus, spectral clustering method is applied to the similarity graph formed by sparse coefficient or collaborative coefficient to realize the detection and recognition of forest-fire images. Figure 1 shows an example of data drawn from two subspaces, the corresponding adjacency matrix and similarity graph. For each data point, the 1 l -minimization or 2 l -minimization gives subspace-preserving representation, hence the adjacency matrix has a block-diagonal structure and the similarity graph has two connected components. Using spectral clustering methods, we can recover the components of the similarity graph, obtaining the segmentation of forest-fire data.
The proposed sparse subspace clustering (SSC) algorithm will be discussed in the following. Let Wherein, Y can be represented by sparse representation if Y is a linear combination of at most K ( K N << ) basis vectors in ψ . In practice, the signal is K-sparse when it has at most K large nonzero coefficients and the remaining coefficients are very small [10]. We can write Y as Y and X belong to the space domain and the subspace domain, respectively.
The idea is based on the observation that each data point can be described as a linear combination of all the other data points in subspace domain. For separating X into different class-specific representations, we need to calculate i i = x Xw (2) W is the similarity matrix whose i th column corresponds to the sparse representation of i x . For each pixel i x in the dictionary X , the sparse representation vector is calculated by solving the 1 l -norm optimization problem 2 1 min . .
is the sparse representation vector corresponding to i x of size 1 N × , and 0 ε > is a small tolerance. Thus, the similarity (or affinity) matrix W is described as The generalized eigenvalue problem can be expressed as where λ is a Lagrange multiplier balancing the minimization between regularization term and residual part [11]. The procedure of SSC is outlined in Algorithm 1.

Algorithm 1 SSC for Segmentation
Input: A set of points lying in a union of N subspaces Normalize the columns of X .
Apply spectral clustering to the similarity graph.
Output: Segmentation of the data.
In the next, collaborative subspace clustering (CSC) is also proposed to investigate the collaborative nature of forest-fire images. Collaborative representation is studied to estimate the similarity matrix by replacing the 1 l -norm minimization in solving the weight matrix with an 2 l -norm minimization. The segmentation of forest-fire images is found by applying spectral clustering to a similarity graph formed by the collaborative coefficients. The collaborative representation vector for i x is calculated by solving the 2 l -norm optimization problem 2 min . .
where i X does not include i x itself, and The regularization parameter λ does two things: it makes the least square solution stable; and it introduces a weaker "sparsity" than that by 1 l -norm minimization to the solution depicted as Equation (6). The collaborative representation vector can be calculated as lying in a union of N subspaces Solve the sparse optimization problem by Equation (7).
Normalize the columns of X .
Obtain a similarity graph (matrix) with N nodes representing the data points by Equation (8).
Apply spectral clustering to the similarity graph.
Output: Segmentation of the data.

Experimental Results
Experiments are conducted using three forest-fire images, which are represent a forest-fire scenario with 55 × 59 pixels, 79 × 63 pixels, and 58 × 51 pixels. To quantify the efficacy of the proposed two approaches, we study the classification performance of them and two state-of-the-art methods (HIS and RGB) for classifying forest-fire data.