# Patent

## Title
System, method and computer program for anonymous localization

## Abstract

The present disclosure provides a system, method and computer program for anonymous localization. The location of a mobile device can be determined based on signal strength from one or more access points and a radio map. A radio map can be generated by measuring signal strength at a set of fingerprints, which are a finite set of reference points within the area to be mapped.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a continuation of U.S. patent application Ser. No. 12/966,493 filed on Dec. 13, 2010, which is hereby incorperated in its entirety by reference.


FIELD OF THE INVENTION
The present invention relate generally to determining a location of a network connected mobile device. The present invention relates more specifically to determining the location of the network connected mobile device based on received signal strength and a radio map.
BACKGROUND OF THE INVENTION
Recent advances in smart phones have made it feasible to provide indoor Location-Based Services; (LBSs) including through, low cost Wireless Local Area Network (WLAN) infrastructures, such as indoor positioning, tracking, navigation, and location-based security. However, due to the complexity of the indoor environment, it is usually difficult to provide a satisfactory level of accuracy in most applications. Thus, one of the key challenges arises: how to design an accurate and real-time indoor positioning system that can be easily deployed on commercially available mobile devices without any hardware installation or modification.
Received Signal Strength (RSS)-based localization algorithms have been extensively studied as an inexpensive solution, for indoor positioning in recent years. Compared with other measurement-based algorithms (e.g. time of-arrival (TOA) or angle-of-arrival (AOA) measurements of ultra-wideband (UWB) signal), RSS can be easily obtained by a WiFi-integrated mobile device, without any additional hardware. Several ESS-based indoor positioning and tracking algorithms have been proposed based on the position information of access points (APs), which may result in labor overheads for the installation of infractures in real applications.
The key challenge for accurate RSS-based positioning comes from the variations of RSS due to the dynamic and unpredictable nature of radio channels, such as shadowing, multipath, interference, the orientation of wireless device, etc.
Also, as is well known GPS still does not provide optimal foundation for indoor LBSs because of signal outages, positional inaccuracies, and other technical problems prevent localization and tracing.
Certain mobile devices (such as those using the ANDROIDTM operating system) are configured to enable the localization of the device hut generally based on communication with a central server with which the mobile device checks in intermittently, providing current location information for the mobile device. Many users however are concerned about the privacy implications of their movements being traced by a remote computer. Furthermore, privacy breaches caused by dealings between individuals and web companies have become very public and have heightened concern around possible privacy implications of LBSs in particular. Certain information services, delivered to or using mobile devices may require some exposure of some location information associated with the user of the mobile device, however, this may be acceptable to the user if they were able to regulate this exposure, which prior art technologies do not permit.
Therefore, what is required is a system and method for localization of a mobile device and tracing of a mobile device, that provides effective support for LBSs including in indoor environments. There is a further need for a system and method for localization of a mobile device that enables LBSs, while maintaining privacy or enabling the user of the mobile device to control exposure of location information to remote computers.
SUMMARY OF THE INVENTION
The present invention provides a system for localization of a mobile device, the system comprising: (a) one or more network access points each emitting a signal; (b) a network accessible server; (c) a fingerprint database linked to the server, the fingerprint database providing a radio map based on received signal strength from the one or more network access points at one or more reference points and (d) a mobile device, the mobile device linked to: (i) a network adaptor operable to receive the signal from the one or more access points; and (ii) a localization engine operable to obtain the radio map or a subset thereof from the server, and to determine the location of the mobile device based on the radio map and the received signal from the one or more access points.
The present invention also provides a method for localization of a mobile device, the method comprising: (a) providing a radio map based on received signal strength of one or more signals emitted from one or more network access points at one or more reference points; and (b) enabling a mobile device to: (i) receive, by means of a network adaptor linked to the mobile device, the signal from the one or more access points; (ii) obtain the radio map or a subset thereof; and (iii) determine, by means of a localization engine linked to the mobile device, the location of the mobile device based on the radio map and the received signal from the one or more access points.
Other features and advantages of the present invention will become apparent from the following detailed description and accompanying drawings. It should be understood, however, that the detailed description and specific examples are given by way of illustration and not limitation. Many modifications and changes within the scope of the present invention may be made without departing from the spirit thereof, and the invention includes all such modifications.



DESCRIPTION OF THE DRAWINGS
The invention will be better understood and objects of the invention will become apparent when consideration is given to the following detailed description thereof. Such description makes reference to the annexed drawings wherein:
FIG. 1 illustrates a system in accordance with the present invention.
FIG. 2 illustrates a block diagram of the radio mapping utility and localization engine.
FIG. 3 illustrates tracking update analysis.
FIG. 4 illustrates a point in close range to a line segment.
FIG. 5 illustrates an example of the clustering result on a PDA using affinity propagation on the radio map at the north orientation.
FIG. 6 illustrates the implementation result of the average localization error with respect to the number of access points used, under different number of clusters generated in all four orientations.
FIG. 7 illustrates the CDF of the localization error of the positioning system under different coarse localization schemes, when 10 APs are used.
FIG. 8 illustrates the implementation result of the average localization error under different AP selection schemes.
FIG. 9 illustrates the cumulative error distribution for kernel-based method, kNN, and the proposed CS-based method.
FIG. 10 illustrates recovery of the radio map during the offline phase using the theory of compressive sensing.
FIG. 11 illustrates a comparison of the localization accuracy using actual RSS measurements at 72 reference points, the recovered RSS radio map from samples on 36 reference points, and that using interpolated RSS radio map.
FIG. 12 illustrates a modular overview for implementing the computer program of the present invention.
FIG. 13 illustrates a comparison of localization accuracy of a mobile user for different positioning and tracking schemes.
FIG. 14 illustrates cumulative error probability using 10 APs.
FIG. 15 illustrates the connected graph defined in CNIB to be used for path routing.
FIG. 16 illustrates a screenshot of the computer program of the present invention showing the actual tracks that the user is walking. The line shows the routed path generated by the navigation module. The squares denote the user's locations and the circle denotes the destination.



In the drawings, embodiments of the invention are illustrated by way of example. It is to be expressly understood that the description and drawings are only for the purpose of illustration and as an aid to understanding, and are not intended as a definition of the limits of the invention.
DETAILED DESCRIPTION
The present invention provides a system, method and computer program for anonymous localization. The location of a mobile device can be determined based on received signal strength (RSS) from one or more access points (APs) and a radio map. A radio map can be generated by measuring RSS at a set of fingerprints, which are a finite set of reference points within the area to be mapped.
The present invention enables the mobile device to measure RSS and compare RSS to the radio map in order to determine its location without providing the RSS measurements to a server or other third party, thus enabling anonymous localization. Furthermore, the location of the APs does not need to be known in order to generate the radio map or determine the location of a mobile device.
The present invention comprises two phases: an offline phase for generating or reconstructing a radio map, and an online phase for localization. A radio mapping utility linked to a mobile device may implement the offline phase, while a localization engine linked to the mobile device may implement the online phase.
The radio mapping utility may generate the radio map by implementing a clustering technique, such as affinity propagation, followed by an outlier adjustment to address the effects of RSS variations. A compressive sensing algorithm may be used by the radio mapping utility to reconstruct the radio map based on RSS measurements at a subset of fingerprints, reducing the number of measurements significantly for updating the radio map.
The localization engine implements one or more algorithms to determine the location of the mobile device based on the measured RSS. One such algorithm is the k-nearest neighbor algorithm (kNN), which estimates the mobile device's location by computing the centroid of the k closest neighbors that have the smallest Euclidean distance with respect to the online RSS readings. Another algorithm is a statistical method, in which the probability of each potential position is analyzed using the Bayesian theory and kernel functions, assuming that RSS readings from different APs are independent at every time instant. A less computationally complex algorithm, which therefore enables real-time or near real-time performance, is a compressive sensing (CS) algorithm for recovering signals that are sparse or compressible under a certain basis, with far fewer noisy measurements than that needed by the Nyquist sampling theorem. The sparse signal can be reconstructed exactly with high probability by solving an l 1-minimization problem. Due to the sparse nature of localization in the spatial domain, the CS algorithm, which offers exact deterministic recovery using a linear programming, is preferable.
In another aspect of the invention, the online phase is divided into two stages: (1) a coarse localization stage to reduce the region of interest; and (2) a fine localization stage to determine an accurate location. The use of two stage localization can significantly reduce processing requirements, thereby enabling real-time or near real-time localization of a mobile device. The localization engine preferably implements a cluster matching algorithm in the coarse localization stage and a compressive sensing algorithm in the fine localization stage.
Additionally, past position estimates and motion dynamics can be used in the coarse localization stage to more accurately reduce the region of interest. The motion dynamics can be modeled by a general Bayesian tracking model and a filter can then be derived to refine the position estimates. By assuming the Gaussian tracking noise model and linear motion dynamics, the general filter becomes a Kalman filter, whose optimal solution is a minimum mean square error (MMSE) estimate. Although the assumption of Gaussian RSS-position relationship is not often the case, the application of the Kalman filter as the post-processing step is able to improve the accuracy of the positioning systems. The accuracy of the estimate can be improved further by using a particle filter. This filter can be applied on non-Ganssian and non-linear models and it can also be refined by additional information such as map, accelerometers, etc. Therefore, in the coarse localization stage, the previous estimate may be used to select the nearby reference points, in addition to the clusters of reference points selected according to the online RSS readings. The trashing system may also implement the Kalman filter to smooth the estimate update.
The localization engine of the present invention is operable to provide relatively accurate location data associated with a mobile device, based on radio information derived from the mobile device only, without the need for information from a remote server tracking the location of the mobile device.
FIG. 1 illustrates a system in accordance with the present invention. The system may include one or more network access points (APs), a network accessible server for administering a fingerprint database, the fingerprint database linked to the server tor providing a radio map, and one or more mobile devices, each linked to a network adaptor compatible with the protocol implemented by the APs so as to be operable to receive the signal from the one or more access points. For example, the APs may be IEEE 802.11 wireless access points and the network adaptors may be WLAN adaptors.
The network access points may have known or unknown location and may be associated with different networks. Each network access point emits a signal. The radio map is based on received signal strength from the one or more network access points at one or more reference points.
Each of the mobile devices may further include or be linked to a localization engine. The localization engine is operable to obtain the radio map or a subset thereof from the server, and to determine the location of the mobile device based on the radio map and the received signal from the one or more access points. The one or more mobile devices may also be linked to a navigation module for enabling a user of the mobile device to provide initial set up, and to provide the user with path routing and tracking updates. One or more of the mobile devices may further include or be linked to a radio mapping utility. Alternatively, certain mobile devices may be linked to a radio mapping utility and used for generating the radio map, while others may be linked to a localization engine and used by users, for example.
The one or more mobile devices will be referred to hereinafter as a single mobile device, linked to both the radio mapping utility and the localization engine, for simplicity.
The mobile device may continuously or intermittently collect online RSS readings from each AP (that is within radio range of the mobile device) at a time interval Δt, which may be limited or dependent on the mobile device's network adaptor and computing performance, denoted as r(t)=[r1(t),r2(t), . . . , rL(t)], t=0, 1, 2, . . . and then computes the estimated positions, denoted as {circumflex over (p)}(t)=[{circumflex over (x)}(t),ŷ(t)]T, where superscript T denotes transposition.
During the offline phase, the time samples of ESS readings are collected at the reference points, by pointing the mobile device to different orientations (e.g., north, south, east, west). The raw set of RSS time samples collected from AP i at reference point j with orientation: o is denoted as {ψi,j(o)(τ), τ=1, . . . , q, q>1}, with q as the total number of time samples collected. Then, the average of these time samples may be computed and stored in a database, which is referred to as the radio map. The radio map gives a sufficient representation of the spatial RSS properties in the given region, of interest, and can fee represented by ψ(o):




  
    
      
        
          Ψ
          
            (
            o
            )
          
        
        =
        
          (
          
            
              
                
                  ψ
                  
                    1
                    ,
                    1
                  
                  
                    (
                    o
                    )
                  
                
              
              
                
                  ψ
                  
                    1
                    ,
                    2
                  
                  
                    (
                    o
                    )
                  
                
              
              
                ...
              
              
                
                  ψ
                  
                    1
                    ,
                    N
                  
                  
                    (
                    o
                    )
                  
                
              
            
            
              
                
                  ψ
                  
                    2
                    ,
                    1
                  
                  
                    (
                    o
                    )
                  
                
              
              
                
                  ψ
                  
                    2
                    ,
                    2
                  
                  
                    (
                    o
                    )
                  
                
              
              
                ...
              
              
                
                  ψ
                  
                    2
                    ,
                    N
                  
                  
                    (
                    o
                    )
                  
                
              
            
            
              
                ⋮
              
              
                ⋮
              
              
                ⋱
              
              
                ⋮
              
            
            
              
                
                  ψ
                  
                    L
                    ,
                    1
                  
                  
                    (
                    o
                    )
                  
                
              
              
                
                  ψ
                  
                    L
                    ,
                    2
                  
                  
                    (
                    o
                    )
                  
                
              
              
                ...
              
              
                
                  ψ
                  
                    L
                    ,
                    N
                  
                  
                    (
                    o
                    )
                  
                
              
            
          
          )
        
      
    
    
      
        (
        1
        )
      
    
  




where





  
    ψ
    
      i
      ,
      j
    
    
      (
      o
      )
    
  
  =
  
    
      1
      q
    
    ⁢
    
      
        ∑
        
          t
          =
          1
        
        q
      
      ⁢
      
        
      
      ⁢
      
        
          ψ
          
            i
            ,
            j
          
          
            (
            o
            )
          
        
        ⁡
        
          (
          τ
          )
        
      
    
  




is the average of RSS readings (in dBm scale) over time domain from AP i at reference point j with orientation, o, for i=1, 2, . . . , L, j=1, 2, . . . , N, and oεO={0°, 90°, 180°, 270°}. L is the total number of APs that can be detected, and N is the number of reference points. The columns of ψ(o) radio map vectors, represent the RSS readings at each reference point with a particular orientation o, which can be referred to as

ψj(o)=[ψ1,j(o), ψ2,j(o), . . . , ψL,j(o)]T, j=1, 2, . . . , N  (2)

where the superscript T denotes transposition.

In addition, the variances of these time samples may be stored. The variance vector for each reference point is defined as

Δj(o)=[Δ1,j(o), Δ2,j(o), . . . , ΔL,j(o)]T, j=1, 2, . . . , N  (3)

where




  
    Δ
    
      i
      ,
      j
    
    
      (
      o
      )
    
  
  =
  
    
      1
      
        q
        -
        1
      
    
    ⁢
    
      
        ∑
        
          t
          =
          1
        
        q
      
      ⁢
      
        
      
      ⁢
      
        
          (
          
            
              
                ψ
                
                  i
                  ,
                  j
                
                
                  (
                  o
                  )
                
              
              ⁡
              
                (
                τ
                )
              
            
            -
            
              ψ
              
                i
                ,
                j
              
              
                (
                o
                )
              
            
          
          )
        
        2
      
    
  




is the unbiased estimated variance of RSS readings from AP i at reference point j with orientation o.

The radio map is then the table (xj, yj; ψj(o), Δj(o)), j=1, . . . , N, oεO, where (xj, yj) is the coordinates of the jth reference point, if no RSS reading is found for an AP at a reference point, the corresponding RSS entity in the radio map is set to a small value (in dBm scale) to imply its invalidity.
The reference points collected in the offline phase may be divided into a number of clusters. Since the database at different orientations has a different set of RSS readings, the clustering may he performed independently for each orientation. The affinity propagation algorithm may be used to generate the clusters, as it does not require initialization of exemplars in the traditional K-means clustering algorithm. Affinity propagation considers all reference points equally as potential exemplars by assigning the same real number, known as preference, for each reference point as an input. Then, real-valued messages are recursively transmitted between pairs of reference points based on a measure of similarity, until exemplars and corresponding clusters are generated. The pair-wise similarity s(i,j)(o) indicates how well the reference point j is suited to be the exemplar for reference point i, which is defined as

s(i,j)(o)=−∥ψi(o)−ψj(o)∥2 

∀i,jε{1, 2, . . ., N}, j≠i, oεO  (4)

The self-similarity value s(j,j)(o), j=1, 2, . . . , N, indicates the possibility that reference point j may become an exemplar. Since all the reference points are equally desirable to be exemplars, their preferences may be set to a common value. In order to generate a moderate number of clusters, the common preference for each orientation is defined as

p(o)=γ(o)·median{s(i,j)(o), ∀i,jε{1, 2, . . ., N}, j≠i}  (5)

where γ(o) is a real number which is experimentally determined, such that a desired number of clusters is generated.
The core operation of the algorithm, is the transmission of two kinds of real-valued messages between pairs of reference points. The responsibility message r(i,j)(o), sent from reference point i to candidate exemplar reference point j, is given by




  
    
      
        
          
            r
            ⁡
            
              (
              
                i
                ,
                j
              
              )
            
          
          
            (
            o
            )
          
        
        =
        
          
            
              s
              ⁡
              
                (
                
                  i
                  ,
                  j
                
                )
              
            
            
              (
              o
              )
            
          
          -
          
            
              max
              
                
                  j
                  ′
                
                ≠
                j
              
            
            ⁢
            
              {
              
                
                  
                    a
                    ⁡
                    
                      (
                      
                        i
                        ,
                        
                          j
                          ′
                        
                      
                      )
                    
                  
                  
                    (
                    o
                    )
                  
                
                +
                
                  
                    s
                    ⁡
                    
                      (
                      
                        i
                        ,
                        
                          j
                          ′
                        
                      
                      )
                    
                  
                  
                    (
                    o
                    )
                  
                
              
              }
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




where i≠j, and the availability message a(i,j)(o), sent from candidate exemplar reference point j to reference point i, is defined as





  
    
      
        
          
            a
            ⁡
            
              (
              
                i
                ,
                j
              
              )
            
          
          
            (
            o
            )
          
        
        =
        
          min
          ⁢
          
            {
            
              0
              ,
              
                
                  
                    r
                    ⁡
                    
                      (
                      
                        j
                        ,
                        j
                      
                      )
                    
                  
                  
                    (
                    o
                    )
                  
                
                +
                
                  
                    ∑
                    
                      
                        
                          i
                          ′
                        
                        ≠
                        i
                      
                      ,
                      j
                    
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    max
                    ⁢
                    
                      {
                      
                        0
                        ,
                        
                          
                            r
                            ⁡
                            
                              (
                              
                                
                                  i
                                  ′
                                
                                ,
                                j
                              
                              )
                            
                          
                          
                            (
                            o
                            )
                          
                        
                      
                      }
                    
                  
                
              
            
            }
          
        
      
    
    
      
        (
        7
        )
      
    
  




The messages may be passed recursively between pairs of reference points within each radio map and the above updating rules may be followed until a good set of exemplars and corresponding clusters emerges.
This process is conducted: after the fingerprints are collected during the offline phase. For each radio map with a particular orientation o, let H(o) be the set of exemplars; and for each, reference point jεH(o), let Cj(o) denote the set of reference points for which reference point j is an exemplar. Each outlier, referred to as a reference point that is in the set of Cj(o) but physically far away from, its exemplar j on the map, is further adjusted by assigning a new exemplar that is in its close proximity. Therefore, using the set of exemplars and their corresponding radio map vector, a coarse localization stage may be provided to select the clusters that match the online RSS observations, and then the reference points of these candidate clusters may be used to localize the mobile device during the line localization stage.
The actual localization of the mobile device takes place in the online phase. During me online phase, an RSS measurement, vector, denoted as

ψr=[ψ1,r, . . . , ψL,r]T  (8)

where {ψk,r, k=1, . . . , L}, is collected by the mobile device pointed, to an arbitrary orientation, at unknown location. As shown in FIG. 2, there may be two stages in the online phase, the coarse localization by cluster matching to reduce the area of interest; and the fine localization by using compressive sensing to recover the location estimation.

The goal of the coarse localization stage is to reduce the region of interest from the whole radio map to a subset thereof. Thus, it removes outliers, and reduces the complexity for the fine localization stage, as fewer reference points are considered. Furthermore, it confines the maximum localization error to the size of this subset, whereas this error can be much larger when no coarse localization is implemented.
The coarse localization is operated by comparing the similarity between the online RSS measurement vector and each exemplar to identify the cluster to which the online readings belong. Instead, of selecting one cluster, a few best-matched exemplars S with their corresponding cluster member set C may be chosen to avoid the edge problem, which can lead to inaccurate estimation when the location, of the mobile device is at the boundaries of clusters. Meanwhile, due to the time variation of the RSS, the online measurement can deviate from the values stored in the database.
Coarse localization can be implemented using a cluster matching scheme, such as exemplar-based cluster matching, average RSS-based cluster matching, weighted cluster matching or strongest APs for duster matching to define the appropriate similarity function. Then the clusters with the largest similarity values may be selected as the candidate clusters.
In exemplar-based cluster matching, similar to (4), the similarity function is defined as the negative of Euclidean, distance of the online measurement vector to the individual exemplar's RSS radio map vector.

s(r,j)(o)=−∥ψr−ψj(o)∥2, ∀jεH(o), ∀oεO  (9)

In average RSS-based cluster matching, instead of using the RSS radio map vector of each exemplar for cluster matching, the average of the RSS radio map vectors of all the cluster members is used to average out the possible RSS variations that come from a specific exemplar. It gives a more comprehensive and representative readings of the cluster. In this case, the Euclidean distance of the online measurement vector ψr to the cluster with reference point j as Its exemplar can be computed by




  
    
      
        
          
            
              s
              ⁡
              
                (
                
                  r
                  ,
                  j
                
                )
              
            
            
              (
              o
              )
            
          
          =
          
            -
            
              
                
                
                  
                  
                    
                      ψ
                      r
                    
                    -
                    
                      
                        1
                        
                          
                          
                            C
                            j
                            
                              (
                              o
                              )
                            
                          
                          
                        
                      
                      ⁢
                      
                        
                          ∑
                          
                            k
                            ∈
                            
                              C
                              j
                              
                                (
                                o
                                )
                              
                            
                          
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          ψ
                          k
                          
                            (
                            o
                            )
                          
                        
                      
                    
                  
                  
                
                
              
              2
            
          
        
        ,
        
          

        
        ⁢
        
          ∀
          
            j
            ∈
            
              H
              
                (
                o
                )
              
            
          
        
        ,
        
          ∀
          
            o
            ∈
            O
          
        
      
    
    
      
        (
        10
        )
      
    
  




where |Cj(o)| denotes the number of members in the cluster where reference point j is the exemplar.

In weighted cluster matching, since the variance of the RSS readings from each AP at each reference point is recorded during the offline phase, the stability of the RSS readings from a specific AP within a certain cluster can be considered as a weight for cluster matching. In weighted cluster matching, different weights are added to the above similarity function for each AP, so that stable RSS readings have larger weights. The corresponding similarity function is defined as




  
    
      
        
          
            
              s
              ⁡
              
                (
                
                  r
                  ,
                  j
                
                )
              
            
            
              (
              o
              )
            
          
          =
          
            -
            
              
                
                
                  
                  
                    
                      ω
                      j
                      
                        (
                        o
                        )
                      
                    
                    ⊗
                    
                      (
                      
                        
                          ψ
                          r
                        
                        -
                        
                          
                            1
                            
                              
                              
                                C
                                j
                                
                                  (
                                  o
                                  )
                                
                              
                              
                            
                          
                          ⁢
                          
                            
                              ∑
                              
                                k
                                ∈
                                
                                  C
                                  j
                                  
                                    (
                                    o
                                    )
                                  
                                
                              
                            
                            ⁢
                            
                              ψ
                              k
                              
                                (
                                o
                                )
                              
                            
                          
                        
                      
                      )
                    
                  
                  
                
                
              
              2
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            ∀
            
              j
              ∈
              
                H
                
                  (
                  o
                  )
                
              
            
          
          ,
          
            ∀
            
              o
              ∈
              O
            
          
        
      
    
    
      
        (
        11
        )
      
    
  




where {circle around (x)} is me element-wise multiplication between two vectors. ωj(o)=[ω1,j(o), . . . , ωl,j(o), . . . , ωL,j(o)]T, lε({1, . . . , L}, where ωl,j(o) represents the weight for the RSS reading from AP l in the cluster j with orientation o, which is proportional to the inverse of the corresponding RSS variance, namely,





  
    
      
        
          
            ω
            
              l
              ,
              j
            
            
              (
              o
              )
            
          
          ∝
          
            1
            
              
                Δ
                _
              
              
                i
                ,
                j
              
              
                (
                o
                )
              
            
          
        
        ,
        
          
            and
            ⁢
            
              
            
            ⁢
            
              
                Δ
                _
              
              
                i
                ,
                j
              
              
                (
                o
                )
              
            
          
          =
          
            
              1
              
                
                
                  C
                  j
                  
                    (
                    o
                    )
                  
                
                
              
            
            ⁢
            
              
                ∑
                
                  k
                  ∈
                  
                    C
                    j
                    
                      (
                      o
                      )
                    
                  
                
              
              ⁢
              
                Δ
                
                  l
                  ,
                  k
                
                
                  (
                  o
                  )
                
              
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




The weights are normalized, so that Σl=1Lωl,j(o)=1.
In strongest APs for cluster matching, since the strongest APs provide the highest probability of the coverage over time, only the set of the APs with the highest online RSS readings is selected. Thus, in strongest APs for cluster matching, the similarity is calculated using any of the above schemes by only considering these selected APs.
All the above cluster matching schemes attempt to reduce the possibility of choosing the wrong cluster, which is the main source for the maximum localization error.
The best-matched clusters can be found by using one or more of the above schemes. By evaluating the similarity function described above, the set of best-matched exemplars S with their corresponding cluster member set C can be found as




  
    
      
        S
        =
        
          {
          
            
              
                (
                
                  j
                  ,
                  o
                
                )
              
              :
              
                
                  
                    s
                    ⁡
                    
                      (
                      
                        r
                        ,
                        j
                      
                      )
                    
                  
                  
                    (
                    o
                    )
                  
                
                >
                α
              
            
            ,
            
              j
              ∈
              
                H
                
                  (
                  o
                  )
                
              
            
            ,
            
              ∀
              
                o
                ∈
                O
              
            
          
          }
        
      
    
    
      
        (
        13
        )
      
    
  
  
    
      
        C
        =
        
          
            ⋃
            
              
                (
                
                  j
                  ,
                  o
                
                )
              
              ∈
              S
            
          
          ⁢
          
            C
            j
            
              (
              o
              )
            
          
        
      
    
    
      
        (
        14
        )
      
    
  




where α is a pre-defined threshold to obtain a moderate number of clusters in S. Since only a small number of clusters is desired to be included in S, α may be set to be a percentage of the maximum similarity, that is





  
    
      
        α
        =
        
          
            
              α
              1
            
            ·
            
              
                max
                
                  
                    j
                    ∈
                    
                      H
                      
                        (
                        o
                        )
                      
                    
                  
                  ,
                  
                    ∀
                    
                      o
                      ∈
                      O
                    
                  
                
              
              ⁢
              
                
              
              ⁢
              
                {
                
                  
                    s
                    ⁡
                    
                      (
                      
                        r
                        ,
                        j
                      
                      )
                    
                  
                  
                    (
                    o
                    )
                  
                
                }
              
            
          
          +
          
            
              
                α
                2
              
              ·
              
                
                  min
                  ⁢
                  
                    
                  
                
                
                  
                    j
                    ∈
                    
                      H
                      
                        (
                        o
                        )
                      
                    
                  
                  ,
                  
                    ∀
                    
                      o
                      ∈
                      O
                    
                  
                
              
            
            ⁢
            
              {
              
                
                  s
                  ⁡
                  
                    (
                    
                      r
                      ,
                      j
                    
                    )
                  
                
                
                  (
                  o
                  )
                
              
              }
            
          
        
      
    
    
      
        (
        15
        )
      
    
  




where α1+α2=1, and α1=0.95 are possible examples of such settings.

After the coarse localization, the set of interest can be reduced to the set C. The partial radio map matrix {tilde over (ψ)}L×Ñ, with Ñ=|C| can be obtained by

{tilde over (ψ)}=[ψj(o):∀(j,o)εC]  (16)

The matrix {tilde over (ψ)} will be used by the following fine localization stage. Note that it is possible that more than two columns in {tilde over (Y)} represent the same reference point, but with different orientations, as ah clusters from different orientations are considered for the cluster matching.
The localization problem has a sparse nature, as the position of the mobile device is unique in the discrete spatial domain at a certain time. Ideally, assuming that the mobile device is located exactly at one of the reference points pointing at one of the orientations, the device's location can be formulated as a 1-sparse vector, denoted as θ (this assumption can be relaxed). Thus, θ is a Ñ×1 vector with all elements equal to zero except θ(n)=1, where n is the index of the reference point at which the mobile device is located, namely

θ=[0, . . . , 0, 1, 0, . . . , 0]T.  (17)

Then, the online RSS reading measured by the mobile device can be expressed as

y=Φ{tilde over (ψ)}θ+ε  (18)

where {tilde over (ψ)} is the partial radio map matrix as defined in (16), and ε is an unknown measurement noise that comes from RSS deviations. The M×L matrix Φ is an AP selection operator applied on the online RSS measurement vector ψr, such that

y=Φψr  (19)

Due to the wide deployment of APs, the total number of detectable APs is generally much greater than that required for positioning, which leads to redundant computations. Furthermore, unreliable APs with large RSS variances may also lead to biased estimation and affect the stability of the positioning system. This motivates the use of AP selection techniques to select a subset of available APs for positioning. Different AP selection schemes can be used to increase the accuracy of the fine localization stage.
According to (1), the set of APs covering the reference points can be denoted as L, with |L|=L. The objective of AP selection is to determine a set M⊂ L such that |M|=M≦L. This process is carried out by using the AP selection matrix Φ. Each row of Φ is a 1×L vector with all elements equal to zero except φ(l)=1, where l is the index of the AP that is selected for positioning:

φm=[0, . . . , 0, 1, 0, . . . , 0], ∀mε{1, 2, . . . , M}  (20)

Different approaches can be used to determine the matrix Φ, including strongest APs, Fisher criterion and random combination,
In strongest APs, similar to the coarse localization, the set of APs with the highest RSS readings is selected, arguing that the strongest APs provide the highest probability of the coverage over time. Here, the measurement vector (8) is sorted in the decreasing order of RSS readings, and the APs corresponding to the least indices are used. Since Φ created based on the current online measurement vector, this criterion may create different Φ for each location update.
The Fisher criterion is used to quantify the discrimination ability for each AP across reference points over four orientations. By comparing the metric ξ1, ∀iε{1, . . . , L}, defined as




  
    
      
        
          ξ
          i
        
        =
        
          
            
              ∑
              
                
                  (
                  
                    j
                    ,
                    o
                  
                  )
                
                ∈
                C
              
            
            ⁢
            
              
                (
                
                  
                    ψ
                    
                      l
                      ,
                      j
                    
                    
                      (
                      o
                      )
                    
                  
                  -
                  
                    
                      ψ
                      _
                    
                    l
                  
                
                )
              
              2
            
          
          
            
              ∑
              
                
                  (
                  
                    j
                    ,
                    o
                  
                  )
                
                ∈
                C
              
            
            ⁢
            
              (
              
                Δ
                
                  i
                  ,
                  j
                
                
                  (
                  o
                  )
                
              
              )
            
          
        
      
    
    
      
        (
        21
        )
      
    
  




where





  
    
      ψ
      _
    
    i
  
  =
  
    
      1
      
        N
        _
      
    
    ⁢
    
      
        ∑
        
          
            (
            
              j
              ,
              o
            
            )
          
          ∈
          C
        
      
      ⁢
      
        
          ψ
          
            i
            ,
            j
          
          
            (
            o
            )
          
        
        .
      
    
  




The denominator of ξi ensures that RSS values do not vary much over time so that the offline and online values are similar; while the numerator represents the discrimination ability of each AP by evaluating the strength of variations of mean RSS across reference points. The APs with the highest ξi are selected to construct the matrix φ for the fine localization.

In a random combination, unlike the above two schemes, which select the appropriate APs based on different criteria and create the matrix φ dynamically for each location update, the AP selection operator φ is defined as a random M×L matrix with i.i.d Gaussian entries. The random combination scheme has less computational complexity, as the matrix is fixed at different runs, and it does not require as much RSS time samples to calculate the variance as required by the Fisher criterion.
Besides sparsity in (18), incoherence is another important property that should be satisfied to enable the use of the CS theory. However, Φ (generated by either the strongest APs or the Fisher criterion) and {tilde over (ψ)} are in general, coherent in the spatial domain, which violates the incoherence requirement tor the CS theory. The following orthogonalization pre-processing procedure restores such property.
Define an orthogonalization operator T as

T=QR†  (22)

where R=Φ{tilde over (ψ)}, where Q=orth(RT)T, where orth (R) is an orthogonal basis for the range of R, and R† is a pseudo-inverse of matrix R.

The orthogonalization process is done by applying the operator T on the measurement vector y, such that

z=Ty=QR†Rθ+ε′  (23)

where ε′=Tε. It is straightforward to show that QR†R=Q. Therefore, the localization problem formulated in (18) can be reformulated as

z=Qθ+ε′.  (24)

Here Q is a row orthogonal matrix with unit norm. It has been proved that Q obeys the Restricted Isomatry Property (RIP) that is needed by the GS. Since θ has a sparse nature, according to the theory of compressive sensing, if the number of APs M is in the order of log(Ñ), the location indicator θ can be well recovered from z with very high probability, by solving the following l1-minimization problem.




  
    
      
        
          
            θ
            ^
          
          =
          
            
              
                arg
                ⁢
                
                  
                
                ⁢
                min
              
              
                θ
                ∈
                
                  R
                  
                    N
                    _
                  
                
              
            
            ⁢
            
              
                
                
                  
                  θ
                  
                
                
              
              l
            
          
        
        ,
        
          s
          .
          t
          .
        
        ,
        
          z
          =
          
            
              Q
              ⁢
              
                
              
              ⁢
              θ
            
            +
            
              
                ɛ
                ′
              
              .
            
          
        
      
    
    
      
        (
        25
        )
      
    
  




where ∥·∥1 is the l1-norm of a vector.

On a special note, the complexity of the l1-minimization algorithm grows proportional to the dimension of vector θ, which represents the number of potential reference points. Therefore, the coarse localization stage, which reduces the area of interest from all the N reference points into a subset of Ñ reference points (Ñ<<N), reduces the computational time for solving the l1-minimization problem and thus, allows this procedure to be carried out by resource-limited mobile devices.
If the mobile device is located at one of the reference points pointing at one of the measured orientations, the recovered position: is almost exact. However, in a real scenario, the mobile device may not be exactly located at a certain reference point facing a certain orientation. In such cases, the recovered location {circumflex over (θ)} is not an exact 1-sparse vector, but with a few non-zero coefficients. In order to compensate for the error induced by the grid assumption, a post-processing procedure is conducted. It is preferable to choose the dominant coefficients in {circumflex over (θ)} whose values are above a certain threshold λ, and take the normalized value in {circumflex over (θ)} as the corresponding weight for each potential reference point to calculate the location, estimation. Let R be the set of all indices of the elements of {circumflex over (θ)} such that

R={n|{circumflex over (θ)}(n)>λ}.  (26)

The location of the mobile user can be estimated, by a weighted linear combination of these candidate points, which is




  
    
      
        
          (
          
            
              x
              ^
            
            ,
            
              y
              ^
            
          
          )
        
        =
        
          
            1
            
              
                ∑
                
                  n
                  ∉
                  R
                
              
              ⁢
              
                
              
              ⁢
              
                
                  θ
                  ^
                
                ⁡
                
                  (
                  n
                  )
                
              
            
          
          ⁢
          
            
              ∑
              
                n
                ∉
                R
              
            
            ⁢
            
              
                
                  θ
                  ^
                
                ⁡
                
                  (
                  n
                  )
                
              
              ·
              
                
                  (
                  
                    
                      x
                      n
                    
                    ,
                    
                      y
                      n
                    
                  
                  )
                
                .
              
            
          
        
      
    
    
      
        (
        27
        )
      
    
  




The radio map may need to be updated if the surrounding environment changes significantly. Specifically, let vector ri represent the RSS readings from AP i over the reference points that cover the experimental area, which is also the transpose of the ith row of the RSS radio map database defined in (1) Let f denote the linear operator that transforms the ri from the pixel representation in the spatial domain into the sparse representation, in the frequency domain, namely.

x=F·ri  (28)

Further define a sampling matrix GM×N. Each row of G is a 1×N vector with all elements equal to zero except g(n)=1 where n is the index of the reference point that is measured on the radio map by the mobile device during the offline phase. The measured reference points are randomly selected.
Therefore, the offline RSS vector from a certain AP measured by the mobile device can be expressed as:

m=Gri=GF−1x=Rx  (29)

Since x has a sparse feature, with the similar orthogonalization procedure in (23), namely, z=Tm, the radio nap can be reconstructed by solving the following l1-minimization problem. Here, total variation minimization, a special ease of the l1-minimization, can be used to solve the sparse signal recovery problem, as it is widely used for 2D image recovery.




  
    
      
        
          
            x
            ^
          
          =
          
            
              
                arg
                ⁢
                
                  
                
                ⁢
                min
              
              x
            
            ⁢
            
              
                
                
                  
                  
                    ∇
                    
                      (
                      x
                      )
                    
                  
                  
                
                
              
              l
            
          
        
        ,
        
          s
          .
          t
          .
        
        ,
        
          z
          =
          
            Qx
            +
            ɛ
          
        
      
    
    
      
        (
        30
        )
      
    
  




where ∥∇(x)∥1, defined as the total variation of x, is the sum of the magnitudes of the gradient at every point, and ε is the measurement noise.

Finally, the reconstructed RSS radio map from AP i over the area of interest can be obtained fey

ri=F−1x  (31)

The radio map from the rest of the APs can be recovered using the same approach. Therefore. RSS is measured on a small number of grid points and (30) is used, to reconstruct the radio map on the whole grid. Since the number of measurements (M) needed for the radio map recovery obeys O(k log(N)), where N is the total number of reference points, and k indicates the sparsity level of signal x, significant redaction in the number of measured reference points can be expected.
The CS-based positioning system can be extended as a tracking system, which improves the accuracy in estimating the mobile device's locations. By using the mobile device's previous estimated locations, the tracking system is able to refine the current estimate in two ways: 1) to select appropriate reference points in the coarse localization stage and 2) to apply Kalman filter for better location estimate. Map information is used to determine how the Kalman filter is updated to find the location. A modified coarse localization stage chooses the relevant reference points based on two criteria; (1) online RSS readings; and (2) physical proximity of previous estimate.
The localization engine first selects the clusters of reference points defined in the offline stage that have similar RSS reading patterns to the online RSS vector r(t). This cluster matching process is as previously described. The localization engine then compares the online RSS readings to the averaged RSS readings of the reference points front the same cluster to select the best-matched clusters of reference points, which are denoted as a set CRSS.
Besides the use of the online RSS readings to choose the relevant reference points, reference points can be chosen by finding the possible range of the device's current location based on the previous estimated location, {circumflex over (p)}(t−1)=[{circumflex over (x)}(t−1),ŷ(t−1)]T. Since a person cannot, walk far away within a short period of time, it is reasonable that the system limit the region of interest into a range of possible walking range from the previous estimated position, if it is known, and reliable. There are two schemes to choose this possible walking range, unpredicted scheme and predicted scheme.
The unpredicted scheme selects the reference points: which are within walking distance during the specified update time interval to the previous estimated location, that is

CDist{j|√{square root over ((xj−{circumflex over (x)}(t−1))2+(yj−ŷ(t−1))2)}<β, jε1, . . . , N}  (32)

where β is the walking distance within the specified update time interval Δt.

The predicted scheme uses the previous estimated location to predict, the current possible location based on a linear motion model and then chooses the reference points which are within the walking range of this predicted position. The state vector of this linear model contains the position and velocity of the mobile device, i.e. {circumflex over (x)}(t)=[{circumflex over (x)}(t),ŷ(t),vx(t),vy(t)]T with vx(t) and vy(t) as the velocities in x and y direction at time t respectively. Then, the model is defined as




  
    
      
        
          
            x
            ^
          
          ⁡
          
            (
            t
            )
          
        
        =
        
          F
          ⁢
          
            
              x
              ^
            
            ⁡
            
              (
              
                t
                -
                1
              
              )
            
          
        
      
    
    
      
        (
        33
        )
      
    
  
  
    
      
        
          z
          ⁡
          
            (
            t
            )
          
        
        =
        
          H
          ⁢
          
            
              x
              ^
            
            ⁡
            
              (
              t
              )
            
          
        
      
    
    
      
        (
        34
        )
      
    
  
  
    
      
        
          
            with
            ⁢
            
              
            
            ⁢
            F
          
          =
          
            (
            
              
                
                  1
                
                
                  0
                
                
                  
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    t
                  
                
                
                  0
                
              
              
                
                  0
                
                
                  1
                
                
                  0
                
                
                  
                    Δ
                    ⁢
                    
                      
                    
                    ⁢
                    t
                  
                
              
              
                
                  0
                
                
                  0
                
                
                  1
                
                
                  0
                
              
              
                
                  0
                
                
                  0
                
                
                  0
                
                
                  1
                
              
            
            )
          
        
        ,
        
          H
          =
          
            (
            
              
                
                  1
                
                
                  0
                
                
                  0
                
                
                  0
                
              
              
                
                  0
                
                
                  1
                
                
                  0
                
                
                  0
                
              
            
            )
          
        
      
    
    
      
        (
        35
        )
      
    
  




where z(t) is the predicted current location. The estimation of the unknown velocities, vx(t) and vy(t) can be obtained from the output of the Kalman filter based on the same linear model (33) in addition to Gaussian noises, which is implemented after the fine localization stage. The implementation of the Kalman filter is described above.

The localization engine then selects a set of reference points, CDist, which are in close proximity to the predicted current location, z(t), according to (32), where z(t) is used instead of {circumflex over (p)}(t−1).
After the selection of these two groups of relevant reference points based on RSS readings similarities and physical proximities, the localization engine includes the common reference points that appear in both groups as the set of reduced region, where the final localization stage is then applied. The common reference points are obtained, as a set C,

C=CRSS∩{(j,o)|jεCDist and oεO}  (36)

This set contains reference points that satisfy both, conditions of similar RSS readings to the online RSS measurement and within close range to the mobile device's previous location. Thus, they are very likely to be the possible locations at which the mobile device is located. By introducing the constraint of physical range, the localization engine is able to identify the instant when the online RSS readings collected is not useful to find the mobile device's position. In normal operation, the mobile device must be within a range around its previous location. If the selected clusters of reference points in CRSS are far away from the previous location, then the online RSS readings can be regarded as invalid, as there are large deviations between the online readings and offline database, so that the cluster matching based on similarities of RSS readings fails to find the correct clusters of reference points. This scenario leads to an empty set of C and halts the fine localization stage. If such thing occurs, the localization engine discards this online RSS measurement vector and obtains anew one to restart the localization process.
There may be a possibility that all the consecutive online RSS measurement vectors lead to empty sets of C. This makes the localization engine continuously collect a new online RSS measurement, which is then discarded, preventing it from computing the true estimate of the mobile device's location. This happens as the previous position, estimate is not accurate and hence the selection of reference points based on such estimate does not match with the reference points selected based on the online RSS measurement vector. Thus, the localization engine only uses the online RSS measurement vector to select the reference points, when Nempty consecutive online RSS measurement vectors are discarded, arguing that the previous position estimate is no longer valid to reduce the localization problem into a smaller relevant region.
A Kalman Filter is applied on the location estimate computed in the fine localization stage to enhance the tracking performance. By adding Gaussian noises to the linear motion models as described in (37), the Kalman tracking model is formulated as

x(t)=Fx(t−1)+ω(t)  (37)

z(t)=Hx(t)+v(t)  (38)

The process noise ω(t) ̃N(0,P) and the measurement noise v(t) ̃N(0,U) are assumed to be independent with, the corresponding covariance matrices: P and U.
The steps to obtain the fetal estimates of state vector and the error covariance P(t) include prediction and update.
In prediction,

{circumflex over (x)}−(t)=F{circumflex over (x)}(t−1)  (39)

P−(t)=FP(t−1)FT+Q  (40)

In update,

K(t)=P−(t)HT)HP−)t)HT+R)−1  (41)

{circumflex over (x)}(t)={circumflex over (x)}−(t)+K(t)(z(t)−H{circumflex over (x)}−(t))  (42)

P(t)=(I−K(t)H)P−(t)  (43)

Note that the observation z(t) in (42) is the estimation of position computed by the fine localization stage, i.e. z(t)={tilde over (p)}(t). After the computation of the state vector, the final estimate of the mobile device's location can be found as {circumflex over (p)}(t)=H{circumflex over (x)}(t).
In a real situation, the Kalman filter is able to enhance the tracking, performance when the user with a mobile device is walking along, a corridor inside a building, as the linear motion assumed by the filter is sufficient to model the user's trajectory, However, when user is making a turn at an intersection, the linear model does not apply on this behavior which involves abrupt change in direction and hence the Kalman filter requires several more updates to reflect the user's true trajectory and. thus leads to more errors in position estimate.
By using the map information, the Kalman filter can be modified to follow the user's trajectory more closely. Since the Kalman filter behaves the best when the user is walking straight along a corridor but performs poorly around the intersections, the Kalman filter is reset when the user is in the region of intersection. According to the map, a region of intersection i can be identified as a non-rotated bounding box with (xmini,ymini) and (xmaxi,ymaxi) as the lower-let and upper-right corners respectively. Thus, the user is within the intersection region at time tturn if the below two conditions are satisfied:

xmini≦{circumflex over (x)}(tturn)≦xmaxi,ymini≦ŷ(tturn)≦ymaxi  (44)

Then, the Kalman filter is reset by reassigning the initial condition of Kalman filter x(tturn)=[{circumflex over (p)}(tturn),0,0]T and P(tturn)=P(0) and the Kalman filter is updated as normal according to (39) to (43) for the next estimate using z(tturn+1)={circumflex over (p)}(tturn+1) This removes the inaccurate estimation by Kalman filter when the user is making a turn.
The mobile device may further be linked to a navigation module to provide guidance to the mobile user to reach his desired destination. The navigation module may enable: 1) initial setup, 2) path rooting and 3) tracking update.
The navigation module depends on the map of the region of interest, which shows the layout of different features such as rooms, corridors and elevators etc. During the setup stage, information about different map features are extracted from the map, in order to let the navigation system to generate a feasible path and descriptive instructions about the surrounding environment.
First, the layout of the map may be interpreted its a graph with nodes, which are a set of Cartesian coordinates of the possible passage points along the corridors or destinations and edges between, nodes that means they can reach each other physically. Each edge may be assigned with a non-negative weight, which is defined as the Euclidean distance between two connected nodes. This connected graph is used by the system to generate the desired path for path routing. In addition to the definition of this connected graph, a list of map features is recorded along with their locations, so that the navigation system can generate instructions based on these features.
At the beginning of the navigation, the mobile device first obtains the users input of desired destination and user's current location, which can be either specified by the user or estimated by the device using the localization engine. Then, the system identifies the two nodes on the connected graph, predefined during initial setup, that are closest to the destination and user's current location, respectively. Path routing may be interpreted as finding the shortest path between these two nodes on the connected graph. This problem can be solved by applying the Dijkstra algorithm.
The generated path can be divided into series of line segments that are oriented at different directions. The generated path can be denoted as a set Of line segments G={l1, l2, . . . , lS}, where S is the number of line segments and each segment is denoted as li={psi, pei}, where psi={xsi,ysi} and pei={xei,yei} are the starting and ending points of the ith line segment respectively. The turning points are identified as the ending points between line segments, that is T={pei|i=1, . . . , S−1}. Based on these generated line segments, the system is able to determine the turning points, the direction of turns and the distance traveled at each line segments. In addition, the system can also find out the list of relevant map features appeared along this generated path denoted as F={pfj,Featurej|j=1, . . . , C}, where pfj={xfj,yfj} the location of feature j and Featurej is the feature's name and C is the total number of relevant map features.
After the generation of the path, that can lead the user to his targets, the navigation module begins tracking updates to keep track of user's position. For each tracking, update, the navigation module compares the location estimate to the routed path to check, if the user follows the path properly. The analysis is done according to FIG. 3.
The navigation module first determines if the user reaches the destination by checking the Euclidean distance between the user's current position and the target being within a range βdestination. Otherwise, the navigation module attempts to match the user's current position {circumflex over (p)}(t) to one of the line segments in the generated path set G. If this tracking update is within a line segment, li as illustrated in FIG. 4, then the navigation module can find the projection and the minimum distance of the tracking update point {circumflex over (p)}(t) to the line segment li with psi and pei by solving the two equations:

pi=psi+μi(pei−psi)  (45)

({circumflex over (p)}(t)−pi)(pei−psi)=0  (46)

where pi is the projected point which is collinear psi and pei and μ is the ratio in terms of the distance between psi and pei indicating how far the point pt is away from psi. The solution to μi from (45) is




  
    
      
        
          μ
          i
        
        =
        
          
            
              (
              
                
                  
                    p
                    ^
                  
                  ⁡
                  
                    (
                    t
                    )
                  
                
                -
                
                  p
                  s
                  i
                
              
              )
            
            ⁢
            
              (
              
                
                  p
                  c
                  i
                
                -
                
                  p
                  s
                  i
                
              
              )
            
          
          
            
              
              
                
                
                  
                    p
                    s
                    l
                  
                  -
                  
                    p
                    e
                    l
                  
                
                
              
              
            
            2
          
        
      
    
    
      
        (
        47
        )
      
    
  




If the computed μi is within a range of [0,1], then the projected point falls onto the line segment, which, means the update estimate is within the range of this line segment. By substituting (47) into (45), the projected point p can be computed and the shortest distance of the tracking update point to the line segment cars be obtained as dmini=∥{circumflex over (p)}(t)−pi∥. Hence, the navigation module, determines that the tracking estimate matches the line segment li if i) μiε[0,1] [0, 1] and ii) dmini<βpath. If there are consecutively Noffpath tracking estimates failing to match with any of the line segments in G, then the navigation module can prompt the user to stop moving and do the path rerouting following the same procedure described above using user's current position as the starting point.
In addition, if the value of p is close to one, which means the user is close to the end of the line segment, then the navigation, module can identify that the user is required to turn and give appropriate instructions. Note that, in normal situation, where the user follows the path correctly, the value of a should increase along the same line segment for each update and eventually move to the next segment. The direction of turn can then be computed based on the current and next line segments' directions.
To determine the orientation of the mobile user, for each tracking update, a direction vector is computed between the current update and the previous one and then is compared with the currently matched line segment direction. If consecutive NWrong direction tracking updates are in opposite direction of the line segment, then a voice command of wrong direction may be issued to the user.
Finally, the navigation module computes the Euclidean distance between the user's current estimate {circumflex over (p)}(t) to the map features in F. If the distance is smaller than βf, then the module will generate the corresponding voice command regarding this specific map features to the user.
The present invention can be applied to a plurality of indoor and outdoor applications,
For example, the present invention can be used to augment current location-based services that are operable outdoors (for example, by use of GPS) but lose functionality indoors. Augmenting outdoor location-based services could be advantageous by providing users the ability to receive path routing within a building from an external origin. It could farther be used to enhance emergency services by providing precise locations of emergency situations. Advertisers could also extend advertising to a more precise location to enhance behavioral marketing.
Another application of the present invention is to enable data sharing between mobile devices within close proximity. Potential applications include file (photos and other media) sharing, document exchange and dating.
Further applications include enabling precise localization of a user within a blueprint provided by the radio map. For example, a user could use a mobile device to navigate a shopping mall that has a radio map augmented with location information including store locations, department locations within a store, sections with a department, and even product placement within a section. Conversely, the invention could be used to monitor/track the location of a child or adult in a busy mall setting.
Similarly, the invention could be used to index and remember the location of parking a user's ear in an indoor parking garage; locate services (bathrooms, restaurants, boarding gates, etc) in an airport, conference center, theme park, hotel or other large or unfamiliar facility; and track locations of assets by placing a fingerprint at the asset location. Asset location tracking could be beneficial, for example, for enabling delivery companies to quickly and precisely locate a delivery point.
The invention could further be used as input to a mobile utility that is location based. For example, in an indoor location that has contextual feedback at a given location, the invention could provide the prompt necessary for the feedback to be provided to a user. In a specific example, a user could be in a museum that has a mobile application providing information regarding the museum artifacts. When the user is in the vicinity of air artifact, the corresponding information can be automatically provided to the user. This could also be used at a site auction, for example, where information on the sale hems could be presented to users based on the user being in proximity of the sale items. It could also be used in real estate sales, where owners could set up information to be presented for specific portions (e.g., rooms, views, etc.) of the real estate.
EXPERIMENT #1
Real data were obtained from am office building. Specifically, the experiments were carried out on a 30 m×46 m area of the fourth floor of an eight-story building (Bahen Center at the University of Toronto). A total of 26 APs were detected throughout the area of interest.
A PDA (HP iPAQ hx4700 with Windows Mobile 2003 pocket PC) was used to measure WLAN signal strength value, and a software was developed in Visual Studio C# to implement the CS-based positioning system on the device. The RSS values were collected on the device by using the open source library OpenNetCF, which provides access to MAC address and RSS values of WLAN APs. During the offline phase, the RSS observations from 26 APs were recorded for a period of 50 seconds (one sample per second) over 72 reference points with an average grid spacing of 1.5 m. At each reference point, RSS values from four orientations were recorded. The online observations were collected on a different day by the device at unknown locations as the testing points to evaluate the actual performance of the system under time-varying environment. Each online observation is an average of 2 RSS time samples, which takes 2 seconds for Wi-Fi scanning on the device.
In the following, the localization error, which is measured by averaging the Euclidean distance between the estimated locations of the mobile user and the actual location over the. testing points, has been reported as the performance measure.
In order to mitigate the RSS variations and to remove potential outliers for coarse localization, affinity propagation is applied on each radio map to generate clusters and their corresponding exemplars during the offline phase. FIG. 5 shows an example of the clustering result on the PDA for the radio map at the north orientation. Each point represents one reference point at which RSS readings are collected, and each color represents one cluster. It shows that the 72 reference points are divided into 13 clusters, and most of reference points belonging to the same cluster are geographically close to each other. We note that the number of clusters might be different at different orientations.
Since the coarse localization is used to reduce the area of interest for location estimate into a subset C, the dimension of the sparse signal in the CS algorithm is reduced to Ñ. According to the theory of compressive sensing, the location indicator can be well recovered when the number of APs is in the order of log(Ñ). This allows the system to reduce the number of APs required for accurate location recovery. FIG. 6 shows the average localization, error as a function of the number of APs used in the algorithm, under different number of clusters generated by the affinity propagation. As illustrated. In FIG. 6, only 8 APs are needed to achieve about 1.1 m error when a total of 58 clusters are generated in all four directions, and 1.9 error under 29 clusters. However, 18 APs are needed to achieve 1.8 m error if no clustering scheme is applied.
Furthermore, the number of clusters generated by the affinity propagation is determined by the input of preference value, which is experimentally set. In one hand, increasing the number of clusters helps to reduce the area of interest into a smaller region after the coarse localization and thus, improves the average localization accuracy and also reduces the complexity for the tine localization. On the other hand, this increases the chance of choosing the wrong cluster, which induces a large localization error of the positioning system. Therefore, we studied different coarse localization schemes to reduce the possibility of choosing the wrong cluster. FIG. 7 illustrates the Cumulative Distribution Function (CDF) of the localization error under different; coarse localization schemes described above, when 10 APs are used. It is shown that the weighted cluster matching scheme reduces the maximum localization error from 9.2 m to 6.3 m over the experiments, as it takes into account the stabilities of the RSS readings from different APs.
FIG. 8 shows the average localization error under different AP selection schemes for the fine localization. In the random combination scheme, according to (19), the value of x-axis implies the number of linear random combinations of online RSS values from the L APs. Among the three schemes proposed, AP selection using the Fisher criterion achieves the best performance especially when the number of APs is less than 5, while the strongest APs selection achieves the worst performance. The proposed random selection scheme achieves a localization error comparable to that of the Fisher criterion, but does not require a large number of offline RSS time samples to calculate the variance. In addition, the matrix Φ can be reused for each location update, saving the computational time for the fine localization.
Meanwhile, using more APs for the fine localization, may not necessarily increase the accuracy due to the biased estimation that is generated by unstable APs. As shown in FIG. 8, when the number of APs is above 11, the performance of the positioning system decreases. It is not affected by the way we choose the APs, as redundant APs are introduced for all of the three cases.
We compare the localization system of the present invention with the traditional fingerprinting approaches, known as the kNN and the kernel-based methods, in terms of the cumulative error distribution, when 10 APs are used. The proposed positioning system used affinity propagation to generate overall 5.8 clusters at four orientations during the offline phase, and then performed coarse localization by weighted cluster matching, followed by a fine localization stage consisting of a random AP combination, an li-minimization algorithm and a post-processing procedure. For fairness, the three positioning systems use the same coarse localization scheme, but are different in the fine localization stage. FIG. 9 shows the implementation result. As noticed, with 90% of the time, the proposed CS-based method achieves an error within 2.7 m, and outperforms fire kNN and the kernel-based method by 25% and 28% respectively.
In order to reduce the number of reference points for the fingerprinting approach, the same CS scheme is also used in the offline phase to reconstruct, the radio map based on RSS measurements at only a small number of reference points. In the simulation, only 36 of the reference points are randomly picked, and we show that the radio map at the overall 72 reference points can be well recovered compared with the values we actually measured at these 72 reference points.
FIG. 10a shows an example of the actual measured RSS radio map from AP 1 at 72 reference points over the experimental area, while FIG. 10b is the corresponding reconstructed radio map, based on samples from 36 randomly picked FPs using the same PDA. The same technique is used for recovering-RSS readings from the rest of APs.
We further use all the reconstructed RSS radio map for localization, compared with the localization using the actual measured radio map. FIG. 11 shows that the proposed scheme is able to achieve an average error of 1.6 m by using the reconstructed radio map, when 10 APs are used. However, using the radio map recovered by the traditional interpolation approach reduces the average localization error to 2.6 m, when 10 APs are used.
EXPERIMENT #2
A software application is developed on smart devices installed with Windows Mobile platform to implement the proposed indoor tracking and navigation system. The software is developed in CM using Microsoft .Net Compact Framework version 3.5. In addition, two open source library: OpenNetCP and DotNetMatrix are used to provide the RSS scanning function and matrix operations to the program. The software is tested on a PDA manufactured by HP, hp iPAQ hx2750. The overview of our software is illustrated in FIG. 12.
The localization system with, prediction is tested at the second floor of the Canadian National Institute for the Blind (CNIB) with an area dimensions of 18 m×36 m. During the offline phase, we have run the developed software on the PDA to collect 100 RSS time samples for each of four orientations: North, East South and West (with the sampling rate of 1 sample per second) over 128 reference points (N=128) which are evenly distributed on the site with an average grid spacing of 1.5 m. In this experiments, about 15 clusters are generated for each orientation RSS database, such that the reference points within the same cluster are geographically close to each other and only 2 or 3 outliers are required to be modified.
Several traces are collected to evaluate the performance of the localization system with prediction. We have walked at a constant speed along 4 different traces, which are summarized In Table I and collected, the RSS readings from visible APs using the same PDA at 1 sample per seconds.







TABLE I







TRACES SUMMARY











Trace #
# of turns
# Repetitions
Distance
Average Duration





1
2
4
53.63 m
156.3 s


2
2
4
29.43 m
 89.2 s


3
0
4
30.80 m
 84.6 s


4
4
2
91.84 m
279.5 s









FIG. 13, for example, compares four different versions of the localization system. In the scheme called “CS-based Positioning”, we only use the estimated location, of the user. In the “CS-based+Kalman filter”, we input the location estimates obtained by the localizer into a Kalman filter to further refine the location estimates. The localization system is also used in two versions: without prediction and with linear prediction. The details of these versions are discussed above.
The mean errors of these systems remain around the same once the number of APs used are beyond 10 and reflect the property of the CS theory that a minimum bound is required. The localization system with prediction using either scheme is able to improve the non-prediction localization system, and also achieve better accuracy than, by directly applying the Kalman filter. When 10 APs are used, the localization system using the unpredicted scheme leads to the average error improvement of 0.98 m (37%) and 0.45 m (21%) over that of the non-prediction localization system and the Kalman filter respectively.
This tracking system with the unpredicted scheme is compared with the non-prediction localization system and the direct applications of the Kalman filter on both the KNN method and the non-prediction localization system. FIG. 14 shows the comparison results in terms of cumulative error distributions and Table II shows the position error statistics for these four systems. The localization system outperforms the other three methods, as it has the smallest mean error, 90th percentile error and variance when compared to the other systems.







TABLE II







POSITION ERROR STATISTICS











Method
Mean [m]
90th [m]
Max [m]
Var [m{circumflex over ( )}2]





CS-based + Positioning
2.68
5.26
26.64
4.79


Positioning


KNN + Kalman Fileter
2.41
4.41
10.95
2.42


CS-based + Kalman Filter
2.17
4.15
24.10
2.69


Proposed Tracking
1.74
3.36
17.93
1.91









We have tested the navigation module on the same experimental site using our developed software on the PDA. FIG. 15 shows the map with the proper defined nodes, which are used by the navigation module to generate path to the desired destination and give appropriate guidance to the user.
The navigation starts by first asking the user to choose the desired destination, on the PDA, then the software finds the user's location and runs the Dijsktra shortest path algorithm on the predefined connected graph to generate the walking path. Then, the system starts our proposed tracking system, which updates the user's current position every 2 seconds (using 2 RSS time samples for each update). An example screenshot is illustrated in FIG. 16 where the user starts from Room 207 on the map and walks towards Room 218E.
We have asked several visually impaired people to try our navigation device on this experimental site. It is clear that the device is able to provide useful guidance to the user to reach his desired destination, as it is able to generate relevant instructions according to the user's locations. In particular, the device is able to lead the participants to reach the spring water fountain, a small, wall-mounted object that is often, easily missed by the participants.
The foregoing description of embodiments has been presented for purposes of illustration and description. It is not intended to be exhaustive or to be limited to the precise forms disclosed, and modifications and variations are possible in light of the above teachings or may be acquired front practice of the invention. The embodiments were chosen and described in order to explain the principals of the invention and its practical application to enable one skilled in the art to utilize the invention in various embodiments and with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims appended hereto and their equivalents.

## Claims

1. A mobile device comprising a processor and a non-transitory computer-readable medium storing a set of instructions, the processor when executing the set of instructions causes the mobile device to:
measure a signal strength of at least one signal emitted from each network access point in a subset of a plurality of network access points;
determine a reduced area of a geographic area within which a location of the mobile device is likely to be by using:
a radio map, stored in the mobile device, defining the geographic area by a plurality of reference points each characterized by the signal strength of signals that are emitted from the plurality of network access points; and
the measured signal strength of the at least one signal emitted from each said network access point in the subset of the plurality of network access points; and

determine the location of the mobile device based on:
the determined reduced area; and
execution of an implementation of a compressive sensing algorithm on a set of signal strength measurements selected from the group comprising the measured signal strength of the at least one signal emitted from each said network access point in the subset of the plurality of network access points;

wherein the determined reduced area is determined by execution of an implementation of a cluster matching algorithm.

2. The mobile device of claim 1, wherein determining the location of the mobile device is based on one or more past determinations of a past location of the mobile device.

3. The mobile device of claim 1, wherein determining the location of the mobile device is based on motion dynamics of the mobile device.

4. The mobile device of claim 3, wherein the motion dynamics are modeled by a Bayesian tracking model and a filter.

5. The mobile device of claim 4, wherein the filter is a modified Kalman filter whose updating rules are governed by map information.

6. The mobile device of claim 1, wherein the mobile device is linked to a navigation module enabling a user of the mobile device to obtain path routing and tracking updates based on a desired destination.

7. The mobile device of claim 1, wherein each said determination by the mobile device applies one or more schemes for compensating for dynamic radio channel characteristics.

8. The mobile device of claim 1, wherein the mobile device determines the location of the mobile device without requiring a location of any said network access point.

9. The mobile device of claim 1, wherein the mobile device determines the location of the mobile device without requiring transmitting the location of the mobile device.

10. The mobile device of claim 9, wherein the mobile device determines the location of the mobile device without requiring transmitting information sufficient to identify the location of the mobile device, whereby the location of the mobile device is determined anonymously.

11. The mobile device of claim 1, wherein each said reference point is further characterized by the signal strength of signals detected from a plurality of directions.

12. A mobile device comprising a processor and a non-transitory computer-readable medium storing a set of instructions, the processor when executing the set of instructions causes the mobile device to:
measure a signal strength of at least one signal emitted from each network access point in a subset of a plurality of network access points;
determine a reduced area of a geographic area within which a location of the mobile device is likely to be by using:
a radio map, stored in the mobile device, defining the geographic area by a plurality of reference points each characterized by the signal strength of signals that are emitted from the plurality of network access points; and
the measured signal strength of the at least one signal emitted from each said network access point in the subset of the plurality of network access points; and

determine the location of the mobile device based on;
the determined reduced area; and
execution of an implementation of a compressive sensing algorithm on a set of signal strength measurements selected from the group comprising the measured signal strength of the at least one signal emitted from each said network access point in the subset of the plurality of network access points;

wherein the determined reduced area is determined by execution of an implementation of a tracking algorithm.

13. The mobile device of claim 12, wherein the tracking algorithm uses an estimate of the location of the mobile device based on past history.

14. The mobile device of claim 12, wherein determining the location of the mobile device is based on one or more past determinations of a past location of the mobile device.

15. The mobile device of claim 12, wherein determining the location of the mobile device is based on motion dynamics of the mobile device.

16. The mobile device of claim 15, wherein the motion dynamics are modeled by a Bayesian tracking model and a filter.

17. The mobile device of claim 16, wherein the filter is a modified Kalman filter whose updating rules are governed by map information.

18. The mobile device of claim 12, wherein the mobile device is linked to a navigation module enabling a user of the mobile device to obtain path routing and tracking updates based on a desired destination.

19. The mobile device of claim 18, wherein each said determination by the mobile device applies one or more schemes for compensating for dynamic radio channel characteristics.

20. The mobile device of claim 19, wherein the mobile device determines the location of the mobile device without requiring a location of any said network access point.

21. The mobile device of claim 12, wherein the mobile device determines the location of the mobile device without requiring transmitting the location of the mobile device.

22. The mobile device of claim 21, wherein the mobile device determines the location of the mobile device without requiring transmitting information sufficient to identify the location of the mobile device, whereby the location of the mobile device is determined anonymously.

23. The mobile device of claim 12, wherein each said reference point is further characterized by the signal strength of signals detected from a plurality of directions.

24. A method implemented by a plurality of network access points and a mobile device comprising a processor and a non-transitory computer-readable medium, the method comprising:
accessing a radio map defining a geographic area by a plurality of reference points each characterized by the signal strength of signals that are emitted from the plurality of network access points;
measuring the signal strength of at least one signal emitted from each said access point in a subset of the plurality of network access points;
determining a reduced area of the geographic area within which the a location of the mobile device is likely to be by using:
the radio map; and
the measured signal strength of the at least one signal emitted from each said network access point in the subset of the plurality of network access points;

and
determining the location of the mobile device based on:
the determined reduced area; and
execution of an implementation of a compressive sensing algorithm on a set of signal strength measurements selected from the group comprising the measured signal strength of the at least one signal emitted from each said network access point in the subset of the plurality of network access points;

wherein the determined reduced area is determined by execution of an implementation of a cluster matching algorithm.

25. The method of claim 24, wherein the tracking algorithm uses an estimate of the location of the mobile device hardware based on past history.

26. The method of claim 24, wherein determining of the location of the mobile device is based on one or more past determinations of a past location of the mobile device.

27. The method of claim 24, wherein determining the location of the mobile device is further based on motion dynamics of the mobile device.

28. The method of claim 27, wherein the motion dynamics are modeled by a Bayesian tracking model and a filter.

29. The method of claim 24, wherein the mobile device is linked to a navigation module enabling a user of the mobile device to obtain path routing and tracking updates based on a desired destination.

30. The method of claim 24, comprising applying one or more schemes for compensating for dynamic radio channel characteristics.

31. The method of claim 24, wherein the location of the mobile device is determined without requiring using a location of any said network access point.

32. The method of claim 24, wherein the location of the mobile device is determined without requiring transmitting the location of the mobile device.

33. The method of claim 24, wherein the location of the mobile device is determined without requiring transmitting information sufficient to identify the location of the mobile device, whereby the location of the mobile device is determined anonymously.

34. The method of claim 24, wherein each said reference point is further characterized by the signal strength of signals that are detected from a plurality of directions.

35. A method implemented by a plurality of network access points and a mobile device comprising a processor and a non-transitory computer-readable medium, the method comprising:
accessing a radio map defining a geographic area by a plurality of reference points each characterized by the signal strength of signals that are emitted from the plurality of network access points;
measuring the signal strength of at least one signal emitted from each said access point in a subset of the plurality of network access points;
determining a reduced area of the geographic area within which the a location of the mobile device is likely to be by using:
the radio map; and
the measured signal strength of the at least one signal emitted from each said network access point in the subset of the plurality of network access points;

and
determining the location of the mobile device based on:
the determined reduced area; and
execution of an implementation of a compressive sensing algorithm on a set of signal strength measurements selected from the group comprising the measured signal strength of the at least one signal emitted from each said network access point in the subset of the plurality of network access points;

wherein the determined reduced area is determined by execution of an implementation of a tracking algorithm.