# Research on Fast Pedestrian Detection Algorithm Based on Autoencoding Neural Network and AdaBoost

Authors: Hongzhi Zhou; Gan Yu
Journal: Complexity
 (2021)

---

## Abstract

In order to solve the problem of low accuracy of pedestrian detection of real traffic cameras and high missed detection rate of small target pedestrians, this paper combines autoencoding neural network and AdaBoost to construct a fast pedestrian detection algorithm. Aiming at the problem that a single high-level output feature map has insufficient ability to express pedestrian features and existing methods cannot effectively select appropriate multilevel features, this paper improves the traditional AdaBoost algorithm structure, that is, the sample weight update formula and the strong classifier output formula are reset, and the two-input AdaBoost-DBN classification algorithm is proposed. Moreover, in view of the problem that the fusion video is not smoothly played, this paper considers the motion information of the video object, performs pixel interpolation by motion compensation, and restores the frame rate of the original video by reconstructing the dropped interframe image. Through experimental research, we can see that the algorithm constructed in this paper has a certain effect.


---

## Body

## 1. Introduction

Pedestrian detection is an enduring research direction in the field of computer vision, and it is an extremely practical subproblem in the big problem of target detection. Some of its applications have a great impact on our daily lives and can be directly applied to indoor and outdoor mobile robots, auto-driving cars, security monitoring, and other scenarios [1].Pedestrian detection technology can detect pedestrians in front of the vehicle in time and take corresponding measures, which makes this technology a vital research content in vehicle-assisted driving technology. At present, through the combination with other technologies, automatic vehicle driving technology has been realized. This technology cannot only ensure the safety of traffic but also save people from the work of driving a car. The research of vehicle driving technology has been favored by more and more research institutes, universities, and companies at home and abroad and has become the focus of common concern in industry and academia [2].Pedestrian detection technology enables intelligent robots to view people around, analyze their behaviors, and respond to human instructions so that they can better serve humans. Pedestrian detection technology is not only applied in the fields of intelligent monitoring, vehicle-assisted driving, and intelligent robots, but as humans continue to research and explore intelligence, it can be applied to any field where people appear and need to provide services. In particular, in recent years, the Internet and other media have rapidly transitioned from text images to videos, which has rapidly increased the amount of information available for video. As the most concerned part of the video sequence, pedestrian detection in the video sequence has also become an indispensable and important task in the field of machine vision research and has a pivotal position for subsequent target tracking and behavior analysis [3].


## 2. Related Work

Pedestrian detection technology, as a research hotspot and focus in the field of computer vision, has attracted the attention of many research institutions at home and abroad. Through research, domestic and foreign researchers have proposed a large number of excellent pedestrian detection algorithms and obtained good research results. The literature [4] uses the template matching method to establish a layered human body template for the target to be detected, then compares and matches each area of the image to be detected, and judges whether it is the required detection target according to its final matching similarity. However, the implementation process of this algorithm is complicated in calculation and is easily affected by external factors such as environment, so it has not been greatly developed and applied. The literature [5] combined Harr features and SVM classifiers to realize pedestrian detection. The literature [6] proposed an epoch-making image histogram of oriented gradient (HOG). This method detects pedestrians through the combination of the HOG feature of the image and a single SVM classifier, which has a good detection effect. The literature [7] proposed a pedestrian detection algorithm based on HOG features and edge symmetry based on HOG features. This method first filters out the possible pedestrian areas in the image based on the symmetry characteristic of the vertical edges of pedestrians in the image and then uses the HOG + SVM method to detect pedestrians in this area, which improves the detection rate to a certain extent. The literature [8] used the image’s multilevel local binary (LBP) and multilevel gradient orientation feature (HOG) as feature sets to detect the head and shoulders of the human body in the image to reduce the dimensionality of the multilevel feature set and achieve accurate statistics on the number of people in complex scenes. With the rapid development of deep learning and other related theories, methods such as artificial god networks have gradually been applied to pedestrian detection. The literature [9] replaced the sliding window detection method in the traditional algorithm with a neural network method and accurately classified the image features to be detected, thereby determining the area to be detected. The currently widely used pedestrian detection methods can be roughly summarized into three types: motion-based analysis method, template-based matching method, and statistics-based learning method [10]. The motion-based analysis method mainly uses the difference in image information of moving objects in different frames of images and performs differential operations on corresponding pixels in adjacent frames of images in the video sequence. After that, it compares the difference result with a preset threshold, obtains the motion information in the video sequence according to the final comparison result, and then uses the characteristic information of the motion area to further detect whether the object is a pedestrian [11]. The template-based matching method is to define a hierarchical human body template for the pedestrian target to be detected, then compare and match the image to be detected with each area of the template, and finally determine whether the target to be detected is a pedestrian based on its matching similarity [12].The method based on statistical learning refers to obtaining a classifier representing pedestrians by training the image sample data and then using the classifier to judge and classify the image to be detected [13]. Statistics-based methods can be divided into support vector machine (SVM), AdaBoost, and neural network-based methods according to their classifiers. The classifier used in the support vector machine-based method is SVM. SVM is based on the principle of risk minimization. The main idea is to determine a linear function through which the new sample data can be correctly separated in the maximum interval hyperplane [14]. AdaBoost is an iterative algorithm. The main idea of this algorithm when implementing pedestrian detection is to combine different weak classifiers trained from the same set of sample data to form an ultimate strong classifier and then use the strong classifier to detect and search the input image to be detected to determine whether there are pedestrians in the image [15]. The neural network is a research hotspot in the field of machine vision and has been widely used. Its application in the field of pedestrian detection is mainly by extracting high-latitude image features in the image and classifying and recognizing pedestrians in the image according to the features. With the continuous development of computer hardware, combined with the relevant research results of pedestrian detection theory, in the actual development and application process, domestic and foreign researchers and institutions have proposed a series of design schemes [16]. The literature [17] used algorithms such as mixture Gaussian background modeling and moving target detection and tracking. Moreover, it used CCS compiler optimization, software pipeline optimization, algorithm code optimization, TI-related function library, and other optimization methods to implement a complete video target tracking system on the DM6437 hardware platform. The literature [18] designed an effective pedestrian detection system on the DM6437-embedded DSP platform by analyzing the operating cycle of related modules and combining the characteristics of the hardware platform. The literature [19] used the DM8168 hardware platform to propose a pedestrian classification and detection algorithm combining the foreground enhancement detection algorithm with the CENTRIST operator, which realizes the effective detection of the pedestrian detection algorithm on the DSP platform. The literature [20] designed a detection system for pedestrians waiting to cross the road and developed and implemented it on the TMS320C40 platform. The experimental results proved that it has a good detection rate. Based on the TMS3206455 platform, the literature [21] proposed an algorithm based on wavelet pyramid decomposition, combined with the tunnel filtering algorithm to achieve multitarget detection of cars, pedestrians, and bicycles in complex scenes. The literature [22] designed a pedestrian detection hardware platform based on DM6437 and studied a DSP car-assisted driving pedestrian automatic detection system that can detect pedestrians and issue warnings, which has a high detection efficiency.


## 3. Basic Theory of Texture Feature Extraction

The texture feature describes the phenomenon that the image is repeated or changed in space and reflects the uniformity of the image. It is a feature description consistent with the human visual perception system. The texture feature can describe the detailed information and change the trend of the local area of the image, so it is effectively used in the field of image classification.Local Binary Pattern (LBP) is mainly used for texture classification. Because of its simple calculation, it is further used for target tracking, facial expression recognition, medical imaging, and image classification. This method considers the rectangular square in the image and encodes the intensity difference between the center pixel and theN neighborhood pixels on the circle of radius R in the binary format. Then, it assigns a binary value (0 or 1) to each neighboring pixel based on the intensity difference and finally performs a weighted summation to obtain the LBP value of the center pixel. In a similar way, each pixel value in the image is replaced with an LBP value. The calculation formula of LBP is as follows:(1)LBPN,R=∑i=1N2i−1×D1Ii,Ic,D1Ii,Ic=1,Ii≥Ic0,Ii<Ic.In the above formula,R and N represent the radius and the number of neighboring pixels, respectively. Ic represents the center pixel, and Ii represents the neighborhood pixel. An example of LBP calculation is shown in Figure 1, where R=1andN=8.Figure 1
LBP mode.For the adjacent pixelInn=1,2,⋯,8 of the center pixel Ic, the LNDP mode value is calculated according to the following process:(2)k1n=I8−In,k2n=In+1−In,n=1,k1n=In−1−In,k2n=In+1−In,n=2,3,⋯,7,k1n=In−1−In,k2n=I1−In,n=8.The difference between each neighboring pixel and the neighboring pixel isk1n and k2n, and each neighboring pixel is assigned a binary value F based on these two difference values:(3)Fk1n,k2n=1,ifk1n≥0andk2n≥01,ifk1n<0andk2n<00,ifk1n≥0andk2n<00,ifk1n<0andk2n≥0.For the center pixelIc, the following binary values can be used to calculate the LNDP mode value:(4)LNDPIc=∑n=182n−1×Fk1n,k2n.Figure2 shows the calculation process of the LNDP mode and windows. Figures 2(a) and 2(b) show the number and pixel intensity of the neighboring pixels, and window f−m represents the calculation of the LNDP mode for each neighboring pixel. Among them, window (f) means that pixel I1 calculates the difference between pixel I1 and pixel I2 and pixel I8 through formula (2), and the difference is “1” and “5,” respectively. Since the two difference values are both positive numbers, “1” is assigned to the pixel I1 by formula (3). Similarly, for other pixels, the mode value has been obtained and shown in window Figure 2(c). As shown in window Figure 2(d), the mode value is multiplied by the weight, and the LNDP value is obtained by summing the mode values in window Figure 2(e).Figure 2
Local neighborhood difference mode.
(a)(b)(c)(d)(e)The traditional LBP mode compares the center pixel in the image with the neighboring pixels to generate a binary mode value. This mode only considers the size relationship between pixels, not the difference between pixels. Figure3 shows two completely different partial structure modes, and the same binary code is obtained after LBP encoding. It shows that the local structure mode encoded by LBP loses a lot of local information, and LBP also ignores the influence of neighboring pixels on its binary encoding.Figure 3
LBP encoding.The local neighborhood enhancement mode calculates the LNIP mode value, as shown in Figure4. The figure shows the neighborhood (pixel)-adjacent (pixel) relationship of each of the 8 neighborhood pixels of the center pixel Ic. When i=1,3,5,and7, Ii has 4 adjacent pixels. When i=2,4,6,and8, Ii has 2 adjacent pixels. Its mathematical definition is as follows:(5)Si=I1+modi+5,7,I1+modi+6,9,Ii+1,Imodi+2,8,i=1,3,5,and7Ii−1,Imodi+1,8,i=2,4,6,and8.Figure 4
Local neighborhood enhancement mode calculation.
(a)(b)(c)(d)(e)(f)(g)(h)(i)(j)For the symbol mode of LNIP, we first calculate the relative difference symbolB1,i between the neighboring pixel Ii of the center pixel and its corresponding neighboring pixel Si. The M bit pattern can be obtained, and M is the number of elements, as shown in formula (6). Similarly, the relative difference symbol B2,i between the central pixel Ic and its corresponding neighboring pixel Si is calculated, as shown in the following formula:(6)B1,i=signSik,Ii,k=1,⋯,M,B2,i=signSik,Ic,k=1,⋯,M,signa,b=1,a≥b0,a<b.By performing bitwise XOR operation onB1,i and B2,i, the structure change of the bit pattern is calculated. When calculating the bitwise XOR, the M bit mode value can be obtained by formula (7). The symbol #Di=1 represents the number of 1 in the binary number Di, and formula (7) finally determines the final binary value of the 3×3 window. Among them, when i is an odd number, M=4, and when i is an even number, M=2. The symbol mode value of LNIP can be obtained by the following formula:(7)Di=XORB1,i,B2,i,BIi,Ic=1,#Di=1≥12M,0,#Di=1<12M,LNDPsIc=∑i=182i−1×BIi,Ic.When calculating the amplitude mode of the3×3 window, the concept of statistical dispersion is taken into consideration. To calculate this dispersion, the absolute average deviation of a particular pixel is considered and compared with the average deviation of the center pixel. Specifically, the average deviation Mi of the neighboring pixel Iii=1,2,⋯,8 and the corresponding neighboring pixel Si and the average deviation Tc of the neighboring pixel Ii relative to the center pixel Ic are calculated. Then, the average deviation Mi is compared with the threshold Tc to determine the binary bit value of the adjacent pixel Ii in the 3×3 window. The calculation formula is as follows:(8)Mi=1M∑k=1MSik−Ii,Tc=18∑i=18Ii−Ic,LNIPMIc=∑i=182i−1×signMi,Tc.Figure3 shows two very different 3×3 pixel blocks through an example, and the same LBP code is obtained through the LBP mode.In Figure4, Figures 4(a) and 4(b) represent the distribution of the center pixel and the neighboring pixels. Figures 4(c)–4(j) represent the calculation process of the symbol mode and amplitude mode of the local neighborhood enhancement mode.


## 4. AdaBoost Algorithm

In the AdaBoost algorithm process, the original dataset is first initialized, that is, each sample is weighted and averaged and assigned a corresponding weight, and the weight of each sample is used to calculate the next algorithm iteration. If a sample is misclassified in the classification, the weight of the sample will increase; otherwise, the weight will decrease. Through this mechanism, the AdaBoost algorithm will focus on solving difficult-to-classify samples. Figure5 is the schematic diagram of the AdaBoost algorithm. First, the training set is initialized with weights, and weak learner 1 is trained, and the weight of the sample is updated according to the classification error of weak learner 1. That is, the weight of correctly classified samples decreases, and the weight of incorrectly classified samples increases. In this way, misclassified samples get more attention in subsequent iterations. After that, it is carried out in sequence according to the same method until the end of the iteration, and the weak learners are integrated to form a strong learner.Figure 5
AdaBoost algorithm flow chart.The core idea of the algorithm is to linearly weight several homogeneous classifiers to form a strong classifier, so the algorithm is mainly used to calculate the weight of each classifier. That is, after a weak classifier is given, the initial dataset is first fitted to the weak classifier, the weight of the classifier is obtained according to the fitting result, and the sample weight of the dataset is adjusted.The AdaBoost algorithm process is as follows:(1)
Train sample weight: in the case of the initial training sample without any prior knowledge, the weight of each sample inN training samples is 1/N, and D1 represents the weight set:(9)D1=1N,1N,⋯,1N.(2)
Calculate the classifier error: the weight of the classifier is calculated by the accuracy of each classification. The higher the classification accuracy, the greater the weight of the classifier. In the following formula,htxi represents the classification category of sample xi in the tth iteration, and yi represents the true label of sample xi:(10)εt=∑i=1NDithtxi≠yi.(3)
Calculate the weight of the classifier: according to the classification error obtained in step (20), the proportional coefficient of the weak classifier in the final strong classifier is determined as follows:(11)α=12lg1−εtεt.(4)
Update sample weight: adjust the weight of the sample according to the classification result in step (2). In the following formula,Dit+1 represents the weight of the ith sample in the t+1 iteration:(12)Dit+1=Dit⋅expαt⋅htxi≠yi.(5)
Output strong classifier: the weight of the classifier and the corresponding classification accuracy are linearly superimposed to form a strong classifier, as shown in the following formula:(13)Hx=∑t=1Tαthxi=yi.As an improved boosting algorithm, the AdaBoost algorithm has a high integration capability. For a variety of homogeneous classifiers, the algorithm can build a good and strong classification model, and the algorithm will not be overfitting after repeated training.As a representative of boosting algorithms, AdaBoost has been widely used. Because the AdaBoost algorithm has too strict requirements on the classification accuracy of the base classifier, the algorithm does not have universal applicability. This section improves the algorithm based on this shortcoming. In addition, combined with the base classifier DBN algorithm, the strong classifier formula output in the AdaBoost algorithm is reset.Aiming at the problem that the AdaBoost algorithm is too strict for the classification accuracy of weak classifiers, Zhu et al. proposed the SAMME algorithm. The calculation method of the classifier weightα in this algorithm is different, as shown in the following formula:(14)α=12lg1−εtεt+lgM−1.The weight of the classifier adds a positive termlgM−1 on the original basis, where M represents the total number of categories. The increase of this item has brought a great improvement to the performance of the algorithm. The original AdaBoost algorithm requires the correct rate of weak classifiers to be greater than 1/2, but it is difficult for general classifiers to meet this requirement. The improved classifier weights show that only the classification error εt<1−1/M of the classifier is required, that is, as the number of iterations increases, the accuracy requirement of the classifier becomes lower and lower. At the same time, according to the update rules of sample weights, the SAMME algorithm will obtain larger weights for misclassified samples when the sample weights are updated. When M=2, the SAMME algorithm is the same as the AdaBoost algorithm.It can be seen from the above analysis that the regular termlgM−1 added to the calculation formula of the classifier weight α greatly increases the universality of the AdaBoost algorithm. However, this regular term is not arbitrarily given, but is obtained from the forward superposition model of multiple types of exponential loss functions. The expression of the two-class index loss function is as follows:(15)Lk,h=e−khx.In the above formula,k∈−1,1, and h is the classification label of the classifier.The above formula is extended to the expression of the multiclass index loss function, as follows:(16)Lk,h=exp−1Mk1h1+,⋯,+kmhm=exp−1MKTh.In the above formula, the value ofK=k1,k2,⋯,kmT is(17)km=1,h=m,−1/M−1,h≠m.In the formula,km is the output value of the mth category determined by the classifier, and M is the total number of categories in the dataset. Here, the condition of k needs to be restricted, and the constraint condition k1+k2+,⋯,+km=0 is added according to the above formula. In this case, when M=2, the m-class index loss function becomes a two-class index loss function.The design of the ensemble model uses the DBN classifier as the base classifier. According to the meaning of the DBN structure to output the classification results, the formula for the output strong classifierHx is improved, as shown in the following formula:(18)Hx=∑t=1Tαth′x.The original formula is(19)Hx=argmaxk∑t=1Tαthx=k.The original formula is decomposed and analyzed: the algorithm symbola in hx=k can be interpreted as that when the logical expression a is true, a=1; otherwise, a=0. Therefore, the output form of the formula hx=k is a matrix composed of 0 and 1. 1 means the classification is correct, and 0 means the classification is wrong. Finally, using the argmax function, the maximum value of each row is obtained for each sample category. The improvements made in this article are(20)Hx=∑t=1Tαthx,where hx represents the proportion of each sample in each category before DBN output, and it is usually a decimal. At this time, the weight of the classifier weights the original data, which can better reflect the results of each classification.The DBN network structure consists of four parts: the number of input layer nodes, the number of output layer nodes, the number of hidden layers, and the number of hidden layer nodes. This article uses the following empirical formula to determine network parameters:(21)S=mn+k2.Among them,S is the number of hidden layer nodes, m is the number of input layer nodes, n is the number of output layer nodes, and k is a constant between 1 and 10. From this empirical formula, the value of the number of hidden layer nodes can be obtained, and the final number of hidden layer nodes can be determined through experiments. Since m and n are known, the number of hidden layer nodes S can be determined by the value of k. According to the above formula, there are p values for the number of first layer nodes S1 in the hidden layer:(22)S1=S11,S12,⋯,S1p.When the number of hidden nodes in the first layer is determined, it is used as the input layer to determine the number of nodes in the second hidden layer. According to the above formula,S2 has q kinds of values:(23)S2=S21,S22,⋯,S2q.Similarly, the number of hidden layer nodes in the next layer can be determined according to the number of hidden layer nodes in the second layer. Through the training results, the number of hidden layer nodes is adjusted, and the optimal value is finally determined.Since the DBN network first trains the RBM layer and then performs error feedback training on the BP layer, the network parameters of the RBM layer and BP layer need to be set separately. Since the initial network parameter values need to be adjusted during the training process, the DBN training process is also a batch training process:(24)That is, training batch=number of training samples÷number of training samples each time.The maximum number of cycles is also a factor that affects the DBN classification effect. This parameter also needs to be adjusted in the cycle. At the same time, the learning rate and momentum factor are also important parameters that affect the network effect.


## 5. Fast Pedestrian Detection Algorithm Based on Autoencoding Neural Network and AdaBoost

The framework of the autoencoding and decoding deep network is shown in Figure6. It can be seen from the figure that the network is similar to the autoencoding network and consists of two processes: encoding and decoding.Figure 6
Block diagram of the deep network of autoencoding and decoding.The codec deep network structure is shown in Figure7. It can be seen from the figure that its network structure is different from the autoencoding network. The coding process of the network is composed of multiple nonlinear mapping layers [h1, h2, h3]. The three nonlinear mapping layers compress feature dimensions layer by layer to make the network’s coding process remove redundant features as much as possible, so as to retain the features after the face pose changes are removed.Figure 7
Autoencoding and decoding deep network.The convolutional autoencoder is an unsupervised algorithm model. However, convolutional autoencoders no longer use full connections in encoding and decoding, but instead use convolution operations. The convolutional autoencoder also protects the input layer, hidden layer, and output layer, and its training steps also include encoding, decoding, and parameter learning. The encoder uses a convolution operation to obtain a hidden layer from the input layer. This process is called convolutional encoding. The decoder uses a deconvolution operation to reconstruct the hidden layer to obtain an output layer with the same dimensions as the input layer, which is called convolutional decoding. Finally, the error between the output layer and the input layer is calculated, and several iterations are performed to minimize the error and obtain the convolutional autoencoder parameters. Figure8 is a schematic diagram of the operation of the convolutional autoencoder.Figure 8
Convolutional autoencoder.The motion estimation algorithm based on block matching is simple and easy to implement. The basic principle is to find the block with the smallest matching error with the current block in the search range of the reference frame through a certain matching criterion. The relative displacement between each current block and the searched matching block is the motion vector MV, which is the motion track of the block, as shown in Figure9.Figure 9
Schematic diagram of block matching search.Among the commonly used classification algorithms, the realization process of the Naive Bayes classification algorithm is relatively simple, but it cannot meet the condition of independent distribution of data in practical applications. TheK-nearest neighbor classification algorithm is simple and effective, but the data processing is more complicated. Multilayer neural networks achieve high classification accuracy at the cost of setting a large number of initial parameters. The support vector machine algorithm (SVM) focuses on the classification of small samples and is the simplest algorithm in linear classification problems. Therefore, the SVM classifier is the most suitable for the two types of problems in this paper that only need to detect pedestrians and nonpedestrians. The flow chart of pedestrian classification is shown in Figure 10.Figure 10
Pedestrian detection process.The target detection network is used to detect pedestrians in a certain frame of the night vision video sequence, and then, the KCF tracking model is used to track the target for several frames, forming a detection-tracking alternate mode. At the same time, by means of intermittent cyclic triggering, after the previous detection is completed for 2 seconds, the system is used to detect and track subsequent videos again, and the cycle continues until the end or termination of the video. Among them, the reason for the detection at an interval of 2 seconds is that the entire process of the target pedestrian from appearing to being caught by human eyes to leaving the field of view takes at least 2 seconds. Therefore, it is most appropriate to set it to detect once every two seconds to achieve the effect of reducing the number of detection frames, while avoiding missed detection of new targets in the field of view. The multitarget rapid detection-tracking detection cycle system is shown in Figure11.Figure 11
Pedestrian detection and multitarget tracking loop system.The idea of multitarget tracking is to execute multiple tracker objects at the same time. Since this article is applied to roads where cars are driving at night and there are not many pedestrians, the tracking algorithm is still very efficient. The multitarget tracking process is shown in Figure12.Figure 12
Multitarget tracking flowchart.


## 6. Algorithm Performance Verification

Next, the performance verification of the fast pedestrian detection algorithm based on autoencoding neural network and AdaBoost constructed in this paper is carried out. In order to verify the efficiency of frame selection fusion and adaptive partition fusion proposed in this paper, this paper compares it with direct fusion and evaluates it from the perspective of video fusion speed. The speed of video fusion is measured by the number of frames per second (FPS). Under the same test video, this article uses two fusion algorithms to average the time required to fuse one frame to indirectly reflect the fusion speed. In order to avoid the interference of three factors such as scene, halo area, and vehicle speed on the fusion speed, the experiment is divided into the following four groups of situations, and the influence of the third variable on the fusion speed is studied by unifying two of them. Four sets of experiments: (1) pedestrians drive at normal speed on main roads in the city, but the halo area is small; (2) pedestrians drive at normal speed on main roads in the city, but the halo area is large; (3) the halo area in the suburbs is small, but the driving speed is normal; (4) the halo area in the suburbs is small, but the driving speed is faster. The average fusion time of one frame in each group of videos recorded and the direct fusion processing speed are shown in Table1 and Figure 13, and the selected frame-partition fusion processing speed is shown in Table 2 and Figure 14.Table 1
Statistical table of processing speed in the direct fusion mode (frames/sec).
No.Experiment 1Experiment 2Experiment 3Experiment 4No.Experiment 1Experiment 2Experiment 3Experiment 411.000.941.220.91510.980.961.200.9120.990.941.200.89520.990.951.210.9230.980.951.200.92531.010.941.200.9041.010.951.200.88540.990.941.210.8851.010.951.190.91551.010.951.200.9061.010.951.220.92560.980.951.220.8971.000.961.200.89571.000.951.190.9281.000.951.200.89581.020.951.190.9090.990.961.190.90591.010.951.190.88100.980.951.200.88601.010.961.210.89111.020.961.210.91611.000.951.200.89120.980.961.200.90620.990.961.220.88130.980.941.200.91631.000.951.220.89141.010.961.200.89640.990.951.220.92151.020.961.200.91651.000.961.220.91161.020.951.210.91660.980.951.200.90171.010.941.190.92671.000.951.190.88181.010.951.210.88680.990.941.190.90191.010.961.210.91690.990.961.200.91201.000.941.200.91701.000.951.210.91211.000.951.220.89711.010.941.190.90220.990.951.220.90721.000.951.230.92231.000.951.230.91731.010.951.210.90241.000.951.220.89741.000.951.210.91251.020.961.220.89751.010.961.200.88260.990.951.210.91761.020.951.210.90271.010.951.220.90771.010.951.210.89280.980.941.220.90780.990.951.210.89290.980.941.230.88791.000.951.230.91300.990.961.220.92801.000.941.220.90311.020.941.200.90810.980.941.230.91320.990.941.200.89821.000.941.220.89331.020.961.210.90830.980.951.220.88341.020.941.190.91840.980.951.210.90350.980.941.200.90850.980.951.200.89361.000.961.200.88860.980.951.200.91371.000.961.200.91871.010.961.220.89381.020.951.190.88881.020.951.220.89391.010.951.200.90891.010.941.210.90401.010.961.190.88901.010.951.200.89410.980.961.220.92910.990.941.190.90420.980.961.200.89921.000.951.210.92431.000.951.210.90931.000.951.200.89441.000.951.200.92941.010.951.230.89451.000.941.220.91950.990.941.200.89461.020.951.200.88961.010.941.220.91471.000.961.200.90970.990.961.190.92481.010.961.220.90980.980.951.220.90490.990.951.200.90991.000.951.200.90501.010.951.210.921000.990.951.190.89Figure 13
Statistical diagram of processing speed in the direct fusion mode (frames/sec).Table 2
Statistical table of processing speed in the frame selection partition fusion mode (frames/sec).
No.Experiment 1Experiment 2Experiment 3Experiment 4No.Experiment 1Experiment 2Experiment 3Experiment 416.425.226.815.79516.385.346.715.8726.315.216.785.67526.335.206.876.0036.385.336.885.88536.535.326.885.7846.515.486.755.98546.655.366.785.6156.415.176.755.99556.395.416.815.9066.615.286.865.90566.605.126.785.8276.485.336.745.66576.425.266.825.8686.365.316.825.87586.355.186.745.9596.625.136.875.96596.655.186.875.98106.645.276.885.68606.695.216.845.80116.665.246.785.74616.665.396.815.83126.665.166.895.63626.515.266.805.70136.445.286.885.89636.695.406.895.87146.335.466.815.74646.505.186.795.65156.455.336.825.99656.555.256.775.60166.655.176.716.00666.675.456.895.98176.405.406.825.81676.665.516.825.83186.315.296.765.64686.485.246.815.95196.485.436.855.74696.515.496.845.91206.555.266.815.75706.485.316.815.86216.565.386.905.63716.465.326.825.98226.305.266.835.75726.525.486.905.91236.635.296.795.94736.375.286.705.81246.515.316.855.96746.495.386.855.67256.665.356.905.87756.545.136.715.61266.375.376.735.61766.685.156.745.94276.605.456.725.70776.565.296.735.87286.375.206.755.81786.345.376.845.97296.615.296.755.72796.655.206.805.78306.615.256.875.84806.535.356.755.61316.325.296.705.89816.375.286.855.90326.595.196.865.79826.625.346.765.72336.305.346.895.90836.325.266.795.66346.435.396.715.66846.625.386.715.96356.455.216.795.73856.455.476.735.97366.465.286.785.99866.665.126.705.86376.365.406.895.87876.455.236.845.89386.635.496.765.92886.345.246.765.87396.325.346.835.83896.315.196.726.00406.495.416.715.94906.515.416.715.62416.415.486.805.70916.465.386.825.71426.345.496.875.67926.375.346.765.72436.345.356.755.66936.465.136.745.68446.335.156.775.90946.375.386.795.80456.645.516.775.99956.445.386.885.88466.645.246.885.69966.355.196.735.90476.485.436.765.66976.665.486.775.88486.325.166.755.89986.545.266.765.84496.315.146.805.86996.515.166.765.93506.505.456.715.991006.675.346.755.99Figure 14
Statistical diagram of the processing speed in the frame selection partition fusion mode (frames/sec).In summary, it can be seen from the subjective and objective evaluation results of the fusion video that the algorithm proposed in this paper has the best video fusion effect, and its video is smooth, content is synchronized, and the speed of video fusion is also significantly improved.Next, this paper analyzes the pedestrian detection accuracy rate of the algorithm constructed in this paper. A total of 90 sets of pedestrian videos are set up. The algorithm is used to detect and count the detection results. The results are shown in Table3 and Figure 15.Table 3
Statistical table of the accuracy of pedestrian detection.
No.Accuracy (%)No.Accuracy (%)No.Accuracy (%)No.Accuracy (%)199249747986998297259948987097398269849997198498279850997298597289751977397697299952987497798309953997598897319854977697999329855987798109833995697789711993498579979981299359958988098139936975997819914983798609882981599389761988398169739976297849817974097639785981898419864998698199742986599879920984399669788992198449967998999229745996899909823984698————Figure 15
Statistical diagram of the accuracy of pedestrian detection.From the above results, it can be seen that the algorithm constructed in this paper has a high accuracy rate in the pedestrian detection process, so the algorithm in this paper can be applied to practice.


## 7. Conclusion

In order to solve the problem of low pedestrian detection accuracy of real traffic cameras and high missed detection rate of small target pedestrians and improve the speed and accuracy of pedestrian detection, this paper studies pedestrian detection technology. By analyzing the classification performance of the classifier, this paper combines the AdaBoost ensemble idea with the DBN classifier and proposes a classification algorithm of autoencoding neural network and AdaBoost-DBN. Aiming at the problem that the AdaBoost algorithm is too strict for the classification accuracy of the weak classifier, this paper improves the calculation formula of the classifier weight, which effectively reduces the accuracy requirements for the weak classifier. Moreover, this paper improves the traditional AdaBoost algorithm structure, that is, resets the sample weight update formula and the strong classifier output formula and proposes a two-input AdaBoost-DBN classification algorithm. In addition, to solve the problem of unsmooth playback of the fusion video, this paper considers the motion information of the video object, performs pixel interpolation with motion compensation, and restores the frame rate of the original video by reconstructing the dropped interframe image. Finally, this paper designs experiments to verify the performance of the algorithm proposed in this paper. The results show that the results of the research meet the expected goals of algorithm construction.



---

*Source: 5548476-2021-03-27.xml*