A real-time fingerprint-based indoor positioning using deep learning and preceding states

In fingerprint-based positioning methods, the received signal strength (RSS) vectors from access points are measured at reference points and saved in a database. Then, this dataset is used for the training phase of a pattern recognition algorithm. Several noise types impact the signals in radio channels, and RSS values are corrupted correspondingly. These noises can be mitigated by averaging the RSS samples. In real-time applications, the users cannot wait to collect uncorrelated RSS samples to calculate their average in the online phase of the positioning process. In this paper, we propose a solution for this problem by leveraging the distribution of RSS samples in the offline phase and the preceding state of the user in the online phase. In the first step, we propose a fast and accurate positioning algorithm using a deep neural network (DNN) to learn the distribution of available RSS samples instead of averaging them at the offline phase. Then, the similarity of an online RSS sample to the RPs’ fingerprints is obtained to estimate the user’s location. Next, the proposed DNN model is combined with a novel state-based positioning method to more accurately estimate the user’s location. Extensive experiments on both benchmark and our collected datasets in two different scenarios (single RSS sample and many RSS samples for each user in the online phase) verify the superiority of the proposed algorithm compared with traditional regression algorithms such as deep neural network regression, Gaussian process regression, random forest, and weighted KNN

The mean reverting Ornstein-Uhlenbeck processes with nonlinear autoregressive drift term innovations

The main purpose of this paper is to present a new approach for energy markets governed by a two-factor Ornstein-Uhlenbeck process with a stochastic nonlinear autoregressive drift term innovation and an unknown diffusion coefficient. This model has interesting characteristics: since the drift is stochastic, it allows for price to fluctuate around a level that is not fixed. A semiparametric method is proposed to estimate the nonlinear regression function based on the conditional least square method for parametric estimation and the nonparametric kernel approach for the AR adjustment estimation. For estimating the diffusion coefficient of the Ornstein-Uhlenbeck process from discretely observed data a semiparametric approach based on the least-squares estimator is carried out. Finally, numerical simulations are performed using Matlab programming to show efficiency and the accuracy of the present work.Publisher's Versio

Sensor Fusion for Object Detection and Tracking in Autonomous Vehicles

Autonomous driving vehicles depend on their perception system to understand the environment and identify all static and dynamic obstacles surrounding the vehicle. The perception system in an autonomous vehicle uses the sensory data obtained from different sensor modalities to understand the environment and perform a variety of tasks such as object detection and object tracking. Combining the outputs of different sensors to obtain a more reliable and robust outcome is called sensor fusion. This dissertation studies the problem of sensor fusion for object detection and object tracking in autonomous driving vehicles and explores different approaches for utilizing deep neural networks to accurately and efficiently fuse sensory data from different sensing modalities. In particular, this dissertation focuses on fusing radar and camera data for 2D and 3D object detection and object tracking tasks. First, the effectiveness of radar and camera fusion for 2D object detection is investigated by introducing a radar region proposal algorithm for generating object proposals in a two-stage object detection network. The evaluation results show significant improvement in speed and accuracy compared to a vision-based proposal generation method. Next, radar and camera fusion is used for the task of joint object detection and depth estimation where the radar data is used in conjunction with image features to generate object proposals, but also provides accurate depth estimation for the detected objects in the scene. A fusion algorithm is also proposed for 3D object detection where where the depth and velocity data obtained from the radar is fused with the camera images to detect objects in 3D and also accurately estimate their velocities without requiring any temporal information. Finally, radar and camera sensor fusion is used for 3D multi-object tracking by introducing an end-to-end trainable and online network capable of tracking objects in real-time

Confidence interval estimation for fingerprint-based indoor localization

Fingerprint-based localization methods provide high accuracy location estimation, which use machine learning algorithms to recognize the statistical patterns of collected data. In these methods, the users’ locations can be estimated based on the received signal strength vectors from some transmitters. However, the data collection is a labor-intensive phase, and the collected data should be updated periodically. Many researchers have contributed to reducing this cost. The easiest way to remove the data collection cost is to use fingerprints generated by the model-based approaches, in which the trained machine learning algorithm can be updated based on the environment changes. Probabilistic-based localization algorithms, in addition to the user location, can estimate a region of interest called 2σ confidence interval in which the probability of user presence is 95%. Gaussian process regression (GPR) is a probabilistic method that can be used to achieve this goal. However, conventional GPR (CGPR) cannot accurately estimate the confidence interval when noise-free fingerprints generated by the model-based approaches are used in the training phase. In this paper, we propose a novel GPR-based localization algorithm, named enhanced GPR (EGPR), which improves the accuracy level of confidence interval estimation compared to the existing methods while fixing the level of computational complexity in the online phase. We also theoretically prove that GPR-based algorithms are minimum variance unbiased and efficient estimators. Experiments under line-of-sight and non-line-of-sight conditions demonstrate the superiority of our proposed method over counterparts in terms of accuracy as well as applicability in real-time localization systems

Joint Coordinate Optimization in Fingerprint-Based Indoor Positioning

Fingerprint-based indoor positioning uses pattern recognition algorithms (PRAs) to estimate the users’ locations in wireless local area network environments, where satellite-based positioning methods cannot work properly. Traditionally, the training phase of PRA is separately conducted for \u1d465 and \u1d466 coordinates. However, the received signal strength from access points is a unique fingerprint for each measured point, not for \u1d465 and \u1d466 coordinates separately. In this letter, we propose a method to jointly employ the \u1d465 and \u1d466 coordinates during the training phase using a novel PRA-based Gaussian process regression (GPR), named 2D-GPR. Experimental results show that the proposed 2D-GPR improves the accuracy of positioning more than 40\u1d450\u1d45a in limited data samples and has a lower calculation cost compared with conventional GPR

CSI-Based Human Activity Recognition Using Multi-Input Multi-Output Autoencoder and Fine-Tuning

Wi-Fi-based human activity recognition (HAR) has gained considerable attention recently due to its ease of use and the availability of its infrastructures and sensors. Channel state information (CSI) captures how Wi-Fi signals are transmitted through the environment. Using channel state information of the received signals transmitted from Wi-Fi access points, human activity can be recognized with more accuracy compared with the received signal strength indicator (RSSI). However, in many scenarios and applications, there is a serious limit in the volume of training data because of cost, time, or resource constraints. In this study, multiple deep learning models have been trained for HAR to achieve an acceptable accuracy level while using less training data compared to other machine learning techniques. To do so, a pre-trained encoder which is trained using only a limited number of data samples, is utilized for feature extraction. Then, by using fine-tuning, this encoder is utilized in the classifier, which is trained by a fraction of the rest of the data, and the training is continued alongside the rest of the classifier’s layers. Simulation results show that by using only 50% of the training data, there is a 20% improvement compared with the case where the encoder is not used. We also showed that by using an untrainable encoder, an accuracy improvement of 11% using 50% of the training data is achievable with a lower complexity level

Representation-Driven Reinforcement Learning

We present a representation-driven framework for reinforcement learning. By representing policies as estimates of their expected values, we leverage techniques from contextual bandits to guide exploration and exploitation. Particularly, embedding a policy network into a linear feature space allows us to reframe the exploration-exploitation problem as a representation-exploitation problem, where good policy representations enable optimal exploration. We demonstrate the effectiveness of this framework through its application to evolutionary and policy gradient-based approaches, leading to significantly improved performance compared to traditional methods. Our framework provides a new perspective on reinforcement learning, highlighting the importance of policy representation in determining optimal exploration-exploitation strategies.Comment: Accepted to ICML 202