# Application of Permutation Entropy in Feature Extraction for Near-Infrared Spectroscopy Noninvasive Blood Glucose Detection

Authors: Xiaoli Li; Chengwei Li
Journal: Journal of Spectroscopy
 (2017)

---

## Abstract

Diabetes has been one of the four major diseases threatening human life. Accurate blood glucose detection became an important part in controlling the state of diabetes patients. Excellent linear correlation existed between blood glucose concentration and near-infrared spectral absorption. A new feature extraction method based on permutation entropy is proposed to solve the noise and information redundancy in near-infrared spectral noninvasive blood glucose measurement, which affects the accuracy of the calibration model. With the near-infrared spectral data of glucose solution as the research object, the concepts of approximate entropy, sample entropy, fuzzy entropy, and permutation entropy are introduced. The spectra are then segmented, and the characteristic wave bands with abundant glucose information are selected in terms of permutation entropy, fractal dimension, and mutual information. Finally, the support vector regression and partial least square regression are used to establish the mathematical model between the characteristic spectral data and glucose concentration, and the results are compared with conventional feature extraction methods. Results show that the proposed new method can extract useful information from near-infrared spectra, effectively solve the problem of characteristic wave band extraction, and improve the analytical accuracy of spectral and model stability.


---

## Body

## 1. Introduction

Diabetes is one of the major diseases threatening human health, and the number of people with diabetes is growing at an alarming rate. More than one hundred million people suffer from diabetes; furthermore, the number is expected to increase to 592 million by 2035 [1]. Although proper diet and insulin injection can be used to regulate blood glucose levels, serious complications are caused in the later stage of diabetes, such as heart failure and blindness [2]. Therefore, the treatment of diabetes is very important, and the concentration of blood glucose detection is the foundation of diabetes treatment. The noninvasive blood glucose detection technology that measures the glucose concentration in the blood under the condition of no skin damage includes near-infrared spectroscopy, photo acoustic spectroscopy, polarization method, fluorescence method, and dielectric spectroscopy method [3–5]. Compared with the near-infrared spectra method, other noninvasive blood glucose detection methods are not perfectly suitable for real-time detection. The signals are hard to be detected and easy to be interfered by other components. At present, noninvasive blood glucose detection based on near-infrared spectra has become the research focus at home and abroad. Near-infrared spectroscopy (NIR), which is generated from molecular vibrations and reflects the chemical bond information, such as C-H, O-H, N-H, and S-H, can measure most kinds of compounds and their mixtures. Compared with the traditional analytical techniques, NIR has been widely applied because it is highly efficient and causes no damage and pollution [6–8]. The main structure and composition of glucose information is contained in the near-infrared spectra. The useful glucose information can be extracted form spectral data; then, the data after pretreatment are used to establish a mathematical model to calculate the glucose concentration. In the field of biomedicine, NIR combined with chemometrics is considered one of the most effective methods for noninvasive blood glucose concentration detection [3]. The common chemometrics methods include multiple linear regression (MLR), principal component regression (PCR), partial least squares regression (PLSR), and support vector regression (SVR). The MLR is limited by the noise in spectral data, and the irrelevance between some principal components and the actual content appears in the PCR. Therefore, the PLSR method and SVR method are applied in this paper. However, certain technical difficulties exist in noninvasive blood glucose measurement because near-infrared spectral samples cannot be pretreated, namely, the complex background, overlapped spectral peaks, and less effective information rate. Therefore, extracting effective information from the original spectra is critical for establishing an ideal mathematical model. The effective extraction of glucose characteristic information from nonlinear and nonstationary near-infrared spectral signals can improve the detection efficiency and detection precision.In 1984, Shannon introduced entropy to the field of information theory and proposed the concept of information entropy to measure the uncertainty of events [9]. Subsequently, the concept of entropy was gradually generalized. In 1991, Pincus proposed the concept of approximate entropy (ApEn), which has the advantages of short required calculating data and excellent antinoise ability [10] and offsets the shortcomings of nonlinear analysis. However, the data has no relevance and the errors are produced in the computational process of ApEn. To observably improve the accuracy and efficiency of the ApEn method, Richman and Moorman proposed an improved ApEn in 2000 called sample entropy (SampleEn) [11]. Compared with the ApEn algorithm, SampleEn has short required data and robust antinoise and anti-interference abilities, well consistent in the range of large parameters such unique advantages. The definition of SampleEn must contain a template match; otherwise, it is meaningless. Therefore, Chen et al. improved SampleEn and first defined a new measure of sequence complexity, named fuzzy entropy [12]. This new measure fuzzifies the similarity measure formula with an exponential function to enable the fuzzy entropy value to transition smoothly with changing parameter. Its definition still has significance when the parameter is small, and it inherits the relative consistency and short data set-processing characteristics of SampleEn. Bandt and Pompe proposed a randomness detection method of a time series, namely, permutation entropy (PE), which can detect the randomness of time series and dynamic mutation behavior [13–18]. Permutation entropy calculates entropy based on permutation patterns by comparing the neighboring values of the time series [19]. PE between 0 and 1 has the advantages of simple concept, fast calculation speed, and robust anti-interference ability, and it is especially suitable for nonlinear data.The key point of near-infrared spectra noninvasive blood glucose detection is to extract the characteristic information from the spectral signal. The near-infrared spectral signals of glucose solution are nonstationary and noisy, but the calculation of PE has a certain antinoise and anti-interference ability. In this study, the feature extraction of spectral information is investigated with glucose solution as the research object from the perspective of whole information from a signal. This paper is organized as follows. Section2 describes the principles of ApEn, SampleEn, fuzzy entropy, and PE and then briefly introduces the methods of near-infrared spectral characteristic band extraction of a glucose solution, such as fractal dimension, mutual information, and the modeling methods, such as PLSR and SVR. In Section 3, the application of the proposed method is presented, and PLSR and SVR are used to establish calibration models with the extracted characteristic bands, as well as verify the validity and superiority of the proposed method. Finally, the conclusion is drawn in Section 4.


## 2. Theory and Methods

### 2.1. Entropy

#### 2.1.1. Approximate Entropy

In 1991, Pincus defined ApEn as a conditional probability that the similarity vector maintains its similarity when it increases fromm dimension to m+1 dimension. The physical meaning is the probability of generating a new pattern of time series when the dimension changes. ApEn has the following advantages: (1) short required data, (2) robust antinoise and anti-interference abilities, and (3) applicability for deterministic and stochastic signals and a mixed signal composed of deterministic and stochastic signals. The steps of the ApEn algorithm are as follows [10]:
(1)
Given a time series of lengthN, ui,i=1,…,N, reconstruct a m-dimensional vector Xi,i=1,2,…,n,n=N−m+1, according to the formula Xi=ui,ui+1,…,ui+m−1.(2)
Compute the distance between arbitrary the vectorXi and the vector Xjj=1,2,…,N−m+1,j≠i.
(1)dij=maxui+j−uj+k,k=0,1,…,m−1.The distance between the two vectors is the maximum absolute value of the difference between two corresponding elements in two vectors.(3)
Specify the thresholdr, which is typically between 0.2 and 0.3. For each vector Xi, find the number of dij≤r×SD (SD is the standard deviation of the sequence) and calculate the ratio between this number and the total number of distances N−m, which is denoted as Cimi.(4)
Take the logarithm ofCimi, average for all i, and denote ϕmr.
(2)ϕmr=1N−m+1∑i=1N−m+1lnCimr.(5)
Increasem by 1 and repeat steps 1 to 4 to obtain Cim+1i and ϕm+1r.(6)
Obtain the ApEn fromϕm+1,ϕm.
(3)ApEn=∑N→∞ϕm−ϕm+1.(7)
For a finite time series, ApEn can be estimated by a statistical value.(4)ApEn=ϕm−ϕm+1.The parametersN,m, and r in the above steps are the length of time series, length of the comparison window, and margin of similarity, respectively. The bigger the value of m is, the more dynamic the process can be reconstructed.


#### 2.1.2. Sample Entropy

The physical meaning of SampleEn is the same as that of ApEn. The larger SampleEn is, the higher the complexity of the sequence and the greater the probability of generating the new pattern will be. The specific algorithm implementation process is as follows [11]:
(1)
Given the time seriesx1,x2,…,xN, compose a set of dimension vectors according to the serial number order.
(5)Xmi=xi,xi+1,…,xi+m−1,i=1~N−m.(2)
Define the distance between vectorXmi and vector Xmj as the largest difference between their corresponding elements, namely,
(6)dXmi,Xmj=maxxi+k−xj+k.(3)
Define the thresholdr. For the value of each i≤N−m, find the number Ni of dXmi,Xmj≤r, and calculate the ratio between Ni and the total number of distances N−m−1, which is denoted as Bmi=Ni/N−m−1. The average for all i is as follows:
(7)Bmr=N−m−1⋅∑i=1NBmi.(4)
Increase the dimension tom+1 and repeat the above steps to obtain
(8)Bm+1r=N−m−1⋅∑i=1NBm+1i.(5)
Theoretically, the SamEn of this sequence is as follows:(9)SampleEnm,r=limN→∞−lnBm+1rBmr,where N→∞. In practice, N is not an infinite value. When N is a finite value, SamEn is calculated as follows:
(10)SampleEnm,r,N=−lnBm+1rBmr.


#### 2.1.3. Fuzzy Entropy

In the definition of fuzzy entropy, the concept of a fuzzy set is introduced, and the exponential function is chosen as the fuzzy function to measure the similarity of two vectors. The exponential function has the following expectation properties: (1) continuity of the exponential function ensures that its value does not have a mutation and (2) the nature of the exponential function ensures that the self-similarity value of the vector is maximum. The definition of fuzzy entropy is as follows [12]:
(1)
The sampling sequence withN points is ui:1≪i≪N.(2)
Compose a set ofm-dimensional vectors according to the serial number order.
(11)Xim=ui,ui+1,…,ui+m−1−u0ii=1,…,N−m,where ui,ui+1,…,ui+m−1 represents the continuous m values of u starting from the ith point. u0i is its mean value.
(12)u0i=1m∑j=0m−1ui+j.(3)
Define the distancedijm between vector Xim and vector Xjm as the largest difference between their corresponding elements, namely,
(13)dijm=dXim,Xjm=maxk∈0,m−1ui+k−u0i−uj+k−u0j,i,j=1~N−m,j≠i.(4)
Define the similarityDijm between vector Xim and vector Xjm, with a fuzzy function _dijm,n,r, namely,
(14)Dijm=_dijm,n,r=exp−dijmnr,where the fuzzy function _dijm,n,r is an exponential function, and n and r are the gradient and width of the exponential function boundary, respectively.(5)
Define the function as follows:(15)Omn,r=1N−m∑i=1N−m1N−m−1∑j=1,j≠iN−mDijm.(6)
Similarly, repeat steps 2 to 5, reconstruct a set ofm+1-dimensional vector according to the serial number order, and define the following function:
(16)Omn,r=1N−m∑i=1N−m1N−m−1∑j=1,j≠1N−mDijm+1.(7)
Define the fuzzy entropy as follows:(17)FuzzyEnm,n,r=limN→∞lnOmn,r−lnOm+1n,r.When N is a finite value, the value obtained by the above steps is the estimated value of the fuzzy entropy of the sequence with length N.
(18)FuzzyEnm,n,r,N=lnOmn,r−lnOm+1n,r.


#### 2.1.4. Permutation Entropy

According to [13], the definition of PE is setting a time sequence Xi,i=1,2,…,n, and reconstruct it in phase space to obtain the matrix
(19)x1x1+τ⋯x1+m−1τ⋮⋮⋮xjxj+τ⋯xj+m−1τ⋮⋮⋮xKxK+τ⋯xKm−1τ,j=1,2,…,K,where m and τ are the embedding dimension and delay time, respectively, and K=n−m−1τ. Each row in the matrix can be regarded as a reconstructed component, with a total of K reconstruction components. The jth reconstruction component xj,xj+τ,…,xj+m−1τ of the reconstruction matrix Xi is rearranged according to the values in ascending order. j1,j2,…,jm represents the index of the column in which the individual elements of the reconstructed component are as follows:
(20)xi+j1−1τ≤xi+j2−1τ≤⋯≤xi+jm−1τ.If equal values in the reconstructed component are observed,(21)xi−j1−1τ=xi−jm−1τ,the components are arranged according to the size of the value of j1 and j2, that is, when j1<j2, xi−j1−1τ≪xi−j2−1τ.Therefore, for an arbitrary time seriesXi, a set of symbol sequences can be obtained from each row in the reconstructed matrix
(22)Sl=j1,j2,…,jm,where l=1,2,…,k and k≪m!. m! is observed when the m-dimensional phase space map has a different symbolic sequence j1,j2,…,jm, and the symbolic sequence Sl is one kind of arrangement. If the probability of the occurrence of each symbol sequence is P1,P2,…,Pk, the PE of k kinds of different symbol sequences of time series Xi in terms of Shannon entropy is as follows:
(23)Hpm=−∑j=1kPjlnPj.When Pj=1/m!, Hpm reaches the maximum value lnm!. For convenience, Hpm is typically normalized with lnm!, namely,
(24)0≪Hp=Hplnm!≪1.The magnitude ofHp represents the randomness degree of the time series Xi. The smaller the value of Hp is, the more inerratic the time series will be; otherwise, the more stochastic the time series will be. The change in Hp reflects and amplifies the minute details of the time series.


#### 2.1.5. Application to Simulation Signal

In order to compare the ApEn, SampleEn, fuzzy entropy, and PE, define a mixed signal composed of deterministic signal and stochastic signal with a different probability,(25)MIXN,p=1−pxt+pyt,where xt=2sin2πt, yt is the stochastic signal in −0.5,0.5, N is the data length, and p∈0,1. Considering the four kinds of entropy of signal with MIX1024,0.4 and MIX1024,0.2, note ApEn1, SampleEn1, FuzzyEn1, PE1, ApEn2, SampleEn2, FuzzyEn2, and PE2 for convenience, respectively. Their change relation with signal amplitude A, signal length N, and signal-to-noise ratio of signal are shown in Figures 1–3.Figure 1
Four kinds of entropy values with different amplitudes.Figure1 shows that ApEn, SampleEn, and FuzzyEn change slightly with the same probability, when signal amplitude A changes bigger gradually. However, the PE has been the same all the time with a different probability, which illustrates that the PE has excellent stability and consistency.Figure2 shows that the ApEn, SampleEn, and FuzzyEn change with the signal length N and remain unchanged after N=512 with the same probability, which illustrates that the values of ApEn, SampleEn, and FuzzyEn are related to the data length. However, the PE has been the same all the time with a different probability, which illustrates that the required time sequence of PE is shorter in the calculation process.Figure 2
Four kinds of entropy values with different data lengths.Figure3 shows that the ApEn, SampleEn, and FuzzyEn change with the signal-to-noise ratio of the signal as the same trend with the same probability, which illustrates that the values of ApEn, SampleEn, and FuzzyEn are affected by SNR of the signal. However, the PE has been the same all the time with a different probability, which illustrates that the PE has robust antinoise ability. Therefore, the PE is used for extracting the feature information of near-infrared spectral data of glucose solution in this study.Figure 3
Four kinds of entropy values with different signal-to-noise ratios of signal.


### 2.2. Fractal Dimension

Dimension, an important feature of geometry, characterizes the size of the space a shape occupies. Because Euclidean geometry objects are relatively regular shapes, the obtained dimension is an integer. However, Euclidean geometry is not applied for irregular complex shapes. Most natural geometries exhibit similar properties. Therefore, the spatial dimension of an object is not always an integer; it can also be fractional. The noninteger dimension is the real dimension of most geometric shapes; integers are only special cases. The noninteger dimension is a different concept, but it is suitable for all the geometric shapes in nature. In 1919, Hausdorff, who studied the properties of singular sets, first proposed the concept of fractal dimension [20] and defined the Hausdorff measure and dimension theory. Since then, several scholars have developed various dimensions, such as self-similar dimension, box dimension, information dimension, correlation dimension, and Lyapunov dimension. The box dimension is one of the most common fractal dimensions because of its ease of calculation, few parameters, and ease of application. The box dimension is defined as the way that the set X is covered by a hypercube with size ε.X is a nonempty and bordered subset Rn. If it is covered by Nε hypercube with length ε, then
(26)DBX=limε→0lnNεln1/ε.The above formula is the definition of the fractal box dimension. The steps are as follows:(1)
Set discrete signalyi⊂Y, and Y is the closed set in the n-dimensional Euclidean space Rn.(2)
DivideRn with the ε grids as small as possible, and Nε is the grid counts of set Y. The limit in the above formula cannot be determined by definition; so, an approximate method is used in calculation. The ε grid is used as the reference, and it is enlarged to the kε grid, where k∈Z+. In this way, NkεNkε is the grid count of set Y in discrete space, and the following formula can be obtained:
(27)Pkε=∑i=1N/kmaxyki−1+1,yki−1+2,…,yki−1+k+1−minyki−1+1,yki−1+2,…,yki−1+k+1,where i=1,2,…,N/k,k=1,2,…,M,M<N,andN is the number of sampling points.The grid count is as follows:(28)Nkε=Pkεkε+1,where Nkε>1. In the graph of lgkε−lgNkε, the scale-free region is determined with good linearity. The beginning and end points of the scale-free region are k1 and k2; thus,
(29)lgNkε=algkε+b,k1≤k≤k2.Finally, the slope of the line is determined by the least square method,(30)a^=k2−k1+1∑lgk∑lgNkε−∑lgk∑lgNkεk2−k1+1∑lg2k−∑lgk2.The box dimensionDB is as follows:
(31)DB=a^.


### 2.3. Mutual Information

Information is the movement state and the way the movement state changes items that are felt and expressed by the cognitive subject. Two kinds of metric forms are identified for information. One measures how much information the message or message collection itself contains; another one is the measure of how much information is provided between messages or message sets. The former is described by self-information entropy and message entropy, whereas the latter is described by mutual information (MI) and average mutual information. Mutual information measures the degree of interdependence between two variables and represents the amount of shared information between two variables. For two given random variablesX and Y, if their respective marginal probability distribution and joint probability distribution are px,py, and px,y, the definition of mutual information between them is as follows:
(32)IX;Y=∑x∑ypx,ylogpx,ypxpy.When the variablesX and Y are completely unrelated or independent with each other, the mutual information is the minimum 0, which means no information overlaps between the two variables. By contrast, the higher the degree of interdependence between the two variables is, the greater the value of mutual information will be, and the more similar the information it contains.


### 2.4. Partial Least Squares Regression

In 1984, Wold and Albano first proposed PLSR, which was a new multivariate statistical data analysis method and studied the regression modeling of multiple dependent variables [21].Givenp independent variables x1,x2,…,xp and q dependent variables, the study of the statistical relationship between the independent variable and dependent variable involves the observation of n sample points, which form the data tables X and Y of the independent variable and dependent variable. In PLSR, the components t1 and u1 are first extracted form X and Y; namely t1 is the linear combination of x1,x2,…,xp and u1 is the linear combination of y1,y2,…,yq. After the first components t1 and u1 are extracted, the regression of X on t1 and Y on u1 is performed by PLSR. The accuracy of the model is validated; if the regression equation reaches satisfactory accuracy, the algorithm is terminated. Otherwise, the residual information of Xinterpreted by t1 and the residual information of Yinterpreted by u1 will be extracted for the second round. This step is repeated until accuracy is satisfactory. Finally, if m components t1,t2,…,tm form X, PLSR can be expressed as the regression equation of yk about the original variables x1,x2,…,xp by implementing regression with ykk=1,2,…,q on t1,t2,…,tm.


### 2.5. Support Vector Regression

The support vector machine (SVM) is a new machine learning method proposed by Vapnik et al. based on statistical learning theory. SVM has the characteristics of small sample learning and strong generalization ability, which can avoid the problems of overlearning and local minimum. By introducing the insensitive loss functionε, Vapnik et al. have extended the SVM to the regression estimation of the nonlinear system and established the SVR algorithm. SVR has been widely used in function estimation, nonlinear system modeling, and other fields [22].For the sample setG=xi,yiin (xi is the input vector, yi is the corresponding target value, and n is the number of samples), the SVR function is as follows:
(33)fx=ωϕx+b,where ϕx is the nonlinear map transforming data into a high-dimension feature space and ω and b are coefficients.


### 2.6. Near-Infrared Spectra Data

In the near-infrared spectra noninvasive blood glucose measurement experiments, the blood glucose solution is temporarily replaced by glucose solution. All the glucose solutions, which concentration ranges from 50 mg/dL to 1000 mg/dL, are continuous and are equally distributed liquid that is uniformly configured under the same conditions. The prepared samples of glucose solution are put into the detection system of spectrometer. All the experimental data are collected by Fourier spectrometer Antaris II FT-NIR, produced by America Thermo Company. Its spectral range is 833–2630 nm, resolution is 4 cm−1 across spectral range, wavenumber reproducibility is better than 0.05 cm−1, and wavenumber accuracy is ±0.03 cm−1. The data meet the measurement principle of Lambert-Beer’s law. All the collected near-infrared spectral data of glucose solution are measured five times with the same concentration in order to get a small statistical error and shown in Figure 4.Figure 4
Near-infrared spectral data of glucose solution.


## 2.1. Entropy

### 2.1.1. Approximate Entropy

In 1991, Pincus defined ApEn as a conditional probability that the similarity vector maintains its similarity when it increases fromm dimension to m+1 dimension. The physical meaning is the probability of generating a new pattern of time series when the dimension changes. ApEn has the following advantages: (1) short required data, (2) robust antinoise and anti-interference abilities, and (3) applicability for deterministic and stochastic signals and a mixed signal composed of deterministic and stochastic signals. The steps of the ApEn algorithm are as follows [10]:
(1)
Given a time series of lengthN, ui,i=1,…,N, reconstruct a m-dimensional vector Xi,i=1,2,…,n,n=N−m+1, according to the formula Xi=ui,ui+1,…,ui+m−1.(2)
Compute the distance between arbitrary the vectorXi and the vector Xjj=1,2,…,N−m+1,j≠i.
(1)dij=maxui+j−uj+k,k=0,1,…,m−1.The distance between the two vectors is the maximum absolute value of the difference between two corresponding elements in two vectors.(3)
Specify the thresholdr, which is typically between 0.2 and 0.3. For each vector Xi, find the number of dij≤r×SD (SD is the standard deviation of the sequence) and calculate the ratio between this number and the total number of distances N−m, which is denoted as Cimi.(4)
Take the logarithm ofCimi, average for all i, and denote ϕmr.
(2)ϕmr=1N−m+1∑i=1N−m+1lnCimr.(5)
Increasem by 1 and repeat steps 1 to 4 to obtain Cim+1i and ϕm+1r.(6)
Obtain the ApEn fromϕm+1,ϕm.
(3)ApEn=∑N→∞ϕm−ϕm+1.(7)
For a finite time series, ApEn can be estimated by a statistical value.(4)ApEn=ϕm−ϕm+1.The parametersN,m, and r in the above steps are the length of time series, length of the comparison window, and margin of similarity, respectively. The bigger the value of m is, the more dynamic the process can be reconstructed.


### 2.1.2. Sample Entropy

The physical meaning of SampleEn is the same as that of ApEn. The larger SampleEn is, the higher the complexity of the sequence and the greater the probability of generating the new pattern will be. The specific algorithm implementation process is as follows [11]:
(1)
Given the time seriesx1,x2,…,xN, compose a set of dimension vectors according to the serial number order.
(5)Xmi=xi,xi+1,…,xi+m−1,i=1~N−m.(2)
Define the distance between vectorXmi and vector Xmj as the largest difference between their corresponding elements, namely,
(6)dXmi,Xmj=maxxi+k−xj+k.(3)
Define the thresholdr. For the value of each i≤N−m, find the number Ni of dXmi,Xmj≤r, and calculate the ratio between Ni and the total number of distances N−m−1, which is denoted as Bmi=Ni/N−m−1. The average for all i is as follows:
(7)Bmr=N−m−1⋅∑i=1NBmi.(4)
Increase the dimension tom+1 and repeat the above steps to obtain
(8)Bm+1r=N−m−1⋅∑i=1NBm+1i.(5)
Theoretically, the SamEn of this sequence is as follows:(9)SampleEnm,r=limN→∞−lnBm+1rBmr,where N→∞. In practice, N is not an infinite value. When N is a finite value, SamEn is calculated as follows:
(10)SampleEnm,r,N=−lnBm+1rBmr.


### 2.1.3. Fuzzy Entropy

In the definition of fuzzy entropy, the concept of a fuzzy set is introduced, and the exponential function is chosen as the fuzzy function to measure the similarity of two vectors. The exponential function has the following expectation properties: (1) continuity of the exponential function ensures that its value does not have a mutation and (2) the nature of the exponential function ensures that the self-similarity value of the vector is maximum. The definition of fuzzy entropy is as follows [12]:
(1)
The sampling sequence withN points is ui:1≪i≪N.(2)
Compose a set ofm-dimensional vectors according to the serial number order.
(11)Xim=ui,ui+1,…,ui+m−1−u0ii=1,…,N−m,where ui,ui+1,…,ui+m−1 represents the continuous m values of u starting from the ith point. u0i is its mean value.
(12)u0i=1m∑j=0m−1ui+j.(3)
Define the distancedijm between vector Xim and vector Xjm as the largest difference between their corresponding elements, namely,
(13)dijm=dXim,Xjm=maxk∈0,m−1ui+k−u0i−uj+k−u0j,i,j=1~N−m,j≠i.(4)
Define the similarityDijm between vector Xim and vector Xjm, with a fuzzy function _dijm,n,r, namely,
(14)Dijm=_dijm,n,r=exp−dijmnr,where the fuzzy function _dijm,n,r is an exponential function, and n and r are the gradient and width of the exponential function boundary, respectively.(5)
Define the function as follows:(15)Omn,r=1N−m∑i=1N−m1N−m−1∑j=1,j≠iN−mDijm.(6)
Similarly, repeat steps 2 to 5, reconstruct a set ofm+1-dimensional vector according to the serial number order, and define the following function:
(16)Omn,r=1N−m∑i=1N−m1N−m−1∑j=1,j≠1N−mDijm+1.(7)
Define the fuzzy entropy as follows:(17)FuzzyEnm,n,r=limN→∞lnOmn,r−lnOm+1n,r.When N is a finite value, the value obtained by the above steps is the estimated value of the fuzzy entropy of the sequence with length N.
(18)FuzzyEnm,n,r,N=lnOmn,r−lnOm+1n,r.


### 2.1.4. Permutation Entropy

According to [13], the definition of PE is setting a time sequence Xi,i=1,2,…,n, and reconstruct it in phase space to obtain the matrix
(19)x1x1+τ⋯x1+m−1τ⋮⋮⋮xjxj+τ⋯xj+m−1τ⋮⋮⋮xKxK+τ⋯xKm−1τ,j=1,2,…,K,where m and τ are the embedding dimension and delay time, respectively, and K=n−m−1τ. Each row in the matrix can be regarded as a reconstructed component, with a total of K reconstruction components. The jth reconstruction component xj,xj+τ,…,xj+m−1τ of the reconstruction matrix Xi is rearranged according to the values in ascending order. j1,j2,…,jm represents the index of the column in which the individual elements of the reconstructed component are as follows:
(20)xi+j1−1τ≤xi+j2−1τ≤⋯≤xi+jm−1τ.If equal values in the reconstructed component are observed,(21)xi−j1−1τ=xi−jm−1τ,the components are arranged according to the size of the value of j1 and j2, that is, when j1<j2, xi−j1−1τ≪xi−j2−1τ.Therefore, for an arbitrary time seriesXi, a set of symbol sequences can be obtained from each row in the reconstructed matrix
(22)Sl=j1,j2,…,jm,where l=1,2,…,k and k≪m!. m! is observed when the m-dimensional phase space map has a different symbolic sequence j1,j2,…,jm, and the symbolic sequence Sl is one kind of arrangement. If the probability of the occurrence of each symbol sequence is P1,P2,…,Pk, the PE of k kinds of different symbol sequences of time series Xi in terms of Shannon entropy is as follows:
(23)Hpm=−∑j=1kPjlnPj.When Pj=1/m!, Hpm reaches the maximum value lnm!. For convenience, Hpm is typically normalized with lnm!, namely,
(24)0≪Hp=Hplnm!≪1.The magnitude ofHp represents the randomness degree of the time series Xi. The smaller the value of Hp is, the more inerratic the time series will be; otherwise, the more stochastic the time series will be. The change in Hp reflects and amplifies the minute details of the time series.


### 2.1.5. Application to Simulation Signal

In order to compare the ApEn, SampleEn, fuzzy entropy, and PE, define a mixed signal composed of deterministic signal and stochastic signal with a different probability,(25)MIXN,p=1−pxt+pyt,where xt=2sin2πt, yt is the stochastic signal in −0.5,0.5, N is the data length, and p∈0,1. Considering the four kinds of entropy of signal with MIX1024,0.4 and MIX1024,0.2, note ApEn1, SampleEn1, FuzzyEn1, PE1, ApEn2, SampleEn2, FuzzyEn2, and PE2 for convenience, respectively. Their change relation with signal amplitude A, signal length N, and signal-to-noise ratio of signal are shown in Figures 1–3.Figure 1
Four kinds of entropy values with different amplitudes.Figure1 shows that ApEn, SampleEn, and FuzzyEn change slightly with the same probability, when signal amplitude A changes bigger gradually. However, the PE has been the same all the time with a different probability, which illustrates that the PE has excellent stability and consistency.Figure2 shows that the ApEn, SampleEn, and FuzzyEn change with the signal length N and remain unchanged after N=512 with the same probability, which illustrates that the values of ApEn, SampleEn, and FuzzyEn are related to the data length. However, the PE has been the same all the time with a different probability, which illustrates that the required time sequence of PE is shorter in the calculation process.Figure 2
Four kinds of entropy values with different data lengths.Figure3 shows that the ApEn, SampleEn, and FuzzyEn change with the signal-to-noise ratio of the signal as the same trend with the same probability, which illustrates that the values of ApEn, SampleEn, and FuzzyEn are affected by SNR of the signal. However, the PE has been the same all the time with a different probability, which illustrates that the PE has robust antinoise ability. Therefore, the PE is used for extracting the feature information of near-infrared spectral data of glucose solution in this study.Figure 3
Four kinds of entropy values with different signal-to-noise ratios of signal.


## 2.1.1. Approximate Entropy

In 1991, Pincus defined ApEn as a conditional probability that the similarity vector maintains its similarity when it increases fromm dimension to m+1 dimension. The physical meaning is the probability of generating a new pattern of time series when the dimension changes. ApEn has the following advantages: (1) short required data, (2) robust antinoise and anti-interference abilities, and (3) applicability for deterministic and stochastic signals and a mixed signal composed of deterministic and stochastic signals. The steps of the ApEn algorithm are as follows [10]:
(1)
Given a time series of lengthN, ui,i=1,…,N, reconstruct a m-dimensional vector Xi,i=1,2,…,n,n=N−m+1, according to the formula Xi=ui,ui+1,…,ui+m−1.(2)
Compute the distance between arbitrary the vectorXi and the vector Xjj=1,2,…,N−m+1,j≠i.
(1)dij=maxui+j−uj+k,k=0,1,…,m−1.The distance between the two vectors is the maximum absolute value of the difference between two corresponding elements in two vectors.(3)
Specify the thresholdr, which is typically between 0.2 and 0.3. For each vector Xi, find the number of dij≤r×SD (SD is the standard deviation of the sequence) and calculate the ratio between this number and the total number of distances N−m, which is denoted as Cimi.(4)
Take the logarithm ofCimi, average for all i, and denote ϕmr.
(2)ϕmr=1N−m+1∑i=1N−m+1lnCimr.(5)
Increasem by 1 and repeat steps 1 to 4 to obtain Cim+1i and ϕm+1r.(6)
Obtain the ApEn fromϕm+1,ϕm.
(3)ApEn=∑N→∞ϕm−ϕm+1.(7)
For a finite time series, ApEn can be estimated by a statistical value.(4)ApEn=ϕm−ϕm+1.The parametersN,m, and r in the above steps are the length of time series, length of the comparison window, and margin of similarity, respectively. The bigger the value of m is, the more dynamic the process can be reconstructed.


## 2.1.2. Sample Entropy

The physical meaning of SampleEn is the same as that of ApEn. The larger SampleEn is, the higher the complexity of the sequence and the greater the probability of generating the new pattern will be. The specific algorithm implementation process is as follows [11]:
(1)
Given the time seriesx1,x2,…,xN, compose a set of dimension vectors according to the serial number order.
(5)Xmi=xi,xi+1,…,xi+m−1,i=1~N−m.(2)
Define the distance between vectorXmi and vector Xmj as the largest difference between their corresponding elements, namely,
(6)dXmi,Xmj=maxxi+k−xj+k.(3)
Define the thresholdr. For the value of each i≤N−m, find the number Ni of dXmi,Xmj≤r, and calculate the ratio between Ni and the total number of distances N−m−1, which is denoted as Bmi=Ni/N−m−1. The average for all i is as follows:
(7)Bmr=N−m−1⋅∑i=1NBmi.(4)
Increase the dimension tom+1 and repeat the above steps to obtain
(8)Bm+1r=N−m−1⋅∑i=1NBm+1i.(5)
Theoretically, the SamEn of this sequence is as follows:(9)SampleEnm,r=limN→∞−lnBm+1rBmr,where N→∞. In practice, N is not an infinite value. When N is a finite value, SamEn is calculated as follows:
(10)SampleEnm,r,N=−lnBm+1rBmr.


## 2.1.3. Fuzzy Entropy

In the definition of fuzzy entropy, the concept of a fuzzy set is introduced, and the exponential function is chosen as the fuzzy function to measure the similarity of two vectors. The exponential function has the following expectation properties: (1) continuity of the exponential function ensures that its value does not have a mutation and (2) the nature of the exponential function ensures that the self-similarity value of the vector is maximum. The definition of fuzzy entropy is as follows [12]:
(1)
The sampling sequence withN points is ui:1≪i≪N.(2)
Compose a set ofm-dimensional vectors according to the serial number order.
(11)Xim=ui,ui+1,…,ui+m−1−u0ii=1,…,N−m,where ui,ui+1,…,ui+m−1 represents the continuous m values of u starting from the ith point. u0i is its mean value.
(12)u0i=1m∑j=0m−1ui+j.(3)
Define the distancedijm between vector Xim and vector Xjm as the largest difference between their corresponding elements, namely,
(13)dijm=dXim,Xjm=maxk∈0,m−1ui+k−u0i−uj+k−u0j,i,j=1~N−m,j≠i.(4)
Define the similarityDijm between vector Xim and vector Xjm, with a fuzzy function _dijm,n,r, namely,
(14)Dijm=_dijm,n,r=exp−dijmnr,where the fuzzy function _dijm,n,r is an exponential function, and n and r are the gradient and width of the exponential function boundary, respectively.(5)
Define the function as follows:(15)Omn,r=1N−m∑i=1N−m1N−m−1∑j=1,j≠iN−mDijm.(6)
Similarly, repeat steps 2 to 5, reconstruct a set ofm+1-dimensional vector according to the serial number order, and define the following function:
(16)Omn,r=1N−m∑i=1N−m1N−m−1∑j=1,j≠1N−mDijm+1.(7)
Define the fuzzy entropy as follows:(17)FuzzyEnm,n,r=limN→∞lnOmn,r−lnOm+1n,r.When N is a finite value, the value obtained by the above steps is the estimated value of the fuzzy entropy of the sequence with length N.
(18)FuzzyEnm,n,r,N=lnOmn,r−lnOm+1n,r.


## 2.1.4. Permutation Entropy

According to [13], the definition of PE is setting a time sequence Xi,i=1,2,…,n, and reconstruct it in phase space to obtain the matrix
(19)x1x1+τ⋯x1+m−1τ⋮⋮⋮xjxj+τ⋯xj+m−1τ⋮⋮⋮xKxK+τ⋯xKm−1τ,j=1,2,…,K,where m and τ are the embedding dimension and delay time, respectively, and K=n−m−1τ. Each row in the matrix can be regarded as a reconstructed component, with a total of K reconstruction components. The jth reconstruction component xj,xj+τ,…,xj+m−1τ of the reconstruction matrix Xi is rearranged according to the values in ascending order. j1,j2,…,jm represents the index of the column in which the individual elements of the reconstructed component are as follows:
(20)xi+j1−1τ≤xi+j2−1τ≤⋯≤xi+jm−1τ.If equal values in the reconstructed component are observed,(21)xi−j1−1τ=xi−jm−1τ,the components are arranged according to the size of the value of j1 and j2, that is, when j1<j2, xi−j1−1τ≪xi−j2−1τ.Therefore, for an arbitrary time seriesXi, a set of symbol sequences can be obtained from each row in the reconstructed matrix
(22)Sl=j1,j2,…,jm,where l=1,2,…,k and k≪m!. m! is observed when the m-dimensional phase space map has a different symbolic sequence j1,j2,…,jm, and the symbolic sequence Sl is one kind of arrangement. If the probability of the occurrence of each symbol sequence is P1,P2,…,Pk, the PE of k kinds of different symbol sequences of time series Xi in terms of Shannon entropy is as follows:
(23)Hpm=−∑j=1kPjlnPj.When Pj=1/m!, Hpm reaches the maximum value lnm!. For convenience, Hpm is typically normalized with lnm!, namely,
(24)0≪Hp=Hplnm!≪1.The magnitude ofHp represents the randomness degree of the time series Xi. The smaller the value of Hp is, the more inerratic the time series will be; otherwise, the more stochastic the time series will be. The change in Hp reflects and amplifies the minute details of the time series.


## 2.1.5. Application to Simulation Signal

In order to compare the ApEn, SampleEn, fuzzy entropy, and PE, define a mixed signal composed of deterministic signal and stochastic signal with a different probability,(25)MIXN,p=1−pxt+pyt,where xt=2sin2πt, yt is the stochastic signal in −0.5,0.5, N is the data length, and p∈0,1. Considering the four kinds of entropy of signal with MIX1024,0.4 and MIX1024,0.2, note ApEn1, SampleEn1, FuzzyEn1, PE1, ApEn2, SampleEn2, FuzzyEn2, and PE2 for convenience, respectively. Their change relation with signal amplitude A, signal length N, and signal-to-noise ratio of signal are shown in Figures 1–3.Figure 1
Four kinds of entropy values with different amplitudes.Figure1 shows that ApEn, SampleEn, and FuzzyEn change slightly with the same probability, when signal amplitude A changes bigger gradually. However, the PE has been the same all the time with a different probability, which illustrates that the PE has excellent stability and consistency.Figure2 shows that the ApEn, SampleEn, and FuzzyEn change with the signal length N and remain unchanged after N=512 with the same probability, which illustrates that the values of ApEn, SampleEn, and FuzzyEn are related to the data length. However, the PE has been the same all the time with a different probability, which illustrates that the required time sequence of PE is shorter in the calculation process.Figure 2
Four kinds of entropy values with different data lengths.Figure3 shows that the ApEn, SampleEn, and FuzzyEn change with the signal-to-noise ratio of the signal as the same trend with the same probability, which illustrates that the values of ApEn, SampleEn, and FuzzyEn are affected by SNR of the signal. However, the PE has been the same all the time with a different probability, which illustrates that the PE has robust antinoise ability. Therefore, the PE is used for extracting the feature information of near-infrared spectral data of glucose solution in this study.Figure 3
Four kinds of entropy values with different signal-to-noise ratios of signal.


## 2.2. Fractal Dimension

Dimension, an important feature of geometry, characterizes the size of the space a shape occupies. Because Euclidean geometry objects are relatively regular shapes, the obtained dimension is an integer. However, Euclidean geometry is not applied for irregular complex shapes. Most natural geometries exhibit similar properties. Therefore, the spatial dimension of an object is not always an integer; it can also be fractional. The noninteger dimension is the real dimension of most geometric shapes; integers are only special cases. The noninteger dimension is a different concept, but it is suitable for all the geometric shapes in nature. In 1919, Hausdorff, who studied the properties of singular sets, first proposed the concept of fractal dimension [20] and defined the Hausdorff measure and dimension theory. Since then, several scholars have developed various dimensions, such as self-similar dimension, box dimension, information dimension, correlation dimension, and Lyapunov dimension. The box dimension is one of the most common fractal dimensions because of its ease of calculation, few parameters, and ease of application. The box dimension is defined as the way that the set X is covered by a hypercube with size ε.X is a nonempty and bordered subset Rn. If it is covered by Nε hypercube with length ε, then
(26)DBX=limε→0lnNεln1/ε.The above formula is the definition of the fractal box dimension. The steps are as follows:(1)
Set discrete signalyi⊂Y, and Y is the closed set in the n-dimensional Euclidean space Rn.(2)
DivideRn with the ε grids as small as possible, and Nε is the grid counts of set Y. The limit in the above formula cannot be determined by definition; so, an approximate method is used in calculation. The ε grid is used as the reference, and it is enlarged to the kε grid, where k∈Z+. In this way, NkεNkε is the grid count of set Y in discrete space, and the following formula can be obtained:
(27)Pkε=∑i=1N/kmaxyki−1+1,yki−1+2,…,yki−1+k+1−minyki−1+1,yki−1+2,…,yki−1+k+1,where i=1,2,…,N/k,k=1,2,…,M,M<N,andN is the number of sampling points.The grid count is as follows:(28)Nkε=Pkεkε+1,where Nkε>1. In the graph of lgkε−lgNkε, the scale-free region is determined with good linearity. The beginning and end points of the scale-free region are k1 and k2; thus,
(29)lgNkε=algkε+b,k1≤k≤k2.Finally, the slope of the line is determined by the least square method,(30)a^=k2−k1+1∑lgk∑lgNkε−∑lgk∑lgNkεk2−k1+1∑lg2k−∑lgk2.The box dimensionDB is as follows:
(31)DB=a^.


## 2.3. Mutual Information

Information is the movement state and the way the movement state changes items that are felt and expressed by the cognitive subject. Two kinds of metric forms are identified for information. One measures how much information the message or message collection itself contains; another one is the measure of how much information is provided between messages or message sets. The former is described by self-information entropy and message entropy, whereas the latter is described by mutual information (MI) and average mutual information. Mutual information measures the degree of interdependence between two variables and represents the amount of shared information between two variables. For two given random variablesX and Y, if their respective marginal probability distribution and joint probability distribution are px,py, and px,y, the definition of mutual information between them is as follows:
(32)IX;Y=∑x∑ypx,ylogpx,ypxpy.When the variablesX and Y are completely unrelated or independent with each other, the mutual information is the minimum 0, which means no information overlaps between the two variables. By contrast, the higher the degree of interdependence between the two variables is, the greater the value of mutual information will be, and the more similar the information it contains.


## 2.4. Partial Least Squares Regression

In 1984, Wold and Albano first proposed PLSR, which was a new multivariate statistical data analysis method and studied the regression modeling of multiple dependent variables [21].Givenp independent variables x1,x2,…,xp and q dependent variables, the study of the statistical relationship between the independent variable and dependent variable involves the observation of n sample points, which form the data tables X and Y of the independent variable and dependent variable. In PLSR, the components t1 and u1 are first extracted form X and Y; namely t1 is the linear combination of x1,x2,…,xp and u1 is the linear combination of y1,y2,…,yq. After the first components t1 and u1 are extracted, the regression of X on t1 and Y on u1 is performed by PLSR. The accuracy of the model is validated; if the regression equation reaches satisfactory accuracy, the algorithm is terminated. Otherwise, the residual information of Xinterpreted by t1 and the residual information of Yinterpreted by u1 will be extracted for the second round. This step is repeated until accuracy is satisfactory. Finally, if m components t1,t2,…,tm form X, PLSR can be expressed as the regression equation of yk about the original variables x1,x2,…,xp by implementing regression with ykk=1,2,…,q on t1,t2,…,tm.


## 2.5. Support Vector Regression

The support vector machine (SVM) is a new machine learning method proposed by Vapnik et al. based on statistical learning theory. SVM has the characteristics of small sample learning and strong generalization ability, which can avoid the problems of overlearning and local minimum. By introducing the insensitive loss functionε, Vapnik et al. have extended the SVM to the regression estimation of the nonlinear system and established the SVR algorithm. SVR has been widely used in function estimation, nonlinear system modeling, and other fields [22].For the sample setG=xi,yiin (xi is the input vector, yi is the corresponding target value, and n is the number of samples), the SVR function is as follows:
(33)fx=ωϕx+b,where ϕx is the nonlinear map transforming data into a high-dimension feature space and ω and b are coefficients.


## 2.6. Near-Infrared Spectra Data

In the near-infrared spectra noninvasive blood glucose measurement experiments, the blood glucose solution is temporarily replaced by glucose solution. All the glucose solutions, which concentration ranges from 50 mg/dL to 1000 mg/dL, are continuous and are equally distributed liquid that is uniformly configured under the same conditions. The prepared samples of glucose solution are put into the detection system of spectrometer. All the experimental data are collected by Fourier spectrometer Antaris II FT-NIR, produced by America Thermo Company. Its spectral range is 833–2630 nm, resolution is 4 cm−1 across spectral range, wavenumber reproducibility is better than 0.05 cm−1, and wavenumber accuracy is ±0.03 cm−1. The data meet the measurement principle of Lambert-Beer’s law. All the collected near-infrared spectral data of glucose solution are measured five times with the same concentration in order to get a small statistical error and shown in Figure 4.Figure 4
Near-infrared spectral data of glucose solution.


## 3. Results and Discussion

The principle of selecting optimal wave bands has two key points: (1) information on the selected bands is large and (2) the correlation between bands is small. The widely used extraction methods include the information comparison of each band, information correlation between bands, best index method, entropy, and joint entropy of band data. In feature extraction, the fractal dimension (FD) can be used as a feature because almost all signals have fractal characteristics. The fractal dimension can distinguish different signals on the premise that two signals have different dimensions under the same measure. If two signals come from the same state, they have similarities, and their fractal dimensions are similar. The correlation or correlation coefficient can only reflect the linear correlation between two variables but cannot measure the nonlinear relationship between them. However, from the view of information theory, mutual information can estimate the total information amount between variables, is not limited to a linear relationship, and has greater advantages than correlation comparison. PE analysis can effectively determine the similarity between sequences and show the strong similarity and distinction, which can be further applied to biological sequence analysis. PE of the time series is calculated using the PE algorithm. The ratio value of PE is the basis for analyzing the similarity between sequences. Therefore, the PE, fractal dimension, and mutual information are used in extracting the feature information of near-infrared spectral data of glucose solution in this study.In the PE calculation, there are three parameters needed to be considered and set, namely, data lengthN, embedded dimension m, and time delay λ. According to reference [23], λ has a little effect on the PE value and there are very small differences among the PE values with different λ. Therefore, λ=1 is chosen in this study. In order to discuss the relationship of N and m with PE value, the PE values of the given signal MIXN,p with data length 128, 256, 512, 1024, and 2048 are calculated in Figure 5. Figure 5 shows that the PE values are almost same in m=2,3,4 with different data length N. If m is too small, the algorithms lose significance and effectiveness because of the few states contained in reconstructed sequence. If m is too big, the time series will be homogenized by phase space reconstruction; thus, the computation is time-consuming and the subtle changes in sequence cannot be reacted. Therefor m=3 and N=1867, which is the length of collected spectra data, are chosen in this study.Figure 5
The PE value of different lengthsN and embedded dimensions m of signal.Because PE cannot be affected by noise (λ=1), the characteristic wave bands are extracted from the collected near-infrared spectroscopy data of the glucose solution. Full spectral wavelength data have 1867 points in total, which are divided into wavelength intervals with 50, 100, 150, and 200 points. The ratio of PE of the corresponding wavelength interval between 50 mg/dL, 500 mg/dL, 1000 mg/dL, and pure water solution, the ratio of FD of the corresponding wavelength interval between 50 mg/dL, 500 mg/dL, 1000 mg/dL, and pure water solution and the MI values of the corresponding wavelength interval between 50 mg/dL, 500 mg/dL, 1000 mg/dL, and pure water solution are shown in Figure 6. As shown in Figure 6, the ratios of FD values and MI values of each wavelength interval have no obvious difference. The PE values of some wavelength intervals are substantially consistent, and other wavelength intervals are significantly different. Therefore, the later wavelength intervals are the characteristic wave bands that contained abundant glucose concentration information. However, the PE values of wavelength intervals that are divided with less than 50 points or more than 200 points of different concentration spectra have no obvious distinguished law. In order to improve the precision and accuracy of feature wavelength extraction, the characteristic wavelength intervals are extracted in four uniform ways (50, 100, 150, and 200), and their overlapping intervals are considered as the final characteristic wavelength intervals (Table 1).Figure 6
PE, FD, and MI of segmented spectral data: (a) 50 mg/dL, (b) 100 mg/dL, (c) 150 mg/dL, and (d) 200 mg/dL.
(a)
(b)
(c)
(d)Table 1
Extraction of feature wave bands by PE.
Number
Segment number
Overlapping wavenumber (cm−1)
1
7, 8, 17, 19
6840–7230, 8680–8880
2
4, 9, 14
3
3, 5
4
4In order to verify the effectiveness of the proposed method, the characteristic wavelength intervals of the collected spectral data of glucose solutions with the FD method, MI method, the proposed method, successive projection algorithm (SPA) method [24], EMD-SPA method [25], and full spectral data are taken into the calibration models that were established by PLSR and SVR. The correlation coefficient and root mean square error correction (RMSEC) of the model are evaluated. The characteristic wavelength points that were extracted based on the PE method are 150, which is much less than the full spectral wavelength points, and the smaller selected characteristic wavelength points are, the shorter the established model time is. The experimental results of SVR and PLSR calibration model (Tables 2 and 3) show that the correlation coefficient (R) and RMSEC of established calibration model by characteristic wavelength intervals that were extracted based on the PE method reach 0.9998/0.9897 and 0.0346%/0.0468%. The results are better than that of the established calibration model by characteristic wavelength intervals that were extracted based on FD method, MI method, SPA method, EMD-SPA method, and by full spectra data. The overall modeling results of SVR are more reliable to that of PLSR modeling method.Table 2
R and RMSEP of SVR model.
Method
R
RMSEC (%)
PE
0.9998
0.0346
EMD-SPA
0.9892
0.0670
SPA
0.9542
0.0846
FD
0.9293
0.1050
MI
0.8990
0.1522
Full spectra data
0.8188
0.2499Table 3
R and RMSEP of PLSR model.
Method
R
RMSEC (%)
PE
0.9897
0.0468
EMD-SPA
0.9688
0.0822
SPA
0.9321
0.1045
FD
0.9089
0.1276
MI
0.8880
0.1601
Full spectra data
0.8076
0.2519


## 4. Conclusions

The feature wave band extraction method that was based on permutation entropy that is proposed in this study for near-infrared spectra noninvasive blood glucose detection. The spectra data do not need denoise because PE has the advantages of robust antinoise and anti-interference abilities, and it is especially suitable for nonlinear data. Taking the near-infrared spectra data of glucose solutions as the object, all of the collected near-infrared spectra are divided with different interval points, and the ratio values of PE of corresponding spectra intervals are calculated. The overlap spectral intervals contained abundant glucose concentration information, which were extracted for reducing the effective range of data. Then, the PLSR and SVR methods are introduced for establishing the calibration models with characteristic spectra that were extracted by the proposed method, FD method, MI method, SPA method, EMD-SPA method, and full spectral data. According to the correlation coefficient and RMSEC of the calibration models, the proposed feature extraction method effectively solves the redundancy problem of near-infrared spectra data, and it also improves the robustness and predictive ability of regression model.



---

*Source: 9165247-2017-08-09.xml*