## Figures

## Abstract

Construction waste is a serious problem that should be addressed to protect environment and save resources, some of which have a high recovery value. To efficiently recover construction waste, an online classification system is developed using an industrial near-infrared hyperspectral camera. This system uses the industrial camera to capture a region of interest and a hyperspectral camera to obtain the spectral information about objects corresponding to the region of interest. The spectral information is then used to build classification models based on extreme learning machine and resemblance discriminant analysis. To further improve this system, an online particle swarm optimization extreme learning machine is developed. The results indicate that if a near-infrared hyperspectral camera is used in conjunction with an industrial camera, construction waste can be efficiently classified. Therefore, extreme learning machine and resemblance discriminant analysis can be used to classify construction waste. Particle swarm optimization can be used to further enhance the proposed system.

**Citation: **Xiao W, Yang J, Fang H, Zhuang J, Ku Y (2019) Development of online classification system for construction waste based on industrial camera and hyperspectral camera. PLoS ONE 14(1):
e0208706.
https://doi.org/10.1371/journal.pone.0208706

**Editor: **Jie Zhang, Newcastle University, UNITED KINGDOM

**Received: **April 11, 2018; **Accepted: **November 21, 2018; **Published: ** January 16, 2019

**Copyright: ** © 2019 Xiao et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.

**Data Availability: **All relevant data are within the paper and its Supporting Information files.

**Funding: **This work was financially supported by the Major Project Foundation of Science and Technology in Fujian Province (2016H6013), and Joint Innovation Project of Industrial Technology in Fujian Province. Jianhong Yang received the funding, grant numbers: 2016H6013, urls: http://xmgl.fjkjt.gov.cn/. This work was also supported by the Quanzhou Science and Technology Plan Project (2018C100R); Huaiying Fang received the funding, grant numbers: 2018C100R.

**Competing interests: ** The authors have declared that no competing interests exist.

## Introduction

Recent technical developments have been focusing on protecting the environment and saving resources. Several studies have discussed the hazardous effects of accumulating construction waste [1]. Construction waste includes materials such as plastics, concrete, wood, and bricks that can degrade the environment; however, these materials can be extremely valuable when recycled or repurposed because they are manufactured via complicated procedures. They are composed of limited nonrenewable resources. Therefore, complicated construction waste must be efficiently separated.

Some studies have used near-infrared hyperspectral camera to classify different objects [2,3]. This camera can capture the internal composition of objects by exploiting the DN values in different wavebands. The name hyper emanates from the camera’s ability to capture hundreds of wavebands with high resolution. By analyzing these DN values, objects can be classified based on their composition. The generated hyperspectral data are processed and displayed as a curve with hundreds of DN values. In practical scenarios, hyperspectral data have numerous dimensions that compromise the calculation efficiency. Therefore, some studies have investigated different ways of extracting feature-related wavebands [4–6]. The most recent ways involving classification using hyperspectral data include extreme learning machine (ELM) [7–9], partial least squares discriminant analysis (PLS-DA) [10,11], and various deep learning algorithms [12,13]. Several other studies have focused on further improving the classification accuracy [14–16].

Thus, the technology can efficiently classify objects using hyperspectral data. However, some problems pertaining to the usage of this technology still need to be addressed. The hyperspectral camera is presently used to acquire spectral data. In most situations, this classification is executed offline via linear scanning and imaging. This imaging is time-consuming, and the amount of generated spectral data will increase over time that can be up to several decades. Furthermore, the need for capturing hyperspectral data hundreds of times makes it difficult to achieve online classification. This study proposes a method that can efficiently achieve online classification.

## Materials and methods

This study mainly aimed to study the classification of construction waste. Some common construction waste samples were obtained in the form of plastics, bricks, concretes, and woods; 80 pieces of each material were obtained. Among these, 50 pieces were used as the training set. The remaining 30 were used as the testing set. Some of these samples are shown in Fig 1. Among them, the foam comes from various packaging boxes, the plastic comes from the electric control cabinet trunking and the plastic pipe, the brick is ordinary red brick, the concrete comes from the abandoned building, the wood is the wooden box board and the dilapidated table and chair.

### A. Capturing system

The system’s structure as shown in Fig 2. The capturing system mainly has two components. The front is a 2D industrial camera with 640*480 pixels, and the rear is a near-infrared (NIR) hyperspectral camera with 640 spatial pixels and 224 spectral pixels. The hyperspectral camera has a wavelength range of 900–1700 nm. The system runs in the order: the objects are transported by belt to the industrial camera work area, and the industrial camera collects 2D pictures. The 2D pictures can be used to obtain the outline and centroid of the objects; Centering on the centroid of the objects, take a 5 * 5 rectangular pixels range as the region of interest (ROI) for the objects. The ROI of object passes through the working area of the NIR hyperspectral camera. The hyperspectral camera collects the spectral data in the ROI and identifies the material, and the recognition result of the ROI is used as the recognition result of the object. The parameters of the system are: belt speed is 115mm/s, industrial camera frame rate is 10fps, and hyperspectral camera frame rate is 120fps. At last, Fig 3 shows the real system.

The C++ language is used to control and analyze the data of this system, thereby enabling a convenient development of follow-up processes such as the recycling sorting system.

### B. Data processing

#### (I)Preprocessing.

The original data required correction by white data and black data to ensure a standard reflectance and minimize variations influenced by light source differences. The calibrated formula is as follows:
(1)
where *D*, *D*_{B}, *D*_{W} are the DNs of the original data, pure black pixels, and standard white board, respectively.

*D*_{B} is obtained by capturing an image by covering the lens cap, and *D*_{W} is obtained by capturing the image of a standard white board. The standard white board is made by poly tetra fluoro ethylene (PTFE). This approach allows eliminating the bias that could be introduced by light intensity and other environmental factors.

The spectral curve of any pixel is an independent one-dimensional curve signal. Due to external environmental factors and the internal components of the camera, the data collected by the camera has more or less noise, which will have some influence on subsequent feature wavebands selection and material identification. Therefore, the collected reflectance data needs to be denoised. Using the Savitsky–Golay (SG) algorithm to denoise the spectral curve can achieve good results and it is easier to implement. This article uses a 7-point smooth fit with a fitting formula of:
(2)
where *x* is the input data, *y* is the smoothed output data, the subscript "0 " indicates the position of the current point, and the "+*n* " subscript indicates the point n to the right of the current point, otherwise the "-*n*" subscript indicates the point n to the left of the current point. Eq (2) only shows the formula of the total length of the data minus 6 points and the calculation method of the edge point can refer to [17].

#### (II)Wavebands selection.

Spectral data have numerous dimensions, which exhibit strong relations with approaching bands. These redundancies complicate the data analyses and make the process time-consuming, thereby making spectral data unsuitable for online analysis. This problem can be resolved using feature vector to replace all data; however, the most representative feature vector must be determined. In this study, two typical algorithms are used to extract feature bands. After extensive optimization, a method to execute this procedure is derived.

The principle component analysis (PCA) [3] enables extracting spectral feature wavebands and yields good result. The main objective of this algorithm is to reduce the dimensions of the data. According to the components of every score, the original data can be translated into fewer dimensions. During this procedure, a matrix coefficient, whose crests and troughs can to some extent represent the character of original data, is loaded. The signatures of these crests and troughs in all spectral data are known as features.

The successive projections algorithm (SPA) [6] separates original matrix to several small matrices. Then, each vector belonging to a matrix is used to project others vectors. Each small matrix will contain unrelated vectors, whose situation at original matrix will be the features. Then, some feature wavebands will be obtained but not the least. The best result from all of the acquired results is determined via testing accuracy.

### C. Experimental program

As shown in Fig 4, this classification system comprises offline and online parts. The main objective of the offline part is to build the classification model. In this study, SPA and PCA are used to extract features; then, the classified model is developed using resemblance discriminate analysis (RDA), extream learning machine (ELM) and particle swarm optimization and online learning extream learning machine (PSO–OL–ELM), respectively. The online part uses the industrial camera to capture ROI, the hyperspectral camera to capture the spectral data, and finally the classification model to classify objects into different species.

**The procedure of system**: (a) Offline part, (b) Online part.

The accuracy of this system is mostly dependent on the classification model. Therefore, the results from three different models are compared and the best result is adopted.

#### (I) Classification based on ELM.

The ELM is a simple, single hidden-layer forward neural network that was developed by professor Hunang [18]. The ELM uses the Moore–Penrose to calculate the weight of output matrices. This algorithm can be quickly trained without compromising the accuracy of the results.

The structure of ELM as shown in Fig 5. The weights of input layer with hidden layer *ω*_{n×L} can be written as follows:
(3)

The weights of hidden layer with output layer *β*_{L×m} can be written as follows:
(4)

The training data can be separated into two matrices *X*_{k×n} and *Y*_{k×m}. The *k* is the size of data, every data will have *n* feature bands. Then, *X* and *Y* can be represented as follows:
(5)
(6)

Substitute *n* with the number of species. *X* is the feature, and *Y* is the label comprising 1 and 0. There were *m* species, which species belong to make that number be 1, others be 0. To complete this function, assuming that *B*_{1×L} is the basis of the hidden layer, we can show that
(7)

A matrix *H* can be assumed to represent the output of hidden layer; then, *H* can be obtained according to the following function:
(8)
where *G* is the activating function represented by the sigmoid as follows:
(9)

For the most essential process, the Moore–Penrose of *H*, which is called *H*^{+}, must be calculated as follows:
(10)

And then , *I* is identity matrix and *C* is penalty factor. A suitable *C* can avoid overfitting.

*β* can be calculated if *Y* is used instead of *O* when training. After completing the training, the computation from the beginning to the end of this network can be used to obtain y, which represents the species of this new data *x*.
(11)
standardize y belong 0 to 1, which represent how similar was it to the corresponding species.

#### (II) Classification based on resemblance discriminate analysis (RDA).

Every data of one object are represented as a vector with *n* dimensions (where *n* is the number of feature bands). To classify objects into species, the corresponding vectors must be classified using the Euclidean distance in combination with other methods. Herein, the Euclidean distance and the subjoining angle are used to establish the difference between species.
(12)
where *d* is the Euclidean distance between *v*_{1},*v*_{2} and *v*_{1},*v*_{2} are vectors with one row and n columns.

By referencing the formulation of two dimensions and three dimensions, the angle of two vectors with *n* dimensions can be calculated using the following function:
(13)

We considered every species’ center vectors as the corresponding average vectors. Then we determined the largest Euclidean distance in the training data as the species’ radius. The Euclidean distances between new data, and every species’ center can be calculated for comparison with the corresponding species’ radium. If the minimum distance between that species was smaller than homologous radius, then the data can be attributed to that species. If the minimum and second minimum distance were similar and both smaller than homologous radius, then the species’ center would need to be calculated. Lastly, we assign class to respective species using the smallest two *θ* values.

In the formula (5), *X* could be separated to *m* (the number of species) matrix *X*_{1},*X*_{2}…*X*_{m} according to species.
(14)
where *m*' is the range from 1 to *m*. The center of species could be calculated using the following function:
(15)
where *i* is the range from 1 to *n*.

According to formulas (12) and (13), the distance and angle can be obtained. As described above, its species can be determined.

#### (III) Improving by particle swarm optimization(PSO) and online learning(OL).

The particle swarm optimization algorithm is used to improve accuracy of classification. Online learning is simultaneously used to extend the training set. These techniques enhanced the efficiency of ELM; however, the ELM algorithm does not yield enough accurate results. For instance, this algorithm first needs to initialize *W* (weight between input and hidden layers) and *B* (bias of layer’s neurons), both of which are random. As a result, training will yield different results each time. To fix this problem, PSO algorithm is used to optimize *W* and *B* as follows:

- Step 1: The size of population
*N*is determined. Then, the population’s position*x*is initialized to include*(n+1)L*particles representing*W*and*B*, which randomly range from −1 to 1. At the same time, the velocity*v*of every particle is initialized randomly between their limits. On average, the velocity’s limits are between 0.25 and 0.5 position’s limits. High velocity would make the position deviate from the best result, whereas low velocity would make the position fall into the local optimum. - Step 2: The fitness function is derived as follows:

*k*is the size of training set,

*O*is the real output,

*Y*is the label of training set.

- Step 3: Each particle’s
*j*fitness function is determined, and the smallest function*pbest*_{j}is identified. Each population’s*pbest*_{j}is further determined, and the smallest function*Gbest*_{i}is determined. - Step 4: Each population’s particle position and velocity is updated according to the following functions (16):

(17)
(18)
among these functions, *c*_{1} and *c*_{2} denote the studying rates, whereas *r*_{1} and *r*_{2} denote random from 0 to 1.

- Step 5: The number of iterations or its fitness is determined. If the results are satisfactory, the procedure is assumed to be completed; however, if the result is not satisfactory, step 2 of the procedure must be reiterated.

In addition, the size of the training set affects the accuracy. When new data has a similarity threshold of 70%, it will be incorporated as a part of the training data because it enhances the accuracy of the testing procedure. As shown in Table 1, 117 ms are required in 250 training datasets. The training time will increase with the increasing amount of training data. By reducing the time required for online learning by milliseconds, the model’s efficiency can be improved, particularly when more training data are involved. Therefore, the turnaround time will continuously improve.

To mitigate this issue, a temper matrix *P* [7] is assumed. Here, the subscript 0 represents old data and the subscript 1 represents new data.
(19)
(20)
(21)
where *H* is same to function (8), the *β* is same to function (4), *I* is Identity matrix and *C* is a penalty factor. A suitable *C* can avoid overfitting. At last, using *β*_{1} to instead of the *β* in function (10) and then the new classifier can be obtained.

## Result and discussion

Owing to considerable noise, the data close to 900 or 1700 nm are excluded in the analysis. These five species are distinguished according to their spectral data. However, some species could not be classified because they resembled wood, foam, brick, and some species such as plastic and concrete.

The average reflectance of five materials are is showed in Fig 6. Foam, plastic, wood are organic, with obvious absorption peaks, expressed as trough characteristics on the curve, while brick and concrete are inorganic, without obvious absorption peak characteristics. The edge points of various materials are similar in some degree. The five types of materials can be clearly distinguished around 1200 and 1400 nm.

### A. Selection of feature bands

The three principal components can provide 98.16% of the information about the original data. Specifically, PC1 (77.69%), PC2 (14.86%), and PC3 (5.61%), which can show original features in some degree. Therefore, these components can be used to obtain feature wavebands reliably. The 3 PC’s variance explained is showed in Fig 7.

The crests and troughs of the curve of load coefficient can express the difference of original curve [3]. According to the Fig 8, the features of PCA can be got, and this result can be verified using the observed feature wavebands at 1215, 1296, 1391, and 1433 nm. Therefore, this system is dependable to some extent. The feature bands with PCA are showed in Fig 9.

The successive project algorithm separated the original matrix to the *N* subset, where *N* is the required number of feature bands. In this study, the original matrix comprised 5 rows that represented 5 species and 224 columns that represented 224 bands. We excluded the first 12 bands and last 12 bands because of the noise. The resulting matrix comprised 5 rows and 200 columns. The five types of materials are not difficult to distinguish, and do not need too many features. Refer to the number of features extracted by PCA, and set *N* = 4. As a result, there were 4 matrices with 5 rows and 50 columns each. Each matrix can be considered as 50 vectors comprising 5 factors. Each vector in one matrix projected to its respective matrix. Therefore, the minimal correlation with the matrix’s vector could be obtained; the feature bands were 1084, 1215, 1345, and 1511, and the result is showed in Fig 10.

### B. Result of experiment

The result of ELM is showed in Table 1. The overall accuracy with SPA is 96.667% and the error mainly happened in brick and concrete. The overall accuracy with PCA is 98%, slightly higher than the SPA. Although the correct rate of bricks and concrete has been improved, at the same time, the correct rate of foam has decreased slightly. Therefore, the overall accuracy of PCA extraction is higher, but the two algorithms have their own advantages and disadvantages.

In Table 2, the RDA exhibits strong calculation efficiency and classification capability because of its simplicity and strong theoretical basis. Whether it is SPA or PCA extraction features, the overall accuracy can reach 100%. It can be seen from Fig 7 and Fig 8 that there are significant differences between categories at the extracted characteristic wavelengths. A good result can be obtained by comprehensively considering the distance and angle between the sample to be tested and the standard category. In this paper, the classification weight of the distance and angle is 1:1. In different applications, the weight of the distance and angle may need to be adjusted.

Comparing the ELM and RDA, there are some conclusions. At first, ELM is a learning algorithm that do not need display programming after build the model and RDA must follow the rules given in advance. This allows the ELM to handle complex problems and be more flexible, but requires sufficient data to adequately train its model to achieve better classification results, resulting in lower accuracy when training data is insufficient. RDA is relatively rigid, but it has greater stability when dealing with simple problems and is much more efficient than ELM. At the same time, a complete RDA classifier can be implemented by only requiring representative samples of each category. However, when the obtained representative samples are insufficiently representative, the correct rate may be low, and it is difficult to obtain good results when dealing with complicated nonlinear problems.

When comparing the PCA and SPA to extract features in the same classification algorithm, PCA is considered more reliable. Although ELM in combination with PCA can yield 98% accurate results, this result is lower than RDA.

The combination of PSO and online learning can make the ELM model efficient and reliable. In this study, the size of iteration is given as 500. The results of this new algorithm are shown in Table 3.

Thus, it is evident from Table 3 that the overall accuracy was improved, thereby indicating that the new algorithm is efficient. However, the process was time-consuming. The testing time was relatively shorter compared to the time consumed during training when the PSO was working. However, every model requires some time to execute PSO. Therefore, the current state may not be perfect, but it works. In addition, the size of testing data was small; therefore, the result did not reveal the overall accuracy. When every object matches its respective species, all of them have more similar to corresponding species. Using the average similar of matching species to assess the consequent of this way will more persuasive. The average similarity can be calculated using the following function:
(22)
where, *j* represents species and *k*_{j} represents the number of species in a testing set of size *j’*.

The subscript 1, 2, 3, 4 and 5 in Table 4 refer to Foam, Plastic, Brick, Concrete and Wood.

Comparing the *AS* between PSO-OL-ELM and ELM are is showed in Table 4. Obviously, this method has improved the classification ability of this model, and there still more potential for this classification to be further refined as time goes. The PSO work in the beginning and the OL work during all running time. When the size of notes of hidden layers is enough, the effect of PSO will be lower, vice versa. Except for plastics, the remaining *AS* of species have increased. The *AS* of foam, brick, and concrete has changed a lot, while the *AS* of plastic and wood has changed less. Combined with the results of Table 1, it is indicated that the growth rate of *AS* with high error rate is large, indicating that the recognition ability of this category is improved. However the accuracy of plastic and wood are both 100%, whose capability of optimization are lower. *As* a result, the extent of *AS* changes is small, and even over-fitting occurs. For example, plastics have a slight decrease in *AS*.

## Conclusions

An online classified system of construction waste using hyperspectral and industrial cameras was demonstrated herein. The combination of near-infrared hyperspectral and industrial cameras realized an efficient online classification of construction waste. The hyperspectral camera utilized too much time and accumulated a large amount of data during imaging, which make it is hard to realize online procession. However, using industrial camera to capture and process spectral data in the regions of interest, online classification could be achieved easily. The principal component analysis and successive projection algorithms was used to extract feature wavelengths. We then successfully used RDA and ELM to discriminate construction waste. ELM is good but in this situation, RDA can perform better result than ELM. RDA and ELM have their own advantages and disadvantages. RDA is more practical, efficient, and accurate in the case of simple and easy to divide and does not have enough training data. ELM needs sufficient training data to adapt to complex situations, and the generalization performance is stronger. The correct rate is not much lower than RDA, and there is still a big improvement after PSO and OL optimization. Which identification scheme is specifically selected can be referred to this paper and determined in conjunction with actual conditions.

## Acknowledgments

The authors would like to thank Enago (www.enago.cn) for the English language review.

## References

- 1. Ma R. (2012). The hazard of the construction rubbish on the environment and treatment and utilization. Northern Environment. 2012;4: 33.
- 2. Dmitriev EV. Classification of the forest cover of tver oblast using hyperspectral airborne imagery. Zv Atmos Ocean Phy. 2014;50: 929–942.
- 3. Serranti S, Gargiulo A, Bonifazi G. Classification of polyolefins from building and construction waste using nir hyperspectral imaging system. Resour Conserv Recycl. 2012;61: 52–58.
- 4. Kumar S, Ghosh J, Crawford MM. Best-bases feature extraction algorithms for classification of hyperspectral data. IEEE Trans. Geosci. Remote Sens. 2001;39: 1368–1379.
- 5. Chen Y, Jiang H, Li C, Jia X, Ghamisi P. Deep feature extraction and classification of hyperspectral images based on convolutional neural networks. IEEE Trans. Geosci. Remote Sens. 2016;54: 6232–6251.
- 6. Ni Q, Qi H, Zhou Z, Wang H. Red rosewood wood species identification based on hyperspectral imaging technology. Journal of Zhejiang Agricultural and Forestry University. 2016;33: 489–494.
- 7.
Guo C. Extreme learning machine and its application in classification. Doctoral dissertation, Zhengzhou University. 2013.
- 8. Heras DB, Argüello F, Quesadabarriuso P. Exploring elm-based spatial–spectral classification of hyperspectral images. Int J Remote Sens. 2014;35: 401–423.
- 9. Argüello F, Heras DB. Elm-based spectral–spatial classification of hyperspectral images using extended morphological profiles and composite feature mappings. Int J Remote Sens. 2015;36: 645–664.
- 10. Ivorra E, Girón J, Sánchez AJ, Verdú S, Barat JM, Grau R. Detection of expired vacuum-packed smoked salmon based on pls-da method using hyperspectral images. J Food Eng. 2013;117: 342–349.
- 11. Marquetti I, Link JV, Lemes ALG, Scholz MBDS, Valderrama P, Bona E. Partial least square with discriminant analysis and near infrared spectroscopy for evaluation of geographic and genotypic origin of arabica coffee. Comput Electron Agric. 2016;121: 313–319.
- 12.
Le JH, Yazdanpanah AP, Regentova EE, Muthukumar V. A deep belief network for classifying remotely-sensed hyperspectral Data. International Symposium on Visual Computing, Springer International Publishing. 2015; 682–692.
- 13. Palsson F, Sveinsson JR, Ulfarsson MO Multispectral and hyperspectral image fusion using a 3-d-convolutional neural network. IEEE Geosci. Remote Sens. Lett. 2047;14: 639–643.
- 14. Demir B, Ertürk S. Empirical mode decomposition based decision fusion for higher hyperspectral image classification accuracy. Geoscience and Remote Sensing Symposium. 2010; 78: 488–491. 0
- 15. Nakamura RYM, Fonseca LMG, Santos JAD, Torres RDS, Yang XS, Papa JP. Nature-inspired framework for hyperspectral band selection. IEEE Trans. Geosci. Remote Sens. 2014;52: 2126–2137.
- 16.
Wang J, Bi H. An extreme learning machine based on particle swarm optimization. Journal of Zhengzhou University (Science Edition). 2013;45: 100–104.
- 17.
Huang, Guang Bin, Q. Y. Zhu, and C. K. Siew. Extreme learning machine: a new learning scheme of feedforward neural networks. IEEE International Joint Conference on Neural Networks, 2004. Proceedings IEEE, 2005:985–990 vol.2.
- 18. Savitzky A, Golay MJE. Smoothing and Differentiation of Data by Simplified Least Squares Procedures. Anal Chem. 1964;36: 1627–1639.