# An Incremental Self-Adaptive Wood Species Classification Prototype System

Authors: Peng Zhao; Zhen-Yu Li; Yue Li
Journal: Journal of Spectroscopy
 (2019)

---

## Abstract

The present wood species classification systems can usually process the limited wood species quantity. We propose a novel incremental self-adaptive wood species classification system to solve the above-mentioned issue. The visible/near-infrared (VIS/NIR) spectrometer is used to pick up the spectral curves of wood samples for the subsequent wood species classification. First, when new wood samples of unknown wood species are added, they are classified as an unknown category by our one-class classifier, Support Vector Data Description (SVDD), while the existent wood species are classified as a known category by the SVDD. Second, the wood samples of known species are sent into the BP neural network for subsequent wood species classification. Third, the new wood samples of unknown species are sent into the Clustering by Fast Search and Find of Density Peaks (CFSFDP) algorithm for the unsupervised clustering, and the clustering result is evaluated by the internal and external norms. Last, if one cluster of one unknown species has an adequate amount of wood samples, these wood samples are removed and identified by human experts or other schemes to ensure to get the correct wood species name. Then, these wood samples are considered as a new known species and are sent into the classifiers, SVDD and BP neural network, to train them again. Experiments on 13 wood species prove the effectiveness of our prototype system with an overall classification accuracy of above 95%.


---

## Body

## 1. Introduction

Wood species recognition has been investigated for some years since different wood species have different physical and chemical properties with a different price. Many wood species classification systems are used for automatic processing by use of sensors and computers. In terms of the used sensors, spectrum-based [1–3], chemometric-based [4], and image-based systems [5–7] are usually investigated. The wood spectral analysis scheme usually deals with the 1D spectral reflectance ratio curves for wood species recognition, which has a low computational complexity and thus a high processing speed.However, most present wood species classification systems usually process the limited wood species quantity. For example, Yusof et al. proposed a kernel-genetic nonlinear feature selection scheme for 52 tropical wood species recognition [8]. Ibrahim et al. proposed a fuzzy preclassifier to classify 48 tropical wood species into 4 broad categories, and then they used a Support Vector Machine (SVM) classifier in each broad category to further determine wood species of the detected wood sample [9]. They pointed out that one advantage is that when a new wood species is added into the system, only the SVM classifier of one broad category requires to be retrained instead of the whole system. But this two-level classification system may not recognize the unknown new wood species automatically [9].In this paper, we propose a novel prototype system which can process the incremental wood species quantity. Our prototype system is illustrated in Figure1, which consists of 3 parts and one renewal procedure mostly. The 1st part is a one-class classifier SVDD, which can classify wood samples into two categories (i.e., the known wood species which are included in the wood training dataset, and the unknown species which are not included in the training dataset). The 2nd part is a BP neural network, which can classify the known wood species samples into a specific species. The 3rd part is an unsupervised clustering analyzer which can classify the unknown wood species samples into several clusters by the use of CFSFDP algorithm. Moreover, an updating procedure is performed to increase the wood species quantity in the training dataset. If one cluster of one unknown species has an adequate amount of wood samples, these wood samples are removed from clusters and identified by human experts or other schemes to ensure to get the correct wood species name. Then, these wood samples are considered as a new known species and are sent into the classifiers, SVDD and BP neural network, to retrain them. In this way, our system can recognize more and more wood species.Figure 1
Our prototype system’s structure graph.


## 2. Materials and Methods

### 2.1. Wood Samples

Our wood samples consist of 13 wood species, as illustrated in Table1. Every wood sample is processed into a 2 cm × 2 cm × 3 cm block. The known wood species category consists of 5 species, while the unknown category consists of 8 species. The training dataset in the known category is used to train the one-class classifier, SVDD, while the testing dataset in the known category and all wood samples in the unknown category are used to test SVDD. Moreover, the unknown category is used for unsupervised clustering analysis.Table 1
Wood species samples.
Category
English name
Latin name
Wood sample quantity
Training dataset
Testing dataset
The known category
Bubinga
Guibourtia tessmannii
60
20
Merbau
Intsia bijuga
60
20
Burma teak
Tectona grandis L.F.
60
20
African padauk
Pterocarpus soyauxii
60
20
Casla
Terminalia neotaliala Capuron
60
20
The unknown category
Birch
Betula platyphylla
55
Mongolian pine
Pinus sylvestris
55
White pine
Picea jezoensis
55
Larch
Larix gmelinii
55
Pometia
Pometia tomentosa
55
Indian teak
Tectona grandis L.F.
55
Siam teak
Tectona grandis L.F.
55
Thailand teak
Tectona grandis L.F.
55The intraclass spectral variations of wood samples may be caused by the wood age, cutting position, and geographic place. For each wood species, our wood samples are taken from different individual trees at random position to include these intraclass differences. In this way, the reliability of our proposed scheme can be ensured.


### 2.2. Spectral Data Acquisition

The spectrometer used here is an Ocean Optics USB2000 + microfiber spectrometer of Ocean America. The visible/near-infrared (VIS/NIR) spectra of wood samples are picked up by this spectrometer system which consists of a halogen lamp, a universal serial bus, a computer, a customized holder, a fiber spectrometer (Ocean Optics Inc, USA), as well as a piece of optics fiber, as illustrated in Figure2. The spectral acquisition is performed in a controlled environment at a temperature of 20°C and in diffuse reflectance. The spectral band covers a range of 340∼1027 nm with a spectral resolution of 0.3 nm approximately. Spectrometer parameter setting, spectral data acquisition, and storing are implemented by the Spectrasuite standard software. The integration time is 300 ms, and the average number of every point measurements is 900. Before spectral acquisition, reference spectra and dark spectra are measured and stored. The reference spectra are acquired with a standard white panel of known 100% reflectance, and the dark spectra are acquired by blocking the radian. The wood sample to be measured is closely fixed on the holder, and the reflectance spectra of each wood sample are acquired. For each wood sample, four diffuse reflectance spectrums are measured randomly at different locations across the wood sample’s cross section, and the mean spectrum is computed and stored for wood spectral analysis and species classification.Figure 2
Spectral data acquisition system’s structure graph: (1) halogen lamp; (2) universal serial bus; (3) computer; (4) holder; (5) spectrometer; (6) optic fiber; (7) test sample.Considering the spectrometer’s price, we choose the VIS/NIR spectrometer for spectral acquisition. As we all know, the spectral data in visible band may be variable because the wood sample’s color may change with the environmental variation. Therefore, we must keep the environment stable during the spectral acquisition and wood sample’s preservations. In addition, 780–900 nm is a near-infrared band, which can characterize the different wood properties to some extents.


### 2.3. Spectral Dimension Reduction

For each spectral curve, the VIS/NIR band includes thousands of spectral data so that the dimension of acquired spectral curve is very large. In fact, each spectral curve contains redundant information, which will reduce the wood species classification speed and accuracy. In this paper, Principal Component Analysis (PCA) and Wavelet Transform (WT) are used and compared for spectral dimension reduction in our one-class classifier, SVDD.PCA is a transformation scheme in multivariate statistics, which is one of the most commonly used spectral feature extraction schemes. WT is an efficient data compression tool that decomposes the signal into a series of wavelet functions with time-frequency analysis capabilities. WT can compress the spectral data, filter the spectral noises, and extract useful spectral features. The spectra are divided into low-frequency and high-frequency parts. The low-frequency coefficient contains most useful information, while the high-frequency coefficient contains redundant information such as noises. Therefore, we replace the original spectral data with low-frequency wavelet coefficients.Moreover, in our unsupervised clustering stage, the t-distributed stochastic neighbor embedding (t-SNE) algorithm is used for the secondary spectral dimension reduction. This algorithm is a nonlinear dimension reduction which is an improved version of the original SNE algorithm [10]. Here, the symbol “t” in the t-SNE algorithm represents the t distribution, and the freedom of t distribution is 1 in this paper.


### 2.4. One-Class Classifier: SVDD

In the SVDD, all objects in known category are considered as an ensemble to construct an optimal hypersphere which can almost consist of all objectsX=xii=1n in known category so that all objects in the known category are separated from all objects in the unknown category. The optimal hypersphere construction can be transformed to the following optimization issue [11]:(1)minR,a,ξiR2+C∑i=1nξi,s.t.xi−a2≤R2+ξi,ξi≥0,where a and R represent the hypersphere’s center and radius, and the slack factor ξi is introduced to increase the classification robustness with the penalty factor C. This optimization issue can be further transformed to the following Lagrange extreme issue:(2)L=R2+C∑i=1nξi−∑i=1nαiR2ξi−xi−a2−∑i=1nβiξi,where αiandβi are Lagrange coefficients and αi≥0 and βi≥0, i = 1, 2, …, n. By minimizing equation (2), we can obtain the following dual equation:(3)L=∑i=1nαixi,xi−∑i=1n∑j=1nαiαjxi,xjs.t.0≤αi≤C,∑i=1nαi=1.When the input objects are not linearly divisible, a nonlinear mappingΦ:X⟶F can be used to map the original low-dimensional space into the high-dimensional space. In this case, the inner product operation xi,xj in equation (3) can be substituted by the kernel function Kxi,xj:(4)LR,a,ξ,α,β=∑i=1nαixi,xi−∑i=1n∑j=1nαiαjKxi,xj,s.t.0≤αi≤C,∑i=1nαi=1.The standard quadratic programming algorithm can be used to solve the optimal solutionαi∗. Suppose y is a support vector whose corresponding specimen lies on the surface of the hypersphere, then its center and radius can be represented as follows:(5)a=∑i=1nαi∗φxi,R2=Ky,y−2∑i=1nαi∗y,xi+∑i=1n∑j=1nαi∗αj∗Kxi,xj.For a new testing specimenz, the distance between z and the hypersphere’s center can be represented as follows:(6)D2=Kz,z−2∑i=1nαi∗Kz,xi+∑i=1n∑j=1nαi∗αj∗Kxi,xj.IfD2≤R2, this specimen z is considered to belong to the known category; otherwise, it belongs to the unknown category.


### 2.5. Wood Species Recognition for the Known Category

In this study, there are 5 wood species in the known category, as illustrated in Table1. The BP neural network is used for the species classification of these 5 wood species. These 5 species are marked with different class labels “1, 2, …, 5.” The network’s input is the spectral data after spectral dimension reduction processing, and its expected output for 5 wood species is the unit matrix code, as illustrated in Table 2. The predictive value of each node Pjj=1,2,…,5 is transformed into the binary code Qj with the following rules. The maximum predictive value is transformed into 1, while the other 4 predictive values are transformed into 0. Then, the sum of squares of errors (SSE) is calculated for each sample’s predictive values and binary values:(7)SSEi=∑j=1lPji−Qji2,i=1,2,…,N,here, N is the wood sample number, and l=5. After the network’s training is over, a threshold T should be set as follows. If SSEi≤T, this sample is considered as in the known category; otherwise, it is in the unknown category.Table 2
Class label and code for 5 wood species in known category.
Class label
Wood species
Code
1
Bubinga
1
0
0
0
0
2
Merbau
0
1
0
0
0
3
Burma teak
0
0
1
0
0
4
African padauk
0
0
0
1
0
5
Casla
0
0
0
0
1


### 2.6. Unsupervised Clustering Analysis for the Unknown Category

#### 2.6.1. CFSFDP

In our clustering analysis, an accurate CFSFDP algorithm [12] is used. In this algorithm, the clustering centers are firstly determined. The clustering centers have relatively high local density, and they are relatively far from those points with higher local density. Define a dataset S=xii=1n, and we need to compute the local density ρi and distance δi for every sample Xi. As for local density ρi, two computation equations can be chosen as follows:(8)cutoff kernel:ρi=∑jxdij−dc,(9)Gaussian kernel:ρi=∑je−dij/dc.Here,dij is the distance between samples i and j; dc is the cutoff distance which is determined by human experts; and χx is a 0-1 function as follows. Therefore, the ρi calculated by equation (8) is a discrete value, while that by equation (9) is a continuous value. We choose Gaussian kernel to compute the local density.(10)χx=0,x≥0,1,x<0,The distanceδi is the distance between sample Xi and its nearest sample Xj among those samples with higher local density.(11)δi=minj:ρj>ρidij.Therefore, one sample may be a clustering center when it has a relatively largeρi and δi. Therefore, the possibility of one sample being a clustering center can be computed by γi.(12)γi=ρi∗δi.Once the clustering centers are determined, one sample is classified into the cluster which consists of the nearest neighbor of this sample with a higher local density.


#### 2.6.2. Evaluation Criterion

(1)
The performance of one-class classifier SVDD is evaluated by the classification precision, recall, andF value as follows:
(13)
precision
=
the number of correctly classified samples in the known category and in the unknown category
the overall sample number
,
recall
=
the number of correctly classified samples in the known category
the number of samples in the known category
,
F
=
2
×
precision
×
recall
precision
+
recall
.
(2)
In the CFSFDP algorithm [12], the clustering centers require to be chosen manually in the decision chart by human experts. In order to fulfill the automatic selection of clustering centers, we make some improvements on this algorithm by the use of internal criteria to evaluate the clustering results. As we know, the goal of clustering analysis is to increase the intraclass similarity and the interclass difference as much as possible. This goal is considered generally by internal criteria which take into account the self-feature of processed dataset. In this work, the CH and DB criteria [13, 14] are used here.
(14)
CH
=
N
−
k
k
−
1
×
BGSS
WGSS
.
Here,N is the sample number, k is the cluster number, BGSS is the trace of interclass divergence matrix, and WGSS is the trace of intraclass divergence matrix. Therefore, a high CH value indicates a good clustering result.
(15)
DB
k
=
1
k
∑
i
=
1
k
max
j
=
1
∼
k
,
j
=
i
W
i
+
W
j
C
i
j
.
Here,Cij is the distance between the center of cluster Ci and that of clusters Cj and Wi represent the mean distance from all its samples to its cluster center for the cluster Ci. Therefore, a low DB value indicates a good clustering result.
(3)
The clustering correct ratio (CCR) is used to evaluate the clustering accuracy.
(16)
CCR
%
=
correct clustering times
overall clustering times
.
(4)
When the cluster number is determined, external criteria are used for clustering evaluation by use of each sample’s true class. Since the calculated clusters may be different from the true clusters, we suppose the true clusters of dataset withN samples as P=P1,P2,…,Pk and the calculated clusters as C=C1,C2,…,Cm. By the pairwise combination, we can get the M sample pairs (M=CN2). Then, the sample pair’s clustering is compared in P and C. First, we define “a” to represent the number of sample pairs that belongs to the same cluster in both P and C. Second, we define “b” to represent the number of sample pairs that belongs to the same cluster only in P. Third, “c” represents the number of sample pairs that belongs to the same cluster only in C. Last, “d” represents the number of sample pairs that belongs to different clusters in both P and C. Finally, the 4 external criteria (i.e., Rand, Adjusted Rand, Jaccard, and Fowlkes–Mallows) [15] are calculated as follows.
(17)
Rand
=
a
+
b
M
,
(18)
AR
=
2
M
a
−
a
+
b
a
+
c
M
2
a
+
b
−
c
−
2
a
+
b
a
+
c
,
(19)
J
=
a
a
+
b
+
c
,
(20)
FM
=
a
a
+
b
a
a
+
c
.


### 2.7. Incremental Updating Procedure

In this section, an updating procedure is performed to increase the wood species quantity in the training dataset so that our system can recognize more and more wood species. If one cluster of an unknown species in the unknown category has an adequate amount of wood samples (i.e., approximately 50 samples per wood species), these wood samples are removed from clusters and identified by human experts or other schemes to ensure to get the correct wood species name. Then, these wood samples are considered as a new known species and are sent into the classifiers, SVDD and BP neural network, to retrain them. By this way, our system can classify this new wood species as in the known category with SVDD and then recognize this wood species correctly with the BP neural network.Moreover, two issues should be considered. First, in the one-class classification by the use of SVDD, some wood samples in the known category may be falsely classified as in the unknown category. These wood samples will be put into some clusters later in the subsequent unsupervised clustering processing. Therefore, if one cluster of an unknown species is removed from clusters and identified by human experts or other schemes to ensure to get the correct wood species name, all wood samples of this cluster must be processed one by one to find and discard those samples falsely classified by SVDD possibly. Second, in the one-class classification, some wood samples in the unknown category may be falsely classified as in the known category on the contrary. These wood samples will be sent into the BP neural network for further species recognition. The ideal classification output should be “rejected classification.”


## 2.1. Wood Samples

Our wood samples consist of 13 wood species, as illustrated in Table1. Every wood sample is processed into a 2 cm × 2 cm × 3 cm block. The known wood species category consists of 5 species, while the unknown category consists of 8 species. The training dataset in the known category is used to train the one-class classifier, SVDD, while the testing dataset in the known category and all wood samples in the unknown category are used to test SVDD. Moreover, the unknown category is used for unsupervised clustering analysis.Table 1
Wood species samples.
Category
English name
Latin name
Wood sample quantity
Training dataset
Testing dataset
The known category
Bubinga
Guibourtia tessmannii
60
20
Merbau
Intsia bijuga
60
20
Burma teak
Tectona grandis L.F.
60
20
African padauk
Pterocarpus soyauxii
60
20
Casla
Terminalia neotaliala Capuron
60
20
The unknown category
Birch
Betula platyphylla
55
Mongolian pine
Pinus sylvestris
55
White pine
Picea jezoensis
55
Larch
Larix gmelinii
55
Pometia
Pometia tomentosa
55
Indian teak
Tectona grandis L.F.
55
Siam teak
Tectona grandis L.F.
55
Thailand teak
Tectona grandis L.F.
55The intraclass spectral variations of wood samples may be caused by the wood age, cutting position, and geographic place. For each wood species, our wood samples are taken from different individual trees at random position to include these intraclass differences. In this way, the reliability of our proposed scheme can be ensured.


## 2.2. Spectral Data Acquisition

The spectrometer used here is an Ocean Optics USB2000 + microfiber spectrometer of Ocean America. The visible/near-infrared (VIS/NIR) spectra of wood samples are picked up by this spectrometer system which consists of a halogen lamp, a universal serial bus, a computer, a customized holder, a fiber spectrometer (Ocean Optics Inc, USA), as well as a piece of optics fiber, as illustrated in Figure2. The spectral acquisition is performed in a controlled environment at a temperature of 20°C and in diffuse reflectance. The spectral band covers a range of 340∼1027 nm with a spectral resolution of 0.3 nm approximately. Spectrometer parameter setting, spectral data acquisition, and storing are implemented by the Spectrasuite standard software. The integration time is 300 ms, and the average number of every point measurements is 900. Before spectral acquisition, reference spectra and dark spectra are measured and stored. The reference spectra are acquired with a standard white panel of known 100% reflectance, and the dark spectra are acquired by blocking the radian. The wood sample to be measured is closely fixed on the holder, and the reflectance spectra of each wood sample are acquired. For each wood sample, four diffuse reflectance spectrums are measured randomly at different locations across the wood sample’s cross section, and the mean spectrum is computed and stored for wood spectral analysis and species classification.Figure 2
Spectral data acquisition system’s structure graph: (1) halogen lamp; (2) universal serial bus; (3) computer; (4) holder; (5) spectrometer; (6) optic fiber; (7) test sample.Considering the spectrometer’s price, we choose the VIS/NIR spectrometer for spectral acquisition. As we all know, the spectral data in visible band may be variable because the wood sample’s color may change with the environmental variation. Therefore, we must keep the environment stable during the spectral acquisition and wood sample’s preservations. In addition, 780–900 nm is a near-infrared band, which can characterize the different wood properties to some extents.


## 2.3. Spectral Dimension Reduction

For each spectral curve, the VIS/NIR band includes thousands of spectral data so that the dimension of acquired spectral curve is very large. In fact, each spectral curve contains redundant information, which will reduce the wood species classification speed and accuracy. In this paper, Principal Component Analysis (PCA) and Wavelet Transform (WT) are used and compared for spectral dimension reduction in our one-class classifier, SVDD.PCA is a transformation scheme in multivariate statistics, which is one of the most commonly used spectral feature extraction schemes. WT is an efficient data compression tool that decomposes the signal into a series of wavelet functions with time-frequency analysis capabilities. WT can compress the spectral data, filter the spectral noises, and extract useful spectral features. The spectra are divided into low-frequency and high-frequency parts. The low-frequency coefficient contains most useful information, while the high-frequency coefficient contains redundant information such as noises. Therefore, we replace the original spectral data with low-frequency wavelet coefficients.Moreover, in our unsupervised clustering stage, the t-distributed stochastic neighbor embedding (t-SNE) algorithm is used for the secondary spectral dimension reduction. This algorithm is a nonlinear dimension reduction which is an improved version of the original SNE algorithm [10]. Here, the symbol “t” in the t-SNE algorithm represents the t distribution, and the freedom of t distribution is 1 in this paper.


## 2.4. One-Class Classifier: SVDD

In the SVDD, all objects in known category are considered as an ensemble to construct an optimal hypersphere which can almost consist of all objectsX=xii=1n in known category so that all objects in the known category are separated from all objects in the unknown category. The optimal hypersphere construction can be transformed to the following optimization issue [11]:(1)minR,a,ξiR2+C∑i=1nξi,s.t.xi−a2≤R2+ξi,ξi≥0,where a and R represent the hypersphere’s center and radius, and the slack factor ξi is introduced to increase the classification robustness with the penalty factor C. This optimization issue can be further transformed to the following Lagrange extreme issue:(2)L=R2+C∑i=1nξi−∑i=1nαiR2ξi−xi−a2−∑i=1nβiξi,where αiandβi are Lagrange coefficients and αi≥0 and βi≥0, i = 1, 2, …, n. By minimizing equation (2), we can obtain the following dual equation:(3)L=∑i=1nαixi,xi−∑i=1n∑j=1nαiαjxi,xjs.t.0≤αi≤C,∑i=1nαi=1.When the input objects are not linearly divisible, a nonlinear mappingΦ:X⟶F can be used to map the original low-dimensional space into the high-dimensional space. In this case, the inner product operation xi,xj in equation (3) can be substituted by the kernel function Kxi,xj:(4)LR,a,ξ,α,β=∑i=1nαixi,xi−∑i=1n∑j=1nαiαjKxi,xj,s.t.0≤αi≤C,∑i=1nαi=1.The standard quadratic programming algorithm can be used to solve the optimal solutionαi∗. Suppose y is a support vector whose corresponding specimen lies on the surface of the hypersphere, then its center and radius can be represented as follows:(5)a=∑i=1nαi∗φxi,R2=Ky,y−2∑i=1nαi∗y,xi+∑i=1n∑j=1nαi∗αj∗Kxi,xj.For a new testing specimenz, the distance between z and the hypersphere’s center can be represented as follows:(6)D2=Kz,z−2∑i=1nαi∗Kz,xi+∑i=1n∑j=1nαi∗αj∗Kxi,xj.IfD2≤R2, this specimen z is considered to belong to the known category; otherwise, it belongs to the unknown category.


## 2.5. Wood Species Recognition for the Known Category

In this study, there are 5 wood species in the known category, as illustrated in Table1. The BP neural network is used for the species classification of these 5 wood species. These 5 species are marked with different class labels “1, 2, …, 5.” The network’s input is the spectral data after spectral dimension reduction processing, and its expected output for 5 wood species is the unit matrix code, as illustrated in Table 2. The predictive value of each node Pjj=1,2,…,5 is transformed into the binary code Qj with the following rules. The maximum predictive value is transformed into 1, while the other 4 predictive values are transformed into 0. Then, the sum of squares of errors (SSE) is calculated for each sample’s predictive values and binary values:(7)SSEi=∑j=1lPji−Qji2,i=1,2,…,N,here, N is the wood sample number, and l=5. After the network’s training is over, a threshold T should be set as follows. If SSEi≤T, this sample is considered as in the known category; otherwise, it is in the unknown category.Table 2
Class label and code for 5 wood species in known category.
Class label
Wood species
Code
1
Bubinga
1
0
0
0
0
2
Merbau
0
1
0
0
0
3
Burma teak
0
0
1
0
0
4
African padauk
0
0
0
1
0
5
Casla
0
0
0
0
1


## 2.6. Unsupervised Clustering Analysis for the Unknown Category

### 2.6.1. CFSFDP

In our clustering analysis, an accurate CFSFDP algorithm [12] is used. In this algorithm, the clustering centers are firstly determined. The clustering centers have relatively high local density, and they are relatively far from those points with higher local density. Define a dataset S=xii=1n, and we need to compute the local density ρi and distance δi for every sample Xi. As for local density ρi, two computation equations can be chosen as follows:(8)cutoff kernel:ρi=∑jxdij−dc,(9)Gaussian kernel:ρi=∑je−dij/dc.Here,dij is the distance between samples i and j; dc is the cutoff distance which is determined by human experts; and χx is a 0-1 function as follows. Therefore, the ρi calculated by equation (8) is a discrete value, while that by equation (9) is a continuous value. We choose Gaussian kernel to compute the local density.(10)χx=0,x≥0,1,x<0,The distanceδi is the distance between sample Xi and its nearest sample Xj among those samples with higher local density.(11)δi=minj:ρj>ρidij.Therefore, one sample may be a clustering center when it has a relatively largeρi and δi. Therefore, the possibility of one sample being a clustering center can be computed by γi.(12)γi=ρi∗δi.Once the clustering centers are determined, one sample is classified into the cluster which consists of the nearest neighbor of this sample with a higher local density.


### 2.6.2. Evaluation Criterion

(1)
The performance of one-class classifier SVDD is evaluated by the classification precision, recall, andF value as follows:
(13)
precision
=
the number of correctly classified samples in the known category and in the unknown category
the overall sample number
,
recall
=
the number of correctly classified samples in the known category
the number of samples in the known category
,
F
=
2
×
precision
×
recall
precision
+
recall
.
(2)
In the CFSFDP algorithm [12], the clustering centers require to be chosen manually in the decision chart by human experts. In order to fulfill the automatic selection of clustering centers, we make some improvements on this algorithm by the use of internal criteria to evaluate the clustering results. As we know, the goal of clustering analysis is to increase the intraclass similarity and the interclass difference as much as possible. This goal is considered generally by internal criteria which take into account the self-feature of processed dataset. In this work, the CH and DB criteria [13, 14] are used here.
(14)
CH
=
N
−
k
k
−
1
×
BGSS
WGSS
.
Here,N is the sample number, k is the cluster number, BGSS is the trace of interclass divergence matrix, and WGSS is the trace of intraclass divergence matrix. Therefore, a high CH value indicates a good clustering result.
(15)
DB
k
=
1
k
∑
i
=
1
k
max
j
=
1
∼
k
,
j
=
i
W
i
+
W
j
C
i
j
.
Here,Cij is the distance between the center of cluster Ci and that of clusters Cj and Wi represent the mean distance from all its samples to its cluster center for the cluster Ci. Therefore, a low DB value indicates a good clustering result.
(3)
The clustering correct ratio (CCR) is used to evaluate the clustering accuracy.
(16)
CCR
%
=
correct clustering times
overall clustering times
.
(4)
When the cluster number is determined, external criteria are used for clustering evaluation by use of each sample’s true class. Since the calculated clusters may be different from the true clusters, we suppose the true clusters of dataset withN samples as P=P1,P2,…,Pk and the calculated clusters as C=C1,C2,…,Cm. By the pairwise combination, we can get the M sample pairs (M=CN2). Then, the sample pair’s clustering is compared in P and C. First, we define “a” to represent the number of sample pairs that belongs to the same cluster in both P and C. Second, we define “b” to represent the number of sample pairs that belongs to the same cluster only in P. Third, “c” represents the number of sample pairs that belongs to the same cluster only in C. Last, “d” represents the number of sample pairs that belongs to different clusters in both P and C. Finally, the 4 external criteria (i.e., Rand, Adjusted Rand, Jaccard, and Fowlkes–Mallows) [15] are calculated as follows.
(17)
Rand
=
a
+
b
M
,
(18)
AR
=
2
M
a
−
a
+
b
a
+
c
M
2
a
+
b
−
c
−
2
a
+
b
a
+
c
,
(19)
J
=
a
a
+
b
+
c
,
(20)
FM
=
a
a
+
b
a
a
+
c
.


## 2.6.1. CFSFDP

In our clustering analysis, an accurate CFSFDP algorithm [12] is used. In this algorithm, the clustering centers are firstly determined. The clustering centers have relatively high local density, and they are relatively far from those points with higher local density. Define a dataset S=xii=1n, and we need to compute the local density ρi and distance δi for every sample Xi. As for local density ρi, two computation equations can be chosen as follows:(8)cutoff kernel:ρi=∑jxdij−dc,(9)Gaussian kernel:ρi=∑je−dij/dc.Here,dij is the distance between samples i and j; dc is the cutoff distance which is determined by human experts; and χx is a 0-1 function as follows. Therefore, the ρi calculated by equation (8) is a discrete value, while that by equation (9) is a continuous value. We choose Gaussian kernel to compute the local density.(10)χx=0,x≥0,1,x<0,The distanceδi is the distance between sample Xi and its nearest sample Xj among those samples with higher local density.(11)δi=minj:ρj>ρidij.Therefore, one sample may be a clustering center when it has a relatively largeρi and δi. Therefore, the possibility of one sample being a clustering center can be computed by γi.(12)γi=ρi∗δi.Once the clustering centers are determined, one sample is classified into the cluster which consists of the nearest neighbor of this sample with a higher local density.


## 2.6.2. Evaluation Criterion

(1)
The performance of one-class classifier SVDD is evaluated by the classification precision, recall, andF value as follows:
(13)
precision
=
the number of correctly classified samples in the known category and in the unknown category
the overall sample number
,
recall
=
the number of correctly classified samples in the known category
the number of samples in the known category
,
F
=
2
×
precision
×
recall
precision
+
recall
.
(2)
In the CFSFDP algorithm [12], the clustering centers require to be chosen manually in the decision chart by human experts. In order to fulfill the automatic selection of clustering centers, we make some improvements on this algorithm by the use of internal criteria to evaluate the clustering results. As we know, the goal of clustering analysis is to increase the intraclass similarity and the interclass difference as much as possible. This goal is considered generally by internal criteria which take into account the self-feature of processed dataset. In this work, the CH and DB criteria [13, 14] are used here.
(14)
CH
=
N
−
k
k
−
1
×
BGSS
WGSS
.
Here,N is the sample number, k is the cluster number, BGSS is the trace of interclass divergence matrix, and WGSS is the trace of intraclass divergence matrix. Therefore, a high CH value indicates a good clustering result.
(15)
DB
k
=
1
k
∑
i
=
1
k
max
j
=
1
∼
k
,
j
=
i
W
i
+
W
j
C
i
j
.
Here,Cij is the distance between the center of cluster Ci and that of clusters Cj and Wi represent the mean distance from all its samples to its cluster center for the cluster Ci. Therefore, a low DB value indicates a good clustering result.
(3)
The clustering correct ratio (CCR) is used to evaluate the clustering accuracy.
(16)
CCR
%
=
correct clustering times
overall clustering times
.
(4)
When the cluster number is determined, external criteria are used for clustering evaluation by use of each sample’s true class. Since the calculated clusters may be different from the true clusters, we suppose the true clusters of dataset withN samples as P=P1,P2,…,Pk and the calculated clusters as C=C1,C2,…,Cm. By the pairwise combination, we can get the M sample pairs (M=CN2). Then, the sample pair’s clustering is compared in P and C. First, we define “a” to represent the number of sample pairs that belongs to the same cluster in both P and C. Second, we define “b” to represent the number of sample pairs that belongs to the same cluster only in P. Third, “c” represents the number of sample pairs that belongs to the same cluster only in C. Last, “d” represents the number of sample pairs that belongs to different clusters in both P and C. Finally, the 4 external criteria (i.e., Rand, Adjusted Rand, Jaccard, and Fowlkes–Mallows) [15] are calculated as follows.
(17)
Rand
=
a
+
b
M
,
(18)
AR
=
2
M
a
−
a
+
b
a
+
c
M
2
a
+
b
−
c
−
2
a
+
b
a
+
c
,
(19)
J
=
a
a
+
b
+
c
,
(20)
FM
=
a
a
+
b
a
a
+
c
.


## 2.7. Incremental Updating Procedure

In this section, an updating procedure is performed to increase the wood species quantity in the training dataset so that our system can recognize more and more wood species. If one cluster of an unknown species in the unknown category has an adequate amount of wood samples (i.e., approximately 50 samples per wood species), these wood samples are removed from clusters and identified by human experts or other schemes to ensure to get the correct wood species name. Then, these wood samples are considered as a new known species and are sent into the classifiers, SVDD and BP neural network, to retrain them. By this way, our system can classify this new wood species as in the known category with SVDD and then recognize this wood species correctly with the BP neural network.Moreover, two issues should be considered. First, in the one-class classification by the use of SVDD, some wood samples in the known category may be falsely classified as in the unknown category. These wood samples will be put into some clusters later in the subsequent unsupervised clustering processing. Therefore, if one cluster of an unknown species is removed from clusters and identified by human experts or other schemes to ensure to get the correct wood species name, all wood samples of this cluster must be processed one by one to find and discard those samples falsely classified by SVDD possibly. Second, in the one-class classification, some wood samples in the unknown category may be falsely classified as in the known category on the contrary. These wood samples will be sent into the BP neural network for further species recognition. The ideal classification output should be “rejected classification.”


## 3. Results and Discussions

### 3.1. Spectral Preprocessing

The acquired spectral curve has noises in the beginning and terminal bands due to the system error. Therefore, these noisy bands should be deleted, and the spectral curve in the band of 450 nm∼900 nm is remained for the model training and testing. Figure3 illustrates spectral curves of our 13 wood species. In this section, the spectral first-order differential operation is used to overcome the random noises, baseline drift, and light-scattering effect.Figure 3
Spectral curve graph of our 13 wood species.


### 3.2. SVDD Classification

The WT and PCA are used and compared for spectral dimension reduction. As for WT, the sym4 wavelet basis is used, and the preprocessed spectral curve is decomposed into 5 levels. Therefore, the original 1328D spectral curve is reduced to 48D, and the low frequency wavelet coefficient is remained and sent into the SVDD classifier. As for PCA, the cumulative contribution ratio (%) reaches to 99% for the first 15 principal components, which can represent the original spectral curve’s basic information. Therefore, the first 15 principal components are remained for SVDD classification, as illustrated in Figure4.Figure 4
The cumulative contribution ratio graph of PCA.In our one-class classification experiment, the Gaussian kernel function is used inKxi,xj, and the hypersphere’s boundary shape is influenced by the penalty factor C and Gaussian kernel parameter σ. When σ is fixed, the number of support vectors is influenced by C, but to some extents, the influence of C on the hypersphere’s boundary shape is relatively small. When C is fixed, a small σ will produce a tight boundary shape and thus an overfit, while a large σ will produce a slack boundary shape and thus an underfit. Therefore, the optimal C and σ should be acquired before the SVDD classification. Table 3 illustrates the SVDD classification results for the testing dataset of the known category and all datasets of the unknown category by use of the optimal C and σ. We can see that WT’s performance is superior to PCA.Table 3
One-class classification of SVDD with optimal parameters and WT/PCA.
Methods
Precision
Recall
F
C
σ
WT-SVDD
0.9963
0.98
0.9881
0.17
18
PCA-SVDD
0.9241
0.97
0.9465
0.06
18


### 3.3. Wood Species Classification in Known Category

The BP neural network’s structure is as follows. Its input layer has 48 nodes, while the output layer has 5 nodes. The hidden layer has 27 nodes that are determined by multiple tests. The delivery function between the input layer and hidden layer is selected as “tansig,” while that between the hidden layer and output layer is “purelin.” The iteration times are 500, with an error target of 0.0002 and a learning rate of 0.01. After network training, this neural network is used for wood species recognition for samples in the known category which may include some samples falsely classified as in the known category by SVDD possibly.To test neural network’s classification performance, the testing dataset in the known category (20×5=100 samples) and all samples in the unknown category (55×8=440 samples) are sent into the network. Figure 5 illustrates SSE for all wood samples, where we can see that SSE of the testing dataset in the known category is much smaller than that of all samples in the unknown category. Therefore, an appropriate threshold T can be used to separate the known category from the unknown category. Figure 6 illustrates the relationship between threshold T and correct accept/reject rate. We can see that when T = 0.023, the correct accept rate for the known category is 100%, while the correct reject rate for the unknown category is 92.05%. However, the correct classification rate is less than 74% (i.e., 100÷100+35=74%).Figure 5
SSE comparison for the known category and unknown category.Figure 6
The relationship between thresholdT and correct accept/reject rate.In our practical system, there are 100 samples in testing datasets of 5 wood species in the known category (Table1). In the SVDD classification test, 4 samples in the known category are falsely classified as in the unknown category, and again 4 samples in the unknown category are falsely classified as in the known category. The BP network’s classification result is illustrated in Figure 7 with T = 0.023, where we can see that the correct classification rate for the known category is 96% (i.e., all these 96 samples are classified as correct wood species), and the remaining 4 samples are correctly rejected so that the correct reject rate for the unknown category is 100%. Therefore, in view of the correct classification rate for the known category and the correct reject rate for the unknown category, the performance of our SVDD plus BP network is much better than that of the BP network alone.Figure 7
Classification result of the BP neural network.


### 3.4. Unsupervised Clustering in Unknown Category

First, the t-SNE algorithm is used for the spectral secondary dimension reduction after WT. The dimension reduction results of t-SNE, PCA, Sammon Mapping (SM) [16], Isometric Feature Mapping (IFM) [17], Laplacian Eigenmaping (LE) [18], and Linear Discriminator Analysis (LDA) [19] are compared in Figure 8. In Figure 8, x-axis and y-axis refer to the first two dimensions after dimension reduction, and we can see that the performance of the t-SNE algorithm is the best in view of the intraclass similarity and the interclass difference.Figure 8
Comparison of secondary dimension reduction results: (a) t-SNE; (b) PCA; (c) SM; (d) IFM; (e) LE; and (f) LDA.
(a)
(b)
(c)
(d)
(e)
(f)Second, the CFSFDP algorithm is used for clustering of 2 wood speciesBetula platyphylla and Picea jezoensis. The cutoff distance is set as dc=4, and the parameters ρi and δi of each sample are calculated, as illustrated in decision chart Figure 9. We can see that these two parameters of no. 35 and no. 68 samples are relatively large, and these two samples are more likely to be clustering centers. Then the γi of each sample is calculated and sorted in descending order, as illustrated in Figure 10. In order to fulfill the automatic selection of clustering centers, the clustering number K is set as an interval K∈2,10. The first K larger γi1−γik correspond to K samples which are set as clustering centers. The remaining samples are classified into these K clusters, and the CH or DB internal criterion can be computed to evaluate the clustering effect. Figure 11 illustrates the CH value for each K∈2,10, and we can see that the CH value is the largest when K=2. Therefore, the best clustering number is K=2.Figure 9
Decision chart for parametersρi and δi.Figure 10
γ
i of each wood sample calculated and sorted in descending order.Figure 11
CH value for different clustering numbers.Third, the remaining 6 wood species are added to our system one by one, and the clustering analysis is performed again. Since the t-SNE algorithm is based on uncertainty in essence, we fulfill the clustering experiments for 50 times when one wood species is added. The times of correct clustering are recorded and CCR is computed, as illustrated in Tables4 and 5.Table 4
CFSFDP clustering analysis with CH criterion.
True wood species number
Different values of clustering numberK
CCR (%)
2
3
4
5
6
7
8
9
10
2
50
0
0
0
0
0
0
0
0
100
3
0
50
0
0
0
0
0
0
0
100
4
0
0
50
0
0
0
0
0
0
100
5
0
0
0
50
0
0
0
0
0
100
6
0
0
0
0
50
0
0
0
0
100
7
0
0
0
0
0
49
1
0
0
98
8
0
0
0
0
0
0
49
1
0
98Table 5
CFSFDP clustering analysis with DB criterion.
True wood species number
Different values of clustering numberK
CCR (%)
2
3
4
5
6
7
8
9
10
2
50
0
0
0
0
0
0
0
0
100
3
0
50
0
0
0
0
0
0
0
100
4
0
0
50
0
0
0
0
0
0
100
5
0
0
0
50
0
0
0
0
0
100
6
0
0
0
1
49
0
0
0
0
98
7
0
0
1
7
24
18
0
0
0
36
8
0
0
0
0
3
10
37
0
0
74Last, the clustering results are also evaluated by some external criteria such as Rand, Adjusted Rand, Jaccard, Fowlkes–Mallows, whose value interval is−1,1. The upper-bound 1 indicates that the clustering result is the best, while the lower-bound −1 is the worst. Therefore, the more these four criteria approach to 1, the more accurate the clustering result is. Table 6 illustrates these four criteria which are all above 0.8, indicating that the CFSFDP algorithm’s clustering effect is good.Table 6
CFSFDP clustering analysis with external criterion.
Clustering algorithm
External criterion
Different values of clustering numberK
2
3
4
5
6
7
8
CFSFDP
Rand
0.9580
0.9504
0.9681
0.9793
0.9854
0.9887
0.9912
Adjusted Rand
0.9160
0.8861
0.9128
0.9337
0.9462
0.9527
0.9587
Jaccard
0.9155
0.8564
0.8760
0.8985
0.9138
0.9218
0.9301
Fowlkes–Mallows
0.9568
0.9231
0.9341
0.9467
0.9551
0.9594
0.9638


## 3.1. Spectral Preprocessing

The acquired spectral curve has noises in the beginning and terminal bands due to the system error. Therefore, these noisy bands should be deleted, and the spectral curve in the band of 450 nm∼900 nm is remained for the model training and testing. Figure3 illustrates spectral curves of our 13 wood species. In this section, the spectral first-order differential operation is used to overcome the random noises, baseline drift, and light-scattering effect.Figure 3
Spectral curve graph of our 13 wood species.


## 3.2. SVDD Classification

The WT and PCA are used and compared for spectral dimension reduction. As for WT, the sym4 wavelet basis is used, and the preprocessed spectral curve is decomposed into 5 levels. Therefore, the original 1328D spectral curve is reduced to 48D, and the low frequency wavelet coefficient is remained and sent into the SVDD classifier. As for PCA, the cumulative contribution ratio (%) reaches to 99% for the first 15 principal components, which can represent the original spectral curve’s basic information. Therefore, the first 15 principal components are remained for SVDD classification, as illustrated in Figure4.Figure 4
The cumulative contribution ratio graph of PCA.In our one-class classification experiment, the Gaussian kernel function is used inKxi,xj, and the hypersphere’s boundary shape is influenced by the penalty factor C and Gaussian kernel parameter σ. When σ is fixed, the number of support vectors is influenced by C, but to some extents, the influence of C on the hypersphere’s boundary shape is relatively small. When C is fixed, a small σ will produce a tight boundary shape and thus an overfit, while a large σ will produce a slack boundary shape and thus an underfit. Therefore, the optimal C and σ should be acquired before the SVDD classification. Table 3 illustrates the SVDD classification results for the testing dataset of the known category and all datasets of the unknown category by use of the optimal C and σ. We can see that WT’s performance is superior to PCA.Table 3
One-class classification of SVDD with optimal parameters and WT/PCA.
Methods
Precision
Recall
F
C
σ
WT-SVDD
0.9963
0.98
0.9881
0.17
18
PCA-SVDD
0.9241
0.97
0.9465
0.06
18


## 3.3. Wood Species Classification in Known Category

The BP neural network’s structure is as follows. Its input layer has 48 nodes, while the output layer has 5 nodes. The hidden layer has 27 nodes that are determined by multiple tests. The delivery function between the input layer and hidden layer is selected as “tansig,” while that between the hidden layer and output layer is “purelin.” The iteration times are 500, with an error target of 0.0002 and a learning rate of 0.01. After network training, this neural network is used for wood species recognition for samples in the known category which may include some samples falsely classified as in the known category by SVDD possibly.To test neural network’s classification performance, the testing dataset in the known category (20×5=100 samples) and all samples in the unknown category (55×8=440 samples) are sent into the network. Figure 5 illustrates SSE for all wood samples, where we can see that SSE of the testing dataset in the known category is much smaller than that of all samples in the unknown category. Therefore, an appropriate threshold T can be used to separate the known category from the unknown category. Figure 6 illustrates the relationship between threshold T and correct accept/reject rate. We can see that when T = 0.023, the correct accept rate for the known category is 100%, while the correct reject rate for the unknown category is 92.05%. However, the correct classification rate is less than 74% (i.e., 100÷100+35=74%).Figure 5
SSE comparison for the known category and unknown category.Figure 6
The relationship between thresholdT and correct accept/reject rate.In our practical system, there are 100 samples in testing datasets of 5 wood species in the known category (Table1). In the SVDD classification test, 4 samples in the known category are falsely classified as in the unknown category, and again 4 samples in the unknown category are falsely classified as in the known category. The BP network’s classification result is illustrated in Figure 7 with T = 0.023, where we can see that the correct classification rate for the known category is 96% (i.e., all these 96 samples are classified as correct wood species), and the remaining 4 samples are correctly rejected so that the correct reject rate for the unknown category is 100%. Therefore, in view of the correct classification rate for the known category and the correct reject rate for the unknown category, the performance of our SVDD plus BP network is much better than that of the BP network alone.Figure 7
Classification result of the BP neural network.


## 3.4. Unsupervised Clustering in Unknown Category

First, the t-SNE algorithm is used for the spectral secondary dimension reduction after WT. The dimension reduction results of t-SNE, PCA, Sammon Mapping (SM) [16], Isometric Feature Mapping (IFM) [17], Laplacian Eigenmaping (LE) [18], and Linear Discriminator Analysis (LDA) [19] are compared in Figure 8. In Figure 8, x-axis and y-axis refer to the first two dimensions after dimension reduction, and we can see that the performance of the t-SNE algorithm is the best in view of the intraclass similarity and the interclass difference.Figure 8
Comparison of secondary dimension reduction results: (a) t-SNE; (b) PCA; (c) SM; (d) IFM; (e) LE; and (f) LDA.
(a)
(b)
(c)
(d)
(e)
(f)Second, the CFSFDP algorithm is used for clustering of 2 wood speciesBetula platyphylla and Picea jezoensis. The cutoff distance is set as dc=4, and the parameters ρi and δi of each sample are calculated, as illustrated in decision chart Figure 9. We can see that these two parameters of no. 35 and no. 68 samples are relatively large, and these two samples are more likely to be clustering centers. Then the γi of each sample is calculated and sorted in descending order, as illustrated in Figure 10. In order to fulfill the automatic selection of clustering centers, the clustering number K is set as an interval K∈2,10. The first K larger γi1−γik correspond to K samples which are set as clustering centers. The remaining samples are classified into these K clusters, and the CH or DB internal criterion can be computed to evaluate the clustering effect. Figure 11 illustrates the CH value for each K∈2,10, and we can see that the CH value is the largest when K=2. Therefore, the best clustering number is K=2.Figure 9
Decision chart for parametersρi and δi.Figure 10
γ
i of each wood sample calculated and sorted in descending order.Figure 11
CH value for different clustering numbers.Third, the remaining 6 wood species are added to our system one by one, and the clustering analysis is performed again. Since the t-SNE algorithm is based on uncertainty in essence, we fulfill the clustering experiments for 50 times when one wood species is added. The times of correct clustering are recorded and CCR is computed, as illustrated in Tables4 and 5.Table 4
CFSFDP clustering analysis with CH criterion.
True wood species number
Different values of clustering numberK
CCR (%)
2
3
4
5
6
7
8
9
10
2
50
0
0
0
0
0
0
0
0
100
3
0
50
0
0
0
0
0
0
0
100
4
0
0
50
0
0
0
0
0
0
100
5
0
0
0
50
0
0
0
0
0
100
6
0
0
0
0
50
0
0
0
0
100
7
0
0
0
0
0
49
1
0
0
98
8
0
0
0
0
0
0
49
1
0
98Table 5
CFSFDP clustering analysis with DB criterion.
True wood species number
Different values of clustering numberK
CCR (%)
2
3
4
5
6
7
8
9
10
2
50
0
0
0
0
0
0
0
0
100
3
0
50
0
0
0
0
0
0
0
100
4
0
0
50
0
0
0
0
0
0
100
5
0
0
0
50
0
0
0
0
0
100
6
0
0
0
1
49
0
0
0
0
98
7
0
0
1
7
24
18
0
0
0
36
8
0
0
0
0
3
10
37
0
0
74Last, the clustering results are also evaluated by some external criteria such as Rand, Adjusted Rand, Jaccard, Fowlkes–Mallows, whose value interval is−1,1. The upper-bound 1 indicates that the clustering result is the best, while the lower-bound −1 is the worst. Therefore, the more these four criteria approach to 1, the more accurate the clustering result is. Table 6 illustrates these four criteria which are all above 0.8, indicating that the CFSFDP algorithm’s clustering effect is good.Table 6
CFSFDP clustering analysis with external criterion.
Clustering algorithm
External criterion
Different values of clustering numberK
2
3
4
5
6
7
8
CFSFDP
Rand
0.9580
0.9504
0.9681
0.9793
0.9854
0.9887
0.9912
Adjusted Rand
0.9160
0.8861
0.9128
0.9337
0.9462
0.9527
0.9587
Jaccard
0.9155
0.8564
0.8760
0.8985
0.9138
0.9218
0.9301
Fowlkes–Mallows
0.9568
0.9231
0.9341
0.9467
0.9551
0.9594
0.9638


## 4. Conclusions

In this paper, we propose a novel incremental self-adaptive wood species classification prototype system. Our prototype system can recognize the incremental wood species quantity. The visible/near-infrared spectrometer is used to pick up the spectral curves of wood samples for the subsequent wood species classification. First, when new wood samples of unknown wood species are added, they are classified as an unknown category by our one-class classifier, SVDD, while the existent wood species are classified as a known category by the SVDD. Second, the wood samples of known species are sent into the BP neural network for the subsequent wood species classification. A few wood samples of the unknown category falsely classified by SVDD as the known category may be processed by the BP network as “rejected classification.” Third, the new wood samples of unknown species are sent into the CFSFDP algorithm for the unsupervised clustering, and the clustering result is evaluated by the internal and external norms. An improvement on this CFSFDP algorithm is proposed to fulfill the automatic determination of clustering number by use of CH or DB internal criterion. Last, if one cluster of one unknown species has an adequate amount of wood samples, these wood samples are removed and identified by human experts or other schemes to ensure to get the correct wood species name. All wood samples of this cluster must be processed one by one to find and discard those samples falsely classified by SVDD possibly. Then, these wood samples are considered as a new known species and are sent into the classifiers, SVDD and BP neural network, to train them again. This procedure is repeated so that our system can recognize more and more wood species.Among wood properties such as wood species, wood density, surface color, surface roughness, surface defects, wood strength, moisture content, and so on, wood species is the most important property since other wood properties are usually related to wood species. Many sensors and measurement schemes have been used to detect these wood properties [20–25]. For instance, Salim et al. measured the bonding strength of three wood species pine, oak, and nyatoh [25]. With regard to wood species recognition, all the present wood species classification systems can usually process the limited wood species quantity. Therefore, we propose a novel incremental self-adaptive wood species classification prototype system to solve the above-mentioned issue. Our prototype system can process the incremental wood species quantity. Moreover, our experimental system is simple and cheap, since the spectrometer used here is an Ocean Optics USB2000 + microfiber spectrometer whose price is only approximately USD 2000. This spectrometer is small and light, which can be used for embedded system development by using Linux operation system and C language programming in the future, but the present prototype system software is realized by using Matlab programming. The research content of this paper lays a theoretical foundation for the development of a portable online practical system that can process more and more wood species.



---

*Source: 9247386-2019-11-15.xml*