Improved Graph-Based Semi-Supervised Learning for Fingerprint-Based Indoor Localization

In location fingerprinting based indoor positioning system, received signal strength (RSS) indications from a set of Wi-Fi access points are used as a unique fingerprint to identify a specific location. However these RSS fingerprints may become outdated when there are unanticipated environmental changes. Re-measuring RSS fingerprints for all locations to maintain an up-to-date RSS database incurs high operational cost, which is impractical in dynamically changed environment. In this paper, we propose a method to estimate the RSS fingerprint of a specific location from a set of neighboring re-measured RSS fingerprints, called “feedbacks”. The proposed method searches for new feedbacks and some necessary old RSS fingerprints in the cut-off area and then applies plane-interpolation to calculate the new RSS fingerprint for a specific location. Based on simulation results, about 5% of re-measured RSS feedbacks are required to satisfy 80% of positioning correctness in the simulated 30×30 m <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">2</sup> area.

WiFi-based indoor positioning is widely exploited thanks to the existing WiFi infrastructure in buildings and built-in sensors in smartphones. The techniques for indoor positioning require the high-density training data to archive high accuracy with high computation complexity. In this paper, the approach for indoor positioning systems which is called the maximum convergence algorithm is proposed to find the accurate location by the strongest receiver signal in the small cluster and K nearest neighbours (KNN) of other clusters. Also, the K-mean clustering is deployed for each access point to reduce the computation complexity of the offline databases. Moreover, the pedestrian dead reckoning (PDR) method and Kalman filter with the information from the received signal strength (RSS) and inertial sensors are applied to the WiFi fingerprinting to increase the efficiency of the mobile object's position. The different experiments are performed to compare the proposed algorithm with the others using KNN and PDR. The recommended framework demonstrates significant proceed based on the results. The average precision of this system can be lower than 1.02 meters when testing in the laboratory environment with an area of 7x7 m using three access points.

A novel indoor localization method for Wi-Fi devices such as smart phones is presented. With an indoor path loss model, the distance between a mobile device (MD) and an access point (AP) can be estimated form the received signal strength (RSS). Then, least-squared-error (LSE) triangulation yields the position of the MD. Though indoor channel characteristics are highly fluctuating with perturbations, a reference point (RP) can be used to compensate for channel instability. We present two contributions: cross monitoring AP and weighted triangulation. Cross monitoring AP removes the need of deploying RPs since it can play the dual role of a regular AP and a RP. Weighted triangulation yields improvement in the accuracy of LSE estimation of the MD position. Experimental results show weighted triangulation with cross monitoring AP provides indoor localization with an error less than 2 meters.

High-precision indoor localization systems (ILSs) are critical for applications such as human smartphone navigation, autonomous robotics and automated warehouse and factory design. This paper presents a novel fingerprinting-based ILS, which features a decimeter-level localization accuracy, the ability to function in a constantly changing non line-of-sight (NLoS) environment, and user privacy protection without the need for heavy computations. The proposed ILS is able to maintain its localization accuracy in a constantly changing environment and to camouflage the user’s location by leveraging multipath propagation. The method was successfully tested both by experimental verification using the ultra-wideband communication standard and a ray-tracing simulation. An average localization error of 6 cm is demonstrated for a stationary or slow-moving receiver. An average error of 30 cm is demonstrated for a receiver that is moving at a fast walking pace. The obtained localization accuracy is comparable to the accuracy of the state-of-the-art localization algorithms. At the same time, the proposed approach solves two practical challenges faced by ILSs: robustness to changing environments with moving objects and the high computation requirements of user privacy protection. The high degree of user privacy was evaluated using a set of corresponding metrics.

WiFi fingerprint based indoor localization has become a key research direction in the field of indoor localization due to its high positioning accuracy and low equipment deployment cost. Increasing the number of reference point collected offline can improve the positioning accuracy, however it yields excessive cost of offline collection. Fingerprint augment is an effective solution to reduce the cost while ensuring the positioning accuracy. In this paper, we are pioneering to propose a fingerprint augment framework based on super-resolution (FASR), which achieves the fusion of fingerprint augment and super-resolution based on mutual conversion between fingerprint data and fingerprint image. The processing framework of FASR is formulated and the implementation of three modules in FASR are given, including Fingerprint-To-Image Conversion module, Super-Resolution module and Image-To-Fingerprint Conversion module. Simulated and real data experiments reveal the feasibility and effectiveness of the FASR. In addition, we explore the impact of two key engineering parameters on the performance of the FASR method. Our work demonstrates the new application of super-resolution in image processing field in wireless indoor localization topics.

Location-based services have become of great importance to a wide range of applications in the era of mobile computing. Various wireless indoor localization techniques are emerging. Due to the wide deployment and availability of WiFi infrastructure, WiFi fingerprint-based indoor localization has become one of the most attractive localization techniques. Site survey to build WiFi fingerprint library and fingerprint matching-based real-time positioning are based on WiFi indoor localization method two basic stages. Equipment heterogeneity and environmental dynamics are two main factors affecting indoor localization accuracy. In order to solve these problems, an algorithm based on Hierarchical Edit Distance(HED) function is proposed to realize calibrations-free fingerprint comparison of heterogeneous devices. RSSI information collected by different mobile devices is transformed into AP sequence. The hierarchical energy level of each AP is calculated according to the difference of the RSSI values. Then the distance between the WiFi fingerprints is calculated by edit distance. In order to locate WiFi fingerprint RSSI information, we use HED to obtain K neighbors, and use the WKNN algorithm to predict position. In order to verify robustness and effectiveness of the algorithm, five different mobile devices were used to collect WiFi RSSI information in three different types of indoor environments. The average localization accuracy was 1.5m.

Aim: Prediction of coronary illness utilizing novel Novel k nearest neighbor (KNN) and contrasting its accuracy with decision tree algorithm. Materials and Methods: Two gatherings are proposed for foreseeing the accuracy (%) of coronary illness. To be specific, novel Novel k nearest neighbor and decision tree algorithm. Here we take 20 examples each for assessment and look at. The sample size was calculated using G power with pretest power at 80% and the alpha of 0.05 value. Result: The decision tree gives better accuracy (84.95%) contrasted with the Novel k nearest neighbor accuracy (76.29 %). Along these lines the factual meaning of the decision tree is superior to the novel k nearest neighbor algorithm with significance value of 0.115. Conclusion: From the outcome, it may very well be inferred that the decision tree helps in anticipating the coronary illness with more precision contrasted with the novel k nearest neighbor algorithm.

An RSS transform–based weighted k-nearest neighbor (WKNN) indoor positioning algorithm, Q-WKNN, is proposed to improve the positioning accuracy and real-time performance of Wi-Fi fingerprint–based indoor positioning. To smooth the RSS fluctuation difference caused by acquisition equipment, time, and environment changes, base Q is introduced in Q-WKNN to transform RSS to Q-based RSS, based on the relationship between the received signal strength (RSS) and physical distance. Analysis of the effective range of base Q indicates that Q-WKNN is more suitable for regions with noticeable environmental changes and fixed access points (APs). To reduce the positioning time, APs are selected to form a Q-WKNN similarity matrix. Adaptive K is applied to estimate the test point (TP) position. Commonly used indoor positioning algorithms are compared to Q-WKNN on Zenodo and underground parking databases. Results show that Q-WKNN has better positioning accuracy and real-time performance than WKNN, modified-WKNN (M-WKNN), Gaussian kernel (GK), and least squares-support vector machine (LS-SVM) algorithms.

The increasing demand of indoor Location Based Services (LBS) has made Indoor Positioning System (IPS) a hot research topic. Recently, various machine learning techniques have been developed to tackle the problems of IPS. The WLAN fingerprinting technique is one of the most cost effective choices for IPS due to the use of existing Wi-Fi networks in commercial and public buildings. However, the variation of Received Signal Strength (RSS) at any specific location due to the indoor fading issue leads to serious challenges in the accuracy of the distance estimates. In this paper, we propose a new technique by using Probabilistic Neural Network (PNN) multi-classifier based on Multiple Service Set Identifiers (MSSIDs) that are configured on the same access point. A spatial voting scenario for three PNN-classifiers is proposed as a tool to determine the location of the user. Using a spatial voting based technique is specifically designed to tackle the negative impact of the multi-path propagation on the performance of IPS. The proposed system is performed inside the College of Engineering and Applied Sciences (CEAS) at Western Michigan University. The performance of the proposed system compared with some of the common methods such as K-Nearest Neighbors (K-NN) and multi-class support vector machine (SVM). According to the experimental results, the spatial voting of the three PNN-dassifiers can significantly mitigate the adverse effects of RSS variation. The performance of the multi-classifier exhibits superior performance to that of the other single classifiers in all Area of Interest (AOI). Over 3000 m2 AOI, the proposed system achieves localization accuracy < 0.73m and with precision 90 % of the distance error less than 2m.

With growing technology, Location Based Services (LBSs) are becoming a vital part of life. The rapid development of mobile internet has offered an opportunity for Wi-Fi indoor positioning to come under the spotlight due to its low cost. Here, indoor positioning is performed using Wi-Fi. The earlier solutions like GPS does not provide efficient positioning in indoor environment due to weak signal reception which makes Wi-Fi more reliable. However, nowadays the accuracy of the traditional indoor positioning algorithms like trilateration cannot meet the practical requirement. This paper proposes the performance analysis of indoor positioning algorithms using Wi-Fi technology based on Received Signal Strength (RSS) from the access points in the network. The positioning algorithms are based on location fingerprinting consisting of two stages: The offline database creation and the online positioning. The RSS values obtained by the mobile device at reference points are sent to the server where all the location fingerprints of all reference points are stored in a database. Coordinates of user position are calculated using positioning algorithms and the position is displayed in terms of 2Dcoordinates of the room and indoor map. Basic Fingerprint algorithm, RSS Fingerprint with minimum Euclidean Distance algorithm and RSS Fingerprint with Euclidean Distance and k-nearest neighbors' algorithm were implemented. Moreover comparison of their performance was carried out in terms of accuracy of position. From the result, it is found that an average accuracy of 0.4962 meters was achieved by RSS Fingerprint with minimum Euclidean distance algorithm.

Fingerprinting based localization is one of the most widely used indoor localization methods. This method is divided into two phases: during the off-line training phase, fingerprints within the area of interest are collected and stored in a fingerprint database; during the on-line mapping phase, the real-time location of a device is estimated by mapping itself to the most accurate fingerprint in the database. The efficiency of the mapping process is one of the key challenges of the on-line phase, and is mostly characterized by the localization accuracy and the response time. Clustering methods have been introduced to reduce computational overhead. In this paper, we propose a dynamic clustering method leveraging the inertial information of the target device. An active area is dynamically computed around the prior position. The target mapping space is significantly reduced with this active area. This method can be integrated with other clustering algorithms to overcome the edge problem and remove outliers. We evaluate this method compared with the state-of-the-art methods on a body sensor based localization system. The results show that the accuracy, precision and response time of the system are improved greatly.

Introduction: Propensity score matching (PSM) is a method to reduce the impact of essential and confounders. When the number of confounders is high, there may be a problem of matching, in which, finding matched pairs for the case group is difficult, or impossible. The propensity score (PS) minimizes the effect of the confounders, and it is reduced to one dimension. There are various algorithms in the field of PSM. This study aimed to compared the nearest neighbor and caliper algorithms. Methods: Data obtained in this study were from patients undergoing angiography at Ghaem Hospital in Mashhad, between 2011-12. The study was a retrospective case-control using PSM. In total, 604 patients were included in the case and control groups. A logistic regression model was used to calculate the propensity score and adjust the variables, such as age, gender, Body Mass Index (BMI), systolic blood pressure, smoking status, and triglyceride. Then, the Odds Ratios (ORs) with 95% Confidence Intervals (CIs) for the raw data and two matching algorithms were determined to examine the relationship between type 2 diabetes and coronary artery disease (CAD). Results: Propensity score in the nearest neighbor and caliper algorithms matched the total number of 604 samples, 200 and 178 pairs, respectively. All variables were significantly different between the two groups before matching (P&lt;0.05). The gender was significantly different between the two groups after matching using the nearest neighbor algorithm (P=0.002). No variables created a significant difference between the two groups after matching with the caliper algorithm. Conclusion: Bias reduction in the caliper algorithm was greater than for the nearest neighbor algorithm for all variables except the triglyceride variable.

Localization technologies play an important role in disaster management and emergence response. In areas where the environment does not change much after an accident or in the case of dangerous areas monitoring, indoor fingerprint-based localization can be used. In such scenarios, a positioning system needs to have both a high accuracy and a rapid response. However, these two requirements are usually conflicting since a fingerprint-based indoor localization system with high accuracy usually has complex algorithms and needs to process a large amount of data, and therefore has a slow response. This problem becomes even worse when both the size of monitoring area and the number of reference nodes increase. To address this challenging problem, this paper proposes a two-level positioning algorithm in order to improve both the accuracy and the response time. In the off-line stage, a fingerprint database is divided into several sub databases by using an affinity propagation clustering (APC) algorithm based on Shepard similarity. The online stage has two steps: (1) a coarse positioning algorithm is adopted to find the most similar sub database by matching the cluster center with the fingerprint of the node tested, which will narrow the search space and consequently save time; (2) in the sub database area, a support vector regression (SVR) algorithm with its parameters being optimized by particle swarm optimization (PSO) is used for fine positioning, thus improving the online positioning accuracy. Both experiment results and actual implementations proved that the proposed two-level localization method is more suitable than other methods in term of algorithm complexity, storage requirements and localization accuracy in dangerous area monitoring.

Aim: Coronary illness is one of the main sources of mortality in this current world. A basic test in the field of clinical information assessment is the expectation of cardiovascular infection. The fundamental target of this paper is to work on the exactness of the Data mining algorithms being used to improve heart disease prediction. We will be comparing the novel Random forest with K Nearest Neighbor to find out which of these can give us the best accuracy. Material and Methods: The study used 98 samples with Novel Random Forest and K Nearest Neighbor is executed with varying training and testing splits for predicting the accuracy for heart disease prediction with the 80% of G-power value and data about cardiovascular disease was gathered from numerous web sources, including latest research findings and threshold 0.05%, confidence interval 95% mean and standard deviation. The performance of the accuracy rate of the classifiers is examined using the heart disease dataset.. There was a statistical insignificant difference among Innovative Random Forest and K Nearest Neighbor p = 0.484 (p&gt;0.05). Results and Discussion: The accuracy of predicting heart disease in Novel Random Forest 90.16% and K Nearest Neighbor 67.21% is obtained. Conclusion: Prediction of Heart disease using the innovative Random Forest (RF) technique appears to be a significant improvement over the K Nearest Neighbor (KNN) algorithm in terms of accuracy.

Indoor positioning systems (IPS) have been recently adopted by many researchers for their broad applications in various Internet of Things (IoT) fields such as logistics, health, construction industries, and security. Received Signal Strength (RSS)-based fingerprinting approaches have been widely used for positioning inside buildings because they have a distinct advantage of low cost over other indoor positioning techniques. The signal power RSS is a function of the distance between the Mobile System (MS) and Access Point (AP), which varies due to the multipath propagation phenomenon and human body blockage. Furthermore, fingerprinting approaches have several disadvantages such as labor cost, diversity (in signals and environment), and computational cost. Eliminating redundancy by ruling out non-informative APs not only reduces the computation time, but also improves the performance of IPS. In this article, we propose a dimensionality reduction technique in a multiple service set identifier-based indoor positioning system with Multiple Service Set Identifiers (MSSIDs), which means that each AP can be configured to transmit N signals instead of one signal, to serve different kinds of clients simultaneously. Therefore, we investigated various kinds of approaches for the selection of informative APs such as spatial variance, strongest APs, and random selection. These approaches were tested using two clustering techniques including K-means and Fuzzy C-means. Performance evaluation was focused on two elements, the number of informative APs versus the accuracy of the proposed system. To assess the proposed system, real data was acquired from within the College of Engineering and Applied Sciences (CEAS) at the Western Michigan University (WMU) building. The results exhibit the superiority of fused Multiple Service Set Identifiers (MSSID) performance over the single SSID. Moreover, the results report that the proposed system achieves a positioning accuracy &lt;0.85 m over 3000 m2, with an accumulative density function (CDF) of 88% with a distance error of 2 m.