Indoor positioning based on the received signal strength (RSS) of the WiFi signal has become the most popular solution for indoor localization. In order to realize the rapid deployment of indoor localization systems, solutions based on crowdsourcing have been proposed. However, compared to conventional methods, lots of different devices are used in crowdsourcing system and less RSS values are collected by each device. Therefore, the crowdsourced RSS values are more erroneous and can result in significant localization errors. In order to eliminate the signal strength variations across diverse devices, the Linear Regression (LR) algorithm is proposed to solve the device diversity problem in crowdsourcing system. After obtaining the uniform RSS values, a graph-based semi-supervised learning (G-SSL) method is used to exploit the correlation between the RSS values at nearby locations to estimate an optimal RSS value at each location. As a result, the negative effect of the erroneous measurements could be mitigated. Since the AP locations need to be known in G-SSL algorithm, the Compressed Sensing (CS) method is applied to precisely estimate the location of the APs. Based on the location of the APs and a simple signal propagation model, the RSS difference between different locations is calculated and used as an additional constraint to improve the performance of G-SSL. Furthermore, to exploit the sparsity of the weights used in the G-SSL, we use the CS method to reconstruct these weights more accurately and make a further improvement on the performance of the G-SSL. Experimental results show improved results in terms of the smoothness of the radio map and the localization accuracy.

With the development of information technology, indoor positioning technology has been rapidly evolving. Due to the advantages of high positioning accuracy, low cost, and wide coverage simultaneously, received signal strength‐ (RSS‐) based WLAN indoor positioning technology has become one of the mainstream technologies. A radio map is the basis for the realization of the WLAN positioning system. However, by reasons of the huge workload of RSS collection, the instability of wireless signal strength, and the disappearance of signals caused by the occlusion of people and objects, the construction of a radio map is time‐consuming and inefficient. In order to rapidly deploy the WLAN indoor positioning system, an improved low‐rank matrix completion method is proposed to construct the radio map. Firstly, we evenly arrange a small number of reference points (RP) in the positioning area and collect RSS data on the RP to construct the radio map. Then, the low‐rank matrix completion method is used to fill a small amount of data in the radio map into a complete database. The Frobenius parameter (F‐parameter) is introduced into the traditional low‐rank matrix completion model to control the instability of the model solution when filling the data. To solve the noise problem caused by environment and equipment, a low‐rank matrix recovery algorithm is used to eliminate noise. The experimental results show that the improved algorithm achieves the expected goal.

This paper introduces a novel action recognition model named ViT-Shift, which combines the Time Shift Module (TSM) with the Vision Transformer (ViT) architecture. Traditional video action recognition tasks face significant computational challenges, requiring substantial computing resources. However, our model successfully addresses this issue by incorporating the TSM, achieving outstanding performance while significantly reducing computational costs. Our approach is based on the latest Transformer self-attention mechanism, applied to video sequence processing instead of traditional convolutional methods. To preserve the core architecture of ViT and transfer its excellent performance in image recognition to video action recognition, we strategically introduce the TSM only before the multi-head attention layer of ViT. This design allows us to simulate temporal interactions using channel shifts, effectively reducing computational complexity. We carefully design the position and shift parameters of the TSM to maximize the model’s performance. Experimental results demonstrate that ViT-Shift achieves remarkable results on two standard action recognition datasets. With ImageNet-21K pretraining, we achieve an accuracy of 77.55% on the Kinetics-400 dataset and 93.07% on the UCF-101 dataset.

Due to the heavy workload of RSS collection, the instability of WLAN signal strength and the disappearance of signals caused by complex indoor environments, the construction of radio map for wireless local area network (WLAN) fingerprint-based indoor positioning system is time-consuming and laborious. In order to rapidly deploy indoor WLAN positioning system, the bidirectional encoder representation from transformers (BERT) model is used to fill the missing signal in radio map and quickly build radio map. The radio map is imported into the BERT model in the form of natural language text, and the missing signal is filled by the BERT model. Since the number of input data in BERT model cannot exceed 512 words, the structure of BERT model is not suitable for WLAN signals with large data volume. Therefore, we redefine the model structure based on the original BERT model and fill in the missing signals in the radio map in parallel. In addition, the loss function is redefined. Except that each segment has a loss function, the weighted average value of all segment loss functions is defined as the total loss function. The experimental results show that the BERT model is better than the traditional linear interpolation method, compressed sensing algorithm and matrix completion algorithm in filling the missing signals in the fingerprint database, and the probability of error within 2 m reaches about 94%.

The feature point method is the mainstream method to accomplish inter-frame estimation in visual Simultaneous Localization and Mapping (SLAM) methods, among which the Oriented FAST and Rotated BRIEF (ORB) feature-based method provides an equilibrium of accuracy as well as efficiency. However, the ORB algorithm is prone to clustering phenomena, and its unequal distribution of extracted feature points is not conducive to the subsequent camera tracking. To solve the above problems, this paper suggests an adaptive feature extraction algorithm that first constructs multiple-scale images using an adaptive Gaussian pyramid algorithm, calculates adaptive thresholds, and uses an adaptive meshing method for regional feature point detection to adapt to different scenes. The method uses Adaptive and Generic Accelerated Segment Test (AGAST) to speed up feature detection and the non-maximum suppression method to filter feature points. The feature points are then divided equally by a quadtree technique, and the orientation of those points is determined by an intensity centroid approach. Experiments were conducted on publicly available datasets, and the outcomes demonstrate the algorithm has good adaptivity and solves the problem of a large number of corner point clusters that may result from using manually set detection thresholds. The RMSE of the absolute trajectory error of SLAM applying this method on four sequences of TUM RGB-D datasets is decreased by 13.88% when compared with ORB-SLAM3. It is demonstrated that the algorithm provides high-quality feature points for subsequent image alignment, and the application to SLAM improves the reliability and accuracy of SLAM.

Extracting traffic information from images plays an increasingly significant role in Internet of vehicle. However, due to the high-speed movement and bumps of the vehicle, the image will be blurred during image acquisition. In addition, in rainy days, as a result of the rain attached to the lens, the target will be blocked by rain, and the image will be distorted. These problems have caused great obstacles for extracting key information from transportation images, which will affect the real-time judgment of vehicle control system on road conditions, and further cause decision-making errors of the system and even have a bearing on traffic accidents. In this paper, we propose a motion-blurred restoration and rain removal algorithm for IoV based on generative adversarial network and transfer learning. Dynamic scene deblurring and image de-raining are both among the challenging classical research directions in low-level vision tasks. For both tasks, firstly, instead of using ReLU in a conventional residual block, we designed a residual block containing three 256-channel convolutional layers, and we used the Leaky-ReLU activation function. Secondly, we used generative adversarial networks for the image deblurring task with our Resblocks, as well as the image de-raining task. Thirdly, experimental results on the synthetic blur dataset GOPRO and the real blur dataset RealBlur confirm the effectiveness of our model for image deblurring. Finally, as an image de-raining task based on transfer learning, we can fine-tune the pre-trained model with less training data and show good results on several datasets used for image rain removal.