# Patent

## Title
Method and apparatus for generating three-dimensional pose using multi-modal sensor fusion

## Abstract

A method and apparatus for providing three-dimensional navigation for a node comprising an inertial measurement unit for providing gyroscope, acceleration and velocity information (collectively IMU information); a ranging unit for providing distance information relative to at least one reference node; at least one visual sensor for providing images of an environment surrounding the node; a preprocessor, coupled to the inertial measurement unit, the ranging unit and the plurality of visual sensors, for generating error states for the IMU information, the distance information and the images; and an error-state predictive filter, coupled to the preprocessor, for processing the error states to produce a three-dimensional pose of the node.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application claims benefit of United States provisional patent applications Ser. No. 61/364,160, filed Jul. 14, 2010, and Ser. No. 61/376,771, filed Aug. 25, 2010, both of which are herein incorporated in their entireties by reference.


GOVERNMENT RIGHTS IN THIS INVENTION
This invention was made with U.S. government support under contract number FA9200-07-D-0045. The U.S. government has certain rights in this invention.


BACKGROUND OF THE INVENTION
1. Field of the Invention
Embodiments of the present invention generally relate to navigation techniques and, more particularly, to a method and apparatus for generating three-dimensional pose using multi-modal sensor fusion.
2. Description of the Related Art
Real-time navigation systems generally rely upon Global Positioning System (GPS) receivers to provide position information. Such systems, by their reliance on satellite signals, are impaired when operating indoors. In an effort to overcome this impairment, multiple sensors for providing navigation information when GPS signals are unavailable have been developed. Real-time tracking by fusing information available from visual and inertial sensors (e.g., an inertial measurement unit (IMU)) has been studied for many years with numerous applications in robotics, vehicle navigation and augmented reality. However, it is still unclear how to best combine the information from these complementary sensors. Since inertial sensors are suited for handling situations where vision is lost due to fast motion or occlusion, many researchers use inertial data as backup or take only partial information (gyroscopes) from an IMU to support vision-based tracking systems.
To better exploit inertial data, several researchers use an extended Kalman filter to fuse all measurements uniformly to a pose estimate. These systems combine the filter with vision-tracking techniques based on artificial markers, feature points, or lines. Results from these Kalman filter-based systems indicate that using vision measurements effectively reduce the errors accumulated from IMU. However, these systems have not eliminated the problem of long-term drift over large areas inherent in an inertial-based navigation system.
Therefore, there is a need in the art for improved navigation using a method and apparatus for generating three-dimensional pose using multi-modal sensor fusion.
SUMMARY OF THE INVENTION
Embodiments of the present invention comprise a method and apparatus for providing three-dimensional navigation for a node comprising an inertial measurement unit for providing gyroscope, acceleration and velocity information (collectively IMU information); a ranging unit for providing distance information relative to at least one reference node; at least one visual sensor for providing images of an environment surrounding the node; a preprocessor, coupled to the inertial measurement unit, the ranging unit and the plurality of visual sensors, for generating error states for the IMU information, the distance information and the images; and an error-state predictive filter, coupled to the preprocessor, for processing the error states to produce a three-dimensional pose of the node.



BRIEF DESCRIPTION OF THE DRAWINGS
So that the manner in which the above recited features of the present invention can be understood in detail, a more particular description of the invention, briefly summarized above, may be had by reference to embodiments, some of which are illustrated in the appended drawings. It is to be noted, however, that the appended drawings illustrate only typical embodiments of this invention and are therefore not to be considered limiting of its scope, for the invention may admit to other equally effective embodiments.
FIG. 1 depicts an environment in which at least one node navigates in accordance with at least one embodiment of the invention;
FIG. 2 illustrates a helmet mounted node of FIG. 1 in accordance with at least one embodiment of the invention;
FIG. 3 depicts a functional block diagram of a node of FIG. 1 in accordance with at least one embodiment of the invention;
FIG. 4 depicts a computer apparatus for implementing a portion of at least one embodiment of a node of FIG. 1;
FIG. 5 depicts a flow diagram of a method for building a landmark database used in the navigation process of at least one embodiment of a node of FIG. 1;
FIG. 6 depicts a flow diagram of a method of operation of a preprocessing module executed by the computer apparatus of FIG. 4;
FIG. 7 depicts a scenario for tracking an object within an environment in which a node in accordance with an embodiment of the invention;
FIG. 8 depicts a top view of the object of FIG. 7; and
FIG. 9 depicts a flow diagram of a method for tracking the object of FIGS. 7 and 8 in accordance with one embodiment of the invention.



DETAILED DESCRIPTION
FIG. 1 depicts an environment 100 in which at least one node (e.g., nodes 1021, 1022, 1023) navigates in accordance with at least one embodiment of the invention. The environment 100 comprises a plurality of mobile nodes (e.g., three mobile nodes 1021, 1022, 1023 are depicted, but any number of mobile nodes may be used), a plurality of visual landmarks (e.g., visual landmarks 1041, 1042 are depicted, but any number of visual landmarks may be used), and a plurality of anchor nodes (e.g., anchor nodes 1061, 1062 are depicted, but any number of anchor nodes may be used). Each node 102 computes its three-dimensional pose relative to the global coordinates of the environment 100 through visualization of the landmarks 104 (represented by dashed lines 108), mobile node 102 to reference node ranging (where a reference node may be a mobile node 102 or an anchor node 106), and inertial measurement information generated within each mobile node 102. Communication paths 110 represent ranging from mobile node 102 to mobile node 102, communication paths 112 represent mobile node 102 to anchor node 106 ranging.
Each node 102 fuses vision information with inertial measurement information and ranging information to create a pose estimate for the node that can be used in a navigation system. In one embodiment of the invention, the loss of visual information due to smoke, haze, or other obstruction does not impair a node's ability to navigate. Using the computer within each node 102, the node 102 may generate navigation information for an autonomous or semi-autonomous vehicle (e.g., a robot), generate augmented reality views for a local user, generate augmented reality views for a remote user, provide navigation information for either a remote user or a local user, and the like.
FIG. 2 illustrates one embodiment of a mobile node 102 of FIG. 1 in accordance with at least one embodiment of the invention. The mobile node 102 is depicted in a front view 102A and a side view 102B. The mobile node 102, in this particular embodiment, is mounted to a helmet 200. In other embodiments, the mobile node 102 may be mounted to a vehicle, a robot, a drone, and/or any device/system that utilizes navigation. The mobile node 102 comprises a computer 202, an inertial measurement unit (IMU) 204, at least one ranging unit 206, a front oriented stereo visual sensor 208, a rear oriented stereo visual sensor 210, a head mounted display 212 and a radio transceiver 214. As discussed below, the IMU 204 is physically coupled to the visual sensors to provide gyroscope, velocity and acceleration information regarding the motion of the front and rear visual sensors 208, 210. The mobile node 102 fuses the IMU information with the visual information and ranging information to provide a robust navigation system. Primarily, the mobile node 102 navigates using the IMU information and visual information. When the visual information is obstructed, i.e., an error, ranging information from the at least one ranging unit 206 is used to generate a three-dimensional pose of the node 102.
In one specific embodiment, the ranging unit 206 is a NANOTRON range measuring radio, which uses short (3nS) pulses converted to chirps (frequency sweeps) to enhance noise and multipath immunity. This ranging radio has an outdoor working range of about 150 m with a small size (35 mm×14 mm×3 mm) and low power consumption (about 500 mW). The ranging radio may be helmet mounted with its antenna, or the ranging radio may be carried in a backpack and the ranging radio antenna mounted to the helmet near the visual sensors 208, 210. In other embodiments, the at least one ranging unit may utilize ranging signals such as laser, radiofrequency, ultrasonic and/or the like.
In one embodiment, location information (the location of each node within the environment) may be transmitted amongst the nodes 102 using transceiver 214. In one embodiment, location information (which may include node pose as well as a global coordinate for the node within the environment) is transmitted over a wireless network at a frame rate of, for example, 15 Hz. An open-source data distribution service approach may be used, wherein each node publishes its own location packets as well as subscribes to all the incoming location information sent by the other nodes. Radio packets carrying range data are associated with camera location packets received by each node 102 based on a node identification field in each packet. Thus, in one embodiment, all mobile nodes 102 know the location, pose or both of all other nodes within the environment. The mobile node 102 may locally use the pose to produce navigation/guidance information either to control motion (e.g., steering or flight attitude) or to provide a navigation display to a user. In other embodiments, the mobile node 102 may use the pose to generate augmented reality graphics on a display such as head mounted display 212. Such a display may be generated and shown locally, or the pose may be transmitted to a remote location for display in a navigation or guidance system. Using the mobile node 102 where fog, smoke, or other visual impediment is present, enables a user to navigate using the augmented reality graphics, e.g., graphics representing “real” artifacts, features or obstacles in the environment that cannot presently be visually seen by the user, but can be represented on the display 212. In various embodiments, the display may operate in a video see through mode or an optical see through mode. The video see through mode overlays synthetic characters on a live video of the scene being captured by the visual sensors. The synthetic characters appear as if they are part of the 3D scene and do not jitter or drift in their placement as the visual sensors move. In optical see through mode, the synthetic characters appear on the display 212.
FIG. 3 depicts a functional block diagram of a node 300 (similar to the node 102 of FIG. 1) in accordance with at least one embodiment of the invention. The node 300 comprises a ranging unit 206, an IMU 204, visual sensors 306, a pre-processor 308, a landmark database 310, an error-state predictive filter 314, an augmented reality/tracking processor 318 and a display 320. Since the ranging unit 206 receives ranging information from both anchor nodes and other mobile nodes, the ranging unit 206 is shown to have two components: an anchor node ranging unit 302 and an inter-node ranging unit 304. In some embodiments, these units 302, 304 are a single ranging radio using signal processing to determine anchor node ranging and inter-node ranging information.
In one embodiment, the IMU 204, as is well known in the art, comprises a gyroscope, a velocity measuring unit and an acceleration measuring unit. In one embodiment, the IMU 204 is a micro-electromechanical (MEMS) device.
In one embodiment, the visual sensors 306 comprise front directed electro-optical stereo sensor 208 and rear directed electro-optical stereo sensor 210. In one embodiment of the invention, stereo sensors are a pair of cameras. The cameras may be infrared, visible or a combination thereof. Any sensor that provides images of the environment may find use as at least one of the visual sensors 306.
The ranging information, the inertial navigation information, and the visual information are coupled to the preprocessor 308. In one embodiment of the invention, the preprocessor 308 utilizes information from a landmark database 310 to reduce the error in an initial node pose computed from the sensor imagery alone. Use of the landmark database 310 is optional. This landmark database 310 is pre-populated with imagery from the environment in which the node 300 operates. The procedure used for populating the landmark database 310 is described with reference to FIG. 5 below. The pre-processor 308 generates a plurality of signals that are utilized by the error-state predictive filter 314 to compute a three-dimensional pose estimate for the node 300. The signals, coupled along path 312, include a range bias, camera location, gyroscope bias vector, velocity vector, accelerometer bias vector, and ground to camera orientation. The procedure used for generating the signals from the measured sensor signals is described in detail with reference to FIG. 6 below.
The error-state predictive filter 314, in one embodiment is an error-stat Kalman filter, uses the signals from the preprocessor 308 to produce a three-dimensional pose estimate that is continuously updated as additional measurements are supplied to the preprocessor 308. The three-dimensional pose estimate is output on path 316.
The error-state predictive filter 314 is used to fuse IMU information, the local measurements from a visual odometry process using front and back facing stereo cameras, ranging information and global measurements from a visual landmark-matching process. The predictive filter 314 adopts a so called “error-state” formulation, so there is no need to specify an explicit dynamic motion model. The filter dynamics follow from the IMU error propagation equations that vary smoothly and therefore are more amenable to linearization. The measurements to the filter consist of the differences between the inertial navigation solution as obtained by solving the IMU mechanization equations and the external source data, which include the relative pose information provided by visual odometry process and global measurements provided by the visual landmark matching process.
In the predictive filter, denote the ground (global coordinate frame) to camera pose as PGC=[RGC TGC] such that point XG expressed in the ground frame can be transferred to the camera coordinates XC=RGCXG+TGC. Accordingly, TGC represents the ground origin expressed in the camera coordinate frame, whereas TCG=−RGCTTGC is the camera location in the ground coordinate frame.
In one embodiment, without loss of generality and to keep the notation simple, one embodiment of the filter assumes that the camera and IMU coordinate system coincide so that PGI=PGC. In reality, the embodiment uses an extrinsic calibration procedure to determine the camera to IMU pose PCI, (front left stereo camera is chosen as the master) and distinguish between PGI=PCI PGC and PGC.
The total (full) states of the filter consist of range radio bias br(k) for each node 1≦k≦K, the camera location TCG, the gyroscope bias vector bg , velocity vector v in global coordinate frame, accelerometer bias vector ba and ground to camera orientation qGC, expressed in terms of the quaternion representation for rotation such that RGC=(|qo|2−||{right arrow over (q)}||2)I3×3+2{right arrow over (q)} {right arrow over (q)}T−2qo[{right arrow over (q)}]x, with qGC=[qo {right arrow over (q)}T]T and [{right arrow over (q)}]x denoting the skew-symmetric matrix formed by {right arrow over (q)}. For quaternion algebra, the embodiment follows the notion and uses a frame rotation perspective. Hence, the total (full) state vector is given by

s=[qGCT bgT vT baT TCGT br(1) . . . br(k)].

The embodiment uses the corresponding system model for the state time evolution.

{dot over (q)}GC(t)= 1/2(qGC(t)ω(t)), bg(t)=nωg(t)

{dot over (v)}(t)=a(t), {dot over (b)}a(t)=nωa(t), {dot over (T)}CG(t)=v(t)

{dot over (b)}r(k)(t)=nωr(k)(t), 1≦k≦K,

where nωg, nωa, and nωr(k) for 1≦k≦K are modeled as white Gaussian noise, and a(t) is camera acceleration in global coordinate frame, and ω(t) is the rotational velocity in camera coordinate frame. Gyroscope and accelerometer measurements of these two vectors are modeled as:

{dot over (q)}GC(t)= 1/2(qGC(t)ω(t)), bg(t)=nωg(t)

{dot over (v)}(t)=a(t), {dot over (b)}a(t)=nωa(t), {dot over (T)}CG(t)=v(t)

{dot over (b)}r(k)(t)=nωr(k)(t), 1≦k≦K,

where nωg, nωa, and nωr(k) for 1≦k≦K are modeled as white Gaussian noise, and a(t) is camera acceleration in global coordinate frame, and ω(t) is the rotational velocity in camera coordinate frame. Gyroscope and accelerometer measurements of these two vectors are modeled as:

ωm(t)=ω(t)+bg(t)+ng(t)

am(t)=RGC(t)(a(t)−g)+ba(t)+na(t)

where ng and na are modeled as white Gaussian noise and g is the gravitational acceleration expressed in the global coordinate frame.

State estimate propagation is obtained by the IMU mechanization equations

{circumflex over ({dot over (q)}GC(t)= 1/2({circumflex over (q)}GC(t){circumflex over (ω)}(t))

{dot over (v)}(t)={circumflex over (R)}GCT(t)â(t)+g,

{circumflex over ({dot over (x)}(t)={circumflex over (v)}(t), {circumflex over ({dot over (b)}g(t)=0, {circumflex over ({dot over (b)}a(t)=0

where {circumflex over (ω)}(t)=ωm(t)−{circumflex over (b)}g(t), and â(t)=âm(t)−{circumflex over (b)}a(t), together with the radio bias propagation

{circumflex over ({dot over (b)}r(k)(t)=0, 1≦k≦K.

The embodiment solves the above system of equations by fourth-order Runge-Kutta numerical integration method. The Kalman filter error state consists of

δs=[δθTδbgTδvTδbaTδTCGTδbr(1). . . δbr(K)]T 

according to the following relation between the total state and its inertial estimate





  
    
      q
      GC
    
    =
    
      
        
          
            q
            ^
          
          GC
        
        ⊗
        δ
      
      ⁢
      
        
      
      ⁢
      
        q
        GC
      
    
  
  ,
  
    
  
  ⁢
  
    
      with
      ⁢
      
        
      
      ⁢
      δ
      ⁢
      
        
      
      ⁢
      
        q
        GC
      
    
    ≃
    
      
        [
        
          1
          ⁢
          
            
              δ
              ⁢
              
                
              
              ⁢
              
                θ
                T
              
            
            2
          
        
        ]
      
      T
    
  




bg(t)={circumflex over (b)}g(t)+δbg(t), ba(t)={circumflex over (b)}a(t)+δba(t)

v(t)={circumflex over (v)}(t)+δv(t), TCG(t)={circumflex over (T)}CG(t)+δTCG(t)

together with

br(k)(t)={circumflex over (b)}r(k)(t)+δbr(k)(t), 1≦k≦K,

based on which the embodiments obtains (after some algebra) the following dynamic process model for the error state:

{dot over (δ)}s=Fδs+Gn

where




  
    F
    =
    
      [
      
        
          
            
              -
              
                
                  [
                  
                    ω
                    ^
                  
                  ]
                
                x
              
            
          
          
            
              -
              
                I
                3
              
            
          
          
            
              0
              
                3
                ×
                
                  
                
                ⁢
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                
                  
                
                ⁢
                3
              
            
          
          
            
              0
              
                3
                ⁢
                
                  
                
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              -
              
                
                  R
                  ^
                
                
                  
                    GC
                    ⁡
                    
                      [
                      
                        a
                        ^
                      
                      ]
                    
                  
                  ⁢
                  x
                
                T
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              -
              
                
                  R
                  ^
                
                GC
                T
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                
                  
                
                ⁢
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              I
              3
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                K
              
            
          
        
      
      ]
    
  




  and




  
    G
    =
    
      [
      
        
          
            
              -
              
                I
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                
                  
                
                ⁢
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                
                  
                
                ⁢
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              I
              3
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              -
              
                
                  R
                  ^
                
                GC
                T
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              I
              3
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              I
              K
            
          
        
      
      ]
    
  




  and




  
    n
    =
    
      [
      
        
          
            
              n
              g
              T
            
          
          
            
              n
              
                ω
                ⁢
                
                  
                
                ⁢
                g
              
              T
            
          
          
            
              n
              α
              T
            
          
          
            
              n
              
                ω
                ⁢
                
                  
                
                ⁢
                α
              
              T
            
          
          
            
              n
              
                ω
                ⁢
                
                  
                
                ⁢
                r
              
              
                (
                1
                )
              
            
          
          
            ...
          
          
            
              
                
                  
                    n
                    
                      ω
                      ⁢
                      
                        
                      
                      ⁢
                      r
                    
                    
                      (
                      k
                      )
                    
                  
                  ]
                
                T
              
              .
            
          
        
      
    
  



To incorporate visual odometry poses that are relative in nature, one embodiment of the invention applies a stochastic cloning approach for the measurement model. In particular, the embodiment denotes P1,2 as the visual odometry pose estimate between two time instances 1 and 2, and let the corresponding pose components of the state be denoted by PG,1 and PG,2. Then defining T2,1=RG,1(T2,G−T1,G), and q1,2=qG,1−qG,2, and after lengthy algebra, the embodiment obtains the following measurement equations

δzT=[{circumflex over (R)}G,1({circumflex over (T)}2,G−{circumflex over (T)}1,G)]×δθG,1+{circumflex over (R)}G,1δT2,G−RG,1δT1,G+vT 

and

δzq= 1/2{circumflex over (R)}1,2TδθG,2− 1/2δθG,1+vq 

where vT and vq are the Gaussian noise in translation and rotation associated with the visual odometry pose solution.

These measurements are a function of the propagated error-state δs2 and the cloned error-state δs1 from previous time instance, which require modifications to the Kalman filter update equations.
As for landmark matching, given a query image, landmark matching returns the found landmark shot from the database establishing the 2D to 3D point correspondences between the query image features and the 3D local point cloud, as well as the camera pose PGL belonging to that shot. First, every 3D local landmark point X is transferred to the global coordinate system via

Y=RLGX+TLG 

which can be written under small error assumption as

Ŷ+δY≃(I−[ρ]x){circumflex over (R)}LG({circumflex over (X)}+δX)+{circumflex over (T)}LG+δTLG 

where ρ is a small rotation vector. Neglecting second order terms results in the following linearization

δY≃{circumflex over (R)}LGδX+[{circumflex over (R)}LG{circumflex over (X)}]xρ+δTLG 

and letting {tilde over (X)}={circumflex over (R)}LG{circumflex over (X)}, and the local 3D point covariance Σy, can be represented in the global coordinate frame in terms of the local reconstruction uncertainty, Σx and landmark pose uncertainty in rotation and translation ΣRLG and ΣTLG, as

ΣY≃{circumflex over (R)}LGΣx{circumflex over (R)}LGT+[{tilde over (X)}]xΣRLG[ X]xT+ΣTLG 

After this transformation, the projective camera measurement model is employed such that for each 3D point Y obtained above and expressed in the current camera coordinate system as Z=[Z1Z2Z3]T, the projection onto the normalized image plane is given by

z=f(Z)+v with f(Z)=[Z1/Z3 Z2/Z3]T 

where v is the feature measurement noise with covariance Σv and

Z=RGCY+TGC=RGC(Y−TCG).

Under small error assumption

{circumflex over (Z)}+δZ≃(I−[δθ]x){circumflex over (R)}GC(Ŷ+δY−{circumflex over (T)}CG−δTCG).

Hence,

δZ≃[{circumflex over (R)}GC(Ŷ−{circumflex over (T)}CG)]xδθ+{circumflex over (R)}GC(δY−δTCG).

Accordingly, the measurement equation in the error states is given by

δzL≃HLδs+η

where the measurement Jacobian

HL=Jf[Jθ03×303×303×3JδTCG]

with





  
    J
    f
  
  =
  
    [
    
      
        
          
            1
            /
            
              
                Z
                ^
              
              3
            
          
        
        
          0
        
        
          
            
              -
              
                
                  Z
                  ^
                
                1
              
            
            /
            
              
                Z
                ^
              
              3
              2
            
          
        
      
      
        
          0
        
        
          
            1
            /
            
              
                Z
                ^
              
              3
            
          
        
        
          
            
              -
              
                
                  Z
                  ^
                
                2
              
            
            /
            
              
                Z
                ^
              
              3
              2
            
          
        
      
    
    ]
  




Jθ=[{circumflex over (R)}GC(Ŷ−{circumflex over (T)}CG)]x, and JδTCG={circumflex over (R)}GC 

and

Ση=Jf[{circumflex over (R)}GCΣY{circumflex over (R)}GCT]JfT+Σv.

The above is applied to all the point correspondences returned as a result of landmark matching, and all the matrices and vectors are stacked to form the final measurement model equation.
Each radio node provides a measurement of its range to every other node in the system, which is modeled as

zr(k)=||TCG−TRG(k)||+br(k)+vr(k), 1≦k≦K

Where vr(k) is white Gaussian measurement noise and the embodiment denotes by TRG(k), the location in global coordinates of that particular node that is being ranged to, whose location is known by the radio that is doing the ranging. (Note that, coordinates of the static nodes are stored in each unit and remain fixed, whereas the location of mobile nodes are given by TCG(k) and are continuously broadcast at the frame rate over the wireless network.) Using the small error assumption, the above can be written as

{circumflex over (z)}r(k)+δzr(k)≃||{circumflex over (T)}CG−TRG(k)||+JrδTCG+{circumflex over (b)}r(k)+δb(k)+vr(k) 

where





  
    J
    r
  
  =
  
    
      
        
      
      ⁢
      
        
          
            T
            ^
          
          CG
          T
        
        -
        
          T
          RG
          
            
              (
              k
              )
            
            ⁢
            T
          
        
      
    
    
      
      
        
          
            T
            ^
          
          CG
        
        -
        
          T
          RG
          
            (
            k
            )
          
        
      
      
    
  




so that

δzr(k)≃JrδTCG+δb(k)+vr(k) 

from which results

δzr(k)=Hrδs+vr(k) 

with

Hr=[01×3 01×3 01×3 01×3 Jre1×K(k)],

where e1×K(k) is a 1×K vector of zeros whose k'th element is a 1.

In the predictive filter, denote the ground (global coordinate frame) to camera pose as PGC=[RGCTGc] such that point XG expressed in the ground frame can be transferred to the camera coordinates XC=RGCXG+TGC. Accordingly, TGC represents the ground origin expressed in the camera coordinate frame, whereas TCG=−RGCTTGC is the camera location in the ground coordinate frame.
In one embodiment, without loss of generality and to keep the notation simple, one embodiment of the filter assumes that the camera and IMU coordinate system coincide so that PGI=PGC. In reality, the embodiment uses an extrinsic calibration procedure to determine the camera to IMU pose PCI, (front left stereo camera is chosen as the master) and distinguish between PGI=PCI PGC and PGC.
The total (full) states of the filter consist of range radio bias br(k) for each node 1≦k≦K, the camera location TCG, the gyroscope bias vector bg, velocity vector v in global coordinate frame, accelerometer bias vector ba and ground to camera orientation qGC, expressed in terms of the quaternion representation for rotation such that RGC=(|qo|2−||{right arrow over (q)}||2)I3×3+2{right arrow over (q)} {right arrow over (q)}T−2qo[{right arrow over (q)}]x, with qGC=[qo {right arrow over (q)}T]T and [{right arrow over (q)}]x denoting the skew-symmetric matrix formed by {right arrow over (q)}. For quaternion algebra, the embodiment follows the notion and uses a frame rotation perspective. Hence, the total (full) state vector is given by

s=[qGCTbgTvTbaTTCGTbr(1). . . br(k)].

The embodiment uses the corresponding system model for the state time evolution.

{dot over (q)}GC(t)= 1/2(qGC(t)ω(t)), bg(t)=nωg(t)

{dot over (v)}(t)=a(t), {dot over (b)}a(t)=nωa(t), {dot over (T)}CG(t)=v(t)

{dot over (b)}r(k)(t)=nωr(k)(t), 1≦k≦K,

where nωg, nωa, and nωr(k) for 1≦k≦K are modeled as white Gaussian noise, and a(t) is camera acceleration in global coordinate frame, and ω(t) is the rotational velocity in camera coordinate frame. Gyroscope and accelerometer measurements of these two vectors are modeled as:

{dot over (q)}GC(t)= 1/2(qGC(t)ω(t)), bg(t)=nωg(t)

{dot over (v)}(t)=a(t), {dot over (b)}a(t)=nωa(t), {dot over (T)}CG(t)=v(t)

{dot over (b)}r(k)(t)=nωr(k)(t), 1≦k≦K,

where nωg, nωa, and nωr(k) for 1≦k≦K are modeled as white Gaussian noise, and a(t) is camera acceleration in global coordinate frame, and ω(t) is the rotational velocity in camera coordinate frame. Gyroscope and accelerometer measurements of these two vectors are modeled as:

ωm(t)=ω(t)+bg(t)+ng(t)

am(t)=RGC(t)(a(t)−g)+ba(t)+na(t)

where ng and na are modeled as white Gaussian noise and g is the gravitational acceleration expressed in the global coordinate frame.

State estimate propagation is obtained by the IMU mechanization equations

{circumflex over ({dot over (q)}GC(t)= 1/2({circumflex over (q)}GC(t){circumflex over (ω)}(t))

{dot over (v)}(t)={circumflex over (R)}GCT(t)â(t)+g,

{circumflex over ({dot over (x)}(t)={circumflex over (v)}(t), {circumflex over ({dot over (b)}g(t)=0, {circumflex over ({dot over (b)}a(t)=0

where {circumflex over (ω)}(t)=ωm(t)−{circumflex over (b)}g(t), and â(t)=âm(t)−{circumflex over (b)}a(t), together with the radio bias propagation

{circumflex over ({dot over (b)}r(k)(t)=0, 1≦k≦K.

The embodiment solves the above system of equations by fourth-order Runge-Kutta numerical integration method. The Kalman filter error state consists of

δs=[δθTδbgTδvTδbaTδTCGTδbr(1). . . δbr(K)]T 

according to the following relation between the total state and its inertial estimate





  
    
      q
      
        GC
        =
      
    
    ⁢
    
      
        
          q
          ^
        
        GC
      
      ⊗
      δ
    
    ⁢
    
      
    
    ⁢
    
      q
      GC
    
  
  ,
  
    with
    ⁢
    
      
    
    ⁢
    δ
    ⁢
    
      
    
    ⁢
    
      
        
          q
          
            GC
            ≃
          
        
        ⁡
        
          [
          
            1
            ⁢
            
              
                δ
                θ
                T
              
              2
            
          
          ]
        
      
      T
    
  




bg(t)={circumflex over (b)}g(t)+δbg(t), ba(t)={circumflex over (b)}a(t)+δba(t)

v(t)={circumflex over (v)}(t)+δv(t), TCG(t)={circumflex over (T)}CG(t)+δTCG(t)

together with

br(k)(t)={circumflex over (b)}r(k)(t)+δbr(k)(t), 1≦k≦K,

based on which the embodiments obtains (after some algebra) the following dynamic process model for the error state:

{dot over (δ)}s=Fδs+Gn

where




  
    F
    =
    
      [
      
        
          
            
              -
              
                
                  [
                  
                    ω
                    ^
                  
                  ]
                
                x
              
            
          
          
            
              -
              
                I
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              -
              
                
                  R
                  ^
                
                
                  
                    GC
                    ⁡
                    
                      [
                      
                        α
                        ^
                      
                      ]
                    
                  
                  ⁢
                  x
                
                T
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              -
              
                
                  R
                  ^
                
                GC
                T
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              I
              3
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                K
              
            
          
        
      
      ]
    
  




  
    
      and
      ⁢
      
        
      
      ⁢
      G
    
    =
    
      [
      
        
          
            
              -
              
                I
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              I
              3
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              -
              
                
                  R
                  ^
                
                GC
                T
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              I
              3
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                3
              
            
          
          
            
              0
              
                3
                ×
                K
              
            
          
        
        
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              0
              
                K
                ×
                3
              
            
          
          
            
              I
              K
            
          
        
      
      ]
    
  




  
    
      
        
          
            and
            ⁢
            
              
            
            ⁢
            n
          
          =
        
      
      
        
          [
          
            n
            g
            T
          
        
      
      
        
          n
          
            ω
            ⁢
            
              
            
            ⁢
            g
          
          T
        
      
      
        
          n
          α
          T
        
      
      
        
          n
          
            ω
            ⁢
            
              
            
            ⁢
            α
          
          T
        
      
      
        
          n
          
            ω
            ⁢
            
              
            
            ⁢
            r
          
          
            (
            1
            )
          
        
      
      
        ...
      
      
        
          
            
              
                n
                
                  ω
                  ⁢
                  
                    
                  
                  ⁢
                  r
                
                
                  (
                  k
                  )
                
              
              ⁢
              
                
              
              ]
            
            T
          
          .
        
      
    
  



To incorporate visual odometry poses that are relative in nature, one embodiment of the invention applies a stochastic cloning approach for the measurement model. In particular, the embodiment denotes P1,2 as the visual odometry pose estimate between two time instances 1 and 2, and let the corresponding pose components of the state be denoted by PG,1 and PG,2. Then defining T2,1=RG,1(T2,G−T1,G), and q1,2=qG,1−qG,2, and after lengthy algebra, the embodiment obtains the following measurement equations

δzT=[{circumflex over (R)}G,1({circumflex over (T)}2,G−{circumflex over (T)}1,G)]×δθG,1+{circumflex over (R)}G,1δT2,G−RG,1δT1,G+vT 

and

δzq= 1/2{circumflex over (R)}1,2TδθG,2− 1/2δθG,1+vq 

where vT and vq are the Gaussian noise in translation and rotation associated with the visual odometry pose solution.

These measurements are a function of the propagated error-state δs2 and the cloned error-state δs1 from previous time instance, which require modifications to the Kalman filter update equations.
As for landmark matching, given a query image, landmark matching returns the found landmark shot from the database establishing the 2D to 3D point correspondences between the query image features and the 3D local point cloud, as well as the camera pose PGL belonging to that shot. First, every 3D local landmark point X is transferred to the global coordinate system via

Y=RLGX+TLG 

which can be written under small error assumption as

Ŷ+δY≃(I−[ρ]x){circumflex over (R)}LG({circumflex over (X)}+δX)+{circumflex over (T)}LG+δTLG 

where ρ is a small rotation vector. Neglecting second order terms results in the following linearization

δY≃{circumflex over (R)}LGδX+[{circumflex over (R)}LG{circumflex over (X)}]xρ+δTLG 

and letting {tilde over (X)}={circumflex over (R)}LG{circumflex over (X)}, and the local 3D point covariance Σy, can be represented in the global coordinate frame in terms of the local reconstruction uncertainty, Σx and landmark pose uncertainty in rotation and translation ΣRLG and ΣTLG, as

ΣY≃{circumflex over (R)}LGΣx{circumflex over (R)}LGT+[{tilde over (X)}]xΣRLG[ X]xT+ΣTLG 

After this transformation, the projective camera measurement model is employed such that for each 3D point Y obtained above and expressed in the current camera coordinate system as Z=[Z1Z2Z3]T, the projection onto the normalized image plane is given by

z=f(Z)+v with f(Z)=[Z1/Z3 Z2/Z3]T 

where v is the feature measurement noise with covariance Σv and

Z=RGCY+TGC=RGC(Y−TCG).

Under small error assumption

{circumflex over (Z)}+δZ≃(I−[δθ]x){circumflex over (R)}GC(Ŷ+δY−{circumflex over (T)}CG−δTCG).

Hence,

δZ≃[{circumflex over (R)}GC(Ŷ−{circumflex over (T)}CG)]xδθ+{circumflex over (R)}GC(δY−δTCG).

Accordingly, the measurement equation in the error states is given by

δzL≃HLδs+η

where the measurement Jacobian

HL=Jf[Jθ03×303×303×3JδTCG]

with





  
    J
    f
  
  =
  
    [
    
      
        
          
            1
            /
            
              
                Z
                ^
              
              3
            
          
        
        
          0
        
        
          
            
              -
              
                
                  Z
                  ^
                
                1
              
            
            /
            
              
                Z
                ^
              
              3
              2
            
          
        
      
      
        
          0
        
        
          
            1
            /
            
              
                Z
                ^
              
              3
            
          
        
        
          
            
              -
              
                
                  Z
                  ^
                
                2
              
            
            /
            
              
                Z
                ^
              
              3
              2
            
          
        
      
    
    ]
  




Jθ=[{circumflex over (R)}GC(Ŷ−{circumflex over (T)}CG)]x, and JδTCG={circumflex over (R)}GC 

and

Ση=Jf[{circumflex over (R)}GCΣY{circumflex over (R)}GCT]JfT+Σv.

The above is applied to all the point correspondences returned as a result of landmark matching, and all the matrices and vectors are stacked to form the final measurement model equation.
Each radio node provides a measurement of its range to every other node in the system, which is modeled as

zr(k)=||TCG−TRG(k)||+br(k)+vr(k), 1≦k≦K

Where vr(k) is white Gaussian measurement noise and the embodiment denotes by TRG(k), the location in global coordinates of that particular node that is being ranged to, whose location is known by the radio that is doing the ranging. (Note that, coordinates of the static nodes are stored in each unit and remain fixed, whereas the location of mobile nodes are given by TCG(k) and are continuously broadcast at the frame rate over the wireless network.) Using the small error assumption, the above can be written as

{circumflex over (z)}r(k)+δzr(k)≃||{circumflex over (T)}CG−TRG(k)||+JrδTCG+{circumflex over (b)}r(k)+δb(k)+vr(k) 

where





  
    J
    r
  
  =
  
    
      
        
          T
          ^
        
        CG
        T
      
      -
      
        T
        RG
        
          
            (
            k
            )
          
          ⁢
          T
        
      
    
    
      
      
        
          
            T
            ^
          
          CG
        
        -
        
          T
          RG
          
            (
            k
            )
          
        
      
      
    
  




so that

δzr(k)≃JrδTCG+δb(k)+vr(k) 

from which results

δzr(k)=Hrδs+vr(k) 

with

Hr=[01×3 01×3 01×3 01×3 Jre1×K(k)],

where e1×K(k) is a 1×K vector of zeros whose k'th element is a 1.

The augmented reality/tracking processor 318 (generally referred to herein as an output processor) utilizes the three-dimensional pose estimate on path 316 to generate tracking information on path 324 and/or an augmented reality display 320. This processor 318 may form a portion of the node 300 as shown in FIG. 3, or the processor 318 may be remotely located. When remotely located, the three-dimensional pose estimate may be transmitted to the remote location using the node's transceiver (e.g., transceiver 204 in FIG. 2). The tracking information 324 may be used for understanding the position of the node 300 from a remote location, used to provide navigation information to the node 300, used locally by the node for node guidance, and the like. In other embodiments, the processor 318 may utilize externally provided video, graphics and other information at ports 322 to generate the augmented reality display 320. Techniques for creating such augmented reality displays are well-known to those skilled in the art.
FIG. 4 depicts a computer 202 forming a portion of at least one embodiment of a node 102/300 of FIGS. 1 and 3. The computer 202 receives input from the IMU 204, visual sensors 306 and ranging unit 206. The output information from the computer 202 is coupled to either a transceiver 214 for transmission to a remote location for further processing or, when using the output information locally, a display 320 or to other local processes to provide node guidance or navigation.
The computer 202 comprises a central processing unit (CPU) 400, support circuits 402 and memory 404. The CPU 400 comprises one or more commercially available processors, microprocessors, microcontrollers and the like, which are capable of performing the processing described herein. The support circuits 402 comprise well-known circuits used to support functionality of the CPU 400. Such circuits include power supplies, cache, timing circuits, communications buses, input/output circuitry, and the like.
The memory 404 stores a plurality of software modules that when executed by the CPU 400 cause the computer 202 to operate as a specific purpose computer. The memory 404 comprises a preprocessing module 406, an error state predictive filter module 412, and an output processing module 414, a landmark database module 416, and a landmark database 418. The preprocessing module 406 comprises a landmark matching module 408 and a visual odometry module 410. Operation of the preprocessing module 406 is described with respect to FIG. 6 below. The error-state predictive filter module 412 is described above with respect to FIG. 3. The output processing module 414 provides the functionality of the augmented reality/tracking processor described with respect to FIG. 3. The landmark database module 416 and its associated landmark database 418 are described with respect to FIG. 5 below.
In one embodiment, the memory 404 stores an object tracking module 420 that, when executed, enables a node to track on object within the environment, One exemplary object is a weapon. The module 420 tracks markers on the weapon such that the pose of the weapon can be monitored. Details of the operation of the object tracking module 420 are described with reference to FIGS. 7, 8 and 9 below.
FIG. 5 depicts a flow diagram of a method 500 for building a landmark database (e.g., database 418 of FIG. 4) used in the node pose computation of at least one embodiment of a node 102/300s of FIGS. 1 and 3. This method may be a portion of the landmark database module 416 and executed by the node's computer. Alternatively, the method 500 may be executed using a separate robot to “map” the environment prior to operating a node in the environment.
The method 500 begins at step 502 and proceeds to step 504, where the method 500 captures three-dimensional measurements of the environment within which a node will operate. In one embodiment, the three-dimensional measurements are produced using a LIDAR scanner. Other forms of scanners such as radar, ultrasonic, laser and the like may also be used.
At step 506, the method 500 utilizes the three-dimensional measurements to generate a point cloud representation of the environment. Because the three dimensional measurements from a LIDAR sensor have a linear error with respect to range, overlapping point clouds can be aligned with a high degree of accuracy. This provides the correction necessary to eliminate drift that would otherwise exist in the collected landmark database.
As the scanner traverses the environment (autonomously or user-controlled), it stops at regular intervals and pans, recording full omni-directional visual and 3D data at each position. Each of these local data collections is called a 360° scan. The algorithm for automatic point cloud integration and pose correction is set up as a pipeline that processes each 360° scan in turn. A single 360° scan Si includes LIDAR and camera data from time ti to tj. The LIDAR data consists of a set of scanlines L[ti. . . tj], the camera data consists of a set of images I[ti. . . tj], and the visual odometry outputs a corresponding set of poses (one for each image) P[ti. . . tj]. There is a point cloud database DB3D and a landmark database DBLM. Iterative closest point (ICP) is an EM-style of algorithm used to align two overlapping point clouds. The algorithm for constructing the model and landmark database follows:

    
    
        for each scan S
        integrate L[ti. . . tj] using P[ti. . . tj] to get Xi 
        query DB3D for overlapping scans XDB 
        align Xi with XDB using ICP algorithm
        transform Xi with ICP correction:
        Xi′=PICPXi 
        add Xi′ to DB3D 
        transform P[ti. . . tj] with same ICP correction
        P′[ti. . . tj]=PICPP[ti. . . tj]
        add (P′[ti. . . tj], I[ti. . . tj]) to DBLM 
        end
    
    


At step 508 the method 500 constructs a point cloud model and a landmark database. The landmark database comprises positioning information of particular landmarks (e.g., physical structures) within a global coordinate system of the environment. For each landmark, the database stores three elements: a three-dimensional coordinate vector representing the landmark's three-dimensional location within the environment, a two-dimensional coordinate vector representing the landmark's two-dimensional location in an image, and a feature descriptor the characterizes the landmark's appearance.
At step 510, the method 500 queries whether a next scan is to be performed to continue expanding the point cloud model and the landmark database. If the query is affirmatively answered, the method 500 proceeds to step 504. If the query is negatively answered, the method 500 proceeds to step 512 to perform post-processing. Once all scans have been processed and the two databases have been populated with landmarks and point clouds, post-processing may be performed to apply global transformations, remove redundant data, or subsample the point clouds to a uniform density.
FIG. 6 depicts a flow diagram of a method 600 of operation of the preprocessing module 406 executed by the computer of FIG. 4 in accordance with one embodiment of the invention. The method 600 receives input imagery at step 602, input range information at step 612, and input IMU information at step 616.
Input imagery is applied to a visual odometry process 604 wherein the imagery is used to generate visual sensor location information. Visual odometry addresses the problem of estimating camera poses based on image sequences in a relative coordinate system. At step 603, the poses of video frames are computed in the coordinate system of the first frame or a key frame in the sequence.
In one embodiment, video frames captured from the multi-camera system are used to compute the visual odometry solution. After acquiring the left and right camera image frames at time tk, the first step consists of detecting and matching Harris corner based feature points in each stereo pair. Feature point image coordinates are normalized using the known intrinsic calibration parameters in each camera (by multiplication with the inverse of a calibration matrix) and compensated for radial distortion. In the stereo matching process, calibration information allows the method 500 to eliminate most of the false matches by applying epipolar and disparity constraints. The stereo camera calibration process is a standard process in computer vision. The method is based on tracking image features on a known calibration board from both the left and right cameras simultaneously. Using the positions of the tracked image features and the corresponding 3D positions of those features on the calibration board, the relative orientation of each of the cameras with respect to the calibration board is computed. From this step, the relative orientation of the two cameras with respect to each other is computed and stored as the extrinsic calibration parameters. The same process is also used to compute intrinsic camera parameters such as focal len., image center, radial distortion etc.
Calibration is followed by computation of the 3D locations corresponding to these feature points through stereo triangulation in the coordinate frame of the current left camera. Next, using the new image frames at time step tk+1, 2D-2D correspondences are established by matching feature points between the previous frames at time step tk and the current ones at tk+1. This allows 3D-2D point correspondences to be established based on the 3D point cloud computed in the previous step. Finally, the pose of the left camera in each stereo pair can be computed using a robust resection method based on RANSAC followed by iterative refinement of the winning hypothesis where Cauchy-based robust cost function of the reprojection errors in both the left and right images is minimized. For the front stereo pair (j=1) and back stereo pair (j=2), this cost function is given by:




  
    
      c
      j
    
    ⁡
    
      (
      
        P
        k
        j
      
      )
    
  
  =
  
    
      
        ∑
        
          i
          =
          1
        
        
          K
          j
        
      
      ⁢
      
        ρ
        ⁡
        
          (
          
            
              x
              i
              
                l
                j
              
            
            -
            
              h
              ⁡
              
                (
                
                  
                    P
                    k
                    j
                  
                  ⁢
                  
                    X
                    i
                    j
                  
                
                )
              
            
          
          )
        
      
    
    +
    
      ρ
      ⁡
      
        (
        
          
            x
            i
            
              r
              j
            
          
          -
          
            h
            ⁡
            
              (
              
                
                  P
                  
                    s
                    j
                  
                
                ⁢
                
                  P
                  k
                  j
                
                ⁢
                
                  X
                  i
                  j
                
              
              )
            
          
        
        )
      
    
  




where, for the jth stereo pair, Kj is the number of feature points, xil and xir denote coordinates of the feature point i in the left and right images, Xij denotes its 3D position in homogeneous coordinates, Ps denotes the pose of the right camera in the left camera coordinate frame (known through stereo calibration), function h is used in denoting the conversion from homogeneous to inhomogeneous coordinates, ρ(y) =log(1+||y|2/a2) is the Cauchy-based robust cost function with a given scale parameter a, and finally Pkj=Pj(tk, tk+1) is the relative pose across two time instants.
Calibration is followed by computation of the 3D locations corresponding to these feature points through stereo triangulation in the coordinate frame of the current left camera. Next, using the new image frames at time step tk+1, 2D-2D correspondences are established by matching feature points between the previous frames at time step tk and the current ones at tk+1. This allows 3D-2D point correspondences to be established based on the 3D point cloud computed in the previous step. Finally, the pose of the left camera in each stereo pair can be computed using a robust resection method based on RANSAC followed by iterative refinement of the winning hypothesis where Cauchy-based robust cost function of the reprojection errors in both the left and right images is minimized. For the front stereo pair (j=1) and back stereo pair (j=2), this cost function is given by:




  
    
      c
      j
    
    ⁡
    
      (
      
        P
        k
        j
      
      )
    
  
  =
  
    
      
        ∑
        
          i
          =
          1
        
        
          K
          j
        
      
      ⁢
      
        ρ
        ⁡
        
          (
          
            
              x
              i
              
                l
                j
              
            
            -
            
              h
              ⁡
              
                (
                
                  
                    P
                    k
                    j
                  
                  ⁢
                  
                    X
                    i
                    j
                  
                
                )
              
            
          
          )
        
      
    
    +
    
      ρ
      ⁡
      
        (
        
          
            x
            i
            
              r
              j
            
          
          -
          
            h
            ⁡
            
              (
              
                
                  P
                  
                    s
                    j
                  
                
                ⁢
                
                  P
                  k
                  j
                
                ⁢
                
                  X
                  i
                  j
                
              
              )
            
          
        
        )
      
    
  




where, for the jth stereo pair, Kj is the number of feature points, xil and xir denote coordinates of the feature point i in the left and right images, Xij denotes its 3D position in homogeneous coordinates, Ps denotes the pose of the right camera in the left camera coordinate frame (known through stereo calibration), function h is used in denoting the conversion from homogeneous to inhomogeneous coordinates, ρ(y) =log(1+||y|2/a2) is the Cauchy-based robust cost function with a given scale parameter a, and finally Pkj=Pj(tk, tk+1) is the relative pose across two time instants.

The method 600 performs the above steps independently for both the front and back stereo pairs in a parallel fashion. At the end of this process, two pose estimates are obtained from both pairs and the best one is chosen based on a cumulative (global) score.
Landmark matching of the sensor videos to a landmark database allows the visual odometry process 604 to locate and track the node's 3D position and pose in an absolute world coordinate system. An incremental motion based navigation system fusing visual odometry, and IMU via Kalman filter is only locally accurate and will drift eventually as the errors accumulate. This drift is mitigated when using either landmark processing or ranging to augment the visual odometry solution. Landmark-based navigation locates the node in an absolute coordinate system and prevents drift. By integrating two complementary modules (visual odometry and landmark matching), the two-stage localization technique dramatically increases the robustness of the combined system.
In one embodiment, a landmark is defined as a feature point in a scene. Specifically, it is extracted from the image using a Harris corner detector. Each landmark is associated with three elements: a 3D coordinate vector representing the 3D location, a 2D coordinate vector representing the 2D location in the image and a feature descriptor that characterizes the appearance. The histogram of oriented gradients (HOG) descriptor is used to model the appearance of each of the selected corner points.
Method 600 accesses the landmark database at step 606. The landmark database is represented as a collection of landmark shots, where a landmark shot is a set of landmarks captured at a specific camera location and view point (or camera pose). A landmark shot is the basic unit of landmark matching. For each landmark shot, besides storing all the location (2D+3D) and appearance (HOG) information of each landmark into the database, the associated camera pose at that instant is also stored.
When the node initializes, it locates itself by searching the entire landmark database. This is performed via the fast indexing technique using a vocabulary tree. Once the node locates itself globally, it will update the current camera pose and its uncertainty to estimate a search region. The estimated search region will serve as a geo-spatial constraint to select a smaller set of landmarks for matching in the next frame. As a result, both efficiency and accuracy can be increased. While navigating, whenever the node fails to locate via landmark-based localization, the visual odometry, ranging and Kalman filter system takes over. The visual odometry, ranging and Kalman filter combination localizes by estimating the frame-to-frame, ranging and IMU relative poses and integrating them over time. The node will resume landmark-based localization as soon as an image is found and matched in the landmark database.
At step 606, the visual sensor pose from step 603 is used to estimate a search region. The landmark database provides landmarks that are within this search region. A radius for the three-dimensional search region is obtained automatically via the uncertainty based on the estimated, tree drift rate. Subsequently, all the landmarks acquired at the positions within the obtained search region are selected from the landmark database to form a landmark cache. For efficient landmark retrieval, the landmark databases index to be a prebuilt vocabulary tree. At step 608, images from the front and back stereo pairs are matched to the vocabulary tree indexed landmark cache to obtain a list of top ranked landmarks. These landmarks are subsequently refined by imposing and at the polar constraint. Finally, the embodiment utilizes the number of matched landmarks to characterize the matching score for each image, any image with the highest score that satisfies a predetermined threshold is returned as a successful match.
For efficiency, method 600 stores they mapped node indices at each layer in the tree for each landmark in the landmark database so that the visual word quantization need be performed only once.
Using this topology inference technique, all the readers its two locations already stored in the landmark database are identified successfully, regardless of the complexity of the environment or the number of overlaps along the systems path during the process of landmark collection. Once a re-visit or an overlapped image pair is found, all the frames between the reference frame and the current frame will be used for optimization using a bundle adjustment.
Bundle adjustment is used to find optimized estimates of poses for the landmark images and the corresponding three-dimensional landmarks. Specifically, given a set of N frames starting at time t=1, the final cost function e is expressed as:

e(Pt=1, . . . ,N, Xm, Xs)=Σt=1Net(Pt, Xtm, Xts)

where Xm=X1mU . . . UXNm and Xs=X1sU . . . UXNs 

Bundle adjustment minimizes the final cost function e over the set of N frames by solving the camera poses Pi and the 3D feature coordinates Xj: 

arg minPi,Xje(Pi=1, . . . ,N, Xj=1, . . . ,K)  (5)

Bundle adjustment is used to find optimized estimates of poses for the landmark images and the corresponding three-dimensional landmarks. Specifically, given a set of N frames starting at time t=1, the final cost function e is expressed as:

e(Pt=1, . . . ,N, Xm, Xs)=Σt=1Net(Pt, Xtm, Xts)

where Xm=X1mU . . . UXNm and Xs=X1sU . . . UXNs 

Bundle adjustment minimizes the final cost function e over the set of N frames by solving the camera poses Pi and the 3D feature coordinates Xj: 

arg minPi,Xje(Pi=1, . . . ,N, Xj=1, . . . ,K)  (5)

Solving the bundle adjustment equation is a linear minimization problem, which is solved using the iterative Levenberg-Marquardt non-linear least-squares approach. During minimization, the initial values are taken from the estimated poses from the multi-stereo fusion performed in step 603. Bundle adjustment provides a globally optimized landmark.
At step 610, the method 600 generates the visual sensor location and pose.
At step 614, the method 600 utilizes the range information from step 612 to update a range bias. The range bias value with each range node is stored as part of the states in the Kalman filter and is initialized by prior values estimated beforehand. Then, for each input range measurement, including only distance information, the error-state predictive filter forms a prediction for that measurement by comprising into the states the stored value including the range bias value. The state values including range bias values thus can be updated by utilizing the derived Jacobian and the difference between input measurements and prediction formed by the filter.
At step 618, the method 600 utilizes the IMU information (e.g., gyroscope, velocity, acceleration) from step 616 to update a gyroscope bias vector, an accelerometer bias vector, and the velocity vector. The gyroscope bias and accelerometer bias values are stored as part of the states in the filter. The filter uses IMU mechanism method to utilize all the IMU information received between two time steps for generating a filter state prediction and forming the state transition matrix among all state values including the bias values. The gyroscope bias and accelerometer bias values thus can be updated.
At step 620, the method 600 creates a measurement input for the error-state predictive filter. This measurement input comprises the range bias, camera location, gyroscope by a sector, velocity vector, accelerometer bias sector, and ground to camera orientation.
The foregoing embodiments, utilized ranging information, IMU information, and visual odometry augmented with landmark matching to perform navigation. In alternative embodiments, ranging information may be excluded and navigation performed using IMU information and visual odemetry augmented with landmark matching. In still further embodiments, navigation can be performed using ranging information, IMU information and visual odometry without landmark matching.
In a further embodiment of the invention, objects within the environment may be tracked and their orientation monitored using the visual sensors of the node. For example, in a helmet mounted node, the forward visual sensors may be used to determine the pose of a weapon or other object held by a user.
As shown in FIG. 7, multiple markers (i.e., fiducials) 700 are mounted on an object (e.g., weapon) 702. By detecting the markers 700 in the video frames from the two forward-facing visual sensors 208, the node 102 estimates six degrees of freedom (6-DOF) pose of the weapon. FIG. 8 depicts a top view of the object 700 comprising a plurality of markers 702. The markers 702 are patterned to assist in marker recognition and orientation computations.
Fiducial detection is well-studied in augmented reality. However, existing approaches are not reliable enough to handle the difficulties inherent in a combat application, including significant lighting changes, severe foreshortening, and the limited fiducial size. The embodiment of the invention relies on curve extraction. This leads to its robustness under non-uniform lighting conditions and its computational efficiency. The embodiment can execute at 60 Hz with 640×480 images on a single-core CPU.
FIG. 9 depicts a flow diagram of a method 900 of computing pose of an object within the environment in accordance with one embodiment of the invention. The method 900 represents one implementation of the object tracking module 420 of FIG. 4. The method 900 begins at step 902 and proceeds to step 904 wherein edge pixels are detected with non-maximum suppression on gradient and linked into curves. Rectangles are detected from the curves. At step 906, each rectangle is classified into one of the fiducials or non-fiducial based on the configuration of its inside curves. Each rectangle is also classified according to the rectangle's internatl pattern (e.g., inside black blobs/dots), which are detected with thresholding. The more confident classification result is output.
The fiducials are detected in both of the left and right images from the forward-facing visual sensors. At step 908, the method 900 computes correspondences between the left and right images. Based on the correspondences between the detected 2D points of the fiducials' corners and their 3D points, the method 900 uses a well-known generalized 3-point algorithm to calculate the pose of the object at step 910. The method 900 ends at step 912.
Various elements, devices, modules and circuits are described above in association with their respective functions. These elements, devices, modules and circuits are considered means for performing their respective functions as described herein.
While the foregoing is directed to embodiments of the present invention, other and further embodiments of the invention may be devised without departing from the basic scope thereof, and the scope thereof is determined by the claims that follow.

## Claims

1. Apparatus for providing three-dimensional navigation for a node comprising:
an inertial measurement unit (IMU), coupled to the node, for providing gyroscope, acceleration and velocity information, collectively IMU information;
a ranging unit, coupled to the node, for providing distance information relative to at least one reference node;
at least one visual sensor, coupled to the node, for providing images of an environment surrounding the node wherein features are tracked in the images in adjacent frames and combined with the IMU information to produce relative pose measurements;
a landmark matcher for generating an error state derived from comparing at least one image to a visual landmark within the environment;
a preprocessor, coupled to the inertial measurement unit, the ranging unit, the at least one visual sensor and the landmark matcher for fusing the relative pose measurements, the error state from the landmark matcher, the distance information and the IMU information to generate an error state comprising local and global information; and
an error-state predictive filter, coupled to the preprocessor, for processing the error state, which comprises local and global information to produce a continually updated three-dimensional pose of the node,
wherein the error-state predictive filter localizes the node by estimating frame to frame information, estimating ranging information and estimating IMU information and integrating the estimates over time when the node fails to localize via the landmark matcher.

2. The apparatus of claim 1 wherein the at least one reference node is at least one of an anchor node or mobile node.

3. The apparatus of claim 1 wherein the at least one visual sensor comprises at least one stereo camera.

4. The apparatus of claim 1 wherein the visual landmark is recalled from a landmark database.

5. The apparatus of claim 4 wherein the landmark database is created by scanning the environment with a sensor to create a point cloud representation of the environment.

6. The apparatus of claim 1 further comprising an output processor for generating, in response to the pose, at least one of tracking information or an augmented reality display.

7. The apparatus of claim 1 wherein the error state further comprises range bias, camera location, gyroscope bias vector, velocity vector, accelerometer bias vector, and ground to camera orientation.

8. The apparatus of claim 7 wherein the error-state predictive filter produces the three dimensional pose when image information is inaccurate or not available.

9. The apparatus of claim 1 wherein the apparatus is attached to a helmet.

10. The apparatus of claim 1 wherein the error states comprise camera location, gyroscope bias vector, velocity vector, accelerometer bias vector, and ground to camera orientation.

11. The apparatus of claim 1 wherein the error- state predictive filter produces the three dimensional pose when image information is inaccurate or not available.

12. A method, executed by a processer, for generating a pose of a node, the method comprising:
using an inertial measurement unit coupled to the node for providing gyroscope, acceleration and velocity information, collectively IMU information, using a ranging unit coupled to the node for providing distance information relative to at least one reference node, and using at least one visual sensor coupled to the node for providing images of an environment surrounding the node, wherein features are tracked in adjacent frames in the images and combined with the IMU information to produce relative pose measurements;
generating, by a landmark matcher, an error state derived from comparing at least one image to a visual landmark within the environment;
fusing the relative pose measurements, the error state from the landmark matcher, the distance information and the IMU information to generate an error state comprising local and global information; and
processing, by the processor, the error state, which comprises local and global information, within an error state predictive filter to produce a continually three-dimensional pose of the node,
wherein the error state predictive filter localizes the node by estimating frame to frame information, estimating ranging information and estimating IMU information and integrating the estimates over time when the node fails to localize via the landmark matcher.

13. The method of claim 12 wherein the error state further comprises camera location, gyroscope bias vector, velocity vector, accelerometer bias vector, and ground to camera orientation.

14. The method of claim 12 wherein the error state predictive filter produces the three dimensional pose when image information is inaccurate or not available.