Fabric wrinkle level classification via online sequential extreme learning machine based on improved sine cosine algorithm

Abstract

Because it is difficulty to classify level of fabric wrinkle, this paper proposes a fabric winkle level classification model via online sequential extreme learning machine based on improved sine cosine algorithm (SCA). The SCA has excellent global optimization ability, can explore different search spaces, and effectively avoid falling into local optimum. Because the initial population of SCA will have an impact on its optimization speed and quality, the SCA is initialized by differential evolution (DE) to avoid local optimization, and then the output weight and hidden layer bias are optimized; that is, the improved SCA is used to select the optimal parameters of the online sequential extreme learning machine (OSELM) to improve the generalization performance of the algorithm. To verify the performance of the proposed model DE-SCA-OSELM, it will be compared with other algorithms using a fabric wrinkles dataset collected under standard conditions. The experimental results indicate that the proposed model can effectively find the optimal parameter value of OSELM. The average classification accuracy increased by 6.95%, 3.62%, 6.67%, and 3.34%, respectively, compared with the partial algorithms OSELM, SCAELM, RVFL and PSOSVM, which meets expectations.

Keywords

wrinkle level classification online sequential extreme learning machine sine cosine algorithm differential evolution

At present, in addition to the style of clothing, the wrinkle resistance of fabric has become a key factor affecting the aesthetics of a garment. Accurate and objective testing and evaluation for wrinkle resistance of fabric can not only guide the rational selection of fabrics, but also save costs and avoid waste of resources.

In the classification process of wrinkle level, the fabric features used for classification are the primary problems, and many researchers have done relevant research. In 1995, Youngjoo Na and Behnam Pourdeyhimi¹ studied the AATCC (American Association of Textile Chemists and Colorists) flatness standard sample using a combination of texture and profilometry. And the results show that the degree of wrinkle can be represented with image grayscale and surface statistical features, gray level co-occurrence matrix (GLCM) and power spectral density. Chang^2–4 studied the method of identifying seam wrinkling characteristics by using five shape parameters, fast Fourier transform and artificial intelligence technology; moreover, the method was used to explore the impact of sewing thread tension and stitch length on these five shapes parameters. In 2011, Ravanidi et al.⁵ studied the influence of GLCM parameters on the texture features of fabric wrinkle surface. The extracted GLCM parameters include: energy, contrast, correlation, entropy and inverse difference moment. The experimental results declare that: there is a high correlation between the objective evaluation results based on texture features and the subjective evaluation of expert groups. Among the five texture features, the best correlation with subjective vision is the inverse difference moment. Jurgita Domskienė et al.⁶ used a pre-set shape model to study the relationship between digital gray intensity and surface wrinkles with uniform sample illumination conditions and filtering procedures, and finally converted the acquired image into a binary image, which is to record the initial state of wrinkles and predict the critical parameters of wrinkles. In 2014, Liu et al.⁷ proposed a multi-directional fabric wrinkle measurement method in which the standard deviation coefficients of wavelet decomposition and GLCM were used to characterize fabric wrinkle features. In 2017, John-Eric Dufour et al.⁸ put forward measuring wrinkling under various conditions of contrast and loading via isogeometric stereocorrelation.

In terms of the multi-classification problem, considering the risk that the neural network has of over-fitting, it is easy to be affected by the model structure, and it is always falling into the local optimum situation. In 2004, Huang^9–11 presented a single hidden layer feedforward neural network (SLFN) extreme learning machine (ELM). ELM has a relatively simple structure, has small parameters to be adjusted, the weight of the hidden layer node is randomly or artificially given, and no update is required, and only output weight needs to be calculated in the learning process. Zhang et al.¹² applied the ELM algorithm to pathological encephalopathy analysis in 2018. Because the input weight and bias are randomly set, which affects the performance of the model on application, thence many optimization algorithms have emerged to improve this problem. In 2016, Zhou et al.¹³ proposed the integrated Bagging-based extreme learning machine improved by the particle swarm optimization algorithm, which was used for illumination correction. In 2019, Zhou et al.¹⁴ put forward optimizing ELM with an improved whale optimization algorithm and utilizing it in color difference classification of solid color printing products. The online sequential extreme learning machine proposed by Liang et al¹⁵ is an ELM algorithm that can learn and update output weight with real-time data. Zhou et al.¹⁶ proposed a hybrid online sequential extreme learning machine based on rotating forests, and the algorithm was applied to the illumination correction of printing products. The constrained online sequential extreme learning machine (COSELM) proposed by Gu et al.¹⁷ is a new indoor positioning technique that uses incremental data to modify old models and handle the frequent fluctuations of wireless signals over time.

In 2016, Seyedali Mirjalili¹⁸ proposed a new particle swarm optimization algorithm named the sine cosine algorithm (SCA). The optimization principle of SCA is that when the absolute value of the sine and cosine function is greater than 1, the algorithm can explore the different regions of search space. When the value of the sine and cosine function is between −1 and 1, the algorithm exploited the promising regions. The advantage of SCA is that the sine and cosine function value change can be used to realize the optimized search, which can explore different search spaces and effectively avoid falling into local optimum. It has some advantages: simple model, less adjustment parameters, fast convergence speed and strong global optimization ability. Li et al.¹⁹ proposed a support vector regression algorithm optimized by SCA. Under the experimental proof, we knew that SCA has an advantage in parameter optimization. Mohammed Abd Elaziz et al.²⁰ proposed the optimized random vector functional link (RVFL) algorithm based on SCA and used it to predict the inhibitory activity of angiotensin-converting enzyme (ACE).

Inspired by the above documents, and combined with the excellent optimization ability of the SCA algorithm and the good classification ability of OSELM, to improve the overall performance of wrinkle classification, the main goal of this paper is to use the improved SCA to optimize the parameters of OSELM, and propose a fabric wrinkle level classification model via OSELM based on an improved sine cosine algorithm, namely DE-SCA-OSELM. The paper presents a more comprehensive performance evaluation on the proposed model. The main contributions are as follows:

A new ELM model was designed to predict the classification of fabric wrinkle level, and the classification accuracy was increased.

Due to the random setting of the input weight and hidden layer bias of OSELM, the classification accuracy of the model would be affected and the stability is lacking. To overcome the shortcomings of OSELM, this paper uses an improved SCA algorithm to optimize the output weight and hidden layer bias of OSELM.

Analysis of the number of search agents, the number of iterations, the ratio of training set and testing set, the number of hidden layer nodes, the activation function and the parameter a in the SCA to influence the velocity and accuracy of the proposed algorithm. Finally, a relatively optimal combination of parameters was adopted.

The paper is organized as follows: the next section introduces the theoretical knowledge of differential evolution (DE), SCA and OSELM algorithms, and proposes an OSELM optimized by improve SCA with DE. The experimental conditions and data sources and the results of analysis are then discussed. This is followed by a consideration of the validity, stability, and significance of the proposed method’s parameters. Finally, there is a conclusion.

Proposed method (DE-SCA-OSELM)

Online sequential extreme learning machine

OSELM is an incremental learning algorithm, a variant ELM. There are two parts in OSELM: first, in the initialization phase, OSELM estimates the initial output weight matrix $β^{(0)}$ and the initial matrix H₀ by a given small amount of training data like the standard ELM algorithm. Generally speaking, the number of samples used for estimating the initial matrix H₀ is not less than the hidden layer nodes of the network. Second, in the online learning phase, whenever a new data block is received, the ELM is run again and a new output weight is obtained. The old and new output weights are combined to output the weight matrix $β_{0}$ to complete the update of the neural network. The specific training of OSELM is as follows:

Initialization phase: the subset $D_{0} = [(x_{i}, t_{i})] i = 1 N_{0}$ of sample $D = {(x_{i}, t i) | x_{i} \in ℜ n, t_{i} \in ℜ m |, i = 1, \dots, N}$ is considered the initial training sample, where, $N_{0} \geq L$ , L is the number of hidden layer nodes. When the activation function is sigmoid, the input weight a_i and hidden layer bias b_i are randomly generated. The initial output weight H₀ is computed as follows

H_{0} = \begin{matrix} [\begin{matrix} G (a_{1}, b_{1}, x_{1}) & \cdot \cdot \cdot & G (a_{L}, b_{L}, x_{1}) \\ \begin{matrix} \dots \\ \dots \\ \dots \end{matrix} & \begin{matrix} \dots \\ \dots \\ \dots \end{matrix} & \begin{matrix} \dots \\ \dots \\ \dots \end{matrix} \\ G (a_{1}, b_{1}, x_{N_{0}}) & \cdot \cdot \cdot & G (a_{L}, b_{L}, x_{N_{0}}) \end{matrix}]_{N_{0} \times L} \end{matrix}

(1)

The initial output weight matrix is obtained

β^{(0)} = K_{0}^{- 1} H_{0}^{T} T_{0}

(2)

K_{0} = H_{0}^{T} H_{0}

(3)

where,

T_{0} = [t_{1}^{T}, t_{2}^{T}, \dots, t_{N_{0}}^{T}] T

, and, set

k = 0

Online sequential learning phase: when a new data sample is received, suppose there are N₁ samples entering the model, we can get something according to the idea of ELM

β^{(1)} = K_{1}^{- 1} \begin{matrix} [\begin{matrix} H_{0} \\ H_{1} \end{matrix}]^{T} [\begin{matrix} T_{0} \\ T_{1} \end{matrix}] \end{matrix}

(4)

where

β^{(1)}

is represented by

β^{(0)}

, namely

β^{(1)} = β^{(0)} + K_{1}^{- 1} H_{1}^{T} (T_{1} - H_{1} β^{(0)})

(5)

Therefore, the recurrence relation of online learning can be obtained

P_{k + 1} = P_{k} - P_{k} H_{k + 1}^{T} (I + H_{k + 1} P_{k} H_{k + 1}^{T}) - 1 H_{k + 1} P_{k}

(6)

β^{(k + 1)} = β^{(k)} + P_{k + 1} H_{k + 1}^{T} (T_{k + 1} - H_{k + 1} β^{(k)})

(7)

finally, set $k = k + 1$ , then repeating the online sequential learning phase.

Differential evolution algorithm

The differential evolution algorithm was first proposed by Storn and Price²¹ in 1995. It mainly has three steps including variation, crossover, and selection, which are often used to solve real optimization problems. This algorithm is a kind of group-based adaptive global optimization algorithm, which belongs to a kind of evolutionary algorithm. Sánchez-Monedero et al.²² conducted a comprehensive evaluation of the combination of sensitivity and precision of the differential evolution extreme learning machine (DEELM) and received very good results. In the process of the DE algorithm, first, two individuals are selected from parent individuals to perform a difference calculation to generate a difference vector. Second, another individual is selected and summed with the difference vector to generate an experimental individual. Then, a crossover operation would be conducted with the parent individual and the corresponding experimental individual to generate a new child individual. Finally, a selection operation is performed between parent and child individual, and the eligible individuals are saved to the next generation group.

Variation

D_{i} (T + 1) = X_{r 1} (T) + F \times (X_{r 2} (T) - X_{r 3} (T))

(8)

where, T is the current number of iterations; F represents the scaling factor, in the range

[0, 2]

; r1, r2 and

r 3

are the random integers, which are not equal to i, any two are not equal to each other; and N is the size of population.

Crossover: for the $j_{th}$ dimension of $i_{th}$ individual

U_{i, j} (T + 1) = \begin{matrix} \begin{matrix} D_{i, j} (T + 1), & if r and < CR or j = D_{n} \\ X_{ij} (T), & otherwise \end{matrix} \end{matrix}

(9)

where,

CR

represents the crossover rate; rand is random numeric in

[0, 1]

; D_n is a random dimension.

Selection: if the fitness value of the test individual is better than that of the target individual, then the test individual replaces the target individual in the next generation; otherwise the target individual would remain.

X_{i} (T + 1) = \begin{matrix} \begin{matrix} U_{i} (T + 1), & if f (U_{i} (T + 1)) \leq f (X_{i} (T)) \\ X_{i} (T), & otherwise \end{matrix} \end{matrix}

(10)

Sine cosine algorithm

In the SCA, after the position of the individual is initialized, the sine and cosine function is used to update the individual position in subsequent iterations. The flow of the algorithm is shown in Algorithm 1. The specific update equation is

X_{i}^{i + 1} = X_{i}^{t} + r_{1} + sin r_{2} + | r_{3} P_{i}^{t} - X_{i}^{t} |

(11)

X_{i}^{i + 1} = X_{i}^{t} + r_{1} + cos r_{2} + | r_{3} P_{i}^{t} - X_{i}^{t} |

(12)

where,

X_{i}^{t}

represents the position of X individual in t_th iteration; r₁, r₂ and r₃ are random numeric; P_i is the current individual optimal position. The available update equation is as follows

X_{i}^{i + 1} = \begin{matrix} \begin{matrix} X_{i}^{t} + r_{1} + sin r_{2} + | r_{3} P_{i}^{t} - X_{i}^{t} |, & r_{4} < 0.5 \\ X_{i}^{t} + r_{1} + cos r_{2} + | r_{3} P_{i}^{t} - X_{i}^{t} |, & r_{4} \geq 0.5 \end{matrix} \end{matrix}

(13)

where, r₄ represents the random numeric in

[0, 1]

In equation (13), r₁, r₂, r₃ and r₄ are the four main parameters of SCA. Where, r₁ determines the position or direction of movement at the next iteration; r₂ is a random numeric in $[0, π]$ , which defines the step value toward or away from the target solution at current movement; r₃ is a weight given by the target solution randomly, with the purpose of strengthening or weakening the influence on the target solution via the step value defined by $r_{3} > 1$ or $r_{3} < 1$ ; r₄ is the key to switches between the sine and cosine in equation (13). When $r_{4} < 0.5$ , the iteration is according to sine; when $r_{4} \geq 0.5$ , the iteration is according to cosine.

This regulation guarantees the balance between local exploration and global exploitation of the algorithm. When the amplitude of the sine and cosine functions is in [−1,1], the algorithm performs the local exploration stage. When the amplitude of the sine and cosine is at [−2, −1] and [1, 2], the algorithm conducts global exploitation. To balance local exploration and global exploitation, traversing all regions in the search space and finally converging to obtain the global optimal solution, the SCA algorithm uses equation (14) to achieve adaptive adjustment of the amplitude of sine and cosine functions

r_{1} = a - t \frac{a}{T}

(14)

where, t represents the current number of iterations; T is the maximum iteration numeric; a is a constant.

Algorithm 1 Sine cosine algorithm
Initialize
Set the random solution of the search agents;
Get the objective values of the initial random solutions;
Get the position of the destination point;
Get the best objective value so far;
Iteration
While t ≤ Maximum number of iterations do
Update the range of sine and cosine using equation (14);
Update the position of solutions using equation (13);
Update the objective values;
Update the position of the destination point;
Update the best objective value so far;
end while
Return the best objective value obtained as the global optimum, as well as the best solutions.

Proposed algorithm and parameter

In the proposed algorithm model, the improved SCA provides the optimal parameters for OSELM. Therefore, the proposed algorithm has achieved good results in terms of accuracy and algorithm performance. At the beginning, the new population (NP), scaling factor (F) and crossover (CR) probability of DE and the parameter search agent number, maximum iterations, and constant a of SCA are all initialized.The search space is two-dimensional including output weight and a hidden layer bias, and the initial solution is randomly generated. Then optimize the parameters during the iterative process. The initialization values of the parameters are shown in Table 1. The flow of the proposed algorithm is shown in Algorithm 2.

Algorithm 2 DE-SCA-OSELM
Step 1: Initialize the parameters of SCA: the random solution of the search agents; the objective values of the initial random solutions; the position of the destination point; the best objective value so far;
Step 2: Normalize the input data and divide it into the training set and the testing set respectively.
Step 3: Set the number of search agents, the maximum iteration. Set iteration variable t = 0 and crossover with DE, selecting the initial population of SCA with variation population.
Step 4: The initialized SCA is used to search for the output weight and hidden layer bias of OSELM; the objective function, the position of target point, and the current optimal target value are obtained by training OSELM.
Step 5: Update (the range of SCA, the position of the obtained solution by training OSELM, the position of the target point, and the optimal target value. And set iteration number t = t + 1)
Step 6: If t exceeds the maximum iterations, then go into Step 7. Otherwise, go into Step 5.
Step 7: The obtained parameters in Step 6 are applied to train the model.
Step 8: The training model in Step 7 is used for classification prediction.

Table 1.

Initial parameter setting

Algorithm	Parameter
DE	population size NP = 10
	scaling factor F = 0.8
	crossover probability CR = 1
SCA	constant a = 2
	search agents = 50
	maximum iterations = 100
OSELM	N0 = 30
	Activation function = ‘Sigmoid’
	Hidden neurons = 20
	ELM_type = 1

DE: differential evolution; SCA: sine cosine algorithm; OSELM: online sequential extreme learning machine.

Experiment results and analysis

In this section, the parameter settings of the proposed algorithm are discussed. The proposed model is compared with RVFL,^23,24 ELM, SCAELM, DEELM,²⁵ PSOELM,²⁶ KELM,²⁷ OSELM,¹⁵ SVM,²⁸ GridSVM, PSOSVM,²⁹ and PNN (see Appendix 1). Many related experiments have been done concerning the selection of parameters. The source of the data set is introduced, and the performance of the proposed algorithm DE-SCA-OSELM is evaluated on the collected data set. Iterative analysis and rank sum test are used in the performance evaluation for the proposed algorithm. All computation was carried out in MATLAB environment on a PC with an Intel(R) Pentium(R) i5-2020 M CPU at 2.4 GHz and 4GB memory.

Description of experimental data

To verify the effectiveness of the proposed algorithm in the classification of fabric wrinkle level, the collected data set is verified in this paper. Sample preparation is according to Liu et al.⁷ The samples used in this article are mainly used for academic research; sleeving at the same person's arm joints was adopted, and the level is subjectively evaluated by experts, because according to Figure 1 from AATCC 128-2004,³⁰ for fabric smoothness rating, 5, 4, 3, 2, 1 rating respectively corresponds to WR-5, WR-4, WR-3, WR-2, WR-1 or worse than the WR-1 replicas in AATCC 128-2004. So we used the five levels for this research. The following steps are taken in data extraction: a Canon LIDE210 scanner is used to collect in standard atmospheric pressure environment with a temperature 20℃ ± 2℃ and a relative humidity 65 ± 3%. The fabric used to capture the image is solid color. The specific collection process is as follows:

The solid color fabric is cut into a square of 30 cm × 30 cm in a standard environment, and each piece of material is ironed with a Panasonic·Wanbao NI-G10E electric iron, and placed into a natural state.

Under the standard environment, carefully sew each piece of cloth into a cylindrical shape, as shown in Figure 2 and try not to produce excessive wrinkles. Place the sleeve at the same person's arm joints, and sew the cloth on the upper and lower sides of the joint to ensure that the wrinkles are generated in the middle of the sample cloth. The arm is placed on the table and bent naturally for five minutes, and then rested on the table for five minutes; eventually the produced wrinkle is taken to be sampled.

The Canon LIDE210 scanner is used to scan the wrinkle samples to obtain image information; when the scanner's brightness, contrast, and resolution are adjusted to the optimal state, the loss of weak wrinkle information is not considered, and image processing is performed on the images (see Figures 3 and 4). Since the edge detection of the grayscale image is clearer and the shadow portion is not treated as an edge, the wrinkle density (WD), the gray-level co-occurrence matrix (GLCM), wavelet analysis (WA) and comprehensive wrinkle index (CWI based on information fusion) are all extracted by the edge image of the grayscale image.

Three professional researchers make a subjective judgment to evaluate the wrinkle level, separately forecast and final discussion to determine the wrinkle level (Integer). Then 106 samples of solid color fabrics were collected, and 106 sets data was obtained as the overall data set. The data scatter plot is shown in Figure 5. Detailed information on the characteristics of the evaluated fabric samples is supplied in Table 2. An evaluation of fabric wrinkle level from the researchers is shown in Table 3.

WD, GLCM, WA, and CWI are introduced as follows:

Table 2.

Detailed information on fabric characteristics

Name	Material	Tissue	LD Count/ 10 cm	WD Count/ 10 cm	SD g·m⁻²	Thickness mm
Pleuche	P	PW	478	367	279.4	0.22
Serge	Fur	Twill	400	356	229	0.26
Nylon taffeta	N	PW	345	238	139.1	0.19
Stretch fabric	C/ P	Satin	384	332	160.6	0.23
Semi PU	PO	Twill	233	242	467.5	0.29
Polyester silk	P	PW	489	360	98.4	0.14
Plain cloth	C	PW	86	87	62.5	0.19
Georgette	R	PW	160	147	32.7	0.21
Khaki	P/C	Twill	118	96	214.7	0.39
Spun silk	NS	PW	345	289	148.5	0.18
Dupion silk	R	PW	69	72	76.3	0.14
Satin	P	Satin	260	278	289.8	0.41
Polyester cotton	P/C	Twill	236	245	186.9	0.28
Lining cloth	P	Twill	236	214	169.5	0.12
Coarse linen	L	PW	89	64	536.8	0.41
Satin	P	Twill	262	270	314.5	0.35
Polar fleece	P/CS	PW	422	388	294.6	0.51
Suede fabric	P	PW	269	271	309.1	0.54
P C Linen	P/L	Twill	142	153	342.5	0.34
Dust covers	A	Satin	261	246	265.8	0.21
Artificial cotton	V	PW	402	423	165.2	0.19
Organza	P/N	PW	116	135	105.6	0.18
Chiffon	P	Twill	135	146	153.2	0.20
Ice silk	P	Twill	462	394	236.4	0.16
Cotton fabric	C	PW	254	278	201.3	0.32
Flocked cloth	A/PO	Satin	396	411	321.5	0.39
Woolen cloth	P	Twill	269	298	268.4	0.29
Artificial cotton	V	PW	335	304	89.6	0.09
Wool material	C	Twill	84	67	219.0	0.54
Natural silk	R	PW	108	88	89.5	0.12
Slub linen	C/L	PW	86	67	177.8	0.26
Cotton canvas	C	Twill	270	240	204.5	0.28
Tencel bamboo	F	PW	84	76	168.0	0.48
Linen fabric	L	PW	93	96	199.5	0.46
Brushed fabric	PO/C	PW	336	220	323.0	0.51

PW: plain weave; LD: latitude density; WD: warp density; SD: surface density; P: polyester; C: cotton; N: nylon; R: rayon; PO: polyurethane; NS: natural silk; L: linen; F: flax; A: acrylic; V: viscose; CS: chemical staple.

1. The calculation formula of WD is

WD = \frac{ω_{n}}{A} \times 100 %

(15)

where,

ω_{n}

represents the number white pixel points in gray edge detection of an image; A represents the total number of pixel points, that is

256 \times 256 = 65536

2. Suppose f(x,y) is a two dimensional image, and its size is $M \times N$ ; gray level is Ng, which would be satisfied with GLCM in a certain space

P (i, j) = {\begin{matrix} (x 1, y 1), (x 2, y 2) \in M \\ \times N | f (x 1, y 1) = i, f (x 2, y 2) = j \end{matrix}}

(16)

where, (x) represents the element number of set x; P is a matrix with size

Ng \times Ng

. If the distance between (x1, y1) and (x2, y2) is d, and the angle between the two and the abscissa axis is θ, then the GLCM

P (i, j, d, θ)

with various distances and angles.

3. Wavelet analysis is from multiresolution, and its main ideology is that the expansion function f(t) is represented as a set of successive approximation expressions, and each of them is in the form of f(t) smoothed; they severally correspond to different resolutions.

4. Information fusion is a complete and accurate comprehensive processing with various information sources. The comprehensive feature based on information fusion is

CWI = WD + Entropy + SH 1

(17)

where, WD is fabric wrinkle density,

Entropy

is the sum of entropy in 0°, 45°, 90° and 135° directions, and SH1 is the standard deviation of the horizontal direction coefficient of the first layer wavelet decomposition of the fabric sample.

Parameter setting for SCA of proposed algorithm

The main parameters of SCA are search agent, maximum iteration, and the constant a In the relation between various parameters and accuracy and time, the accuracy is average test accuracy for programs run 10 times, and the time is total time to run programs 10 times. According to equation (14), we know that constant a controls the range of sine and cosine to ensure that the exploration and exploitation can be performed fluently. According to Figure 6(a) and (b), the change of a in [1, 10] will have an effect on accuracy and time. In Figure 6(a), it can be seen that when a equals 2, the accuracy of the proposed model will be optimal, and the accuracy of its two sides is stable. In Figure 6(b), the time will be lowest when a equals 4 or 5, but when a is 2, the time is not very high; a little time is used to compensate for accuracy, which will be worthwhile. Therefore, a equals 2 is the best choice.

The number of search agents can influence exploration efficiency, which is shown in Figure 6(c) and (d). The influence on accuracy has been reached when the search agent number ranges from 10 to 100. From Figure 6(c), we know that when the search agent number is 10, 20, 30, 40 and 80, there will be a relatively high accuracy. And it can be seen that the time consumption is basically increased with the increase of search agent (Figure 6(d)). When the search agent number is 20, the accuracy is not the highest, but it is relatively high, and the time consumption is relatively low at this time. Therefore, the most suitable number of search agents equals 20.

The maximum number of iterations will also have an impact on the performance of the proposed model. As shown in Figure 6(e) and (f), we have studied the effect of iteration number from 10 to 100 on the accuracy. It can be seen from Figure 6(e) that at 20, 50, 60 and 70, the test accuracy is higher. In terms of time consumption, except for a slight decrease at 60, the overall trend is on the rise. When considering the overall performance, the maximum iteration number is set at 20.

Parameter setting for OSELM of proposed algorithm

In the OSELM algorithm, there are some parameters that need to be set: the number of hidden layer neurons, the type of activation function, block and so on. We explored the influence of parameters on the model. The effect of number of hidden layer neurons is performed under different activation functions. Each number of neurons is calculated under different activation functions, and the corresponding accuracy is the average test accuracy of running the program 10 times; the result is shown in Figure 7. The hidden layer neurons range from 5 to 80, with a step size of 5. As far as the activation function is concerned, the accuracy of the blue sigmoid activation function is generally superior. Considering the influence of the number of hidden layer neurons on the accuracy, the accuracy is highest when the number is between 30 and 40. Therefore, using this comprehensive analysis, the sigmoid activation function and 35 hidden layer neurons are adopted for parameter setting.

Experimental results and discussion

In this paper, the proposed algorithm DE-SCA-OSELM was compared with RVFL, ELM, DEELM, PSOELM, KELM, OSELM, SVM, GridSVM, PSOSVM, and SCAELM algorithms in terms of accuracy, which illustrated the performance of the proposed method in the classification of fabric wrinkle level. To make the experimental results statistically significant, randomly sampled testing with the proposed algorithm and each comparison algorithm was repeated 10 times, and then the average of 10 times was used as a measure. Figure 8 shows the classification of the test set in each algorithm. The average accuracy of each algorithm is relatively high to display the classification. Table 4 shows the classification accuracy of each algorithm test set, the classification error and the total time for 10 repetitions of each algorithm. Although the hold-out from machine learning was used to distribute size of training and testing sets, generally, at least 30% of the data is used as the testing set in the hold-out method. Table 5 shows the effect on average test accuracy of the training set and testing set, the result of experiment showed that the testing and training set size selected in the paper achieved the highest accuracy.

Table 3.

Evaluation of fabric wrinkle level

Images of fabrics	Wrinkle levels
	1
	2
	3
	4
	5

Table 4.

Accuracy, error and total time for each algorithm

Index Algorithm	Accuracy	Error	Total time
ELM	0.4528	0.5472	20.29966
DEELM	0.9167	0.0833	24.76359
PSOELM	0.9083	0.0983	2.32882
KELM	0.8889	0.1111	1.53100
OSELM	0.8722	0.1278	3.90600
RVFL	0.8750	0.1247	12.25936
SVM	0.9083	0.0917	3.28967
GridSVM	0.4444	0.5556	13.77094
PSOSVM	0.9083	0.0170	14.80638
SCAELM	0.9055	0.0945	6.64990
PNN	0.8840	0.1160	11.04650
DE-SCA-OSELM	0.9417	0.0583	11.33696

Table 5.

Accuracy influence by ratio of training set and test set

Algorithm	Dataset 106	Accuracy
DE-SCA-OSELM	Training 60/Testing 46	0.87174
	Training 70/Testing 36	0.94167
	Training 80/Testing 26	0.86558

Significance and stability analysis of proposed algorithm

To verify the significance and stability of the proposed DE-SCA-OSELM algorithm, the box plot and the influence of iteration number are used to analyse the stability. The results of the Wilcoxon rank sum test are used for testing significance.

The box plot displays the maximum, minimum, median, and upper and lower quartiles of a data set. Identifying the outliers is the objective of the box plot. Therefore, the box plot has certain advantages in identifying outliers and overall values. The accuracy shown in Figure 9 is the average accuracy of each algorithm run 10 times. It can be seen from the median and the upper and lower quartiles of each box plot that DE-SCA-OSELM has the highest test accuracy distribution, which indicates that the proposed algorithm is more stable and superior to other algorithms in predicting test accuracy.

To more intuitively observe the influence of iteration number on test accuracy, the proposed algorithm and some other algorithms are compared in Figure 10. Because the optimal number of iterations discussed above is 20, 20 iterations are selected. We can see that the convergence speed of the proposed algorithm is faster, and its convergence accuracy is the highest. Therefore, the proposed algorithm is advantageous in terms of stability.

Table 6 shows the results of Wilcoxon rank sum³¹ test for the proposed algorithm and each comparison algorithm. The Wilcoxon rank sum test is a common nonparametric test method used to determine whether there are significant differences between the two distribution variables. For example, the proposed algorithm and the ELM algorithm are compared and the output p value is 1.8165e-04, and the h value is 1, which means the proposed algorithm is significantly different from the ELM. The error probability of the assertion is 1.8165e-04. The algorithms with p value of 1 are ELM, KELM, OSELM, RVFL, SVM, GridSVM, PNN and PSOSVM, which indicates that the proposed algorithm has significant differences in test accuracy prediction. Although DEELM, PSOELM, SCAELM and the proposed algorithm have an h value of 0 with the Wilcoxon rank sum test, their p values are relatively large compared with the default hypothesis value 0.05, so the proposed algorithm still has some significant difference from the three algorithms mentioned above.

Table 6.

Wilcoxon rank sum test between proposed algorithm and each algorithm

Proposed algorithm	Comparison algorithm	P value	h value
	ELM	1.8165e-04	1
	DEELM	0.1123	0
	PSOELM	0.1153	0
	KELM	0.0311	1
DE-SCA-OSELM	OSELM	1.7962e-04	1
	RVFL	1.7962e-04	1
	SVM	0.0452	1
	GridSVM	0.0022	1
	PSOSVM	6.3864e-05	1
	PNN	0.0125	1
	SCAELM	0.0583	0

To find the multi-class error of each algorithm in the paper, therefore, the confusion matrix is introduced, and the analysis shows that the error of the proposed algorithm basically does not produce a bad decision; the results are shown in Table 7.

Table 7.

Result of classification errors

Algorithm	FP	FN	Testing
ELM	19	1	36
DEELM	1	0	36
PSOELM	0	3	36
KELM	1	3	36
OSELM	2	3	36
RVFL	1	3	36
SVM	2	2	36
GridSVM	0	20	36
PSOSVM	2	2	36
SCAELM	0	4	36
PNN	1	2	36
DE-SCA-OSELM	0	2	36

FP: false positive; FN: false negative; Testing: total number of testing.

Conclusion

OSELM has been applied in classification in previous studies. Because the parameter selection of OSELM will have a great impact on its performance, this paper proposed an optimized SCA by DE to select the parameters of the OSELM algorithm, proposed the novel algorithm DE-SCA-OSELM, and applied the algorithm to the classification of fabric wrinkle level. Compared with ELM, SVM, RVFL and other algorithms, the proposed algorithm achieves a good classification effect on fabric wrinkle classification. To check the performance of the proposed algorithm, many experiments have been done in this study. Experiments show that compared with other algorithms, the proposed algorithm has good significance and stability in the application studied.

Footnotes

Declaration of conflicting interests

The authors declared no potential conflicts of interest with respect to the research, authorship, and/or publication of this article.

Funding

The authors disclosed receipt of the following financial support for the research, authorship, and/or publication of this article: This work was supported by NSFC-Zhejiang Joint Fund for the Integration of Industrialization and Informatization (No.U1609205), Zhejiang Provincial Natural Science Foundation of China (No. LY18F030018, LZ20F020003), Science Foundation of Zhejiang Sci-Tech University (No. 18032232-Y) and Zhejiang Top Priority Discipline of Textile Science and Engineering.

ORCID iD

Zhiyu Zhou

Appendix 1

SCAELM: extreme learning machine optimized by sine cosine optimization

PSOELM: extreme learning machine optimized by particle swarm optimization

KELM: kernel extreme learning machine

SVM: support vector machine

GridSVM: support vector machine optimized by Grid

PSOSVM: support vector machine optimized by particle swarm optimization

PNN: probabilistic neural network

ELM: extreme learning machine

DEELM: extreme learning machine optimized by

OSELM: online sequential extreme learning machine

RVFL: random vector functional link network

DE-SCA-OSELM: differential evolution- sine cosine optimization- extreme learning machine

References

Youngjoo

Behnam

. Assessing wrinkling using image analysis and replicate standards. Text Res J 1995; 65: 149–157.

Chang

Kang

. Objective evaluation of seam pucker using artificial intelligence, Part I: Geometric of seam pucker. Text Res J 1999; 69: 735–742.

Chang

Kang

. Objective evaluation of seam pucker using artificial intelligence, Part II: Method of evaluating seam pucker. Text Res J 1999; 69: 835–845.

Chang

Dae

Kang

. A new evaluation of seam pucker and its application. Int J Cloth Sci Tech 1997; 9: 252–255.

Ravanidi Seyed

Pan

. The influence of gray-level co-occurrence matrix variables on the textural of winkled fabric surfaces. J Text Inst 2001; 102: 315–321.

Domskienė

Strasdienė

Bekampienė

. Development and optimisation of image analysis technique for fabric bucking evaluation. Int J Cloth Sci Tech 2011; 23: 329–340.

Liu

. Novel testing equipment for fabric wrinkle resistance simulating actual wear. Text Res J 2014; 84: 1059–1069.

Dufour

J-E

Gonnet

Grau

, et al. On the analysis of canvas wrinkling via isogeometric stereocorrelation. Int J Solids Struct 2017; 154: 114–123.

Huang

Zhu

Siew

. Extreme learning machine: a new learning scheme of feed forward neural networks. IEEE International Joint Conference on Neural Networks 2005; 2: 985–990.

10.

Huang

Zhou

Ding

, et al. Extreme learning machine for regression and multiclass classification. IEEE Trans Syst 2012; 42: 513–529.

11.

Huang

Zhu

Siew

. Extreme learning machine: theory and applications. Neurocomputing 2006; 70: 489–501.

12.

Zhang

Zhao

Sun

, et al. Smart pathological brain detection by synthetic minority oversampling technique, extreme learning machine, and Jaya algorithm. Multimed Tools Appl 2018; 77: 22629–22648.

13.

Zhou

, et al. Illumination correction of dyed fabrics approach using Bagging-based ensemble particle swarm optimization-extreme learning machine. Opt Eng 2016; 55: 093102–093102.

14.

Zhou

Wang

Zhang

, et al. Color difference classification of solid color printing and dyeing products based on optimization extreme learning machine of improved whale optimization algorithm. Text Res J. 2020; 90: 135–155.

15.

Liang

Huang

Saratchandran

, et al. A fast and accurate online sequential learning algorithm for feed forward networks. IEEE Trans Neural Netw 2006; 17: 1411–1423.

16.

Zhou

Gao

Zhang

, et al. A novel hybrid model using the rotation forest-based differential evolution online sequential extreme learning machine for illumination correction of dyed fabrics. Text Res J 2019; 89: 1180–1197.

17.

Gu Y, Liu J, Chen Y, et al. Constraint Online Sequential Extreme Learning Machine for lifelong indoor localization system. In Proceeding of the International Joint Conference on Neural Networks 2014, Beijing, China, 6 July–11 July 2014, pp. 732–738. New York, NY: Institute of Electrical and Electronics Engineers Inc.

18.

Mirjalili

. A sine cosine algorithm for solving optimization problems. Knowl Based Syst 2016; 96: 120–133.

19.

Fang

Liu

. Parameter optimization of support vector regression based on sine cosine algorithm. Expert Syst Appl 2018; 91: 63–67.

20.

Abd Elaziz

Hemedan

Ostaszewski

, et al. Optimization ACE inhibition activity in hypertension based on random vector functional link and sine-cosine algorithm. Chemometr Intell Lab 2019; 190: 69–77.

21.

Storn R and Price KV. Differential evolution: A simple and efficient adaptive scheme for global optimization over continuous spaces. Technology Report TR-95-012, 1995.

22.

Sánchez-Monedero

Hervas-Martinez

Gutierrez

, et al. Evaluating the performance of evolutionary extreme learning machines by a combination of sensitivity and accuracy measures. Neural Netw World 2010; 20: 899–912.

23.

Pao

Phillips

Dejan

. Neural-net computing and the intelligence control of systems. Int J Control 1992; 56: 263–289.

24.

Pao

Gwang-Hoon

Dejan

. Learning and generalization characteristics of the random vector Functional-link net. Neurocomputing 1994; 6: 163–180.

25.

Zhu

Qin

Suganthan

, et al. Evolutionary extreme learning machine. Pattern Recognit 2005; 38: 1759–1763.

26.

Shu

. Evolutionary extreme learning machine-based on particle swarm optimization. International Conference on Advances in Neural Networks 2006; 36: 644–652.

27.

Pal

Maxwell

MAE

Warner

. Kernel-based extreme learning machine for remote sensing image classification. Remote Sens Lett 2013; 4: 835–862.

28.

Cortes

Vapnik

. Support-vector networks. Mach Learn 1995; 20: 273–297.

29.

Rui

Zhang

, et al. Total organic carbon content prediction based on support-vector-regression machine with particle swarm optimization. J Petrol Sc Eng 2019; 180: 699–706.

30.

AATCC 128-2004. Wrinkle recovery of fabrics: Appearance method [S].

31.

Wilcoxon

. Individual comparisons by ranking methods. Biometrics Bull 1945; 1: 80–83.