 Research
 Open Access
 Published:
A visual fingerprint update algorithm based on crowdsourced localization and deep learning for smart IoV
EURASIP Journal on Advances in Signal Processing volume 2021, Article number: 84 (2021)
Abstract
Recently, deep learning and visionbased technologies have shown their great significance for the prospective development of smart Internet of Vehicle (IoV). When the smart vehicle enters the indoor parking of a shopping mall, the visionbased localization technology can provide reliable parking service. As known, the visionbased technique relies on a visual map without a change in the position of the reference object. Although, some researchers have proposed a few automatic visual fingerprinting (AVF) methods, which are aiming at reducing the cost of building the visual map database. However, the AVF method still costs too much under such a situation, since it is impossible to determine the specific location of the displaced object. Given the smart IoV and the development of deep learning approach, we propose an algorithm for solving the problem based on crowdsourcing and deep learning in this paper. Firstly, we propose a Regionbased Fully Convolutional Network (RFCN) based method with the feedback of crowdsourced images to locate the specific displaced object in the visual map database. Secondly, we propose a method based on quadratic programming (QP) for solving the translation vector of the displaced objects, which finally solves the problem of updating the visual map database. The simulation results show that our method can provide a higher detection sensitivity and correction accuracy as well as the relocation results. It means that our proposed algorithm outperforms the compared one, which is verified by both synthetic and real data simulation.
Introduction
Background and significance
With the development of the Internet of Things (IoT) [1, 2] and 5G technology [3], video or image could be transmitted more efficiently in locationbased services. As an important topic of IoT, visionbased technology is more common for the Internet of Vehicle (IoV). The driving assistance system integrating vision and artificial intelligence technology will gradually become a research hotspot in the field of smart IoV [4, 5]. This system is more important for smart vehicles running in an indoor environment, such as the indoor parking of a shopping mall. The reason is that wireless communication in the indoor environment is more vulnerable to interference, resulting in more packet loss or greater delay. Therefore, visionbased technology is a promising solution for the positioning and navigation of smart vehicles after entering the indoor environment.
Visionbased localization technology has its unique advantages. The evidence is more obvious in the composite positioning technologies. For instance, WiFi and vision [6], inertia and vision [7], Lidar and vision [8], hybrid localization technology [9]. Visual localization is a key role in their system architecture, respectively. The premise of accurate visual localization is to establish a visual map database on the offline stage in the interested areas. Typically, with the help of customized equipment [10,11,12], the visual fingerprint can be collected very accurately in a given area. However, these devices need to be customized specially, which is also expensive. To solve this problem, Farhang et al. proposed an automatic visual fingerprinting method based on the consumergrade device in [13], which was further improved in our previous work [14]. These methods have well solved the visual fingerprinting problem in different ways. However, some objects in an interested area will be moved randomly, which will lead to localization deviation. Unfortunately, none of the existing visual fingerprinting methods could solve the visual fingerprint updating problem directly, which is caused by displaced objects in the location area.
In contrast, the problem of updating the WiFi radio map is well studied in its corresponding research community. The method of updating a WiFi radio map can be summarized into three categories. One is predicting the Received Signal Strength Indication (RSSI) fingerprint by the particular radio propagation model, [15,16,17] can be classified as examples of this type. The other one is leveraging the deep learning framework for generating the renewed radio fingerprint by training the large amount of timevarying RSSI, Signal Noise Ratio (SNR), or Channel State Information (CSI), such as [18,19,20]. These two kinds of methods are based on the fingerprint change with some fixed patterns. Unlike the characters of radio fingerprints, the visual fingerprint has no model for learning algorithms. Another method is crowdsourcing. When the user is cooperative, the fingerprint used in his/her localization can be updated from the available radio map. Several methods are proposed in this category for finding the best updated RSSI fingerprint [21,22,23,24,25]. Although these methods could not be directly used for updating the visual fingerprint, they provide an inspired idea.
An interesting technology that should mention in this section is the Regionbased Fully Convolutional Network (RFCN), which was proposed by Dai et al. in [26]. RFCN provides an effective solution for image recognition, which is well proved by [27,28,29]. It should be noted that we also use this framework for semantic segmentation in crowdsourced query images. By leveraging these regions generated by RFCN, semantic SpeedUp Robust Feature (SURF) forms. Fortunately, there are many existing frameworks for deep learning implementation, among which Caffe is a representative one. A list of works has shown its superior performance [30,31,32]. More details about Caffe are referred to [33].
Therefore, the purpose of this paper is to propose a visual fingerprint update algorithm based on crowdsourced visual localization. More specifically, a displaced visual fingerprint detection method and quadratic programming (QP) based visual fingerprint update method is designed in two consecutive steps. The main contributions of this paper are in three folds:

1.
A visual fingerprint update algorithm is proposed in this paper, which is based on crowdsourced visual localization. When the users are cooperative, compared to the location in the visual map database, the algorithm could detect automatically whether the objects in the localization area are displaced or not.

2.
A novel method is proposed in this paper for detecting the positional change of the visual fingerprints. A regionbased fully convolutional network is used for labeling the SURF descriptor in the query image, which is defined as Semantic SURF. Compared with the traditional PerspectivenPoint (PnP) solver with all 2D3D correspondences, our method is calculated with semantic 2D3D correspondences. Our proposed method has a higher detection ratio, which is proved by synthetic and real data simulation results.

3.
A Quadratic Programming (QP) based visual fingerprint update method is also proposed. In this way, the fingerprint can update automatically without the real crowdsourced localization results. The accuracy is higher than that of the compared method under different configurations.
The rest of this paper organizes as follows. In Sect. 1.2, some related works will be discussed. Section 1.3 describes the visual fingerprint update problem in visual localization and presents our proposed system model. In Sect. 2, we propose our semantic SURFbased detection method and QPbased update method, respectively. Section 3 explains the experimental setup. Section 4 provides the simulation results, and the conclusion draws in Sect. 5.
Ralated works
As far as we know, this paper is the first proposal for solving the visual fingerprint update problem. Therefore, in this section, we introduce the relevant works in our proposed algorithm. Farhang et al. proposed an automatic visual fingerprinting (AVF) method for the first time in [13], which improves the efficiency of collecting the fingerprint and reduces the cost of acquisition equipment. Once the object is displaced, which is also shot in the query image by the crowdsourced user, the result of visual localization will deviate. At present, it seems that the only solution is the periodic scanning by the AVF method to correct the error in the database due to object displacement. However, this will lead to two problems, one is how to set the optimal acquisition cycle, the other is the consumption of labor and time cost caused by overall rescanning.
Visual localization is more accurate than the other methods, which is mainly due to its 6 degree of freedom mapping equation. The coefficients of these equations are defined by 2D–3D correspondences. [34] proposed an effective and efficient method for finding 2D–3D correspondences. The method expresses the 3D point by 2D image feature descriptor when it is generated by the Structure from Motion (SfM) technique. The mean value of the two matched 2D feature descriptors is saved for representing the particular 3D point. The 2D feature descriptor could be Scale Invariant Feature Transform (SIFT) [35], SURF [36], or any other features. When a 2D image feature and 3D point match, a Fast Library for Approximate Nearest Neighbor (FLANN) [37] search or bag of visual words approach could accomplish this task. In our proposed algorithm, we also use this method to find reliable 2D–3D correspondences. More specifically, SURF and FLANN are chosen in the framework.
Efficient PnP (EPnP) is the most widely used solver for PnP problems [38], which is classical for its O(n) complexity with known camera internal parameters. The algorithm utilizes the linearization and relinearization method for solving the weight of a linear combination of a matrix eigenvector, which derives from 3D2D correspondences. With these weights, the camera coordinates of the 3D point can calculate. Then, the rotation matrix and translation vector decompose with the help of Singular Value Decomposition (SVD) for solving the matrix maximum trace problem. Furthermore, a more accurate result will be reached by setting the closedform solution as the initial input of the Gauss–Newton scheme. Displaced objects in the indoor interested environment may lead to localization error due to the mismatch between the 2D feature image coordinates and 3D point world coordinates. A natural idea is setting a threshold, which acts as a criterion for the 3dimensional localization results. When the feedback of crowdsourced users is beyond the threshold, it can assume that some reference objects in the scene may move. This method could treat as the traditional strategy and the benchmark of our proposal. Specifically, EPnP with all 2D–3D correspondences with a judging threshold is chosen as our benchmark. Since in the largescale environment the selfverifiable localization mark is the vertical result, there is only one predefined threshold for judging the reliability of the localization result.
RANdom SAmple Consensus (RANSAC) is well known for filtering outliers in the dataset by calculating the mathematical model parameters of the samples [39]. It is generally applicable to refine the matched pairs during the offline stage due to its timeconsuming characteristics in the computer vision field. For the algorithm proposed in this paper, the calculation cost of RANSAC is not so restrictive. Therefore, it can be used for filtering the mismatch, so that a corrected localization result will be generated, which could also locate the displaced semantic object.
In recent years, the Deep Learning (DL) based method has been embedded into the indoor localization framework. One role of DL in localization is to generate new fingerprints compared to traditional ones. Hernández et al. [40] proposed a deep learning feature for localization, which was trained by multisensor fingerprints. Ma et al. constructed hierarchical convolutional features for visual tracking in [41]. However, the improvement is limited in terms of localization accuracy, considering the cost of the training. The other application is to map the image information and its location directly through the DL network. This method entails an obvious cost, which needs a substantial set of training data. Although it shows some practical value in the latest research, such as [42, 43], it still has no advantage from the point of theoretical view. Another one is leveraging DL for semantic segmentation, which could provide a pixelwise classification. Undoubtedly, it is embedded into the DLbased visual localization framework to enhance performance. A representative one based on DL is proposed in [44], which is called VLocNET++. Unfortunately, it can not be used to solve the problem mentioned in this paper.
DL could use as a fundamental tool for filtering features, which could provide more accurate coefficients for solving the PnP equations. We define this as Semantic SURF, and it is a basic tool for challenging the visual fingerprint update problem. Specifically, in this paper, we propose a visual fingerprint update algorithm under the crowdsourced framework, which contains a semantic SURFbased visual fingerprint, displacement detection method with the help of RFCN, and a visual fingerprint update method. In this way, the fingerprints can update automatically and reliably.
System model
Once the layout of the located region is known, the visual fingerprint will be collected from the visual sensors mounted on a smart vehicle, which is labeled in green. When it is fingerprinting over the extinguisher, its position will record as the position framed by the grey box in the database. Thereafter, the extinguisher moves to the position of the red dotted box. The visual localization result will deviate when the camera labeled with red tends to locate itself by the visual sensor and the surrounding visual fingerprint, due to the displaced extinguisher in the query image. Meanwhile, the camera labeled in blue will obtain an accurate result since its reference fingerprint is fixed, which may be the unmoved ashbin. The description is shown in Fig. 1.
The cameras labeled both red and blue can be regarded as volunteers, which are located at different times after generating the visual fingerprint database. Whenever the vehicle has completed the visual localization or navigation in the scene, as long as it is pleased to send the data back to the server cooperatively, our proposed algorithm will work automatically without any human aids. Noted that in our proposed algorithm, there is no need to give the ground truth location of the query image or any other additional information. When the query image from the volunteer sends back to the server, the visual fingerprint update algorithm is initiated. A block diagram of our proposed algorithm is shown in Fig. 2.
The location of the query image will recalculate on the server to validate the availability of the feedback from the crowdsourced user. As shown in Fig. 2, the visual fingerprint displacement detection method will be applied in the algorithm. When the results obtained by this method are beyond the predetermined threshold, the feedback from crowdsourced users is invalid, so that the overall process will terminate. On the contrary, when the method locks the displaced fingerprint, the subsequent fingerprint relocation method will initiate. Thereafter, the new location of the displaced visual fingerprint will be calculated, and the database refreshes. Our proposed algorithm will automatically detect and update the displaced visual fingerprint to substitute for the periodic manual fingerprint scanning. Although the overall algorithm typically operates on the server, the calculation should complete as quickly as possible in consideration of the amount of crowdsourcing data. As shown in Fig. 2, the visual fingerprint displacement detection method mainly consists of RFCN, RANSAC, and EPnP. The online computation complexity of RFCN is O(n), as well as EPnP, while RANSAC is mainly affected by the number of iterations and the value of maximum tolerable error.
A brief illustration of the role of the regionbased fully convolutional network (RFCN) in this paper is provided in Fig. 3. The crowdsourced image is an input of RFCN, whose output is the corresponding semantic segmentation and the label with its score.
In the next step, semantic SURF will extract, respectively, which shows in Fig. 4. It could be further filtered by RANSAC with its corresponding one in the reference image. According to its matching results with the point cloud simultaneously, several bundles of semantic PnP equations will be established. Then, different localization results calculate. Otherwise, the semantic point cloud can also be generated by leveraging the semantic SURF. Besides matching, the images above could also describe the traditional way of generating point clouds by two frames in a sequential image sequence, while the images below could represent a novel way for creating semantic point clouds by RFCN.
When all groups of semantic SURF are beyond the predefined threshold, the crowdsourced data will be determined as invalid by the proposed method, the overall process will terminate as a consequence. When a group of semantic SURF is within the predefined threshold, the displaced object will be locked by the method automatically. The result will be input into the visual fingerprint relocation method, which is aimed at providing a reliable new location of the displaced visual fingerprint locked by the previous method. Then the translation can be solved by the equations, whose coefficients are from the semantic 2D–3D correspondences. The optimal value of the translation is the solution of a constructed quadratic programming problem. Finally, the refreshed location will be recorded into the visual fingerprint database. We will explain the visual fingerprint displacement detection method and show how it defines in Sect. 2.1. Then, the visual fingerprint relocation method details in Sect. 2.2.
Methods
Visual fingerprint displacement detection method
As stated before, the crowdsourced image sends back to the server. For a Region of Interest (RoI) rectangle of size \(w\times h\) in the image, \(k \times k\) bins form with each size approximate to \(\frac{w\times h}{k^2}\). In the last convolutional layer, the \(k^2\) score map for each category produces, a pooling scheme defined as
where \(r_c(i,j)\) is the response in the (i, j)th bin for the cth category, \(z_{i,j,c}\) is one score map out of the \(k^2(c+1)\) score map, \((x_0,y_0)\) is the topleft corner of an RoI, n is the number of pixels in the bin, \(\Theta\) is all parameters of the RFCN. Then, \(k^2\) scores are voted by averaging on the RoI. A \(c+1\) dimensional vector generates as \(r_c(\Theta )=\sum _{i,j}r_c(i,j\Theta )\). Finally, the softmax responses computed by \(s_c(\Theta )=e^{r_c(\Theta )}/\sum ^{c}_{c_{i,i=0}}e^{r_{c_i}(\Theta )}\). Note that the output of RFCN for each RoI is the particular category \(c_i\) and its bounding box \({\mathbf{S}}_i=(s_x,s_y,s_w,s_h)\). In general, the output from the pretrained RFCN can express as
where \({\mathbf{S}}_j\) is the jth semantic region, m is the total semantic region labeled by RFCN.
Then, the SURF descriptors extracts, which express as
where n is the number of SURF descriptor, \(\mathbf {F}_i\) is a vector. With the help of the descriptor, 2D features and 3D points can be mapped uniquely by [34]. Typically, the 2D image coordinates and the 3D point world coordinates will be the coefficients of our proposed method after semantic segmentation. The pixel coordinates of each SURF descriptor can be used to judge easily which \({\mathbf{S}}_i\) it belongs to. It describes as
where \({F}_{s_j} \subset \mathbf {F}\). Then, RANSAC is used for refining the 2D2D matches between the crowdsourced image and the reference image. The remaining SURF descriptor with its semantic label can be used for checking the displacement of the object. We define the matched SURF number of each semantic segmentation before RANSAC as \(n^{{\mathbf{s}}_{j}}_{\mathrm{match}}\), and the remaining SURF number after RANSAC as \(n^{{\mathbf{s}}_{j}}_{\mathrm{filter}}\). Typically, when the ratio \(\phi _{{\mathbf{s}}_j}=n^{{\mathbf{s}}_{j}}_{\mathrm{filter}}/n^{{\mathbf{s}}_{j}}_{\mathrm{match}}\) is lower than a threshold \(\phi _{\mathrm{thr}}\), it could assume that the corresponding semantic object is displaced comparing to the reference. Furthermore, considering the randomness of RANSAC, m groups of PnP equations will establish, respectively. By EPnP [38] algorithm, the localization results of the crowdsource user can be recalculated, where \(\{{\mathbf {R}}_{\mathrm{filter}}, {\mathbf {t}}_{\mathrm{filter}}\}_{\mathrm{RANSAC}}\) is the solution of all the RANSAC filtered 2D3D correspondences. When the number is too small to solve the accurate solution, the calculation of the reprojection error will substitute for solving the EPnP equations, which is a golden standard for judging the correctness of the solution. It will correct the misjudgment of the first step as far as possible.
Finally, the displaced object can be judged by
where \({{\mathbf{S}}}^{\mathrm{disp}}\) is the displaced semantic region in the image plane, \(\phi _{{\mathbf{S}}_i}\) is the ratio labeled by the semantic region \({\mathbf{S}}_i\), \(\phi _{\mathrm{thr}}\) is a threshold, \(\epsilon _{\mathrm{reproj}}^{{\mathbf{S}}_i}\) is the reprojection error of correspondences labeled by \({\mathbf{S}}_i\), \(\epsilon _{\mathrm{reproj}}^{thr}\) is the reprojection error threshold. \(\epsilon _{\mathrm{diff}}^{{\mathbf{S}}_i}\) is the difference between \(\{{\mathbf {R}}_{\mathrm{filter}}, {\mathbf {t}}_{\mathrm{filter}}\}_{{\mathbf{s}}_i}\) and \(\{{\mathbf {R}}_{\mathrm{filter}}, {\mathbf {t}}_{\mathrm{filter}}\}_{\mathrm{RANSAC}}\), \(\epsilon _{\mathrm{diff}}^{\mathrm{thr}}\) is the difference threshold. When the semantic object is unshifted, the corresponding region is defined as \({\mathbf{S}}^{\mathrm{unsh}}\). Consequently, the displaced object will be ranked according to the semantic region in the image plane. The proposed method is summarized in Algorithm 1.
Visual fingerprint relocation method
In the previous subsection, the displaced object has been locked as well as the unshifted objects. The translation vector of the displaced object will calculate for refreshing the visual fingerprint database in this subsection. First of all, a benchmark method will be illustrated. Although it can be derived very simply from the PnP equation, we need to give a brief deduction in this subsection to compare with our proposed method. Another reason is that it is the first proposal for solving the visual fingerprint refreshing problem. The semantic 2D–3D correspondences can be clustered into two categories, which describes as two sets \({\mathbf{T}}^{\mathrm{disp}}=\{u_d,v_d,x_d,y_d,z_d\}\) and \({\mathbf{T}}^{\mathrm{fix}}=\{u_f,v_f,x_f,y_f,z_f\}\). \({\mathbf{T}}^{\mathrm{disp}}\) represents the set of displaced 2D3D correspondences, while \({\mathbf{T}}^{\mathrm{fix}}\) is the set of fixed ones. The rotation matrix and translation vector of the crowdsourcing query image can be calculated by EPnP [38] with the coefficients from \({\mathbf{T}}^{\mathrm{fix}}\), which donates as \(\mathbf {R}\) and \({\mathbf {t}}=[t_1, t_2, t_3]^{\mathbf{T}}\). The relative translation vector of the displaced object defines as \(c_x,c_y,c_z\), respectively. Then, according to the PnP equation, without considering the rotation of the displaced object, we have
where \(u_i\), \(v_i\) is the ith 2D feature coordinate, \(\lambda _i\) is its depth factor, \(x_i\), \(y_i\), \(z_i\) is its corresponding 3D point coordinate, and \({\mathbf {K}}\) is the camera internal matrix of the crowdsourced user. The internal matrix can be roughly recovered from the crowdsourced image, or sent by the user as a part of the feedback data accurately, \({\mathbf {K}}\) can further represent as
where f is the focal length, \(u_0,v_0\) is the principal point coordinate of the image. Noted that the coefficients of (6) are from the set \({\mathbf{T}}^{disp}\). For a tuple of \({\mathbf{T}}^{\mathrm{disp}}\), (6) could transform to a simplified form of three linear associated equations with four unknowns. A very natural idea is to do an elimination before solving the equations. When \(\lambda _i\) is eliminated, we have
where \(\mathbf {A}^i_{11}=fr_{11}+(u_0u_i)r_{31}\), \(\mathbf {A}^i_{12}=fr_{12}+(u_0u_i)r_{32}\), \(\mathbf {A}^i_{13}=fr_{13}+(u_0u_i)r_{33}\), \(\mathbf {A}^i_{21}=fr_{21}+(v_0v_i)r_{31}\), \(\mathbf {A}^i_{22}=fr_{22}+(v_0v_i)r_{32}\), \(\mathbf {A}^i_{23}=fr_{23}+(v_0v_i)r_{33}\), \(\mathbf {B}^i_1=(u_iu_0)({\mathbf {R}}^3\mathbf {X}_i+t_3)f({\mathbf {R}}^1\mathbf {X}_i+t_1)\), \(\mathbf {B}^i_2=(v_0v_i)({\mathbf {R}}^3\mathbf {X}_i+t_3)f({\mathbf {R}}^2\mathbf {X}_i+t_2)\). Note that \(r_{ij}\) and \({\mathbf {R}}^i\) are the element and the ith row vector of rotation matrix \({\mathbf {R}}\), respectively.
It is clear that for a tuple of coefficients from \({\mathbf{T}}^{\mathrm{disp}}\), two equations can be obtained. Therefore, when there are n tuples in the set \({\mathbf{T}}^{\mathrm{disp}}\), \(2\times n\) linear equations will generate. According to linear algebra, a simplified form expresses as
where \(\mathbf {c}=[c_x, c_y, c_z]^{\mathbf{T}}\) is the unknown vector. A direct leastsquare solution can solve as
Finally, we have
where \(\mathbf {x}_s^r\) is the refreshed location of the displaced visual fingerprint, \(\mathbf {x}_s\) is the primitive one in the database. It defines as our benchmark, which could be called the DLS method.
Our proposed method will deduce from the PnP equation, which is
Noted that the point coordinates \([x^i, y^i, z^i]^{\mathbf{T}}\) are the projection of the image coordinates \([u_i,v_i]\) in the crowdsourced query image by the depth \(\lambda _i\), rotation matrix \(\mathbf {R}\), and translation vector \({\mathbf {t}}\). Be different from Eq. (6), the goal is to calculate the point coordinates of each semantic feature in the world coordinate system. From Eq. (12), we have 3 equations and 4 unknowns, which represent infinite solutions. Thus, we formulate a minimization problem as our goal of a solution, which is
where \(\lambda _i^j\) donates the jth expression of \(\lambda _i\) from Eq. (12). Typically, (13) is a quadratic programming problem. The optimal solution can obtain by solving the first derivative of (13). The final simplified form is 3 equations of the first degree, which is quite easy for computation. With n tuples of projected point coordinates, the center can obtain as \(\mathbf {c}^p\), while the primitive center of the displaced object is \(\mathbf {c}^r\). The translation vector of the center coordinate \(\mathbf {c}\) represents as
Generally, this value is used as an index to measure the accuracy of the method, since \(\mathbf {c}\) is predefined in the simulation. The proposed method summarizes in Algorithm 2.
Experiments
Comparison algorithm
Some researchers have proposed visual localization methods by the leverage of known prerequisites, such as man height [45] or vertical direction [46]. A traditional idea is borrowed from this kind of setting. On the contrary, we can judge whether the localization result is right or wrong by the known prerequisites. However, in the application of pedestrian visual localization, these prerequisites will not be satisfied all time. Fortunately, the localization error still could be utilized for ranking the displaced object. Typically, the localization result is with an error in every direction. Since the user is unaware of his real location in the horizontal or vertical direction, a traditional method can only leverage the distance perception of the human in the vertical direction for judging the accuracy of the localization result. Thus, the conventional trick is to set an error threshold in the vertical direction. Once the result is beyond the threshold, it will determine that some mismatch exists in the 2D–3D correspondences. The threshold method referred to in the comparison is a concrete realization of the traditional one.
Synthetic data
To minimize the impact of related parts on our proposed method, the experiment is conducted on the synthetic data for convenience. Moreover, it could assume that the 2D–3D corresponding match and semantic segmentation have \(100\%\) accuracy in the synthetic data set, respectively. Thus, the focus will concentrate on the visual fingerprint displacement detection and relocation method.
For simplicity, we assume that the first camera is set as the origin of the world coordinate system, while the second camera assumes to be translated several units from the first camera along the xaxis. The reason is that the two cameras need to keep a certain distance to keep the overlap between the images. The camera coordinates of 3D points are generated randomly within a box of \([2,2]\times [2,2]\times [6,8]\), then the pixel coordinate of the two cameras is projected by a pinhole camera model with an initial point (960, 540) and focal length around 1000. The yaxis angle of the second camera chooses randomly from \(10^\circ 0^\circ\), while the angle of the first camera varies from \(0^\circ 10^\circ\). In each trial, 500 points generate. Then, the Kmeans algorithm applies to clustering points. For a cluster, they all belong to the same object as a common assumption. Consequently, any object can be used to simulate a displaced one. The shifted distance is set to \(0.5{}1\) units far from its original position. Suppose that the object displaces too far or a new one places, it will not exist in the crowdsourced image at that particular location. These two kinds of situations are beyond the scope of this paper. The setting of the crowdsourced camera is the same as the second camera in the synthetic data simulation. Both the displaced points and fixed ones project on the image plane. With these image coordinates and their corresponding points, the location can be calculated by a PnP algorithm like EPnP [38].
We divided the synthetic data simulation into two parts according to the number of displaced objects. There is only one displaced object in the first part, which is more likely in the indoor environment. There are two displaced objects at the same time in the other part, which is more complex. Both results were achieved under the condition of \(\phi _{\mathrm{thr}}=5\%\), \(\epsilon _{\mathrm{reproj}}^{\mathrm{thr}}=100\), \(\epsilon _{\mathrm{diff}}^{\mathrm{thr}}=1\), which are the optimal setting in our simulations. We find that when \(\phi _{\mathrm{thr}}\) is bigger, the RANSAC threshold method will report false alarms in simulations using synthetic data, especially when the number of 2D3D correspondences is originally small. Meanwhile, \(\epsilon _{\mathrm{reproj}}^{\mathrm{thr}}=100\) and \(\epsilon _{\mathrm{diff}}^{\mathrm{thr}}=1\) are to tolerate the errors introduced by the 2D3D matching procedure for the real dataset. The threshold could be set lower in the simulations with synthetic data, e.g. \(\epsilon _{\mathrm{reproj}}^{\mathrm{thr}}=20\) in the primitive implementation of EPnP [38].
Real dataset
The real dataset chooses from the image shot at the communication research center in Harbin Institute of Technology, whose floor plan and layout show in Fig. 1. The experiment site is mainly the area marked yellow on the plan. The main aisle is about 50m long and 3m wide. To simulate the smart vehicles for convenience, we use wheeled equipment instead, which mounted the camera on its roof. The training set is a total of 800 images, whose image resolution is \(1920 \times 1080\). Some samples of the reference image have been shown in Figs. 3 and 4 previously. By leveraging semantic segmentation, we defined 9 kinds of objects in RFCN. The statistics used in the training step are shown below in Table 1.
A typical example of the displaced objects in the above scene is shown in Fig. 5. The extinguishers in the red box of Fig. 5a are in their original positions while scanning the fingerprint with Canon EOS 1300D digital camera. Then, in the red box of Fig. 5b, their positions moved, which was shot by the crowdsourced user with iPhone 6S camera. The crowdsourced images were also collected by Samsung Galaxy S9plus and iPhone XR cameras, which have different internal parameters. It should be noted that images with low quality are not considered in this paper.
The learning parameters in the RFCN have selected default values. The Caffe framework is trained on a server with Inter(R) Xeon(R) Gold 5118 CPU @2.3GHz, memory 64GB, NVIDIA SMI 418.56 GPU, and 64 bits Ubuntu OS. More details about the RFCN configurations for our simulation environments can be referred to in our previous conference paper [47].
Results and discussion
Results from synthetic dataset
Figures 6, 7 and 8 show different comparison results under the assumption of one displaced object and two fixed ones from the synthetic dataset. According to the proposed visual fingerprint updating algorithm, the first step is to find the displaced visual fingerprint from a single crowdsourced image.
Figure 6 shows the detection probability curve w.r.t. the threshold value between the traditional method and our proposed method. As mentioned before, the traditional one uses all 2D–3D correspondences as the coefficients of the PnP equations. Furthermore, the solution is provided by the PnP solver. In our simulation, EPnP is chosen due to its accuracy and efficiency. For each threshold sampling point, the results are obtained from 5000 repeated random trials. The traditional method is more sensitive to the humanperceivable threshold, which means the performance is disturbed by the threshold value. The threshold value is also contradictory. The bigger is the value, the more sensitive is the crowdsourced user. However, the detection probability decreased dramatically with the increase of the threshold value. The threshold is set from 0 to 0.9 m, the reason is that with the help of an infrared or laser distance sensor equipped with the device, the localization error could be perceived. Moreover, a human will sense at least a 20 cm error in the vertical direction.
In Fig. 7, the logarithmic localization error of different 2D3D correspondences shows, respectively. The mean and maximum errors are used for comparison. It concludes that the localization error is small when the 2D–3D correspondences are from the fixed objects, whose point label represents FOP1s and FOP2s. The logarithmic error is positive when the 2D–3D correspondences are from a displaced object, which labels as MOPs. The difference is obvious when the 2D–3D correspondences are from fixed objects and displaced ones. The localization result is hard to distinguish whether the positioning results are correct when the correspondences are mixed, which labels as APs. From the results, it is easy to tell which object displaces with its semantic label.
Once the displaced object is locked, the next step in our proposed algorithm is to relocate the point cloud fingerprint. In the previous step, the ground truth rotation matrix and translation vector of the crowdsourced image can calculate correspondences from the fixed objects. The process is followed by RANSAC for all correspondences. It makes our method of semantic 2D3D correspondences more intuitive and efficient. Since the translation vector of the displaced object is predefined, the error could be calculated between the ground truth and the solved one. The predefined translation vector varies by a random value between 0.5 and 0.8 in the xaxis and yaxis. The CDF curve shows in Fig. 8. The error CDF curve of our proposed method is much better than the benchmark. It illustrates that the position of the fingerprint is refreshed by our proposed method more accurately.
The second part of the synthetic dataset results shows in Figs. 9, 10, 11. There are two unmoved objects and two displaced objects, which means more mismatches are in 2D3D correspondences. The number of all 2D–3D correspondences is 500. Noted that to ensure the normal solution of EPnP, at least 10 points are generated on each object.
From Fig. 9, the detection probability of both displaced objects is higher than the one of the traditional method. With more mismatched correspondences, the detection ratio of the traditional method promotes indeed from the comparison of Figs. 6 and 9. However, the trend is the same. Meanwhile, the performance of our proposed method remains unchanged.
Figure 10 shows the logarithmic error of the localization results from different bundles of 2D–3D correspondences. Comparing with Fig. 7, the error between fixed and displaced objects still exists, which also will be enabled to lock the displacement object accurately.
In Fig. 11, the CDF curves of relocation error from different displaced object draw. The relocation error of the two displaced objects by our proposed method diverges slightly, whose computation results are both better than that of the traditional one. Advantageously, the performance preserves well when in comparison with Fig. 8.
Results from real dataset
The detection result from the real dataset shows in Fig. 12. To simplify the process of the simulation, we select a random location in the scene, which contains four semantic objects. One object is moved deliberately to a specific location. It should be noted that the displacement of the object will also happen in normal time, and the chosen location is only for the convenience of measuring the ground truth.
When the semantic object shifts, 50 test images are collected near the reference location, whose precise locations are unknown. It shows clearly that the successful detection ratio of the displaced object is independent of the humanperceivable threshold by our proposed method, while the ratio of the comparing one decreases indeed with the increase of the threshold. However, unlike synthetic data simulation, the fixed objects are misjudged. There are \(55\%\) and \(30\%\) misjudgments from fixed objects labeled as FO2 and FO3, respectively. The main reason for this difference is that the number of effective semantic features on FO2 and FO3 is smaller in real data simulation than in synthetic one. The average percentage number of features on FO2 is \(5.95\%\), while that on FO3 is \(17.64\%\), which are both much smaller than FO1. The reprojection errors of FO2 and FO3 can obtain by using the location results of FO1, which can eliminate such misjudgments. Furthermore, it could reduce to \(5\%\) and \(20\%\).
Figure 13 describes the localization result of the displaced object. Our proposed method outperforms the compared method when the error is smaller than 0.94 m. Compared with the simulation results of synthetic data, the convergence of the Cumulative Distribution Function (CDF) curve is slower than that of the compared method in real data simulation. In summary, the performance of our proposed method on the real data is worse than that of the synthetic data. The reason is that the feature matching algorithm fails to provide \(100\%\) accuracy, which will lead to misjudgments and distortion of equation coefficients. As a result, the solution of our proposed method will have a few deviations.
Operation efficiency
As known, the computation complexity of EPnP is O(n). It is supposed that the type of semantic segmentation is m. Typically, it regards as \(m \le 10\) in an indoor environment, which is similar to our experiment place. Thus, according to Algorithm 1, the computation complexity of our proposed visual fingerprint displacement detection method is \(O(m \times n)\). Meanwhile, the computation complexity of the proposed visual fingerprint relocation method is O(n) by Algorithm 2, where n is the number of visual fingerprints belonging to the displaced object. The average running time trend w.r.t. the corresponding 2D3D point number n shows in Fig. 14.
The running time of each sampling point was obtained from the average of 1000 trials. With the increase of the feature number that extracts from the images, the time required by both methods increases slowly. Meanwhile, the number of displaced objects does not significantly affect the performance of the method. The experiment results show that the proposed method is efficient. However, compared with other methods in the proposed algorithm in this paper, the average running time of semantic segmentation by RFCN is still long, which is 1.63 s. It makes the algorithm be only able to run on the serverside temporarily.
Comparison with AVF reconstruction
In this subsection, we list the disadvantages and advantages of our proposed visual fingerprint updating algorithm and reconstruction by the AVF method, which can be seen in Table 2.
The result of average processing time and relocation error is from 500 trials. In the experiment, we set one moving object, whose translation varies from 50 to 100 cm. Under this condition, it is convenient to calculate the relocation error of the fingerprint. It should be noted that the AVF method is easily affected by the flow of people in the scene. By contrast, our proposed algorithm is more flexible with the aim of crowdsourced localization.
Conclusion
In this paper, we propose an algorithm based on crowdsourcing and deep learning for solving the challenging visual fingerprint update problem of the smart vehicle, which aims to detect whether the reference object in the crowdsourced image is displaced and provide a refreshed location to facilitate subsequent vehicles. The simulation results are achieved thoroughly from synthetic data with various configurations. Besides, a real indoor dataset is applied to test the performance of our proposed algorithm compared with synthetic data. In summary, our proposed algorithm can promote nearly \(100\%\) detection probability, while the average probability by threshold method is \(60\%\). The accuracy of relocated fingerprints by our proposed algorithm is \(42\%\) higher than the DLS method. Although the accuracy of our proposed algorithm is \(10\%\) lower than the AVF reconstruction method, our proposed algorithm outperforms in other aspects. In future research, the influence of the rotation of the displacement object will be considered, which will further refine the refreshed fingerprint location.
Availability of data and materials
The datasets used for the evaluation of the algorithm are not sharing publicly. Please contact the corresponding author if neccessary.
Abbreviations
 IoT:

Internet of things
 IoV:

Internet of vehicle
 AVF:

Automatic visual fingerprinting
 RFCN:

Regionbased fully convolutional network
 QP:

Quadratic programming
 RSSI:

Received signal strength indication
 SNR:

Signal noise ratio
 CSI:

Channel state information
 SURF:

Speedup robust feature
 PnP:

Perspectivenpoint
 SIFT:

Scale invariant feature transform (SIFT)
 FLANN:

Fast library for approximate nearest neighbor
 SfM:

Structure from motion
 EPnP:

Efficient PnP
 SVD:

Singular value decomposition
 RANSAC:

RANdom SAmple Consensus
 DL:

Deep learning
 RoI:

Region of interest
 CDF:

Cumulative distribution function
References
 1.
X. Liu, X. Zhang, NOMAbased resource allocation for clusterbased cognitive industrial internet of things. IEEE Trans. Ind. Inform. 16(8), 5379–5388 (2020)
 2.
X. Liu, X.B. Zhai, W. Lu, C. Wu, QoSguarantee resource allocation for multibeam satellite industrial internet of things with NOMA. IEEE Trans Ind. Inform. 17(3), 2052–2061 (2021)
 3.
X. Liu, X. Zhang, Rate and energy efficiency improvements for 5gbased IoT with simultaneous transfer. IEEE Internet Things J. 6(4), 5971–5980 (2019)
 4.
J. Wang, C. Jiang, H. Zhu, Y. Ren, L. Hanzo, Internet of vehicles: Sensingaided transportation information collection and diffusion. IEEE Trans. Veh. Technol. 67(5), 3813–3825 (2018)
 5.
K.N. Qureshi, S. Din, G. Jeon, F. Piccialli, Internet of vehicles: Key technologies, network model, solutions and challenges with future aspects. IEEE Trans. Intell. Transp. Syst. 22(3), 1777–1786 (2021)
 6.
G. Huang, Z.Z. Hu, J. Wu, H.B. Xiao, F. Zhang, WiFi and vision integrated fingerprint for smartphonebased selflocalization in public indoor scenes. IEEE Internet Things J. 7(8), 6748–6761 (2020)
 7.
J. Dong, M. Noreikis, Y. Xiao, A.Y. Jääski, ViNav: a visionbased indoor navigation system for smartphones. IEEE Trans. Mobile Comput. 18(6), 1461–1475 (2019)
 8.
Y.L. Shi, W.M. Zhang, F.X. Li, Q. Huang, Robust localization system fusing vision and lidar under severe occlusion. IEEE Access 8, 62495–62504 (2020)
 9.
X.X. Zuo, P. Geneva, Y.L. Yang, W.L. Ye, Y. Liu, G.Q. Huang, Visualinertial localization with prior LiDAR map constraints. IEEE. Robot. Autom. Lett. 4(4), 3394–3401 (2019)
 10.
R. Huitl, G. Schroth, S. Hilsenbeck, F. Schweiger, E. Steinbach, TUMindoor: an extensive image and point cloud dataset for visual indoor localization, in Proc. of the 19th IEEE Int. Conf. Image Processing. (ICIP), Orlando, FL, USA, Oct (2012), pp. 1773–1776
 11.
H. Xue, L. Ma, X.Z. Tan, A fast visual map building method using video stream for visualbased indoor localization, in Proc. of the Int. Wireless Commun. Mobile Comput. Conf. (IWCMC), Paphos, Cyprus, Sep. (2016), pp. 650–654
 12.
J.Z. Liang, N. Corso, E. Turner, A. Zakhor, Image based localization in indoor environments, in Proc. of the 4th Int. Conf. on Comput. for Geospatial Research and Application, San Jose, CA, USA, Jul. (2013), pp. 70–75
 13.
F. Vedadi, S. Valaee, Automatic visual fingerprinting for indoor imagebased localization applications. IEEE Trans. Syst. Man Cybern. Syst. 50(1), 305–317 (2020)
 14.
X.L. Yin, L. Ma, X.Z. Tan, D.Y. Qin, A SOCPbased automatic visual fingerprinting method for indoor localization. IEEE ACCESS 7, 72862–72871 (2019)
 15.
G. Caso, L.D. Nardis, F. Lemic, V. Handziski, A. Wolisz, M.G.D. Benedetto, ViFi: virtual fingerprinting WiFibased indoor positioning via multiwall multifloor propagation model. IEEE Trans. Mobile Comput. 19(6), 1478–1491 (2020)
 16.
E. Leitinger, F. Meyer, F. Hlawatsch, K. Witrisal, F. Tufvesson, M.Z. Win, A belief propagation algorithm for multipathbased SLAM. IEEE Trans. Wirel. Commun. 18(12), 5613–5629 (2019)
 17.
Y.X. Duan, K.Y. Lam, V.C.S. Lee, W.D. Nie, H. Li, J.K.Y. Ng, Multiple power path loss fingerprinting for sensorbased indoor localization. IEEE Sensors Lett. 1(4), 1–4 (2017)
 18.
B. Xu, X.R. Zhu, H.B. Zhu, An efficient indoor localization method based on the long shortterm memory recurrent neuron network. IEEE Access 7, 123912–123921 (2019)
 19.
T.K. Akino, P. Wang, M. Pajovic, H.J. Sun, P.V. Orlik, Fingerprintingbased indoor localization with commercial MMWave WiFi: a deep learning approach. IEEE Access 8, 84879–84892 (2020)
 20.
X.Y. Wang, L.J. Gao, S.W. Mao, S. Pandey, CSIbased fingerprinting for indoor localization: a deep learning approach. IEEE Trans. Veh. Technol. 66(1), 763–776 (2017)
 21.
C.S. Wu, Z. Yang, Y.H. Liu, Smartphones based crowdsourcing for indoor localization. IEEE Trans. Mobile Comput. 14(2), 444–457 (2015)
 22.
Y. Zhuang, Z. Syed, Y. Li, N.E. Sheimy, Evaluation of two WiFi positioning systems based on autonomous crowdsourcing of handheld devices for indoor navigation. IEEE Trans. Mobile Comput. 15(8), 1982–1995 (2016)
 23.
W.L. Zhao, S. Han, R.Q. Hu, W.X. Meng, Z.Q. Jia, Crowdsourcing and multisource fusionbased fingerprint sensing in smartphone localization. IEEE Sensors J. 18(8), 3236–3247 (2018)
 24.
B.Q. Huang, Z.D. Xu, B. Jia, G.Q. Mao, An online radio map update scheme for WiFi fingerprintbased localization. IEEE Internet Things J. 6(4), 6909–6918 (2019)
 25.
Y.H. Zhao, W.C. Wong, T.Y. Feng, H.K. Garg, Calibrationfree indoor positioning using crowdsourced data and multidimensional scaling. IEEE Trans. Wirel. Commun. 19(3), 1770–1785 (2020)
 26.
J.F. Dai, L. Yi, K.M. He, J. Sun, RFCN: object detection via regionbased fully convolutional networks, in Proc. of the Int. Conf. Neural Inf. Process. Syst. (NIPS), Barcelona, Spain (2016)
 27.
T. Wang, Y.T. Yao, Y. Chen, M.Y. Zhang, F. Tao, H. Snoussi, Autosorting system toward smart factory based on deep learning for image segmentation. IEEE Sensors J. 18(20), 8493–8501 (2018)
 28.
G. Cheng, J.W. Han, P.C. Zhou, D. Xu, Learning rotationinvariant and fisher discriminative convolutional neural networks for object detection. IEEE Trans. Image Process. 28(1), 265–278 (2019)
 29.
M. Braun, S. Krebs, F. Flohr, D.M. Gavrila, EuroCity persons: a novel benchmark for person detection in traffic scenes. IEEE Trans. Pattern Anal. Mach. Intell. 41(8), 1844–1861 (2019)
 30.
C. Zhang, G.Y. Sun, Z.M. Fang, P.P. Zhou, P.C. Pan, J. Cong, Caffeine: toward uniformed representation and acceleration for deep convolutional neural networks. IEEE Trans. Comput. Aided Design Integr. Circuits Syst. 38(11), 2072–2085 (2019)
 31.
Y. Wang, W.X. Chen, J. Yang, T. Li, Exploiting parallelism for CNN application on 3D stacked processinginmemory architecture. IEEE Trans. Parallel Distrib. Syst. 30(3), 589–600 (2019)
 32.
M. Komar, P. Yakobchuk, V. Golovko, V. Dorosh, A. Sachenko, Deep neural network for image recognition based on the caffe framework, in Proc. of the IEEE. 2nd Int. Conf. Data Stream Mining & Processing. (DSMP), Lviv, Ukraine, Aug. (2018), pp. 102–106
 33.
(Mar. 9, 2020). Caffe. Accessed on Mar. 9, 2020. [online]. Available: http://caffe.berkeleyvision.org
 34.
T. Sattler, B. Leibe, L. Kobbelt, Efficient & effective prioritized matching for largescale imagebased localization. IEEE Trans. Pattern Anal. Mach. Intell. 39(9), 1744–1756 (2017)
 35.
D.G. Lowe, Distinctive image features from scaleinvariant keypoints. Int. J. Comput. Vis. 60, 90–110 (2004)
 36.
H. Bay, T. Tuytelaars, L.V. Gool, Speedup robust features (SURF), in Proc. of the European Conf. Comput. Vis. (ECCV), Graz, Austria, May. (2006), pp. 404–417
 37.
M. Muja, D.G. Lowe, Scalable nearest neighbor algorithms for high dimensional data. IEEE Trans. Pattern Anal. Mach. Intell. 36(11), 2227–2240 (2014)
 38.
V. Lepetit, F. MorenoNoguer, P. Fua, EPnP: an accurate O(n) solution to the PnP problem. Int. J. Comput. Vis. 81(2), 155–166 (2009)
 39.
M.A. Fischler, R.C. Bolles, Random sample consensus: a paradigm for model fitting with applications to image analysis and automated cartography. Commun. ACM 24, 381–395 (1981)
 40.
A.B. Hernández, G.H. Peñaloza, D.M. Gutiérrez, F. Álvarez, SWiBluX: multisensor deep learning fingerprint for precise realtime indoor tracking. IEEE Sensors J. 19(9), 3473–3486 (2019)
 41.
C. Ma, J.B. Huang, X.K. Yang, M.H. Yang, Robust visual tracking via hierarchical convolutional features. IEEE Trans. Pattern Anal. Mach. Intell. 41(11), 2709–2723 (2019)
 42.
R.H. Li, S. Wang, D.B. Gu, DeepSLAM: a robust monocular SLAM system with unsupervised deep learning. IEEE Trans. Ind. Electron. 68(4), 3577–3587 (2021)
 43.
G. Costante, M. Mancini, Uncertainty estimation for datadriven visual odometry. IEEE Trans. Robot. 36(6), 1738–1757 (2020)
 44.
N. Radwan, A. Valada, W. Burgard, VLocNet++: deep multitask learning for semantic visual localization and odometry. IEEE Robot. Autom. Lett. 3(4), 4407–4414 (2018)
 45.
M.B. Qi, R. Zhang, J.G. Jiang, X.T. Li, Research of rotatable single camera object localization based on man height model in visual surveillance, in Proc. of the 2nd Int. Conf. Bioinformatics and Biomedical Engineering, Shanghai, China, (2008), pp. 1131–1134
 46.
L. Svärm, O. Enqvist, F. Kahl, M. Oskarsson, Cityscale localization for cameras with known vertical direction. IEEE Trans. Pattern Anal. Mach. Intell. 39(7), 1455–1461 (2017)
 47.
J. Dai, L. Ma, D.Y. Qin, X.Z. Tan, High accurate and efficient image retrieval method using semantics for visual indoor positioning, in Proc. of the IEEE. 8th Int. Conf. Commun., Signal Process., Syst. (CSPS), Urumqi, China, Jul. (2019), pp. 128–136
Acknowledgements
The authors would like to thank the anonymous reviewers for their valuable suggestions.
Author’s information
Xiliang Yin is pursuing his Ph.D. in information and communication engineering, specialises in locationbased service, machine learning, and computer vision, and is a lecturer in Harbin Vocational & Technical College, China.
Lin Ma has a Ph.D. in communication engineering, specialises in locationbased service, cognitive radio, and cellular networks, and is currently an Associate Professor with the school of electronics and information engineering, Harbin Institute of Technology, China.
Ping Sun is pursuing her M. S., specialises in deep learning, and is a graduate student in the school of electronics and information engineering, Harbin Institute of Technology, China.
Xuezhi Tan has a Ph.D in communication engineering, specialises in broadband multimedia trunk communication, cognitive radio network, and is currently an Professor with the school of electronics and information engineering, Harbin Institute of Technology, China.
Funding
This paper is supported by National Natural Science Foundation of China (61971162, 41861134010, 61771186).
Author information
Affiliations
Contributions
XLY developed and implemented the core concepts of the algorithm presented within this manuscript, LM provided refinements and proofreadings, PS provided debugging of deep learning network. XZT revised the introduction and experiment parts. All authors read and approved the final manuscript.
Corresponding author
Ethics declarations
Competing interests
The authors declare that they have no competing interests.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons.org/licenses/by/4.0/.
About this article
Cite this article
Yin, X., Ma, L., Sun, P. et al. A visual fingerprint update algorithm based on crowdsourced localization and deep learning for smart IoV. EURASIP J. Adv. Signal Process. 2021, 84 (2021). https://doi.org/10.1186/s13634021007957
Received:
Accepted:
Published:
Keywords
 Smart IoV
 Visual map
 Deep learning
 Visual localization