# Patent

## Title
Tracking a surface in a 3-dimensional scene using natural visual features of the surface

## Abstract

A facility for determining the 3-dimensional location and orientation of a subject surface in a distinguished perspective image of the subject surface is described. The subject surface has innate visual features, a subset of which are selected. The facility uses the location of the selected visual features in a perspective image of the subject surface that precedes the distinguished perspective image in time to identify search zones in the distinguished perspective image. The facility searches the identified search zones for the selected visual features to determine the 2-dimensional locations at which the selected visual features occur. Based on the determined 2-dimensional locations, the facility determines the 3-dimensional location and orientation of the subject surface in the distinguished perspective image.

## Background
CROSS-REFERENCE TO RELATED APPLICATION
This is a continuation application of U.S. application Ser. No. 10/692,020, filed on Oct. 22, 2003 now U.S. Pat. No. 7,343,278, entitled Tracking A Surface In A 3-Dimensional Scene Using Natural Visual Features Of The Surface which claims the benefit of (1) U.S. Provisional Application No. 60/420,638, entitled “An Augmented Reality Registration Method Based On Matching Templates Generated From An Image Texture,” filed on Oct. 22, 2002; and (2) U.S. Provisional Application No. 60/513,725, entitled “Registrating a Specific Planar Scene Using Fiducial Markers,” filed on Oct. 22, 2003, each of which is hereby incorporated by reference in its entirety.


TECHNICAL FIELD
The present invention is directed to the fields of computer vision and video processing.
BACKGROUND
One task faced in the field of computer vision is tracking the movement of an object within a video scene. In many cases, tracking the object consists of tracking the location and orientation of the object with respect to a camera—that is, the point in space that is the perspective from which the video scene is captured.
One significant subset of the movement tracking task is tracking the movement of a roughly planar, i.e., 2-dimensional, surface within a video scene. Such a surface may be one side of a sheet of paper, either a free-standing sheet of paper or a sheet of paper in a book. It may also be a surface presented by virtually any other object. One application of surface tracking is introducing a view of a virtual, 3-dimension object into each frame of the video scene that appears to float about the surface, termed reality augmentation.
Surface tracking has conventionally been addressed through the use of fiducial marker tracking. Fiducial marker tracking involves affixing a special, visually distinct symbol (such as a bold black square having a white interior) to the surface to be tracked; locating the symbol—called a fiducial marker—in each video frame; determining the location of the surface with respect to the camera based on the size of the marker in the video frame and its location in the video frame; and determining the orientation of the surface with respect to the camera based on the orientation of the marker in the video frame.
Fiducial marker tracking has significant disadvantages, however. First, fiducial marker tracking fails any time the fiducial marker is not present in the scene. This can happen in a variety of circumstances, even while the surface remains in the scene. For example, the fiducial marker may be occluded by an object that intervenes in space between the camera and the fiducial marker, such as a person's hand or another inanimate object. The fiducial marker may also move outside of the boundaries of the video scene, such as when the camera moves so close to (or zooms in so close to) the surface that the scene can only contain a portion of the surface that excludes the fiducial marker. This disadvantage can only be overcome by adding larger and larger numbers of fiducial markers to the surface, overwhelming the appearance of the surface and obscuring its innate visual features.
Second, fiducial marker tracking can fail when the surface is distant from the camera, and the camera's view of the surface is too limited to distinguish the fiducial marker. The only way to address this disadvantage is to use larger and larger fiducial markers, again overwhelming the appearance of the surface and obscuring its innate visual features.
In view of these shortcomings, an approach to surface tracking that does not rely on the continuous visibility and distinguishability of fiducial markers affixed to the surface would have significant utility.



BRIEF DESCRIPTION OF THE DRAWINGS
The patent or application file contains at least one drawing executed in color. Copies of this patent or patent application with color drawings will be provided to the United States Patent and Trademark Office upon request and payment of the necessary fee.
FIG. 1 is an image diagram showing a typical image that, when attached to a surface, can be tracked by the facility.
FIG. 2 is a flow diagram showing steps typically performed by the facility in order to track a surface.
FIG. 3 is a block diagram showing a typical environment in which the facility operates.
FIG. 4 is a pixel diagram showing the relationship between a window used in template matching and a search area within a video frame that contains it.
FIG. 5 is a pixel diagram that illustrates the feature point constraints for a candidate pixel.
FIG. 6A shows the output of this first step of the offline feature extraction algorithm for the original image resolution of 200 dpi.
FIG. 6B shows the output at a lower resolution of 100 dpi. Both of these figures reflect a template size of 25×25 pixels.
FIG. 7 is an image diagram showing sample features extracted from the image shown in FIG. 1.
FIG. 8 is a graph showing the experimental efficacy of different combinations of these prediction methods.
FIGS. 9A-9C are tracking diagrams showing tracking results for various resolutions in a scene.
FIGS. 10A and 10B are tracking diagrams showing tracking results under an occlusion condition.
FIGS. 11A-11D are tracking diagrams showing tracking results for scenes under various degrees of rotation.
FIGS. 12A and 12B are image diagrams showing sample images tracked by the facility.
FIG. 13 is a coordinate diagram showing the coordinate system used by the facility.
FIGS. 14A and 14B are diagrams showing preliminary feature point extraction results.
FIGS. 15A and 15B are diagrams showing preliminary feature point extraction results.
FIGS. 16A-16H are tracking diagrams showing the results of sample tracking experiments.
FIGS. 17A-17D show template matching results for example images.



DETAILED DESCRIPTION
A software facility for tracking a surface in a 3-dimensional scene using natural visual features of the surface (“the facility”) is provided. In some embodiments, the facility acquires an image of the surface, and uses it to select visual features of the surface that the facility will use to track the surface. In some embodiments, the facility performs this surface analysis and feature selection on a non-real-time basis. In some embodiments, the facility selects groups of features that are each of a different size, for use when the surface is at different distances from the camera. To initially identify the surface in the video frame, in some embodiments, the facility locates a fiducial marker attached to the surface within the video scene, and uses it to determine the surface's distance and orientation relative to the camera. After this point, the facility reiteratively uses earlier tracking results to both (1) select a group of features to search for based upon the distance of the surface from the camera, and (2) delineate search zones in the video scene in which the facility expects to find the natural features based upon their prior positions. The facility then searches these search zones for the natural features in the selected group, and uses their locations in the video scene to determine the surface's location and orientation relative to the camera.
The key idea to allow real-time tracking of natural features is to select beforehand the “best” features to track using an offline image processing program, and to choose an appropriate and fast matching method that will allow the detection and matching of these features in real-time during the online tracking phase. Based on these considerations, we chose points as the features to track, and template matching as the matching technique.
FIG. 1 is an image diagram showing a typical image that, when attached to a surface, can be tracked by the facility. The image has visual contents 100, including a fiducial marker 110.
The offline extraction of the features to track greatly reduces the computation time and makes it possible to track the features in real-time: since the set of specific pixels to track is defined a priori, natural point features do not have to be extracted from each frame, but only to be tracked over time. In other words, the offline feature point extraction generates a set of fixed “natural corners” which perform exactly the same function as the artificial corners introduced by a marker, i.e. to be reference points whose coordinates are known in the object frame. However, as the camera pans in or pans out, the level of detail perceived by the camera changes dramatically. For example, a black letter on a white background is a good feature to track when the camera is close to the planar scene, it might be that this same letter is not visible when the camera is far away from the scene. This problem can be solved by performing the offline feature extraction independently at different resolutions and adapting the set of features online as the camera moves.
In all other respects, the general principle of natural-feature based tracking is the same as the marker-based tracking. Four coplanar feature points whose coordinates are known in the page and their projections in the image plane provide correspondences that allow calculating the planar homography and the extrinsic parameters. The main difference is that there are usually a lot more than four feature points available, thus providing a natural mechanism to cope with occlusions: if the tracked planar scene has a reasonable size, it is very unlikely that the user's hand will occlude all the available features in the image.
One drawback of the natural feature tracking however is that the tracker's initialization appears to be a delicate task: detecting four natural feature points in the first video frame requires template matching on the whole image for every single possible feature point. This search is computationally expensive and ineffective if the video frame does not provide a perpendicular view of the scene to track. To overcome this drawback, a marker is placed on the page to provide the initial homography as described further below. This homography is used to un-warp the image so that the tracker has a perpendicular view of the scene. From there the tracker knows where to look for the predefined natural point features and no longer needs the marker to be in view. A search size is fixed and template matching is carried out in windows around the predicted feature points' positions. The four “best” natural point features detected are selected as input for updating the homography. The updated homography is also used to generate new templates around the feature points, since the region around a pixel changes as the camera moves. The previous feature points' locations and displacement are used to predict their location in the next frame. Then the tracker estimates the current resolution of the planar scene as seen by the camera and changes the set of predefined features to track if appropriate. Finally, the camera pose is estimated and the virtual model can be rendered on the top of the book page.
FIG. 2 is a flow diagram showing steps typically performed by the facility in order to track a surface. The facility begins in marker based initialization mode 210. In step 211, the facility converts an image of the surface into binary form. In step 212, the facility extracts connected components from the binary version of the image of the surface. In step 213, the facility extracts the contours from the image of the surface. In step 214, the facility rejects any false contours among the extracted contours, and performs sub-pixel recovery of the coordinates of the corners of the marker. In step 215, the facility computes the homography of the surface (that is, its location and orientation relative to the camera), and un-warps the image of the surface by normalizing it with respect to the surface's determined location and orientation with respect to the camera. In step 216, the facility selects the best visual features of the surface, such as the best four features. These selected features are sometimes referred to as “point features.”
After the steps of the marker-based initialization mode 210 are completed, the facility enters a natural feature tracking mode 220. In step 221, the facility updates the templates established during the marker-based initialization phase. In step 222, the facility uses earlier tracking results to predict the locations in the video image at which the surface's point features will occur in the next video frame. In step 223, the facility attempts to detect the point features near the predicted locations in the video frame using a template-matching process. In step 224, the facility updates the surface's homography using the results of step 223. In step 225, the facility evaluates the resolution in feature point selection for the next iteration of the natural feature tracking mode. In some embodiments, step 225 precedes step 221 in the natural feature tracking mode (not shown).
After completing the steps of natural feature tracking mode 220, the facility performs a test 230 to determine whether the most recent iteration of the natural feature tracking mode failed to track the surface in the video scene. If so, the facility continues in the marker-based initialization mode to re-locate the surface in the video scene, else the facility continues in the natural feature tracking mode to continue tracking the surface.
FIG. 3 is a block diagram showing a typical environment in which the facility operates. The environment contains a computer system 300, which includes one or more processors 310 for executing programs, such as the facility; a video interface 320 that is connected to a camera 360 for acquiring individual images and/or video sequences comprised of images; a persistent storage device 330; a memory 340, containing at least the facility 341; and a computer-readable medium drive 350 for reading information or installing programs such as the facility from computer-readable media, such as a floppy disk, a CD-ROM, or a DVD. Those skilled in the art will appreciate that data and/or programs may be transferred between memory and the persistent storage device for purposes of memory management and data integrity. While various embodiments are described in terms of the environment described above, those skilled in the art will appreciate that the facility may be implemented in a variety of other environments including combinations of one or more computer systems or similar devices connected in various ways.
1. Offline Feature Extraction
This subsection illustrates the design of the feature extraction scheme that detects the best candidate points for template matching at different resolutions.
1.1 Template Matching
The offline feature extraction method detects points for which template matching will work well. Therefore, the design of the feature extraction scheme is contingent on the design of the template matching technique. Assuming that the disparity between two successive video frames Ik and Ik+1 is small, then the criterion that can be used to match a point feature is similarity. For points, the universal measure of intensity similarity is correlation. Let pi be a feature point in Ik, and W be a window of size w+1 and h+1 (with w and h odd numbers) centered on pi. W defines the template to look for in Ik+1.
FIG. 4 is a pixel diagram showing the relationship between a window used in template matching and a search area within a video frame that contains it. Rectangle 400 is the video frame Ik+1. Rectangle 410 is the search area. Rectangle 420 is the search window W, centered on pixel 430 at (y0, x0). Window W spans columns x0−w/2 through x0+w/2, and spans rows y0−w/2 through y0+w/2.
Finding the pixel in Ik+1 that is most likely to correspond to pi is equivalent to finding the region of size w+1 and h+1 in Ik+1 that has the highest correlation score with W within the search area. Normalized cross-correlation (NCC)—discussed in F. Vial, “State of the Art Report on Natural Feature Tracking for Vision—Based Real-Time Augmented Reality”, Technical Report, Human Interface Technology Laboratory New Zealand (HITLab NZ), University of Canterbury, Christchurch, New Zealand, 2003, has shown to be an effective point correlation method. To calculate the NCC between a template W and a region of the same size around a pixel (x0, y0) in Ik+1, the intensity values for the considered pixels have to be centered. Let i and j be indexes spanning a square region of the same size as W. Then

Ĩk+1(x0,y0,i,j)=Ik+1(x0+i,y0+j)−Īk+1(x0,y0) and {tilde over (W)}(i,j)=W(i,j)− W

are the centered values of the pixel (i,j) within the considered region in Ik+1 and W respectively, with




  
    
      
        
          I
          _
        
        
          k
          +
          1
        
      
      ⁡
      
        (
        
          
            x
            0
          
          ,
          
            y
            0
          
        
        )
      
    
    =
    
      
        1
        
          
            (
            
              w
              +
              1
            
            )
          
          ⁢
          
            (
            
              h
              +
              1
            
            )
          
        
      
      ⁢
      
        
          ∑
          
            i
            =
            
              
                -
                w
              
              /
              2
            
          
          
            w
            /
            2
          
        
        ⁢
        
          
            ∑
            
              j
              =
              
                
                  -
                  h
                
                /
                2
              
            
            
              h
              /
              2
            
          
          ⁢
          
            
              I
              
                k
                +
                1
              
            
            ⁡
            
              (
              
                
                  
                    x
                    0
                  
                  +
                  i
                
                ,
                
                  
                    y
                    0
                  
                  +
                  j
                
              
              )
            
          
        
      
    
  




  and




  
    
      W
      _
    
    =
    
      
        1
        
          
            (
            
              w
              +
              1
            
            )
          
          ⁢
          
            (
            
              h
              +
              1
            
            )
          
        
      
      ⁢
      
        
          ∑
          
            i
            =
            
              
                -
                w
              
              /
              2
            
          
          
            w
            /
            2
          
        
        ⁢
        
          
            ∑
            
              j
              =
              
                
                  -
                  h
                
                /
                2
              
            
            
              h
              /
              2
            
          
          ⁢
          
            W
            ⁡
            
              (
              
                i
                ,
                j
              
              )
            
          
        
      
    
  



Then, the normalized cross correlation score between W and the region around (x0,y0) yields:





  
    
      
        
          NCC
          ⁡
          
            (
            
              
                
                  I
                  
                    k
                    +
                    1
                  
                
                ⁡
                
                  (
                  
                    
                      x
                      0
                    
                    ,
                    
                      y
                      0
                    
                  
                  )
                
              
              ,
              W
            
            )
          
        
        =
        
          
            
              ∑
              
                i
                =
                
                  
                    -
                    w
                  
                  /
                  2
                
              
              
                w
                /
                2
              
            
            ⁢
            
              
                ∑
                
                  j
                  =
                  
                    
                      -
                      h
                    
                    /
                    2
                  
                
                
                  h
                  /
                  2
                
              
              ⁢
              
                
                  
                    
                      I
                      ~
                    
                    
                      k
                      +
                      1
                    
                  
                  ⁡
                  
                    (
                    
                      
                        x
                        0
                      
                      ,
                      
                        y
                        0
                      
                      ,
                      i
                      ,
                      j
                    
                    )
                  
                
                ⁢
                
                  
                    W
                    ~
                  
                  ⁡
                  
                    (
                    
                      i
                      ,
                      j
                    
                    )
                  
                
              
            
          
          
            
              
                
                  ∑
                  
                    i
                    =
                    
                      
                        -
                        w
                      
                      /
                      2
                    
                  
                  
                    w
                    /
                    2
                  
                
                ⁢
                
                  
                    ∑
                    
                      j
                      =
                      
                        
                          -
                          h
                        
                        /
                        2
                      
                    
                    
                      h
                      /
                      2
                    
                  
                  ⁢
                  
                    
                      
                        
                          I
                          ~
                        
                        
                          k
                          +
                          1
                        
                      
                      ⁡
                      
                        (
                        
                          
                            x
                            0
                          
                          ,
                          
                            y
                            0
                          
                          ,
                          i
                          ,
                          j
                        
                        )
                      
                    
                    2
                  
                
              
            
            ⁢
            
              
                
                  ∑
                  
                    i
                    =
                    
                      
                        -
                        w
                      
                      /
                      2
                    
                  
                  
                    w
                    /
                    2
                  
                
                ⁢
                
                  
                    ∑
                    
                      j
                      =
                      
                        
                          -
                          h
                        
                        /
                        2
                      
                    
                    
                      h
                      /
                      2
                    
                  
                  ⁢
                  
                    
                      
                        W
                        ~
                      
                      ⁡
                      
                        (
                        
                          i
                          ,
                          j
                        
                        )
                      
                    
                    2
                  
                
              
            
          
        
      
    
    
      
        (
        
          1.1
          ⁢
          .1
        
        )
      
    
  




An advantage is that the NCC scores between −1 and 1, providing an intuitive range to perform similarity thresholding: a value of −1 indicates no similarity at all whereas a value of 1 shows perfect similarity. Another benefit of using the NCC comes from its insensitivity to illumination changes. If we model an illumination change by the addition of a constant value to all the pixels of the regions, then the score of the NCC will be the same as without that offset. However, correlation is not insensitive to any affine or perspective transformation. Therefore, templates will be generated for each frame grabbed by the system as mentioned above.
Moreover, NCC is computationally expensive and can become inefficient when the values of w, h and the size of the search area become large. To compensate for this, a coarse to fine technique will be used: firstly, template matching within the search window is carried out every n pixels to reduce the search complexity by a factor n. The three positions for which the NCC score was the highest are stored. Then the fine search is carried out: template matching is performed for every pixel in the regions around the three stored positions. The highest NCC score provides the final detected position.
1.2 Point Feature Extraction Scheme
A front-facing representation of the planar scene to track containing a marker has to be supplied to the tracker. Usually, a JPEG or a GIF file is used as the input image file. Firstly, the marker is detected in the input image using well known techniques, such as those described in U.S. Provisional Patent Application No. 60/513,725. The position and size of the scene in the input image are calculated and stored in a file.
Subsequently, the extraction of the natural features of the scene is performed. The choice of a specific template matching technique to match natural feature points from frame to frame requires that we define a set of constraints for the feature points to be extracted from the original image:

    
    
        Constraint 1: the similarity between pixels inside the w×h region around the candidate feature point (and outside the circular area defined in constraint 2.) should be small so that uniform or low contrast regions are rejected. This is equivalent to saying that the template should have a minimum variance.
        Constraint 2: the similarity between pixels inside the w×h region within a circular region of radius n around a candidate feature point should be high so that the best three results in the coarse step of template matching include the region around the correct position of the feature. In other words, this constraint ensures that the correct feature position is not missed by the coarse step of the template matching.
        Constraint 3: there should be no similar region within the search area around a candidate feature point for which template matching is carried out. In other words, we want to make sure that there can be no more than one match for a template of size w and h in the search area of size wsearch and hsearch around the candidate pixel so that the tracker does not get confused.
    
    


FIG. 5 is a pixel diagram that illustrates the feature point constraints for a candidate pixel. The candidate pixel 501 is likely to be a good feature within template 503 if: (1) the similarity within a small circular region 502 about the candidate pixel is high; (2) the similarity inside the template 503 and outside the circular region 502 is low, i.e., there is a high variance; and (3) no similar template regions exist within search area 504.
The offline feature extraction program proceeds thus: the user gives in the different resolutions for which he or she would like the features to be automatically extracted. The more resolutions are specified, the more accurate the tracker will be but the more processing time will be required. The parameters that have to be fixed for the natural feature extraction are:

    
    
        the template dimensions w and h
        the threshold tvar defining the minimum value of the variance described in constraint 1 above.
        the search size for template matching wsearch and hsearch 
        the threshold tMaxSim defining the maximum tolerated similarity described in constraint 3.
        the radius r of the small circular region and the threshold tMinSim defining the minimum tolerated similarity described in constraint 2.
    
    


Experimental results have been carried out (see Section 3 below) that provide default values for these parameters. In a first step, the feature extraction process only tests for the constraints 1 and 3. The procedure is outlined in the pseudocode shown in Code Block 1 below.
For every resolution chosen by the user
For every pixel pix in the input image

    
    
        Generate the template tp of size w and h around pix.
        Calculate the variance over the region tp excluding the central circular area of radius n.
        If (variance <tvar) reject pix and go to next pixel.
        For every w×h region reg included in the wsearch×hsearch window around pix
        
            Calculate the similarity sim between reg and tp with the normalized cross correlation.)
            Update the maximum value of similarity within the search area.
            If (similarity >tMaxSim) reject pix and go to next pixel.
        
        
    
    


End For

    
    
        Pix=sim

End For

    
    


End For
Code Block 1
The result of this algorithm performed for the image in FIG. 1 at two different resolutions is shown in FIGS. 6A and 6B. FIG. 6A shows the output of this first step of the offline feature extraction algorithm for the original image resolution of 200 dpi. FIG. 6B shows the output at a lower resolution of 100 dpi. Both of these figures reflect a template size of 25×25 pixels. In the output images, dark regions indicate highly correlated regions (uniform regions) from which feature points should not be chosen. On the contrary bright regions are image regions for which template matching is likely to work well. As expected, fewer details are visible in the image with lower resolution.
The obtained maps of candidate features at different resolutions are used as input for a second algorithm that selects the best point features to track. This operation is performed by enforcing constraint 2 and by thresholding the results obtained. Additional restrictions are that the selected template regions must be as evenly distributed as possible and must not overlap. The tvar parameter directly influences the number of features extracted: the higher tvar is the fewer feature points will fulfil constraint 1. FIG. 7 is an image diagram showing sample features extracted from the image shown in FIG. 1. FIG. 7 shows the extracted features in the original image for tvar=10. Each red square identifies a feature extracted for the original resolution (200 dpi) with tvar=10, tMaxSim=0.65 and tMinSim=0.85. Having a large number of extracted features allows the tracker to cope better with occlusions but slows down the tracking process and may confuse the tracker under some occlusive conditions.
On the other hand, few features speeds up the tracking process but leads the system to be much more sensitive to occlusions. As a consequence, a trade-off has to be made to find the optimal balance between a good occlusion handling and a fast tracking. The locations of the extracted feature points relatively to the marker are stored in a file that will be used during the online tracking mode.
2. Online Tracking
This subsection describes an efficient tracking algorithm of predefined features which allows continued pattern tracking in the presence of significant occlusion. The fundamental idea is to track the known point feature from frame to frame, and to update the homography for the planar scene based on these natural features, instead of simply relying on the four artificial corners provided by the marker.
2.1 Initialization
As mentioned earlier, the initialization of the tracker is made using the fiducial marker as described in Section 1.2.
2.2 Feature Selection and Template Updating
Now that the initial homography has been computed, the tracker has to decide which natural features are the “best” ones to choose in the current frame. Keeping in mind the fact that our application must run in real-time, we want to choose as few features as possible whose locations are optimal. Therefore, the following heuristic selection method is chosen:

    
    
        1. Using the homography of the previous frame, obtain the image coordinates of the features from their known coordinates in the object frame. Using the estimate of the current resolution, reject all features that are not visible in the current video frame.
        2. Selection of the first feature point: select the one whose position is the furthest from the video frame center.
        3. Selection of the second feature point: select the one that is the furthest from the first feature point.
        4. Selection of the third feature point: select the one that maximizes the area of the triangle formed with the two first selected feature points.
        5. Selection of the fourth feature point: select the point that maximizes the area of the rectangle formed with the three first selected feature points.
    
    


The motivation behind this selection scheme is that the homography computed from point features distant from each other is less prone to errors. Once these four points have been selected, the homography from previous frame is also used to generate new templates around the features. This template updating ensures that the rotated view of the template does not prevent the template matching technique from working.
2.3 Coarse Feature Prediction
The first stage of the tracking mode consists of predicting the location of the features in the current frame using the homography computed in the previous frame. Assuming temporal coherency, three simple prediction methods can be derived.
Firstly, it can be supposed that the feature in the current frame Ik will be located at the same position as in the previous frame Ik−1 using the small inter-frame motion hypothesis:

{circumflex over (p)}ik=pik−1  (2.3.1)

with the superscript “^” designated an estimation.

As the camera image is almost always moving, this assumption is almost always violated, and we may therefore rather assume a constant velocity of the feature. So for any frame Ik with k>2, the value of the velocity vector v yields:




  
    v
    ⁡
    
      (
      k
      )
    
  
  =
  
    v
    =
    
      
        
          p
          i
          
            k
            -
            1
          
        
        -
        
          p
          i
          
            k
            -
            2
          
        
      
      
        Δ
        ⁢
        
          
        
        ⁢
        t
      
    
  




with Δt the time elapsed between the frame Ik−1 and Ik−2. We will suppose that the time elapsed between two frames is constant and has a unit value. We can subsequently write

v≅pik−1−pik−2 

{circumflex over (p)}ik can then be estimated as:

{circumflex over (p)}ik≅pik−1+v 

{circumflex over (p)}ik≅2pik−1−pik−2  (2.3.2)

In a similar manner, if we consider that the acceleration of the feature is constant, then its position in frame Ik can be estimated by:

{circumflex over (p)}ik=3pik−1−3pik−2+pik−3  (2.3.3)

Those position estimates are coarse and could not compete in accuracy with the widely used Kalman filtering discussed in G. Iannizzotto, L. Vita, “On-line Object Tracking for Colour Video Analysis,” Real-Time Imaging, 8:2, pp. 145-155, April 2002, and D. Koller, G. Klinker, E. Rose, D. Breen, R. Whitaker, M. Tuceryan, “Real-time Vision-Based Camera Tracking for Augmented Reality Applications,” in Proc. of the ACM Symposium on Virtual Reality Software and Technology, pp. 87-94, Lausanne, Switzerland, September 1997, each of which is hereby incorporated by reference in its entirety, but they have the great advantage of being computationally cheap. Following one, two or all three of these estimations, one can predict the position of pi in the current frame.

2.4 Feature Detection

The estimated positions of the features are subject to errors due to small errors in the homography as well as due to the approximations introduced in Section 4.4.2. A search window around that position has to be defined to proceed with template matching. The tricky task is to fix the size of this search area. A simple approach is to declare its size constant, and to set it to a value determined empirically by tests in real conditions. This approach is very simple and may not be well adapted to dynamic motions, yet it is the basis of our system since we extracted features assuming a fixed search window size. A large search window allows for more movement, but slows down the matching process since normalized cross correlation has to be carried out for a large number of pixels. Conversely, a small search window size increases the speed of the matching process, but increases the chance of tracker failure due to rapid motion. Please refer to Section 3 for the empirical determination of the window size. The position of the selected features is determined by the template matching process described in 1.1 (typically, a match is found if the NCC score is greater than 0.7) and the radial distortion is corrected.
2.5 Homography Updating and Resolution Estimation
Using the four feature point correspondences piIPiw, a new homography H is determined. A reprojection error measure is defined as:




  ɛ
  =
  
    
      
        ∑
        
          i
          =
          1
        
        4
      
      ⁢
      
        
          (
          
            
              p
              i
              I
            
            -
            
              HP
              i
              W
            
          
          )
        
        2
      
    
    4
  




If ε is smaller than a predefined threshold (a value of 5.0 has proven to be a useful threshold value), the homography is accepted and another tracking cycle can begin with the next video frame. If ε is greater than the threshold, it may indicate that the set of point correspondences contains a spurious value due to noise or occlusion. To handle this, the search for a fifth feature point is carried out. If one additional feature point is detected, the planar homography is computed for every subset of four points among five and the one that minimizes ε is chosen as the result. If a fifth feature point cannot be detected, tracking fails and the tracker reverts to the initialization mode. The fiducial marker has to be in view for the tracker to be re-initialized.
If the tracking succeeds, an estimate of the viewed resolution of the planar scene is computed as follows: two feature points whose coordinates are known in the world frame and in the image frame are chosen. We know the distance in millimeters separating the two features in the world frame and the distance in pixels separating them in the image frame. Consequently, it is easy to know how many pixels represent a centimeter in world coordinates and to deduce the resolution of the scene that the camera is currently viewing. If necessary, a different set of features corresponding to that resolution is chosen.
3. Implementation Details
3.1 Determining the Parameters
Our feature extraction technique necessitates that we set the dimensions w and h of the template as well as dimensions wsearch and hsearch of the search size once and for all for the whole process. For simplicity reasons, we declare that both windows are square, that is, w=h and wsearch=hsearch.
3.1.1 Template Size
For normalized cross correlation to be reliable, w has to be large, but this also means that template matching will be computationally expensive. The computation time needed by normalized crossed correlation has been calculated for a range of values of w. A value of 25 pixels has shown to be a good trade-off between reliability and speed for images of dimensions 3800 pixels×1920 pixels.
3.1.2 Search Area Size
Concerning the online tracking phase, the feature prediction method has a direct influence on the size of the search area. A small search area would make faster the matching process but would cause tracking to fail due to the coarse nature of the prediction method. This means that a too small value of wsearch will give a higher chance of the tracked feature not being in the search area and causing the tracker to fail. To determine wsearch empirically, tracking in real conditions was carried out for four thousand features with different combinations of prediction methods (2.3.1), (2.3.2), and (2.3.3). The error rate representing the percentage of feature points that were not detected in the search area was calculated as a function of the search area size. The results are shown in FIG. 8.
FIG. 8 is a graph showing the experimental efficacy of different combinations of these prediction methods. The graph 800 is encoded using a key 801, in which the numeral 1 refers to prediction method (2.3.1), the numeral 2 refers to prediction method (2.3.2), and the numeral 3 refers to prediction method (2.3.3).
It can be seen that prediction method (2.3.1) gives poor results unless the search window size is large. Furthermore, we observe that any combination of two prediction methods or of the three together gives similar results. To choose a search area size, we look more in details in the range between 41 and 61 pixels to see what value provides an acceptable error rate for every prediction method. The results are shown in Table 1 below.
The combination of prediction methods (2.3.1) and (2.3.2) is chosen to reduce the time needed by the prediction stage of the tracker. Consequently, a search area size of 49 is selected since it is the minimum size guaranteeing that the feature points will be found in the search area.
Finally, during the online tracking, the coarse step of template matching is performed every n=3 pixels. This value allows enough speed improvement for the tracker to work in real time.
3.2 Performance Evaluation
One of the major design goals of our augmented reality system was real-time performance on a standard personal computer. The software runs under the Windows XP operating system and the camera used is an off-the-shelf USB web camera delivering 640 pixel×480 pixel video frames. The tracking system is currently implemented in C with OpenGL and VRML used to render the augmented graphics on top of the video. All tests have been run on an Intel Pentium IV 2.4 GHz processor, with a GeForce4 Ti 4600 video card.
3.2.1 Offline Feature Extraction
The offline feature extraction is the bottleneck of the whole application because of its algorithmic complexity. For small images (640 pixels×480 pixels) the processing time can be a few minutes. However, when the size of the input becomes large, as it is the case for our application (3800 pixels×1920 pixels), the time needed to generate the feature map at different resolutions is more than five hours. This remains the main drawback of the application.
3.2.2 Online Tracking
The online tracking shows promising results with a frame rate of 25 to 30 frames per second. This proves that the method is suitable for real-time purposes.
The scale invariance is tested by starting tracking with the camera far away from the scene and gradually taking it closer to the scene. The multi-resolution template scheme works well as shown in FIGS. 9A-9C.
FIGS. 9A-9C are tracking diagrams showing tracking results for various resolutions in a scene. FIG. 9A shows tracking results for a low resolution, FIG. 9B for a medium resolution, and FIG. 9C for a high resolution. The numbered green squares in these figures represents the current point features tracked. A zoomed view of the templates can be seen on the left side of each figure.
Occlusion handling is then tested with a typical users reaction: putting a hand over the scene to track. Here again, the tracker succeeds in choosing alternative feature points, thus providing continuous tracking. The results for occlusion are shown in FIGS. 10A and 10B.
FIGS. 10A and 10B are tracking diagrams showing tracking results under an occlusion condition. FIG. 10A shows tracking results for a scene that is not occluded, while FIG. 10B shows tracking results for a similar scene that is occluded by a human hand. Because the occlusion of feature 2 shown in FIG. 10A is prevented in the scene shown in FIG. 10B by the occlusion, the facility proceeds to register a new feature in the scene of FIG. 10B, shown there as feature number 4.
Note that only the natural feature tracking mode provides any robustness to occlusion. The marker-based initialization mode of the tracker requires the marker to be completely visible. The robustness of the tracker relative to different orientations was also tested. The scene was alternatively viewed from different angles and the tracker succeeded in finding four features, even under severe rotation. An example is shown in FIGS. 11A-11D.
FIGS. 11A-11D are tracking diagrams showing tracking results for scenes under various degrees of rotation. FIG. 11A shows tracking results under no rotation, FIG. 11B under rotation of 45°, FIG. 11C under rotation of 60°, and FIG. 11D under rotation of 80°.
One limitation of some embodiments of the tracker is its sensitivity to rapid motion. If the camera is rotated or translated quickly, the tracker usually fails. This is due to the poor image quality delivered by a simple USB web camera. When the camera moves quickly, the frame provided by the camera is too blurred for template matching to succeed. The use of a higher quality camera with higher shutter-speed should increase considerably the robustness of the tracker to rapid image motion.
6. Additional Details
This section contains additional details about the facility and its implementation.
6.1 Tracked Images
FIGS. 12A and 12B are image diagrams showing sample images tracked by the facility. The image of FIG. 12A consists of letters and photos and has a size of about 20 cm by 28 cm. The image of FIG. 12B is an example of a color map, and is of size of about 80 cm by 104 cm.
6.2 Registration by Template Matching
6.2.1 Coordinates System
FIG. 13 is a coordinate diagram showing the coordinate system used by the facility. There is an object coordinate frame centered on the tracked object. The origin of the object coordinates, Xo and Yo axes lie on the surface, while the Zo axis is perpendicular to the surface. The camera has a camera coordinate frame and there is a perspective relationship between the camera coordinates and the screen coordinates. Straight lines in the 3D environment should ideally remain straight when transformed into screen coordinates. However in practice this does not happen because of lens distortion. To compensate for this we introduce two screen coordinates; ideal screen coordinates which keep the perspective transformation with camera coordinates, and observed screen coordinates which represent the distorted image from the camera. The transformation from object coordinates to ideal screen coordinates is represented by




  
    
      
        
          
            
              
                h
                ⁡
                
                  [
                  
                    
                      
                        
                          x
                          c
                        
                      
                    
                    
                      
                        
                          y
                          c
                        
                      
                    
                    
                      
                        1
                      
                    
                  
                  ]
                
              
              =
              
                
                  
                    [
                    
                      
                        
                          
                            C
                            11
                          
                        
                        
                          
                            C
                            12
                          
                        
                        
                          
                            C
                            13
                          
                        
                      
                      
                        
                          0
                        
                        
                          
                            C
                            22
                          
                        
                        
                          
                            C
                            23
                          
                        
                      
                      
                        
                          0
                        
                        
                          0
                        
                        
                          1
                        
                      
                    
                    ]
                  
                  ⁡
                  
                    [
                    
                      
                        
                          
                            R
                            11
                          
                        
                        
                          
                            R
                            12
                          
                        
                        
                          
                            R
                            13
                          
                        
                        
                          
                            T
                            1
                          
                        
                      
                      
                        
                          
                            R
                            21
                          
                        
                        
                          
                            R
                            22
                          
                        
                        
                          
                            R
                            23
                          
                        
                        
                          
                            T
                            2
                          
                        
                      
                      
                        
                          
                            R
                            31
                          
                        
                        
                          
                            R
                            32
                          
                        
                        
                          
                            R
                            33
                          
                        
                        
                          
                            T
                            3
                          
                        
                      
                    
                    ]
                  
                
                ⁡
                
                  [
                  
                    
                      
                        
                          X
                          o
                        
                      
                    
                    
                      
                        
                          Y
                          o
                        
                      
                    
                    
                      
                        
                          Z
                          o
                        
                      
                    
                    
                      
                        1
                      
                    
                  
                  ]
                
              
            
          
        
        
          
            
              =
              
                C
                ·
                
                  
                    T
                    co
                  
                  ⁡
                  
                    [
                    
                      
                        
                          
                            X
                            o
                          
                        
                      
                      
                        
                          
                            Y
                            o
                          
                        
                      
                      
                        
                          
                            Z
                            o
                          
                        
                      
                      
                        
                          1
                        
                      
                    
                    ]
                  
                
              
            
          
        
      
    
    
      
        (
        
          eq
          .
          
            
          
          ⁢
          6.1
        
        )
      
    
  




where matrix C contains the intrinsic camera parameters of focal length, scale factor, optical center, aspect ratio and skew factor based on perspective projection model. Matrix Tco represents the transformation between object coordinates to camera coordinates and consists of a translation component and a rotation component.

The point (xc, yc) in ideal screen coordinates is transformed to the point (xd, yd) in observed screen coordinates by the distortion function

x=s(xc−xd0), y=s(yc−yd0)

d2=x2+y2 

p={1−fd2}

xdpx+xd0, yd=py+yd0  (eq. 6.2)

where (xd0, yd0) is the center of distortion, s is the scale parameter and f is the distortion factor. This transformation is a non-linear function but we represent it as follows:





  
    
      
        
          [
          
            
              
                
                  x
                  d
                
              
            
            
              
                
                  y
                  d
                
              
            
            
              
                1
              
            
          
          ]
        
        =
        
          
            
              F
              ⁡
              
                [
                
                  
                    
                      
                        x
                        c
                      
                    
                  
                  
                    
                      
                        y
                        c
                      
                    
                  
                  
                    
                      1
                    
                  
                
                ]
              
            
            ⁡
            
              [
              
                
                  
                    
                      x
                      c
                    
                  
                
                
                  
                    
                      y
                      c
                    
                  
                
                
                  
                    1
                  
                
              
              ]
            
          
          =
          
            
              F
              
                -
                1
              
            
            ⁡
            
              [
              
                
                  
                    
                      x
                      d
                    
                  
                
                
                  
                    
                      y
                      d
                    
                  
                
                
                  
                    1
                  
                
              
              ]
            
          
        
      
    
    
      
        (
        
          eq
          .
          
            
          
          ⁢
          6.3
        
        )
      
    
  




So the registration problem reduces to calculation of the transformation matrix Tco. We describe how to do this in the next section.

6.2.2 Pose and Position Calculation
Given that there are n feature points (Xoi, Yoi, Zoi) (i=0, 1, n−1) in object coordinates and they are projected into (xdi, ydi) (i=0, 1, n−1) in observed screen coordinates, an error function is represented in ideal screen coordinates (eq. 6.4).




  
    
      
        
          
            err
            2
          
          =
          
            
              
                1
                n
              
              ⁢
              
                
                  ∑
                  
                    i
                    =
                    0
                  
                  
                    n
                    -
                    1
                  
                
                ⁢
                
                  
                    {
                    
                      
                        
                          (
                          
                            
                              x
                              ci
                            
                            -
                            
                              
                                x
                                ~
                              
                              ci
                            
                          
                          )
                        
                        2
                      
                      +
                      
                        
                          (
                          
                            
                              y
                              ci
                            
                            -
                            
                              
                                y
                                ~
                              
                              ci
                            
                          
                          )
                        
                        2
                      
                    
                    }
                  
                  ⁢
                  
                    

                  
                  [
                  
                    
                      
                        
                          x
                          ci
                        
                      
                    
                    
                      
                        
                          y
                          ci
                        
                      
                    
                    
                      
                        1
                      
                    
                  
                  ]
                
              
            
            =
            
              
                F
                
                  -
                  1
                
              
              ⁡
              
                [
                
                  
                    
                      
                        x
                        di
                      
                    
                  
                  
                    
                      
                        y
                        di
                      
                    
                  
                  
                    
                      1
                    
                  
                
                ]
              
            
          
        
        ,
        
          
            h
            ⁡
            
              [
              
                
                  
                    
                      
                        x
                        ~
                      
                      ci
                    
                  
                
                
                  
                    
                      
                        y
                        ~
                      
                      ci
                    
                  
                
                
                  
                    1
                  
                
              
              ]
            
          
          =
          
            C
            ·
            
              
                T
                co
              
              ⁡
              
                [
                
                  
                    
                      
                        X
                        oi
                      
                    
                  
                  
                    
                      
                        Y
                        oi
                      
                    
                  
                  
                    
                      
                        Z
                        oi
                      
                    
                  
                  
                    
                      1
                    
                  
                
                ]
              
            
          
        
      
    
    
      
        (
        
          eq
          .
          
            
          
          ⁢
          6.4
        
        )
      
    
  




The matrix Tco minimizes this error function. If n is more than 3 and suitable initial values are given for Tco, this calculation is possible. We employ the functions provided, by ARToolKit for this calculation. In order to set suitable initial values into Tco, the result for previous frame is used in iterative tracking phase. A black square fiducial and ARToolKit functions are used to set the initial values in initial detection phase.
To calculate subsequent values for Tco we need to detect positions in observed screen coordinates which correspond to n feature points in object coordinates. We employ template matching for this process.
6.2.3 Feature Detection by Template Matching
Template matching can detect similar regions to the template from images. In general templates have to be prepared beforehand. However this is impossible with this kind of 3D tracking, because the image of a feature point varies by its 6 DOF movement. Therefore the templates have to be generated for each image frame. We assume that the movement of the tracked object is small between each continuous image frame. Then templates are generated from the texture image of the tracked object that is captured beforehand based on the pose and position information in previous frame. Detection of feature positions consists of the following three steps:
1) Calculation of Observed Screen Coordinates (xdi, ydi) of Feature Points
The tracked object exists in Xo−Yo surface of the object coordinates. So the feature points can be represented as (Xoi, yoi, 0) (i=0, 1, n−1). Given transformation matrix from the object coordinates to camera coordinates in previous frame is Tco, observed screen coordinates (xdi, ydi) corresponding to (Xoi, yoi, 0) can be calculate by (eq. 1) and (eq. 2).
2) Generation of the Template in which (xdi, ydi) is Centered
In order to generate the template in which (xdi, ydi) is centered, the transformation from observed screen coordinates to Xo−Yo surface in the object coordinates is needed. Given Zo=0, the following equation is obtained.




  
    
      
        
          h
          ⁡
          
            [
            
              
                
                  
                    x
                    c
                  
                
              
              
                
                  
                    y
                    c
                  
                
              
              
                
                  1
                
              
            
            ]
          
        
        =
        
          
            C
            ·
            
              
                T
                co
              
              ⁡
              
                [
                
                  
                    
                      
                        X
                        o
                      
                    
                  
                  
                    
                      
                        Y
                        o
                      
                    
                  
                  
                    
                      0
                    
                  
                  
                    
                      1
                    
                  
                
                ]
              
            
          
          =
          
            
              
                [
                
                  
                    
                      
                        p
                        11
                      
                    
                    
                      
                        p
                        12
                      
                    
                    
                      
                        p
                        13
                      
                    
                  
                  
                    
                      
                        p
                        21
                      
                    
                    
                      
                        p
                        22
                      
                    
                    
                      
                        p
                        23
                      
                    
                  
                  
                    
                      
                        p
                        31
                      
                    
                    
                      
                        p
                        32
                      
                    
                    
                      
                        p
                        33
                      
                    
                  
                
                ]
              
              ⁡
              
                [
                
                  
                    
                      
                        X
                        o
                      
                    
                  
                  
                    
                      
                        Y
                        o
                      
                    
                  
                  
                    
                      1
                    
                  
                
                ]
              
            
            =
            
              P
              ⁡
              
                [
                
                  
                    
                      
                        X
                        o
                      
                    
                  
                  
                    
                      
                        Y
                        o
                      
                    
                  
                  
                    
                      1
                    
                  
                
                ]
              
            
          
        
      
    
    
      
        (
        
          eq
          ⁢
          
            
          
          ⁢
          6.5
        
        )
      
    
  




Therefore,





  
    
      
        
          
            1
            h
          
          ⁡
          
            [
            
              
                
                  
                    X
                    o
                  
                
              
              
                
                  
                    Y
                    o
                  
                
              
              
                
                  1
                
              
            
            ]
          
        
        =
        
          
            
              P
              
                -
                1
              
            
            ⁡
            
              [
              
                
                  
                    
                      x
                      c
                    
                  
                
                
                  
                    
                      y
                      c
                    
                  
                
                
                  
                    1
                  
                
              
              ]
            
          
          =
          
            
              P
              
                -
                1
              
            
            ·
            
              
                F
                
                  -
                  1
                
              
              ⁡
              
                [
                
                  
                    
                      
                        x
                        d
                      
                    
                  
                  
                    
                      
                        y
                        d
                      
                    
                  
                  
                    
                      1
                    
                  
                
                ]
              
            
          
        
      
    
    
      
        (
        
          eq
          .
          
            
          
          ⁢
          6.6
        
        )
      
    
  




By using this equation, object coordinates for every template pixels are calculated and color values can be substituted in the template from the texture image of the tracked object.

Template Matching
We employ normalized correlation for the template matching.




  
    
      
        s
        =
        
          
            
              ∑
              
                i
                =
                1
              
              N
            
            ⁢
            
              
                (
                
                  
                    x
                    j
                  
                  -
                  
                    x
                    ~
                  
                
                )
              
              ·
              
                (
                
                  
                    y
                    i
                  
                  -
                  
                    y
                    ~
                  
                
                )
              
            
          
          
            
              
                
                  ∑
                  
                    i
                    =
                    1
                  
                  N
                
                ⁢
                
                  
                    (
                    
                      
                        x
                        i
                      
                      -
                      
                        x
                        ~
                      
                    
                    )
                  
                  2
                
              
            
            ⁢
            
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  N
                
                ⁢
                
                  
                    (
                    
                      
                        y
                        j
                      
                      -
                      
                        y
                        ~
                      
                    
                    )
                  
                  2
                
              
            
          
        
      
    
    
      
        (
        
          eq
          ⁢
          
            
          
          ⁢
          6.7
        
        )
      
    
  




where xi is a pixel value, {tilde over (x)}i is the mean of pixel values, yi is a template value and yi is the mean of template values. The calculated value is between −1.0 and 1.0. The position where the biggest value is found matches the corresponding position (xdi, ydi) in observed screen coordinates to feature position (Xoi, Yoi, 0) in object coordinates.

If at least three corresponding positions can be obtained, Tco can be found for the current image frame using the calculation in previous section.
6.3 Improvements for Performance and Accuracy
6.3.1 Multi Scale Templates and Defocusing
Templates can be generated by using (eq. 6.6), however if the resolution of the texture image is quite different from the resolution of generated templates, the expected templates cannot be found because of the resampling problem. If an interpolation technique is used in resampling, it could be avoided. But it requires much calculation cost. To overcome this some textured images with several resolutions need to be prepared beforehand.
We also assume that the camera does not have automatic focus control and that input images are captured with blur in certain distance between the camera and tracked objects. To compensate for this we defocus some texture images by adopting an averaging filter of 3×3 mask.
6.3.2 Feature Selection
Feature points in texture images are registered with our software beforehand so they can be used for template matching. However suitable feature points for template matching depend on the resolution. For example, when the camera is near to the tracked object, the resolution of observed image is high and small letters in the image can be used as feature points. On the other hand, when the camera is far from the tracked object, the resolution of observed image is low and small letters cannot be resolved. To compensate for this suitable feature points are independently registered for different resolutions of the texture image.
As many feature points as possible are registered, and the best of these are dynamically selected in the tracking phase. Because we don't use special hardware for the template matching, the selection of the least number and optimal locations of feature points is desired in order to reduce the calculation cost as much as possible. In addition, the order of selection of feature points is important and is done iteratively with the tracking of each feature point.
We employ a heuristic feature selection method as follows. First of all, the most important feature selection policy is that four feature points are detected from images. If this is impossible, detection of three feature points is needed. If fewer than three feature points are detected, then tracking fails. When a feature point is selected, template matching is done for the selected feature. If the template matching succeeds, in other words the maximal value of normalized correlation is greater than 0.7, the feature point are stored and selection of next feature point is continued. If the template matching fails, the feature point is rejected and selection of an alternative feature point is continued. The conditions used by this selection policy are as follows:
1) Common Condition that is not Relative to Selection Order

    
    
        1.1—The position of the feature point has to be within the image window when its 3D position is projected into the observed screen coordinates by using the Tco matrix obtained from the previous frame.
        1.2—The resolution of the feature point is satisfied with the condition pre-defined for each feature when it is projected into the observed screen coordinates.
    
    


2) Selection of the First Feature Point

    
    
        The feature position is the farthest from image center.
    
    


3) Selection of the Second Feature Point

    
    
        The feature position is the farthest from the first feature point.
    
    


4) Selection of the Third Feature Point

    
    
        The area of the triangle that is made with the first and second feature points is maximum.
    
    


5) Selection of the Fourth Feature Point

    
    
        The area of the rectangle that is made with the first, second and third feature points is maximum.
    
    


6) Selection of the Fifth Feature Point

    
    
        The feature is selected in registered order.
    
    


When template matching succeeds for four feature points, the transformation matrix Tco is calculated from them based on (eq. 6.4). If the error is less than a certain value (5.0 in experiments), the object tracking succeeds. If not, missed detections might be included and the detection of a fifth feature point is carried out. If one is found, the transformation matrices Tco are calculated for all combinations of four feature points in the set of five points. Then the transformation matrix with minimum error is picked up as a result. If the detection of a fifth feature point fails, transformation matrices Tco are calculated for all combinations of three feature points in the set of four points. Then the transformation matrix with minimum error is picked up as a result. If the minimum error value is greater than a threshold, the object tracking fails.
6.3.3 Improvement of Performance on Template Matching
Normalized correlation has a high calculation cost while it detects matching point well. Our template size is 24×12 pixels for a 640×240 image. Images of 640×480 are input but field sequential images are used for template matching. To further improve performance, template matching is done for gray-scale pixel values that are calculated by averaging color pixels. At the moment, the dimension of matching data is 24×12×1=288 and its calculation cost is still high.
To reduce the calculation cost, we employ two steps template matching. First of all, a coarse search is carried out. In scanning on the search area, template matching is done once for every 3 pixels in the x direction and the positions of best three results are stored. Also (eq. 6.9) is used for this template matching.




  
    
      
        e
        =
        
          
            ∑
            
              j
              =
              0
            
            11
          
          ⁢
          
            
              ∑
              
                i
                =
                0
              
              11
            
            ⁢
            
              
              
                
                  (
                  
                    
                      I
                      ⁡
                      
                        (
                        
                          
                            2
                            ⁢
                            i
                          
                          ,
                          j
                        
                        )
                      
                    
                    -
                    
                      I
                      _
                    
                  
                  )
                
                -
                
                  (
                  
                    
                      T
                      ⁡
                      
                        (
                        
                          
                            2
                            ⁢
                            i
                          
                          ,
                          j
                        
                        )
                      
                    
                    -
                    
                      T
                      _
                    
                  
                  )
                
              
              
            
          
        
      
    
    
      
        (
        
          eq
          .
          
            
          
          ⁢
          6.9
        
        )
      
    
  




where I(i,j) is a pixel value at position (i, j) in the region on which template overlaps, Ĩ is an average pixel values in the region in which the template overlaps, T(i,j) is a pixel value at position (i, j) in the template and T is an average pixel value in the template. As mentioned before, the template size is 24×12 pixels. However this calculation uses one pixel in every two pixels so the calculation cost is reduced.

Next, a fine search is carried out. A normalized correlation with a 24×12 template size is used based on (eq. 6.7) in regions around the previously obtained three positions. Then the position with highest correlation value is found as the result.
In order for this template matching to work well, matching results in the region around the correct position have to keep a high similarity so that they are included in the best three results in the coarse search. Defocusing the texture images aids this 2 step matching process as well.
6.4 Offline Automatic Feature Detection
Many suitable feature points have to be registered in images of all resolutions so that the template matching described in section 3 works well. There are two conditions for suitable feature points.

    
    
        1) There are no similar regions within the search size of template matching.
        2) Similarity within three pixels from the feature point is high.
    
    


We have developed a method for automatic detection of the best feature points. Suitability as a feature point is examined at every position for texture images of all resolutions. For each point in the texture image, the region of which the point is center is extracted as a template and the maximum value of the normalized correlation is calculated from a search area of 49×49 pixels, excluding the center 5×5 pixel region. This value is calculated at every position in a texture image.
FIGS. 14A and 14B are diagrams showing preliminary feature point extraction results. FIG. 14A shows preliminary feature point extraction results for the image of FIG. 12A while FIG. 14B shows preliminary feature point extraction results for the image of FIG. 12B. Bright pixels in these images means little correlation value, that is, bright position are suitable for condition 1 as a feature point. The square marker regions in the images are also omitted from this calculation.
Next, normalized correlation is carried out for the 5×5 region, excluding the center position. If the minimum value is greater than 0.6 and the maximum value less than 1.0, then the position is registered as a feature point. However if its template region has overlaps with the template regions of pre-registered feature points, it is cancelled. FIGS. 15A and 15B are diagrams showing preliminary feature point extraction results. FIG. 15A shows preliminary feature point extraction results for the image of FIG. 12A while FIG. 15B shows preliminary feature point extraction results for the image of FIG. 12B. Each figure shows feature points extracted at three different levels of resolutions: feature points identified by red boxes at a high level of resolution, feature points identified by green boxes at a medium level of resolution, and feature points identified by blue boxes at a low level of resolution.
6.5 Experiments
Experiments were done for texture images in FIG. 1. We used a PC with an Intel Pentium4 2.0 GHz, Linux OS, an analog video capture card and a GeForce3 graphics card. A camera was attached on a HMD and its shutter speed was 1/250 sec. 640×480 images were captured and the tracking program was able to work accurately at about 30 frames per seconds. While tracking succeeds, 16 wire-frame cubes are overlaid on the tracked objects.
FIGS. 16A-16H are tracking diagrams showing the results of sample tracking experiments. We can see virtual objects are suitably overlaid on the tracked objects in some conditions.
FIGS. 17A-17D show template matching results for example images. The rectangles arrayed along the left edge of each figure show the feature templates generated by the facility for the matched features. Green rectangle regions in images are accepted matching regions and yellow rectangle regions are rejected regions. We can see template matching is attempted until 4 matching regions are found. So registration works well even when textures are occluded by a hand.
Tracking sometimes failed when a tracked object rotates quickly because template matching is robust for translation but not robust for rotation of the tracked regions. Another problem was pose and position calculation from 3 feature points. When 3 feature points are almost in a straight line, the registration was bad and it caused tracking to fail in next frame. So the condition to select 3 feature points in the set of 4 points has to be considered.
It will be appreciated by those skilled in the art that the above-described facility may be straightforwardly adapted or extended in various ways. While the foregoing description makes reference to preferred embodiments, the scope of the invention is defined solely by the claims that follow and the elements recited therein.

## Claims

1. A method in a computing system having a processor for tracking the-movement of a surface having an arbitrary appearance relative to a camera, comprising:
capturing an image of the surface using the camera;
analyzing by the computing system the captured image of the surface to identify visual features present in the image surface;
from the identified visual features, selecting by the computing system a plurality of visual features for use in tracking the movement of the surface with respect to the camera, wherein the selection of identified features includes selecting visual features in at least two different size ranges;
selecting one of the size ranges based upon a measure of distance from the camera to a present location of the surface;
receiving by the computing system a sequence of images captured by the camera, at least some of which constitute a view of at least a portion of the surface;
for each image of the sequence:
identifying by the computing system 2-dimensional positions at which the selected features occur in the image; and
based upon the 2-dimensional positions at which the selected features are identified in the image, determining by the computing system 3-dimensional location and orientation of the surface in the image of the sequence with respect to the camera, wherein selected features in the selected size range are used to determine the location and orientation of the surface.

2. The method of claim 1 wherein the identification of the 2-dimensional positions at which the selected features occur in the image is predicated on an assumption that the selected features appear as coplanar in the image.

3. The method of claim 1 wherein the surface is a 2-dimensional surface.

4. The method of claim 1 wherein the surface is a flat surface.

5. The method of claim 1 wherein the surface is an irregular body that appears flat when observed at a distance.

6. The method of claim 1, further comprising using by the computing system the determined location and orientation of the surface to introduce a supplemental image into the images of the sequence at a size, location, and orientation that are relative to those of the surface.

7. The method of claim 1, further comprising using by the computing system the determined location and orientation of the surface to superimpose a view of a 3-dimensional object over the surface.

8. The method of claim 1 wherein the selection of identified features is performed based upon a comparison of the levels of contrast provided by each of the identified features.

9. The method of claim 1 wherein the selection of identified features is performed based upon a comparison of the levels of uniqueness of each of the identified features among all of the identified features.

10. The method of claim 1 wherein the selection of identified features is performed based upon a comparison of the levels of accuracy with which they can be used to determine the position and orientation of the surface.

11. The method of claim 1, further comprising, for each image of the sequence:
based upon the 2-dimensional positions at which the features are identified in one or more prior images of the sequence, predicting by the computing system 2-dimensional positions at which the features will occur in the current image; and
establishing by the computing system search zones about the predicted positions, and wherein identifying by the computing system 2-dimensional positions at which the selected features occur in the image comprises searching by the computing system the established search zones for the selected features.

12. The method of claim 1 wherein the surface, in addition to having an arbitrary appearance, is modified to contain one or more fiducial markers, the method further comprising, in a first image of the sequence, identifying and analyzing by the computing system a portion of the image corresponding to the fiducial markers to determining the 3-dimensional location and orientation of the surface in the image, and wherein the determining the 3-dimensional location and orientation of the surface in the first image of the sequence is used to identify the 2-dimensional positions at which the selected features occur in the first image of the sequence.

13. The method of claim 12 wherein each fiducial marker comprises a unique distinguishing pattern.

14. The method of claim 12 wherein each fiducial marker is square-shaped.

15. The method of claim 1 wherein the 3-dimensional location and orientation of the surface in the current image of the sequence is determined without the use of explicit fiducial markers.

16. The method of claim 1 further comprising capturing the sequence of images using the camera, and wherein the determination by the computing system is made in real-time with respect to the capture.

17. The method of claim 1 wherein, between two successive images of the sequence, the camera moves relative to the environment.

18. The method of claim 1 wherein, between two successive images of the sequence, the surface moves relative to the environment.

19. The method of claim 1 wherein the images are captured by a single camera.

20. A computer-readable storage medium comprising computer executable instructions which when executed on a computing system cause the computing system to track the-movement of a surface having an arbitrary appearance relative to a camera by:
capturing an image of the surface using the camera;
analyzing by the computing system the captured image of the surface to identify visual features present in the surface;
from the identified visual features, selecting by the computing system a plurality of visual features for use in tracking the movement of the surface with respect to the camera, wherein the selection of identified features includes selecting visual features in at least two different size ranges;
selecting one of the size ranges based upon a measure of distance from the camera to a present location of the surface;
receiving by the computing system a sequence of images captured by the camera, at least some of which constitute a view of at least a portion of the surface;
for each image of the sequence:
identifying by the computing system 2-dimensional positions at which the selected features occur in the image; and
based upon the 2-dimensional positions at which the selected features are identified in the image, determining by the computing system 3-dimensional location and orientation of the surface in the image of the sequence with respect to the camera, wherein selected features in the selected size range are used to determine the location and orientation of the surface.

21. The computer-readable medium of claim 20 wherein the images are captured by only one camera.

22. A method in a computing system having a processor for tracking a 2-dimensional surface having an innate visual appearance and being marked with one or more explicit fiducial markers, comprising:
storing in computer system's memory images of the surface captured by a camera;
identifying by the computing system visually significant aspects of the surface's innate visual appearance from images stored in the memory, wherein the identification of visually significant aspects includes identifying visually significant aspects in at least two different size ranges;
selecting one of the size ranges based upon a measure of distance from the camera to a present location of the surface;
in a first of a series of perspective images of the surface, performing by the computing system recognition of the fiducial markers to determine the 3-dimensional location and orientation of the surface in the first image; and
in successive perspective images of the surface, performing by the computing system recognition of the identified aspects of the surface's innate visual appearance to determine the 3-dimensional location and orientation of the surface in the successive images, wherein identified aspects in the selected size range are used to determine the location and orientation of the surface.

23. The method of claim 22 wherein the recognition of the identified aspects of the surface's innate visual appearance in each successive image is guided by the 3-dimensional location and orientation of the surface in the preceding image.

24. The method of claim 22 wherein each fiducial marker is square-shaped.

25. The method of claim 22 wherein the recognition of the identified aspects of the surface's innate visual appearance is predicated on an assumption that the selected features appear as coplanar in the successive perspective images.

26. A computing system for tracking a 2-dimensional surface having an innate visual appearance and being marked with one or more explicit fiducial markers, comprising:
a processor;
a memory storing images of the surface captured by a camera;
a visual analysis subsystem that identifies visually significant aspects of the surface's innate visual appearance from images stored in the memory, wherein the visual analysis subsystem identifies visually significant aspects in at least two different size ranges;
a selection subsystem that selects one of the size ranges based upon a measure of distance from the camera to a present location of the surface;
a first recognition subsystem that, in a first of a series of perspective images of the surface, performs recognition of the fiducial markers to determine the 3-dimensional location and orientation of the surface in the first image; and
a second recognition subsystem that, in successive perspective images of the surface, performs recognition of the identified aspects of the surface's innate visual appearance to determine the 3-dimensional location and orientation of the surface in the successive images, wherein identified aspects in the selected size range are used to determine the location and orientation of the surface.

27. A method in a computing system having a processor for determining the 3-dimensional location and orientation of a subject surface in a distinguished perspective image of the subject surface, the subject surface having innate visual features, the method comprising:
storing in computer system's memory distinguished perspective images of the surface captured by a camera;
selecting a plurality of subsets of innate visual features of the subject surface each subset containing features of a different size;
using locations of the selected visual features in a perspective image of the subject surface that precedes the distinguished perspective image in time, identifying by the computing system search zones in the distinguished perspective image;
based on an earlier-determined 3-dimensional location of the subject surface, choosing by the computing system one subset of features based upon a measure of distance from the camera to a present location of the surface;
searching by the computing system the identified search zones for the selected visual features to determine the 2-dimensional locations at which the selected visual features occur, wherein the identified search zones are searched for the features of the chosen subset; and
based on the determined 2-dimensional locations, determining by the computing system the 3-dimensional location and orientation of the subject surface in the distinguished perspective image.

28. The method of claim 27 wherein the selected innate visual features of the subject surface number at least four.

29. The method of claim 27 wherein the determination of the 2-dimensional locations at which the selected visual features occur is predicated on an assumption that the selected visual features appear as coplanar in the image.

30. A computer-readable storage medium comprising computer executable instructions which when executed on a computing system cause the computing system to determine the 3-dimensional location and orientation of a subject surface in a distinguished perspective image of the subject surface, the subject surface having innate visual features, by a method comprising:
storing in computer system's memory distinguished perspective images of the surface captured by a camera;
selecting a plurality of subsets of innate visual features of the subject surface each subset containing features of a different size;
using locations of the selected visual features in a perspective image of the subject surface that precedes the distinguished perspective image in time, identifying by the computing system search zones in the distinguished perspective image;
based on an earlier-determined 3-dimensional location of the subject surface, choosing by the computing system one subset of features based upon a measure of distance from the camera to a present location of the surface;
searching by the computing system the identified search zones for the selected visual features to determine the 2-dimensional locations at which the selected visual features occur, wherein the identified search zones are searched for the features of the chosen subset; and
based on the determined 2-dimensional locations, determining by the computing the 3-dimensional location and orientation of the subject surface in the distinguished perspective image.