# Adaptive Tracking Algorithm for Multiperson Motion Targets Based on Local Feature Similarity

Authors: Chang Xiankun; Liu Mingliang; Wang TianMing
Journal: Wireless Communications and Mobile Computing
 (2022)

---

## Abstract

The traditional multitarget tracking method has many points of concern. In view of the problems of high target recognition switching rate and high target trajectory false alarm rate in complex scenes and the problem of target loss caused by video tracking in existing video tracking algorithms, a new method based on video tracking is proposed: a multitarget tracking algorithm for local feature similarity, a strong target motion maneuvering or rapid deformation of asymmetric rigid targets. The algorithm builds a depth metric model, which can predict and track the temporal features of the target trajectory frame appearance features and motion features at the same time, which makes the extracted target features more discriminative and reduces the target recognition switching rate. At the same time, the adaptive model tracking algorithm can adjust the model in real time according to the clarity of the target area, effectively ensure the accuracy of the target tracking model, effectively aggregate the characteristics of the trajectory frame, and reduce the false alarm rate. The experimental results show that combining the multiperson moving target adaptive tracking algorithm based on local feature similarity into the DSST model can improve the average accuracy and success rate of the DSST model and has good stability.


---

## Body

## 1. Introduction

Identifying and monitoring multiple target items such as pedestrians and automobiles is accomplished through the analysis of video. In practical applications like video surveillance, autonomous driving, motion identification, and crowd behavior analysis, multitarget tracking algorithms are used to track many targets simultaneously. Presently, multitarget tracking is a tough visual task, with the primary issue being easy to lose track of the tracked object or switch the target identity when tracking numerous targets at the same time, due to occlusion and a high degree of resemblance in their appearance. The success of deep learning in computer vision tasks such as picture classification and target recognition has fueled the advancement of multitarget tracking technology in recent years, and multitarget tracking algorithms integrated with deep neural networks have emerged as a popular research area [1–7].Detection-based multitarget tracking frameworks are comprised of the following processes: target detection, feature extraction from the target detection frame, similarity computation between the target detection frame and the trajectory frame, and data association. The target detection algorithm is responsible for the majority of the work in the detection phase, and the present research on multitarget tracking algorithms is mostly concerned with the latter two things.Visual target tracking has long been a popular research topic in the field of computer vision, and as technology has progressed, target tracking technology has become increasingly popular in a variety of fields, including unmanned aerial vehicles, intelligent traffic systems, intelligent surveillance systems, virtual reality, and other applications [8, 9]. When the target is hidden during the tracking process, the light conditions in the environment change, the target scale changes, and so on, this might result in a poor eye-tracking effect. A large number of academics have undertaken some research on tracking algorithms in order to solve this type of challenge [10–15].The kernel correlation filter (KCF) tracking algorithm has been proposed by some researchers, which converts the matrix operation into an intervector dot product operation by extracting the image direction HOG features and exploiting the fact that a circular matrix can be diagonalized in the frequency domain to speed up the operation [16, 17]. However, the method has a drawback: it cannot handle target scale changes and is unable to perform scale adaptation. The adaptive color attribute tracking approach translates the characteristics of RGB space into an 11-dimensional color space, which increases the abundance of the algorithm’s input features and enhances the tracking accuracy by making the algorithm’s input features more numerous [18]. The target is taught to compensate for the impacts of scale transformation and illumination on the tracking effect by learning to track in different environments [19]. The scale adaptive correlation filter SAMF algorithm, which employs the scale pooling approach to achieve adaptive tracking of the target, is described in detail below. Some researchers have improved the KCF algorithm by including an adaptive Gaussian window function and scale estimation. Their findings have been promising. When confronted with difficulties like as background clutter, rapid target motion, light changes, occlusion, and size changes, the tracking accuracy of the algorithms listed above will deteriorate to varying degrees, and in some cases, the target will be lost entirely [20–24].With the advancement of deep learning technology, it is possible to mine the deep semantic information contained in images and apply it in sectors such as target tracking and image segmentation, among others [25]. The HCF tracking algorithm, which is based on the kernel correlation filter tracking algorithm, selects multilayer depth features rather than HOG features and uses shallow network features for tracking and localization, which improves the tracking accuracy. The HCF tracking algorithm is based on the kernel correlation filter tracking algorithm [26, 27]. The Siam R-CNN algorithm presents a new method of mining instances. The C-COT algorithm is an improvement on deep learning and correlation filtering algorithms that addresses the problem of algorithm training in the continuous space domain by using cubic interpolation and a Hessian matrix to handle the problem of algorithm training in the continuous space domain [28].The circular structure kernel (CSK) algorithm, the kernel correlation filtering (KCF) algorithm, the discriminative scale space tracking (DSST) algorithm, the edge target tracking (LMCF) algorithm based on circular feature mapping, and the long-time target tracking (LCT) algorithm, among others, are the most widely used correlation filtering algorithms at this time. As part of its eye-tracking accuracy enhancements, the CSK algorithm incorporates a kernel-based least-sum-of-squares filter (MOSSE), which is based on the Ridge regression approach based on the kernel function. This helps to maintain the algorithm’s computing performance while improving accuracy. CSK is used to create multichannel features, which are then used by KCF in order to improve the trackability and tracking accuracy of the algorithm at the feature extraction level. The DSST method incorporates scale tracking into the correlation filtering algorithm in order to address the issue of the impact of targets with large-scale changes on the tracking results of the correlation filtering algorithm [29]. The LMCF algorithm approaches model updating from the standpoint of tracking accuracy, and the average peak correlation energy (APCE) metric and feature maximum response value are combined to determine tracking accuracy and, consequently, whether or not to update the model is necessary. On the basis of DSST, the LCT method integrates online neighborhood algorithm (KNN) detection, which significantly increases the stability of the system for long-term tracking applications [30]. The tracking effects of the algorithms described above are good in the case of weak maneuverability and modest deformation of the target in the video, and they can increase the tracking accuracy of the target to a certain level in this scenario. However, if the target is more mobile or changes rapidly or the image is obscured, the target is easily lost and cannot be recovered, resulting in low tracking accuracy and long-term tracking [31].A multiperson motion target adaptive tracking algorithm based on local feature similarity is proposed in this paper to address the problems mentioned above. This algorithm can effectively improve tracking accuracy in the case of a strong target motion maneuver or rapid deformation of asymmetric rigid targets. Furthermore, the target’s appearance features and motion features are extracted uniformly in the depth metric network in order to learn their temporal correlation, which improves the target’s discriminative property and minimizes the target’s ID switching rate. A network is also trained to learn the probability value of correct matching of different time sequence history trajectory frames of the target, to suppress false detection in the target trajectory and the influence of low-quality target frames on the overall features of the target, to reduce the false alarm rate, and to solve the problem that a target cannot be retrieved again after it has been lost, all at the same time.The research contributions of the paper are as follows:(1)
This paper proposes a multitarget tracking algorithm based on local feature similarity(2)
The algorithm proposed in this paper builds a depth metric model, which can simultaneously predict the temporal features of the appearance features and motion features of the tracking target trajectory frame(3)
The proposed adaptive model tracking algorithm can adjust the model in real time according to the clarity of the target area, effectively ensure the accuracy of the target tracking model, effectively aggregate the characteristics of the trajectory frame, and reduce the false alarm rate


## 2. Related Method

### 2.1. Correlation Filtering Tracking

Correlation filtering was first applied in signal processing as a method to describe the correlation between 2 signals. For 2 signalsf and g, their correlation in the time domain is in the continuous and discrete forms as follows:
(1)f⊗gτ=∫−∞+∞f∗tgt+τdt,f⊗gn=∫−∞+∞f∗mgm+τdm,where f∗t is the complex covariance of ft, t and τ are the independent variables and variations in continuous time, and m and n are the independent variables and variations in discrete time, respectively. The correlation calculation is performed for ft and fm. The moment corresponding to the maximum response value is the moment when the two signals are closest.According to the fundamental concept of the correlation filtering algorithm, the tracking problem of the target position in an image may be characterized as follows: Figure1 depicts the process of tracking the target position in an image. As a result, it can be determined that the correlation filtering algorithm requires the extraction of a target image filter template hi in the initial frame and the calculation of the target image filter template hi with the input image fi in order to produce the response matrix gi. In this case, the subscript i represents the pixel ordinal number. The greater the distance between the point and the target, the greater the response value. When the tracking is steady, the response matrix gi calculated from the tracking results will have a good single peak; however, when the tracking is unstable, the response matrix gi will have several peaks with low peaks.Figure 1
Structure of linear CRF.The calculation process of the correlation filter tracking algorithm is shown in Figure2, and it can be found that the whole calculation process is mainly divided into three parts: feature extraction, online matching, and model updating. First, the features are extracted from the target of the first frame of the image sequence, including grayscale features, color features, HOG features, and depth features in the deep learning algorithm; then, the extracted feature model is matched online with the region to be matched in the next frame to get the response matrix of the next image. After matching each frame, the obtained feature model is updated according to a certain learning rate to quadruple-match the next frame with the learned new model, and the model update can be expressed as
(2)X∧p=1−γX∧p−1+γX^,where X^ is the extracted feature model and γ is the learning rate.Figure 2
Structure of correlation filter tracking algorithm.


### 2.2. KCF

The full name of the KCF algorithm is kernelized correlation filters, which is a fully automatic tracking algorithm. The KCF algorithm consists of several steps: first, use a circular matrix to sample the positive and negative samples of the tracking area, extract the sample HOG features, and train the filter. Secondly, the similarity between the target area and the candidate area is calculated by using the polynomial kernel function, the response graph is derived, and the peak position in the response graph represents the tracking target position; thirdly, the tracking target position is calculated using the polynomial kernel function.Let the training sample bexi, the corresponding label be yi, and linear classifier be fx=WTxi; the purpose of the training classifier is to find the best filter template coefficient W by sample xi, so that fxi and label yi squared error sum are minimum; the loss function of the classifier is shown in the following:
(3)minw∑ifxi−yi2+λw2,in which λ is a regularized item.By introducing the mapping functionφx, the data is mapped to the high-dimensional space, at which point W can be expressed as a linear combination of φxi, as shown in the following equation, and can be solved using the kernel function.
(4)W=∑iαiφxi.Then we have(5)α=k+λI−1y,in which I is the unit matrix, yi is the sample label, and k is the kernel function.By using the circular matrix and Fourier transform operation, we have(6)α=F−1FyFk+λ,in which F−1 denotes the Fourier transform operation.When dealing with targets that move a lot or deform a lot in the video, it is critical to have a robust adaptive model updating process. As a result, the learning rate of the model is determined by the relative sharpness of the candidate region in the next frame, which is determined by the learning rate algorithm.Tenengrad, an image gradient-based function and a generally used image sharpness assessment function, is used to judge the sharpness of the candidate region in order to keep the algorithm’s speed as low as possible. Image processing professionals often feel that clearer image pixels have sharper edges, for example, greater gradient function values, and blurrier image pixels have less sharp edges. It is necessary to utilize the Sobel operator to extract gradient values in both the horizontal and vertical directions when using the Tenengrad function, and the following are the specific procedures to be taken.
(1)
Let theSobel convolution kernel be Gx and Gy; then the gradient of image I at the point x,y can be expressed as(7)Sx,y=Gx∗Ix,y+Gy∗Ix,y.And theTenengrad function is
(8)XTenengrad=1n∑x∑ySx.y2,in which n is the total number of pixels in the evaluation region. A larger value of the Tenengrad function indicates a higher sharpness of the evaluation region. Conversely, it indicates a lower sharpness of the evaluation region. First, a basic learning rate Lbase and a basic sharpness Cbase are fixed, where the basic sharpness Cbase is obtained from the sharpness evaluation value of the first frame. Then, the ratio of the basic sharpness Cbase to the sharpness of the current frame is calculated in the remaining frames, and the product of this ratio and the basic learning rate is defined as the learning rate. Finally, the target loss caused by inaccurate feature extraction when the motion target is too blurred is fully considered, and the sharpness threshold TC. If the sharpness is lower than the threshold TC, then the learning rate is immediately adjusted to 0, which can be expressed as
(9)I=Lbase×Cbasec,c>TCI=0,c<TC,in which I is the updated learning rate and C is the clarity value at the current moment.Since the continuous movement of the target will lead to changes in the appearance model, which directly affects the tracking effect, it is necessary to continuously update the filter and appearance model:(10)xi=1−ηxi−1+ηxi,αi=1−ηxi−1+ηαi,in which, xi is the appearance model, αi is the classifier coefficient, and αi is the learning rate.


## 2.1. Correlation Filtering Tracking

Correlation filtering was first applied in signal processing as a method to describe the correlation between 2 signals. For 2 signalsf and g, their correlation in the time domain is in the continuous and discrete forms as follows:
(1)f⊗gτ=∫−∞+∞f∗tgt+τdt,f⊗gn=∫−∞+∞f∗mgm+τdm,where f∗t is the complex covariance of ft, t and τ are the independent variables and variations in continuous time, and m and n are the independent variables and variations in discrete time, respectively. The correlation calculation is performed for ft and fm. The moment corresponding to the maximum response value is the moment when the two signals are closest.According to the fundamental concept of the correlation filtering algorithm, the tracking problem of the target position in an image may be characterized as follows: Figure1 depicts the process of tracking the target position in an image. As a result, it can be determined that the correlation filtering algorithm requires the extraction of a target image filter template hi in the initial frame and the calculation of the target image filter template hi with the input image fi in order to produce the response matrix gi. In this case, the subscript i represents the pixel ordinal number. The greater the distance between the point and the target, the greater the response value. When the tracking is steady, the response matrix gi calculated from the tracking results will have a good single peak; however, when the tracking is unstable, the response matrix gi will have several peaks with low peaks.Figure 1
Structure of linear CRF.The calculation process of the correlation filter tracking algorithm is shown in Figure2, and it can be found that the whole calculation process is mainly divided into three parts: feature extraction, online matching, and model updating. First, the features are extracted from the target of the first frame of the image sequence, including grayscale features, color features, HOG features, and depth features in the deep learning algorithm; then, the extracted feature model is matched online with the region to be matched in the next frame to get the response matrix of the next image. After matching each frame, the obtained feature model is updated according to a certain learning rate to quadruple-match the next frame with the learned new model, and the model update can be expressed as
(2)X∧p=1−γX∧p−1+γX^,where X^ is the extracted feature model and γ is the learning rate.Figure 2
Structure of correlation filter tracking algorithm.


## 2.2. KCF

The full name of the KCF algorithm is kernelized correlation filters, which is a fully automatic tracking algorithm. The KCF algorithm consists of several steps: first, use a circular matrix to sample the positive and negative samples of the tracking area, extract the sample HOG features, and train the filter. Secondly, the similarity between the target area and the candidate area is calculated by using the polynomial kernel function, the response graph is derived, and the peak position in the response graph represents the tracking target position; thirdly, the tracking target position is calculated using the polynomial kernel function.Let the training sample bexi, the corresponding label be yi, and linear classifier be fx=WTxi; the purpose of the training classifier is to find the best filter template coefficient W by sample xi, so that fxi and label yi squared error sum are minimum; the loss function of the classifier is shown in the following:
(3)minw∑ifxi−yi2+λw2,in which λ is a regularized item.By introducing the mapping functionφx, the data is mapped to the high-dimensional space, at which point W can be expressed as a linear combination of φxi, as shown in the following equation, and can be solved using the kernel function.
(4)W=∑iαiφxi.Then we have(5)α=k+λI−1y,in which I is the unit matrix, yi is the sample label, and k is the kernel function.By using the circular matrix and Fourier transform operation, we have(6)α=F−1FyFk+λ,in which F−1 denotes the Fourier transform operation.When dealing with targets that move a lot or deform a lot in the video, it is critical to have a robust adaptive model updating process. As a result, the learning rate of the model is determined by the relative sharpness of the candidate region in the next frame, which is determined by the learning rate algorithm.Tenengrad, an image gradient-based function and a generally used image sharpness assessment function, is used to judge the sharpness of the candidate region in order to keep the algorithm’s speed as low as possible. Image processing professionals often feel that clearer image pixels have sharper edges, for example, greater gradient function values, and blurrier image pixels have less sharp edges. It is necessary to utilize the Sobel operator to extract gradient values in both the horizontal and vertical directions when using the Tenengrad function, and the following are the specific procedures to be taken.
(1)
Let theSobel convolution kernel be Gx and Gy; then the gradient of image I at the point x,y can be expressed as(7)Sx,y=Gx∗Ix,y+Gy∗Ix,y.And theTenengrad function is
(8)XTenengrad=1n∑x∑ySx.y2,in which n is the total number of pixels in the evaluation region. A larger value of the Tenengrad function indicates a higher sharpness of the evaluation region. Conversely, it indicates a lower sharpness of the evaluation region. First, a basic learning rate Lbase and a basic sharpness Cbase are fixed, where the basic sharpness Cbase is obtained from the sharpness evaluation value of the first frame. Then, the ratio of the basic sharpness Cbase to the sharpness of the current frame is calculated in the remaining frames, and the product of this ratio and the basic learning rate is defined as the learning rate. Finally, the target loss caused by inaccurate feature extraction when the motion target is too blurred is fully considered, and the sharpness threshold TC. If the sharpness is lower than the threshold TC, then the learning rate is immediately adjusted to 0, which can be expressed as
(9)I=Lbase×Cbasec,c>TCI=0,c<TC,in which I is the updated learning rate and C is the clarity value at the current moment.Since the continuous movement of the target will lead to changes in the appearance model, which directly affects the tracking effect, it is necessary to continuously update the filter and appearance model:(10)xi=1−ηxi−1+ηxi,αi=1−ηxi−1+ηαi,in which, xi is the appearance model, αi is the classifier coefficient, and αi is the learning rate.


## 3. Adaptive Tracking Algorithm for Multiperson Motion Targets Based on Local Feature Similarity

The structure of the adaptive tracking algorithm for multiperson motion targets based on local feature similarity is shown in Figure3.Figure 3
The structure of our algorithm.Specifically, this multitarget tracking framework is composed of the following four components:(1)
Extraction of the target frame. It is retrieved from the current frame of video based on its target detection algorithm, whereas it is computed from its past video frames to produce a track frame, which is the target track frame derived from its historical video frames(2)
The calculation of similarity. A metric network is utilized to determine the degree of similarity between the target detection frame and the trajectory frame, and the result is displayed. This network uses the CNN to extract the depth features of the target frame, and then two GRUs are used to learn the temporal correlation of the appearance and motion features of the target historical track frame and the probability value of correct matching for each historical track frame saved by the target, to aggregate the appearance features of the target track frame in different time sequences, and then the CNN-GRU network outputs the similarity between the f and the target track frame, as shown in Figure1. In the following step, the CNN-GRU network determines if the features of the target trajectory frame and the detection frame are identical. For the target detection frame and trajectory frame, a deep learning-based Reid network is used to extract the appearance features from their respective frames and to determine the similarity between them. The network structure of CNN-GRU is shown in Figure 4(3)
This paper addresses the issues of tracking accuracy and robustness of the relevant filter tracking algorithm in complex environments. Because the KCF target tracking algorithm using HOG features may lead to tracking drift or even tracking failure due to the single extracted feature, this paper replaces the single feature of the original KCF algorithm with a weighted fusion of FHOG features and depth features to complete the accurate localization of the target and completes the est. tracking accuracy(4)
The association of data. The similarity between the output of the Reid network and CNN-GRU is combined to obtain the matching correlation matrix of detection frames and trajectory frames, and the matching results of all detection frames and target trajectory frames of the current video frame are finally obtained by the Hungarian matching algorithm, which is based on the similarity between the output of the Reid network and CNN-GRUFigure 4
The structure of CNN-GRU.By directly training the similarity between detection frames and trajectory frames and by adaptively combining appearance features and motion features in this metric network, the framework is able to cope with complex scene changes of multitarget tracking and cope with complex scene changes of multitarget tracking. The deep metric network is trained to understand the temporal connection of appearance and motion attributes of historical target trajectory frames in distinct time sequences, which reduces the ID switching rate of targets. Learning the probability value of correct matching of previous track frames from distinct time sequences saved by each target helps to limit the number of false alarms generated. As part of this process, the similarity of the depth metric network’s output and the similarity of appearance features extracted by the pedestrian reidentification network are combined in order to obtain a final matching result between the detection frame and the trajectory frame, which further reduces the target identification switching rate.Conv2-1 and Conv4-1 in ResNet-50 are used to extract the depth features of the tracking target region, and the FHOG features of the target region are also extracted. The response of each feature in the frequency domain is calculated as shown in the following equations.(11)fConv2−1z=F−1FkzxConv2−1⊙FαConv2−1,(12)fConv4−1z=F−1FkzxConv4−1⊙FαConv4−1,(13)fFHOGz=F−1FkzxFHOG⊙FαFHOG,in which fConv2−1z, fConv4−1z, and fFHOGz represent the response maps corresponding to the Conv2-1 feature, Conv4-1 feature, and FHOG feature of the sample z of the window to be detected, respectively. α represents the solution of the classifier corresponding to each feature, and kzx represents the kernel correlation between the feature vector x corresponding to the training sample and the sample z of the candidate region in the next frame.The 3 feature response maps are weighted and fused as shown in the following(14)fz=λ1fConv2−1z+λ2fConv4−1z+λ3fFHOGz,in which λ1, λ2, and λ3 are feature fusion coefficients; it was found during the experiments that the 3 response maps were fused with different weights with different effects, and the comparison of tracking results under different weights is shown in Table 1. The improved algorithm fusion weight into λ1=1, λ2=0.6, and λ3=0.5 is derived through extensive experiments. fz is the final fused response map, and the peak position is the tracking target center position.Table 1
Comparison of tracking results with differentλ1, λ2, and λ3.
WeightAccuracySuccess rateλ1λ2λ310.20.50.880.7410.40.50.850.7110.60.50.910.7910.80.50.810.62110.50.860.73It employs the YOLOv4 detection algorithm, which has a fair balance between speed and accuracy at this point in the development process. Because YOLOv4 is a deep learning-based target detection method, it is necessary to train the algorithm on the category of the tracked target before it can be used; otherwise, the system will not be able to recognize and track unknown targets. The target bounding box detected by the YOLOv4 algorithm will have a confidence score, and if the confidence score is greater than a predetermined threshold, the program automatically determines that the detection was successful, and the algorithm moves on to the tracking phase, with the detected bounding box serving as the initial frame for the tracking phase. Whenever the greatest response value of multiple consecutive frames is less than the preset threshold, it is possible to conclude that the tracking has drifted at that point; in this case, the recheck mode is activated, and the detection process is entered once more.


## 4. Experiment Results

The experiments focus on the tracking results of multiplayer motion targets, where the comparison experiments on the MOT17 dataset use the open target detection results provided by this dataset. The detection results of the tracker detection part of the validation experiments on the MOT16 dataset use the results from the literature [21].To verify the effectiveness of the adaptive tracking algorithm for multiperson motion targets based on local feature similarity, validation experiments are first conducted on the MOT16 training set. Let the baseline model of the tracker consists of Kalman filter + IOU + Hungarian matching algorithm, named baseline. The multitarget tracker consisting of the baseline model + metric network is named BCG. The multitarget tracker consisting of the baseline model + pedestrian reidentification network is named BRD.Figures5 and 6 represent the comparison results of the algorithm in this paper and the comparison algorithm on the two metrics of IDF1 and IDs, respectively. It can be seen that the algorithm in this paper significantly outperforms the comparison algorithm.Figure 5
Comparison of the IDF1 value among different algorithms.Figure 6
Comparison of the IDF1 value among different algorithms.Both Figures7 and 8 depict the OPE test curves for all of the targets in the OTB100 dataset that were subjected to fast motion, motion blur, and fast deformation rapid deformation. In this study, it is discovered that the average accuracy and success rate of the algorithm are greater than the average accuracy and success rate of the other algorithms on the rapid motion target frame sequences. This suggests that the approach employed by this algorithm can, to a certain extent, mitigate the target loss induced by a powerful target motion maneuver or by rapid deformation of asymmetric rigid targets.Figure 7
Comparison of algorithms with different error thresholds.Figure 8
Comparison of algorithms with different overlap thresholds.It can be seen from Figures7 and 8 that the threshold of the algorithm proposed in this paper is higher and more reasonable than other algorithms, and it has more advantages under the same conditions.


## 5. Conclusion

This paper proposes an adaptive tracking algorithm for multiperson moving targets based on local feature similarity, which solves the problem of target loss caused by strong target motion maneuvering or rapid deformation of asymmetric rigid targets to a certain extent. This method uniformly extracts the appearance features and motion features of targets in the metric network and learns their temporal correlations, so that the targets have better discriminativeness, thereby reducing the ID switching rate. The experimental results show that the algorithm in this paper is obviously better than the comparison algorithm. The framework proposed in this paper can effectively reduce the ID switching rate and false alarm rate and improve the tracking accuracy.



---

*Source: 4039002-2022-04-16.xml*