Abstract:
A method and apparatus for identifying and analysing an aircraft landing site during flight is provided. The method includes the steps of using image capture means such as an infrared camera to capture in-flight images of the ground in the region of a possible landing site, using a database of computer modelled images of possible aircraft landing sites mapped to a global co-ordinate reference frame to compare the in-flight images with a modelled image of the possible landing site and optimising correspondence between the two images to obtain an in-flight image optimally mapped to the global co-ordinate reference frame. Thereafter, the landing site which corresponds to the optimally mapped in-flight image is analysed to ascertain the presence of any obstructions such as life forms, vehicles or newly erected buildings thereon.

Description:
FIELD OF THE INVENTION 
       [0001]    The present invention relates to the identification and analysis of aircraft landing sites and, more particularly, to a method of identification and analysis, during flight, of such a site for the purposes of detecting obstructions on the landing site. Such a method is particularly useful when an aircraft has to make a forced landing. 
       BACKGROUND 
       [0002]    There is an increasing demand for Unmanned Aerial Vehicles (UAVs) to enter civilian airspace. This raises important flight certification issues. These are defined by the Civil Aviation Authority (CAA) for the United Kingdom in the directorate of airspace policy. The key objective is for UAVs to demonstrate an equivalent level of safety to that of manned aircraft. An important issue is to enable UAVs to use alternative landing sites as a result of an onboard fault or failure, which causes the planned landing site to be out of reach. The CAA states that they, “may think fit to apply . . . a prohibition on flight unless the aircraft is equipped with a mechanism that will cause the said aircraft to land in the event of a failure . . . ”. Currently UAVs on military missions typically use either parachutes to land in an unknown position or flight termination systems including remote detonation where the UAV does not attempt to land. 
         [0003]    In the case of manned aircraft, during emergencies pilots use a combination of local geographical knowledge and visual observations to select an alternative site. This is evident in real-life examples such as US Airways flight 1549, an Airbus A320 jet. The piloted aircraft was successfully ditched in the Hudson river in 2009 after bird strike during climb out. 
         [0004]    One of the earliest autonomous aircraft landings using computer vision was demonstrated in 2002. A heliport landing site was detected and tracked in images, using appearance based information using a camera fixed perpendicular to the ground. By low pass filtering, binarising and performing connected component labelling, a set of candidates regions was determined. Object recognition was performed by calculating geometric information such as perimeter, area and moments for each candidate region. Experiments used a small scale remote control helicopter with differential-GPS. 
         [0005]    Fixed-wing miniature air vehicles have also been used to research flight stability. Such vehicles typically use image processing to detect the position of the horizon line in the image. This relies upon recognising the appearance of sky and ground terrain using colour information. However, this image based solution requires that the detected horizon line also measures the aircraft&#39;s orientation with respect to the ground. Traditionally, these measurements were independent of any onboard positioning sensors. 
         [0006]    A survey paper by Gong and Abbotty particularly emphasises the use of computer vision techniques for detecting and tracking airport runways. Some of these techniques rely on model-matching. The objective of model-matching is to estimate the position and orientation of the modelled object with respect to the local coordinate frame. Autoland is a commercial system, which matches a geometric model of a predefined target to image features. 
         [0007]    A model-matching approach has also been used for terrain aided localisation using electro-optical sensing. Neither solution relies on GPS or on-board pose information. 
         [0008]    Algorithms have been proposed which use an estimate of the imaging projective transform parameters to project points of a prior model into the image. These points are then associated with feature points extracted in the image. The horizontal and vertical pixel errors between each point correspondence are then expressed by two equations. These use the sum of the products of its partial derivatives multiplied by an unknown multi-dimensional vector of corrections to the parameterisation of the imaging projective transform. The process is iterated until convergence or a maximum number of iterations is reached. 
         [0009]    Other techniques include estimating the optical flow between frames. This approach has been used to automate the landing of miniature aircraft. Further, in 2007 the automatic detection and selection of regions in an image that could be designated as suitable for landing was successfully demonstrated. This approach required no prior landing site position information, but relied on having good quality imagery of the terrain at the appropriate scale. Furthermore the camera was restricted to being perpendicular to the ground plane and the solution provided no geospatial referencing of the chosen region to the global coordinate frame. 
         [0010]    Research into the same problem has also been performed using a downward-scanning LADAR to determine terrain slope, roughness and obstacles for identifying a landing site. 
       SUMMARY OF THE INVENTION 
       [0011]    In a first aspect, the present invention provides a method of identifying and analysing an aircraft landing site during flight, the method including the steps of using image capture means to capture in-flight images of the ground in the region of a possible landing site, using a database of computer modelled images of possible aircraft landing sites mapped to a global co-ordinate reference frame to compare the in-flight images with a modelled image of the possible landing site and optimising correspondence therebetween to obtain an in-flight image optimally mapped to the global co-ordinate reference frame, and analysing a landing site corresponding to the optimally mapped in-flight image to ascertain the presence of any obstructions thereon. 
         [0012]    The analysis of the landing site for obstructions may include the step of analysing the in-flight image to detect image intensity above a threshold value, whereby to determine the presence of an obstruction. 
         [0013]    The analysis of the landing site for obstructions may include the step of analysing the portion of the in-flight image corresponding to the obstruction to detect the surface area of the obstruction. 
         [0014]    The analysis may include the step of calculating a convex hull for the obstruction to define multiple polygons in the image. 
         [0015]    Each polygon may be back projected from a local image co-ordinate frame to the global co-ordinate reference frame, whereby to calculate the actual area of the obstruction and detect area above a threshold value. 
         [0016]    The method may include the step of computing the probability of a said obstruction being present on the landing site by comparing a number of time varying in-flight images to determine the relative frequency of the obstruction being detected. 
         [0017]    The method may include the step of determining terrain characteristics of the landing site and/or presence of obstructions on the landing site by obtaining a measure of randomness of spatial information present in a said in-flight image. 
         [0018]    The measure of randomness of spatial information may be obtained by computing a statistical measure of the said randomness based on image intensity estimated from a grey-level histogram. 
         [0019]    The method may include optimising correspondence between in-flight images and a modelled image which may include creating a random sample of possible landing site in-flight images spread about the mean position, translating each image into the global co-ordinate reference frame and comparing each said image with the expected mean image intensity of the landing site in the global co-ordinate reference frame (“the appearance prior”) and ranking each said image accordingly by minimising the difference between the sample mean intensity and the expected mean intensity whereby to optimise correspondence between in-flight images and a said modelled image. 
         [0020]    The method may include the step of applying a Kalman filter to filter optimally mapped in-flight images in time. 
         [0021]    The method may include the step of estimating the horizon line in the optimally mapped in-flight image by applying geometric back projection of features in the global co-ordinate reference frame into the in-flight image. 
         [0022]    According to a second aspect of the invention there is provided apparatus for identifying and analysing an aircraft landing site during flight, the apparatus including image capture means adapted to capture in-flight images of the ground in the region of a possible landing site, a database of computer modelled images of possible aircraft landing sites mapped to a global co-ordinate reference frame, comparison means to compare the in-flight images with a said modelled image of the possible landing site and optimising means to optimise correspondence therebetween to obtain an in-flight image optimally mapped to the global co-ordinate reference frame, and means to analyse a landing site corresponding to the optimally mapped in-flight image to ascertain the presence of any obstructions thereon. 
     
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         [0023]      FIG. 1  is a photo of US Airways Flight 1549 after crashing into the Hudson River in New York City, US; 
           [0024]      FIG. 2  is an illustration of (a) a Thermoteknic Miricle 307 infrared camera, (b) Camera installed in a baggage-pod adjustable declination mount, (c) BAE System Jetstream Flying-Test-Bed aircraft (FTB G-BWWW), (d) Germanium window for the camera in the baggage-pod; 
           [0025]      FIG. 3  illustrates maps from Openstreetmap of two of the locations of the forced landing sites captured during flight trials (a) Warton Aerodrome (b) Isle of Walney airport; 
           [0026]      FIG. 4  illustrates example trajectories of the aircraft in the world (blue line), the camera FOV limits (red lines) and the GPS landmarks (black circles) for both data sets  121  and  160  in (a) and (b), respectively. 
           [0027]      FIG. 5  illustrates (a) isometric, (b) plan, (c) side and (d) in-situ views of the INS (largest cube), camera mount (medium cube) and camera (smallest cube) coordinate systems.  FIG. 5   d  also illustrates the projected camera FOV limits and 3D uncertainty ellipse for the INS; 
           [0028]      FIG. 6  illustrates example frames for data set  121  showing projected points onto the image plane (dark blue) and associated uncertainty ellipses (cyan).  FIG. 6(   a ) illustrates 4 points defining the main rectangular part of the runway, (b) 6 points along the triangular set of runways and (c) 4 points along the boundary of a pond; 
           [0029]      FIG. 7  illustrates a single frame with sample project ROIs representing the uncertainty in the geospatial overlayed on frames from data set  121 ; 
           [0030]      FIG. 8  illustrates single frames showing different positions from using only the camera model (dark green lines), model fitting (yellow lines) and filtering multiple observations (orange lines) from data set  121  in (a)-(c) and  161  in (d)-(f); 
           [0031]      FIG. 9  illustrates sample horizons line position estimation results including some with the absence of visual information from data sets  121  in (a)-(c) and  161  in (d)-(f); 
           [0032]      FIG. 10  illustrates sample results from using data set  121  in (a)-(b) and  161  in (c)-(f) using the rule based target object detector to illustrate the challenges of the problem; 
           [0033]      FIG. 11  illustrates the results for data sers  121  in (a, c, e) and  160  in (b, d, e) where (a, b) show indications of critical time period of detecting life-forms and (e-f) surface homogeneity values; 
           [0034]      FIG. 12  illustrates examples of the typical artefacts images with low contrast and with poor contrast with banding from the sensor during trials; and, 
           [0035]      FIG. 13  illustrates example infrared images after pre-processing. 
       
    
    
       [0036]    It is an aim of the present work to improve the estimate of the position of the landing site, by using a geospatial camera observation model to provide an initial position estimate. Due to the distance from the target and low image resolution, the requirement to extract feature points in the image that correspond to the landing site is impractical. Instead we generate the same multi-dimensional vector of measured error terms but generate a set of samples. Each of these samples is tested using an appearance constraint to select the best fitting model to the data. These measurements are then combined in time using a simple exponential smoother. Also, we note that our prior 3D model of points is defined in the global coordinate frame and that the observation model we define has a high dimensional parameter space. 
       DETAILED DESCRIPTION 
       [0037]    The system is being developed for the BAE Systems Military Air Solutions Flying-Test-Bed Jetstream aircraft, which acts as a surrogate UAV. During this research, the aircraft was equipped with a Thermoteknix Miricle 307 infrared camera in a fixed angled pan and tilt position installed in the undercarriage behind a Germaniun coated glass cover. The camera, camera mount, aircraft and baggage pod are shown in  FIG. 3-3 . This sensor is an uncooled microbolometer with a resolution of M×N=640×480 detecting wavelengths between 7-14 μm in the long-wave infrared spectrum. This is coupled to the widest angle lens available that could be installed (see Table 3). The analogue video output is digitised by a GE Series Fanuc. The digital video output is recorded using a STACK DVR2-440, which is a ruggedised solid state MPEG-2 encoder with time-stamp and GPS overlays. The video data is recorded at 25 Hz. A Honeywell Laser Inertial Navigation System (LINS) with a GARMIN GPS 496 and barometric altimeter records the global pose and position of the UAV. This is recorded at a pre-configured rate of 50 Hz. The video data is time stamped with the real-time clock from the STACK and the GPS, but is currently only available as an embedded image overlay. The mount position of the camera with respect to the INS was measured using a Leica Laser. Some additional position offsets were required due to the UAV design and hardware layout. These were determined from computer aided designs of the aircraft in conjunction with Cranfield Aerospace. 
         [0038]    Several flight trials were organised during the research to assess the computer vision system. Most of the trials were based around two locations. The first location was the BAE Systems Warton Aerodome located near to Warton village on the Fylde in Lancashire, England. The second location was the BAE Systems airport on the Isle of Walney, located just north-west of the centre of Barrow-in-Furness, Cumbria, England. The latter, due to its location, allowed the scenario to be more controlled. The layout of the runways are shown in the maps in  FIG. 3  and brief descriptions of the data sets captured in Table 1. With the exception of a few seconds at the start of the flights, the landing site is not visible at the beginning nor end of the flight. This is typical, since at the start of the flight trial the aircraft is manoeuvring to observe the landing site. Whilst at the end, the aircraft is pulling up in order not to land but to perform another fly-pass. 
         [0039]    Data sets  121  and  160  have no indications of life-forms present in the landing site ROI, but may well do beyond this region. 
         [0000]    
       
         
               
             
               
               
               
               
               
               
             
           
               
                 TABLE 1 
               
             
             
               
                   
               
               
                 Table describing the data sets used in the experiments 
               
             
          
           
               
                 Data 
                 Trial 
                   
                 Indications 
                 Duration 
                 Date 
               
               
                 set ID 
                 sortie 
                 Brief description 
                 of life-forms 
                 MM:SS 
                 DD/MM/YY 
               
               
                   
               
               
                 121 
                 1-2 
                 Warton, auto contrast  
                 0 
                 04:13:60 
                 24/02/11 
               
               
                   
                   
                 settings 
                   
                   
                   
               
               
                 160 
                 2-3 
                 Walney, manual  
                 0 
                 03:20:44 
                 07/04/11 
               
               
                   
                   
                 contract adjustments 
               
               
                   
               
             
          
         
       
     
         [0040]    During each trial the aircraft descended from approximately 1000 m to 100 m above ground level (AGL) at an angle of declination of approximately 4°. Since the camera was in a fixed position the pilot was requested to maintain the landing site within the camera field of view (FOV) supported by a co-pilot using a tablet monitor. Apart from the obvious landing sites of the runway several less obvious sites were chosen, for example, a pond. The altitude measurements were taken from the official above mean sea level (AMSL) data for these sites. In Table 2 we provide some sample GPS landmarks of three surveyed sites. 
         [0000]    
       
         
               
             
               
               
               
             
               
               
               
               
               
               
               
               
               
             
           
               
                 TABLE 2 
               
             
             
               
                   
               
               
                 Table to provide a set of example GPS coordinates 
               
               
                 of three ROIs defining possible landing sites. 
               
             
          
           
               
                 Warton Aerodrome 
                 Isle of Walney Airport 
                 Isle of Walney Minor Pond 
               
             
          
           
               
                 Lat (°) 
                 Long (°) 
                 Alt (m) 
                 Lat (°) 
                 Long (°) 
                 Alt (m) 
                 Lat (°) 
                 Long (°) 
                 Alt (m) 
               
               
                   
               
               
                 53.749083 
                 −2.864002 
                 17 
                 54.136562 
                 −3.272213 
                 13 
                 54.133041 
                 −3.269205 
                 13 
               
               
                 53.746829 
                 −2.863787 
                 17 
                 54.136273 
                 −3.270882 
                 13 
                 54.131130 
                 −3.263555 
                 13 
               
               
                 53.741469 
                 −2.900033 
                 17 
                 54.135141 
                 −3.271161 
                 13 
                 54.129671 
                 −3.256860 
                 13 
               
               
                 53.741951 
                 −2.900566 
                 17 
                 54.135267 
                 −3.272363 
                 13 
                 54.127056 
                 −3.261752 
                 13 
               
               
                 • • • 
                 • • • 
                 • • • 
                 • • • 
                 • • • 
                 • • • 
                 54.124742 
                 −3.266301 
                 13 
               
               
                 • • • 
                 • • • 
                 • • • 
                 • • • 
                 • • • 
                 • • • 
                 54.129219 
                 −3.267932 
                 13 
               
               
                   
               
             
          
         
       
     
         [0041]    The sensor model defines the geometric relationship between a 3D point and its corresponding perspective projected 2D point in the image plane (           3 →           2 ). We express the intrinsic camera properties of the sensor model as the matrix K defined as: 
         [0000]    
       
         
           
             
               
                 
                   K 
                   = 
                   
                     [ 
                     
                       
                         
                           
                             
                               f 
                               x 
                             
                             / 
                             
                               S 
                               x 
                             
                           
                         
                         
                           
                             
                               ζ 
                               x 
                             
                              
                             
                               f 
                               x 
                             
                           
                         
                         
                           
                             O 
                             x 
                           
                         
                       
                       
                         
                           0 
                         
                         
                           
                             
                               ζ 
                               r 
                             
                              
                             
                               ( 
                               
                                 
                                   f 
                                   y 
                                 
                                 / 
                                 
                                   S 
                                   y 
                                 
                               
                               ) 
                             
                           
                         
                         
                           
                             O 
                             y 
                           
                         
                       
                       
                         
                           0 
                         
                         
                           0 
                         
                         
                           1 
                         
                       
                     
                     ] 
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where O x  and O y  are the principle point position coordinates (image plane and optical axis intersection). These define the origin of the pixel coordinate system located at the bottom left of the image, with the optical axis perpendicular to the centre of the image. Parameters ζ r  and ζ s  model the pixel aspect ratio and skew of the pixels respectively. The terms f x  and f y  are the focal length in pixel units using: 
         [0000]    
       
         
           
             
               
                 
                   
                     f 
                     x 
                   
                   = 
                   
                     
                       
                         Mf 
                         
                           C 
                           x 
                         
                       
                        
                       
                           
                       
                        
                       
                         f 
                         y 
                       
                     
                     = 
                     
                       Nf 
                       
                         C 
                         y 
                       
                     
                   
                 
               
               
                 
                   ( 
                   2 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where C x , C y  are the CCD dimensions in millimetres, M and N the width and height of the image in pixels respectively and S x , S y  are the pixel scaling values. Example values used in our experimental setup for these terms are shown in Table 3. 
         [0042]    Next we compensate for radial and tangential distortion caused by the camera lens. Let P=(u, v) T  and P d =(u d , v d ) T  be the corrected and measured distorted (d) pixel positions respectively from forward projection using Equation 7. The relationship between p and p d  can be modelled with a lens distortion model L expressed as: 
         [0000]    
       
         
           
             
               
                 
                   
                     ( 
                     
                       
                         
                           
                             u 
                             - 
                             
                               O 
                               x 
                             
                           
                         
                       
                       
                         
                           
                             v 
                             - 
                             
                               O 
                               y 
                             
                           
                         
                       
                     
                     ) 
                   
                   = 
                   
                     
                       L 
                        
                       
                         ( 
                         
                           r 
                           d 
                         
                         ) 
                       
                     
                      
                     
                       ( 
                       
                         
                           
                             
                               
                                 u 
                                 d 
                               
                               - 
                               
                                 O 
                                 x 
                               
                             
                           
                         
                         
                           
                             
                               
                                 v 
                                 d 
                               
                               - 
                               
                                 O 
                                 y 
                               
                             
                           
                         
                       
                       ) 
                     
                   
                 
               
               
                 
                   ( 
                   3 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where L(r d ) is based on parameters            1 ,            2  and            3  corresponding to a third degree polynomial and            4  a translation displacement, defined as: 
         [0000]        L ( r   d )=1+           1   r   d   4 +           2   r   d   3 +           3   r   d   2 +           4   r   d   (4)
 
         [0000]    where           influences the size of the FOV. The term r d   n  for order n corresponds to the normalised radius of an image pixel defined as: 
         [0000]        r   d   n =( u   d   −O   x ) n +( v   d   −O   y ) n   (5)
 
         [0043]    A perfect lens would have            1,2,3 =0 and            4 =1.0, leaving p=p d . 
         [0044]    The calibration process for estimating           requires the undistorted image generated from using inverse mapping. This consists of scanning each pixel in the output image and re-sampling and interpolating the correct pixel from the input image using the inversion of the radial lens distortion model. This is carried out for several images of a scene with targets of a known geometric correctness in the world. In our case experiments showed it was sufficient to only optimise            2  for correcting the apparent barrel distortion. Table 3 records the actual parameter values used in the experiments. 
         [0000]    
       
         
               
             
               
               
               
               
               
               
               
               
               
             
               
               
               
               
               
               
               
               
               
               
               
             
               
               
               
               
               
               
               
               
               
             
               
               
               
               
               
               
               
               
               
               
               
             
           
               
                 TABLE 3 
               
               
                   
               
             
             
               
                 Table to provide a set of example intrinsic camers parameters used in the system. 
               
             
          
           
               
                 M 
                 N 
                 f 
                 ζ r   
                 ζ s   
                 HFOV 
                 VFOV 
                 DFOV 
                 K 
               
               
                   
               
             
          
           
               
                 640 
                 pixels 
                 480 
                 pixels 
                 32 mm 
                 1 
                 1 
                 28.2° 
                 21.2° 
                 34.7° 
                 
                   
                     
                       
                         
                           [ 
                           
                             
                               
                                 826.6 
                               
                               
                                 0 
                               
                               
                                 320 
                               
                             
                             
                               
                                 0 
                               
                               
                                 826.6 
                               
                               
                                 240 
                               
                             
                             
                               
                                 0 
                               
                               
                                 0 
                               
                               
                                 1 
                               
                             
                           
                           ] 
                         
                           
                       
                     
                   
                 
               
             
          
           
               
                 C x   
                 C y   
                 O x   
                 O y   
                 S x   
                 S y   
                 κ 1   
                 κ 2   
                 κ 3   
               
             
          
           
               
                 8.8 
                 mm 
                 6.6 
                 mm 
                 M/2 
                 N/2 
                 6 
                 6      
                   0.001     
                  0.02     
                 0.001 
               
               
                   
               
             
          
         
       
     
         [0045]    Both the position of the UAV and the landing site coordinates are recorded as geographic latitude and longitude ellipsoid bearing coordinates direct from the onboard INS. These are converted to the metric-based cartesian Universal Transverse Mercator (UTM) coordinate system. The UTM coordinate system defines many map projections. We use zone  30 U to calculate northings and eastings using the world geodetic system standard WGS84. For the United Kingdom this defines the Earth&#39;s equatorial semi-major axis radius of 6, 378, 137.0 m, semi-minor axis 6, 356, 752.314245 m and first eccentricity squared of 0.006694380004260827. 
         [0046]    We use the equations defined by Krakiwsky [9] in our implementation. We then define three coordinate frames. First, the INS position T w (x, y, z) and orientation as R w (θ x , θ y , θ z ). 
         [0047]    Second, the camera mount position T m (x, y, z) and orientation as R m (θ x , θ y , θ z ).Third, the sensor position T c (x, y, z) and orientation as R c (θ x , θ y , θ z ). The INS coordinate system uses the North-East-Down (NED) convention where the X-axis extends positive forward (North), the Y-axis extends positive right (East) and the Z-axis extends downwards (Down) but positive up. The camera sensor is displaced relative to the camera mount, which is in turn displaced with respect to the INS. The camera optical axis is parallel to the camera sensor Z-axis. All transforms use a right handed coordinate systems with associated positive (forward) rotations. The orientations R w , R m  and R c  are formally defined as: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       R 
                       
                         w 
                         , 
                         m 
                         , 
                         c 
                       
                     
                      
                     
                       ( 
                       
                         
                           θ 
                           x 
                         
                         , 
                         
                           θ 
                           y 
                         
                         , 
                         
                           θ 
                           z 
                         
                       
                       ) 
                     
                   
                   = 
                   
                     
                       
                         [ 
                         
                           
                             
                               1 
                             
                             
                               0 
                             
                             
                               0 
                             
                           
                           
                             
                               0 
                             
                             
                               
                                 cos 
                                  
                                 
                                     
                                 
                                  
                                 
                                   θ 
                                   x 
                                 
                               
                             
                             
                               
                                 
                                   - 
                                   sin 
                                 
                                  
                                 
                                     
                                 
                                  
                                 
                                   θ 
                                   x 
                                 
                               
                             
                           
                           
                             
                               0 
                             
                             
                               
                                 sin 
                                  
                                 
                                     
                                 
                                  
                                 
                                   θ 
                                   x 
                                 
                               
                             
                             
                               
                                 cos 
                                  
                                 
                                     
                                 
                                  
                                 
                                   θ 
                                   x 
                                 
                               
                             
                           
                         
                         ] 
                       
                        
                       
                         [ 
                         
                           
                             
                               
                                 cos 
                                  
                                 
                                     
                                 
                                  
                                 
                                   θ 
                                   y 
                                 
                               
                             
                             
                               0 
                             
                             
                               
                                 sin 
                                  
                                 
                                     
                                 
                                  
                                 
                                   θ 
                                   y 
                                 
                               
                             
                           
                           
                             
                               0 
                             
                             
                               1 
                             
                             
                               0 
                             
                           
                           
                             
                               
                                 
                                   - 
                                   sin 
                                 
                                  
                                 
                                     
                                 
                                  
                                 
                                   θ 
                                   y 
                                 
                               
                             
                             
                               0 
                             
                             
                               
                                 cos 
                                  
                                 
                                     
                                 
                                  
                                 
                                   θ 
                                   y 
                                 
                               
                             
                           
                         
                         ] 
                       
                     
                      
                     
                       [ 
                       
                         
                           
                             
                               cos 
                                
                               
                                   
                               
                                
                               
                                 θ 
                                 z 
                               
                             
                           
                           
                             
                               
                                 - 
                                 sin 
                               
                                
                               
                                   
                               
                                
                               
                                 θ 
                                 z 
                               
                             
                           
                           
                             0 
                           
                         
                         
                           
                             
                               sin 
                                
                               
                                   
                               
                                
                               
                                 θ 
                                 z 
                               
                             
                           
                           
                             
                               cos 
                                
                               
                                   
                               
                                
                               
                                 θ 
                                 z 
                               
                             
                           
                           
                             0 
                           
                         
                         
                           
                             0 
                           
                           
                             0 
                           
                           
                             1 
                           
                         
                       
                       ] 
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where T w,m,c  and R w,m,c  define the pose of each coordinate frame of the forced landing system for the Jetstream. 
         [0048]    This allows for 6 degrees of freedom (DoF) for the INS, another 6 DoF for the sensor mount and a further 6 DoF to allow the sensor to be turreted. Due to the aircraft configuration, from here in, both the latter T m , R m , T c  and R c  were fixed, reducing the system to 6 DoF. The values used for the fixed parameters are given in Table 4. 
         [0000]    
       
         
               
             
               
               
               
               
               
               
               
             
           
               
                 TABLE 4 
               
               
                   
               
               
                 Table to provide a set of examples  
               
               
                 extrinsic model parameters used in the system. 
               
               
                   
               
             
             
               
                   
               
             
          
           
               
                   
                 T c (x) 
                 T c (y) 
                 T c (z) 
                 T m (x) 
                 T m (y) 
                 T m (z) 
               
               
                   
                 0.25 m 
                 0 m 
                 0.5 m 
                 −2 m 
                 −0.5 m 
                 1 m 
               
               
                   
                            (          ) 
                            (          ) 
                            (          ) 
                            (          ) 
                            (          ) 
                            (          ) 
               
               
                   
                 
                           
                 
                 
                           
                 
                 
                           
                 
                 
                           
                 
                 
                           
                 
                 
                           
                 
               
               
                   
                   
               
               
                   
                             indicates data missing or illegible when filed 
               
             
          
         
       
     
         [0049]    To map a 3D world point P(x, y, z) T  to a point p(u, v) T  on the image plane (forward projection            3 →           2 ) we calculate: 
         [0000]        p=R   c (( R   m (( R   w (( KP )− T   w ))− T   m ))− T   c )  (7)
 
         [0050]    To map a 2D point from the image plane p to a 3D world point P (back projection            2 →           3 ) we calculate: 
         [0000]        P=R   w   −1 (( R   m   −1 ( R   c   −1 (( K   −1   p )+ T   c ))+ T   m ))+ T   w )  (8)
 
         [0051]    From herein Equations 7 and 8 are referred to as p=g(P) and P=h(p), the inverse of g, respectively. The backward projection using Equation 8 requires the inverse of the lens distortion model coefficients and will only be approximate to a linear, first-order, representation. 
         [0052]    To back project points we require an estimate of range from our bearing only sensor. We consider that for each point in the image p there exists a collection of world points P that are projected onto the same point p. This collection of points constitute a ray connecting the centre of the camera C and the point in the image p. 
         [0053]    The ray associated to a pixel p can be defined as: 
         [0000]        P=C+λh ( p )  (9)
 
         [0054]    where λ is a positive scaling factor defining the position of P on the ray. The camera centre C(x, y, z) T  in the global coordinate frame is defined as: 
         [0000]        C=T   w +( R   w ( T   m +( R   m   T   c )))  (10)
 
         [0055]    In the case where z in P (x, y, z) T  is known (see Equation 49), it is possible to obtain the coordinates P(x) and P(y) by calculating λ, using the relationship: 
         [0000]    
       
         
           
             
               
                 
                   λ 
                   = 
                   
                     
                       z 
                       - 
                       
                         C 
                          
                         
                           ( 
                           z 
                           ) 
                         
                       
                     
                     
                       P 
                        
                       
                         ( 
                         z 
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   11 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where the denominator P(z) comes from P(x, v, z) T =h(p) are the Euclidean coordinates of the observed landmark in the world. For λ&lt;0 the ray between p and P is impossible given the value of z, which occurs when the camera observes regions of sky, that is, infinite range. 
         [0056]    We are interested in target objects           and regions of interest (ROI)           that exist in both the image (X         , X         ) and world domains (Z         , Z         ) respectively. In the world domain, both           and           define a vector of world points: 
         [0000]        Z             =Z             =Z   i   =[P   i   ,P   i+1   , . . . , P   n ] T   (12)
 
         [0000]    where P i (x, y, z) T  is a GPS point observation in UTM coordinates within the set            3 . These describe n vertices of a non self-intersecting closed irregular polygon where t is the time index. Using Equation 7 every observation in Z t  is forward projected to the image to define a vector of feature points: 
         [0000]        X             =X             =X   t   =[p   i   ,p   i+1   , . . . , p   n ] T   (13)
 
         [0000]    where p i (u, v) T  is a point measurement in the image along the horizontal and vertical axes within the set            2 . We note that whilst each point in X t  corresponds to point observations of landmarks in Z t , the point is not necessarily a visually salient feature in the image domain. If no errors exist then the mapping of Z t  to X t  will be exact, so that the re-projection error for each point observation is zero: 
         [0000]        g ( P   i )− {tilde over (p)}   i   =h ( p   t )− {tilde over (P)}   i =0  (14)
 
         [0000]    where {tilde over (p)} i  and {tilde over (P)} i  are the unknown perfect point measurements in both local and global domains. However, all the terms in the projection functions defined are prone to error. The parameters with the most significant sources of error are the INS rotation values (°), GPS measurements (m), altitude (m) and camera focal length (mm). The vector of mean values for these parameters is: 
         [0000]        p=[T   w ( x ), T   w ( y ), T   w ( z ), R   w (θ x ), R   w (θ y ), R   w (θ z ), K (θ)] T   (15)
 
         [0057]    The corresponding vector of errors is defined as: 
         [0000]      δ=[Δ T   w ( x ),Δ T   w ( y ),Δ T   w ( z ),Δ R   w (θ x ),Δ R   w (θ y ),Δ R   w (θ z ),Δ K (ƒ)] T   (16)
 
         [0058]    Each element is initialised using errors based on variances from datasheets or experiments: 
         [0000]      δ=[8.0 m,8.0 m,10.0 m,0.1°,0.1°,0.1°,2.0 mm] T   (17).
 
         [0059]    The error values in δ are then dynamically adjusted in time to account for synchronisation errors, so that errors are maximal during extreme manoeuvres and minimal during periods of stable flight. To do this, without INS rate information available, we differentiate each pose related term in δ with respect to time using backward finite differences. This uses the stored past pose at t−dt, where dt is a small time period. We then use an estimate of the maximum system timing error during extreme manoeuvres, defined as Δt. This is used as a scaling factor to provide an estimate of rotation and translation position error to adjust the associated error values. Finally, δ is redefined as: 
         [0000]    
       
         
           
             
               
                 
                   δ 
                   = 
                   
                     
                       [ 
                       
                         
                           
                             δ 
                             1 
                           
                           + 
                           
                             
                               
                                  
                                 
                                   δ 
                                   1 
                                 
                               
                               
                                  
                                 t 
                               
                             
                              
                             Δ 
                              
                             
                                 
                             
                              
                             t 
                           
                         
                         , 
                         
                           
                             δ 
                             2 
                           
                           + 
                           
                             
                               
                                  
                                 
                                   δ 
                                   2 
                                 
                               
                               
                                  
                                 t 
                               
                             
                              
                             Δ 
                              
                             
                                 
                             
                              
                             t 
                           
                         
                         , 
                         … 
                          
                         
                             
                         
                         , 
                         
                           
                             δ 
                             n 
                           
                           + 
                           
                             
                               
                                  
                                 
                                   δ 
                                   n 
                                 
                               
                               
                                  
                                 t 
                               
                             
                              
                             Δ 
                              
                             
                                 
                             
                              
                             t 
                           
                         
                       
                       ] 
                     
                     T 
                   
                 
               
               
                 
                   ( 
                   18 
                   ) 
                 
               
             
           
         
       
     
         [0060]    Next we define a single measure of uncertainty for each point projection. First we assume that each of these error terms are additive and follow a normal probability distribution function with zero mean, In order to combine these into single measure of uncertainty they have to be in the same units. This is only possible by observing their effect in the image coordinate space for each feature. The combined error is computed by constructing a covariance matrix for p i  given P i . Equation 19 allows the mapping of different domains: 
         [0000]        Cov ( p   i )=Σ= JWJ   T   (19)
 
         [0000]    where W=Diag(δ) since the measurements are treated as independent, and the inverse on J dropped due to the direction of the mapping. Note that J T  J is the approximated Hessian. The full Jacobian J is defined by the partial derivatives of gas: 
         [0000]    
       
         
           
             
               
                 
                   J 
                   = 
                   
                     
                       
                         [ 
                         
                           
                             
                               ∂ 
                               g 
                             
                             
                               ∂ 
                               
                                 δ 
                                 1 
                               
                             
                           
                           , 
                           
                             
                               ∂ 
                               g 
                             
                             
                               ∂ 
                               
                                 δ 
                                 2 
                               
                             
                           
                           , 
                           … 
                            
                           
                               
                           
                           , 
                           
                             
                               ∂ 
                               g 
                             
                             
                               ∂ 
                               
                                 δ 
                                 n 
                               
                             
                           
                         
                         ] 
                       
                        
                       
                           
                       
                        
                       where 
                        
                       
                           
                       
                        
                       
                         
                           ∂ 
                           g 
                         
                         
                           ∂ 
                           
                             δ 
                             i 
                           
                         
                       
                     
                     = 
                     
                       
                         [ 
                         
                           
                             
                               ∂ 
                               u 
                             
                             
                               ∂ 
                               
                                 δ 
                                 i 
                               
                             
                           
                           , 
                           
                             
                               ∂ 
                               v 
                             
                             
                               ∂ 
                               
                                 δ 
                                 i 
                               
                             
                           
                         
                         ] 
                       
                       T 
                     
                   
                 
               
               
                 
                   ( 
                   20 
                   ) 
                 
               
             
           
         
       
     
         [0000]    for a single equation g with n estimated variables. To calculate the partial derivatives we numerically differentiate g using a simple 2 point estimation defining Newton&#39;s difference quotient: 
         [0000]    
       
         
           
             
               
                 
                   
                       
                   
                    
                   
                     
                       
                         
                           
                             
                               ∂ 
                               g 
                             
                             
                               ∂ 
                               
                                 δ 
                                 i 
                               
                             
                           
                            
                           
                             ( 
                             
                               
                                 P 
                                 i 
                               
                               , 
                               
                                 δ 
                                 i 
                               
                               , 
                               
                                 
                                   δ 
                                   
                                     i 
                                     + 
                                     1 
                                   
                                 
                                  
                                 
                                     
                                 
                                  
                                 … 
                               
                                
                               
                                   
                               
                               , 
                               
                                 δ 
                                 n 
                               
                             
                             ) 
                           
                         
                         ≈ 
                         
                           ? 
                         
                       
                       = 
                       
                         
                           Δ 
                            
                           
                               
                           
                            
                           
                             g 
                              
                             
                               ( 
                               
                                 δ 
                                 i 
                               
                               ) 
                             
                           
                         
                         
                           δ 
                           i 
                         
                       
                     
                      
                     
                       
 
                     
                      
                     
                       
                         ? 
                       
                        
                       
                         indicates text missing or illegible when filed 
                       
                     
                   
                 
               
               
                 
                   ( 
                   21 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where δ i  is the error perturbation on each selected variable g is dependent on. 
         [0061]    To test the conditioning of □ we calculate the 2-norm condition number τ using the eigenvalues λ of □: 
         [0000]    
       
         
           
             
               
                 
                   
                     Cond 
                      
                     
                       ( 
                       Σ 
                       ) 
                     
                   
                   = 
                   
                     r 
                     = 
                     
                       
                         log 
                         10 
                       
                        
                       
                         ( 
                         
                           
                             λ 
                             min 
                           
                           
                             λ 
                             max 
                           
                         
                         ) 
                       
                     
                   
                 
               
               
                 
                   ( 
                   22 
                   ) 
                 
               
             
           
         
       
     
         [0062]    This gives an indication of the sensitivity of the perturbation, determining how much the relative input error is magnified in the relative output error. If □ is well-conditioned then τ is low≦6 and if □ is ill-conditioned then τ is &gt;6 [19]. If □ is rank deficient then λ=0 and Cond(□)=∞. We note that we have not included the errors of the GPS measurements in the database. 
         [0063]    Optimisation of the error vector δ requires the correct correspondence between features in the image from the projected landmarks and extracted feature points in the image [10]. Due to the low image resolution, poor contrast and the large distance to the target, the popular feature extraction techniques of Harris, KLT, SIFT and SURF primarily using image gradient information do not produce useable feature lists. Therefore, we developed an approach without needing to rely on extracting feature points. 
         [0064]    We start by defining a random sampling strategy to generate s sample measurements. The objective is to create a sample of regions of interest {circumflex over (X)} 1           , . . . {circumflex over (X)} s            spread about the mean measurement values in ρ. The sample is generated by applying additive noise η to every parameter in ρ using δ independently and then re-projecting the region to the image coordinate frame: 
         [0000]        {circumflex over (X)}   l             =g ( Z           ,ρ i +η i ,ρ i+1 +η i+1 , . . . , ρ η +η η )  (23)
 
         [0000]    where η i ˜         (μ ρi , σ δ     i   ) are non-identical Gaussian distributions and when l=0 using η=0 to include the original landing site in the set. This means that each sample region {circumflex over (X)} l            reserves the original shape of the region defined from the database but under different perspective distortions. Samples are only generated while the region in the image is less than the image limits. Examples of the generation of 100 samples for 1σ, 2σ and 3σ confidence intervals are shown in  FIG. 7 . It is clear from  FIG. 7  that the shape of the region can be reasonably well-defined by using GPS measurements. Also that the set of samples preserve this shape and represents feasible locations and deformations given the errors in key parameters of the observation model. 
         [0065]    Furthermore, since image textures are frequently bounded to a region, we use an appearance prior to rank each ROI in the sample. Our appearance prior is simply the expected mean intensity K of the target in the world. We then minimise the distance between the sample mean intensity and prior: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       X 
                       ^ 
                     
                      
                   
                   = 
                   
                     
                       argmin 
                       
                         l 
                         ∈ 
                         s 
                       
                     
                      
                     
                       { 
                       
                         K 
                         - 
                         
                           Mean 
                            
                           
                             ( 
                             
                               I 
                                
                               
                                 ( 
                                 
                                   k 
                                   ; 
                                   
                                     ℙ 
                                      
                                     
                                       ( 
                                       
                                         
                                           
                                             [ 
                                             
                                               u 
                                               , 
                                               v 
                                             
                                             ] 
                                           
                                           T 
                                         
                                         , 
                                         
                                           X 
                                           l 
                                            
                                         
                                       
                                       ) 
                                     
                                   
                                 
                                 ) 
                               
                             
                             ) 
                           
                         
                       
                       } 
                     
                   
                 
               
               
                 
                   ( 
                   24 
                   ) 
                 
               
             
           
         
       
     
         [0066]    To ensure only pixel intensities k bounded by the sample are used in the computation, a point-inside-polygon algorithm (P) tests the image indices are within X l           . Since the polygon may be convex or concave and potentially have self-intersections the odd-parity rule is used, where any ray from a point inside the polygon to infinity crosses an odd number of edges. This gives a complexity of O(lg(n)) for n intersections between rays and edges of the polygon. 
         [0067]    We note that by computing the error in position between every point in {circumflex over (X)}          (generated using the vector of parameter errors δ), with every point in the original projected X          (generated using only the vector of parameter mean values ρ), we derive similar horizontal u and vertical v error terms to Lowe [10]: 
         [0000]    
       
         
           
             
               
                 
                   
                     E 
                     u 
                   
                   = 
                   
                     
                       
                         
                           ∂ 
                           u 
                         
                         
                           ∂ 
                           
                             ρ 
                             1 
                           
                         
                       
                        
                       
                         δ 
                         1 
                       
                     
                     + 
                     
                       
                         
                           ∂ 
                           u 
                         
                         
                           ∂ 
                           
                             ρ 
                             2 
                           
                         
                       
                        
                       
                         δ 
                         2 
                       
                     
                     + 
                     … 
                     + 
                     
                       
                         
                           ∂ 
                           u 
                         
                         
                           ∂ 
                           
                             ρ 
                             n 
                           
                         
                       
                        
                       
                         δ 
                         n 
                       
                     
                   
                 
               
               
                 
                   ( 
                   25 
                   ) 
                 
               
             
             
               
                 
                   
                     E 
                     v 
                   
                   = 
                   
                     
                       
                         
                           ∂ 
                           v 
                         
                         
                           ∂ 
                           
                             ρ 
                             1 
                           
                         
                       
                        
                       
                         δ 
                         1 
                       
                     
                     + 
                     
                       
                         
                           ∂ 
                           v 
                         
                         
                           ∂ 
                           
                             ρ 
                             2 
                           
                         
                       
                        
                       
                         δ 
                         2 
                       
                     
                     + 
                     … 
                     + 
                     
                       
                         
                           ∂ 
                           v 
                         
                         
                           ∂ 
                           
                             ρ 
                             n 
                           
                         
                       
                        
                       
                         δ 
                         n 
                       
                     
                   
                 
               
               
                 
                   ( 
                   26 
                   ) 
                 
               
             
           
         
       
     
         [0068]    However, since we have used a sampling approach we do not need to perform the iterative Newton optimisation in [10]. 
         [0069]    Before we update the parameters in the original projection equations, the vector of parameter errors are smoothed in time. Without an underlying process model of the observed time series for each parameter and equal weights not favouring current data, we simply use a exponential smoothing. This defines the weights to follow a geometric progression that is the discrete version of an exponential function. This provides a reliable estimate for predicting just one time step into the future for each parameter. When α is close to 1 more emphasis is on the previous estimated data and when close to 0 more emphasis is on the actual data than an estimation capability. We chose α=0.5 to give moderate smoothing and speed. 
         [0070]    In this section we use a Kalman filter to provide the final estimate of the ROI position from filtering the observations in time. An observation is defined as the model fitted ROI {circumflex over (X)} t−1            from the previous section. We chose to use a Kalman filter because of the added benefit of allowing a long term estimate of the ROI to be determined for making predictions. The goal of the Kalman filter is simply to build an overall model that best fits the observed sequence as a whole. We define the state {circumflex over (x)} t   −  and covariance Σ t   −  for {circumflex over (X)} t            as: 
         [0000]        {circumflex over (x)}   t   −   =[{circumflex over (X)}   t             [p   l ( u )],{circumflex over (X)} l             [p   l ( v )],{dot over (u)} 1   ,{dot over (v)}   1   , . . . , {circumflex over (X)}   t             [p   n ( u )],{circumflex over (X)} t             [p   n ( v )],{dot over (u)} n   ,{dot over (v)}   n ] T   (27)
 
         [0000]      Σ t   − =diag(Σ l,1 ,[1,1] T , . . . , Σ l,n ,[1,1] T )  (28)
 
         [0000]    using the convention ( − ) for before and ( + ) for after both updating or predicting. The state is initialised using the ROI model fitted measurement and the associated projected point uncertainty Σ t,n , defined for each observation in Equation 19. The state is reinitialised after periods when no indications of life-forms are detected in the image. The process model describes the ROI position in terms of its previous positions using the linear kinematic model, expressed as: 
         [0000]        x   t   =f ( x   t−1 )+ w   t   (29)
 
         [0000]        {circumflex over (x)}   t ( l )=[ {circumflex over (x)}   t−1 ( u   1 ), {circumflex over (x)}   t−1 ( v   1 )]+[{circumflex over (x)} t−1 ( {dot over (u)}   1   ,{circumflex over (x)}   t−1 ( {dot over (v)}   1 )]Δ t   (30)
 
         [0000]    where {dot over (u)} 1  and {dot over (v)} 1  are velocities in u and v pixel coordinates that are also updated in state. The observation model is also linear since all information is in the same local coordinate frame and simply provides a means of indexing into the state vector: 
         [0000]        z   t   =h ( x   t−1 )+ v   t   (31)
 
         [0071]    Both terms w t ˜N(0, Q t ) and v t ˜N(0, R t ) take into account perceived irregular motion of the landing site in the image as a result of, for example, aircraft turbulence and perspective distortions from, for example, rotations in depth respectively. After Kalman filter updating and predicting the final estimate of the landing site  X   t            is set from the Kalman filter state: 
         [0000]          X     t             =[{circumflex over (x)}   t   + (1), {circumflex over (x)}   t   + (2), {circumflex over (x)}   t   + (5), {circumflex over (x)}   t   + (6), . . . ,  {circumflex over (x)}   t   + (4 n ), {circumflex over (x)}   t   + (4 n+ 1)] T   (32)
 
         [0072]    for n data points.  FIG. 8  illustrates example frames showing the improved positioning. 
         [0073]    We now estimate the position of the horizon line to provide a validation test for the estimated position of the ROI. The horizon line in the image domain is defined as a straight line between points p a  and p b . The gradient m of this line is related to the bank angle by: 
         [0000]        R   w (θ x )=tan −1 ( m )≡tan −1 (2 πv /( gt ))  (33)
 
         [0000]    where v is aircraft velocity, g gravitational acceleration and t the time for a 360° turn rate. Further the inclination angle is proportional to the region of image above or below the horizon line. We construct temporary image points along the vertical coordinate by n for an initial position i. All temporary points p a,i  and p b,i  have a horizontal value of 0 or M respectively. 
         [0000]        p   a,i =[0 ,{i−n, . . . , i− 1 ,i,i+ 1 , . . . , i+n}]   T   (34)
 
         [0000]        p   b,i=[M 1 ,{i−n, . . . , i− 1 ,i,i+ 1 , . . . , i+n}]   T   (35)
 
         [0074]    Each of these points is then projected into the global coordinate frame to a zero altitude: 
         [0000]        P   a,i   =g ( p   a,i   ,z= 0)  (36)
 
         [0000]        P   b,i   =g ( p   b,i   ,z= 0)  (37)
 
         [0075]    Vectors representing the ray for each temporary point to the camera centre C T , defined in Equation 10, are expressed as: 
         [0000]        v   1   =C   T   −P   a,i   T   (38)
 
         [0000]        v   2   =C   T   −P   b,i   T   (39)
 
         [0076]    We then project a point from the camera centre C T  to the global coordinate system to make a point observation P c . Again the initial altitude of zero is used. 
         [0000]        P   c   =g ([ M/ 2 ,N/ 2 ],z= 0)  (40)
 
         [0000]    Once P c  is created the altitude is reset to the same value as the altitude of the camera centre: 
         [0000]        P   c ( z )= C ( z )  (41)
 
         [0000]    This creates a ray that is always parallel to the ground, assuming that the ground is flat, creating the vector: 
         [0000]        v   3   =C   T   −P   c   T   (42)
 
         [0000]    This allows us to calculate the angle between the vector parrallel to the ground and each candidate vector: 
         [0000]      θ i =arg min(| v   3   |·|v   1 |)  (43)
 
         [0000]      θ i =arg min(| v   3   |·|v   2 |)  (44)
 
         [0077]    By minimising the angles on both sets of vectors we use the associated index i to construct two points in the image that lie on the horizon line. On the first execution the search indexes along the whole vertical axis of the camera frame to find the global minimum. However, for every other run the previous result is used to initialise the search. This uses an upper and lower bound that are scaled by the camera frame rate. 
         [0078]      FIG. 9  shows several examples of horizon line estimation using this approach.  FIGS. 9   a - c  show some visually, easy to inspect, results since the horizon can be observed. Conversely,  FIGS. 9   d - f  show examples where there is no visual information to indicate the location of the horizon. We point out that this approach is sensitive to errors in data time synchronisation and errors in geospatial referencing, which are visible in  FIG. 9   c.    
         [0079]    The rule based target object detector is used to identify objects in the image that we consider as potential indications of life-forms. The first rule is based on image intensity in the local coordinate frame. We assume that the intensity of indications of life-forms has the following normal distribution          (μ β ,σ β   2 ) and use this to calculate a lower and upper threshold for generating a binary mask: 
         [0000]    
       
         
           
             
               
                 
                   
                     Mask 
                      
                     
                       ( 
                       
                         u 
                         , 
                         v 
                       
                       ) 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           1 
                         
                         
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 
                                   μ 
                                   β 
                                 
                               
                               - 
                               
                                 
                                   v 
                                   β 
                                 
                                  
                                 
                                   σ 
                                   β 
                                 
                               
                             
                             ≤ 
                             
                               I 
                                
                               
                                 ( 
                                 
                                   
                                     k 
                                     ; 
                                     u 
                                   
                                   , 
                                   v 
                                 
                                 ) 
                               
                             
                             ≤ 
                             
                               
                                 μ 
                                 β 
                               
                               + 
                               
                                 
                                   v 
                                   β 
                                 
                                  
                                 
                                   σ 
                                   β 
                                 
                               
                             
                           
                         
                       
                       
                         
                           0 
                         
                         
                           otherwise 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   45 
                   ) 
                 
               
             
           
         
       
     
         [0000]    for a confidence interval of v β . Each group of true values in the mask represents a general object of interest          . The second rule is based on the surface area of each object in m 2  in the global coordinate frame. This requires that we calculate the convex hull for each object to define multiple polygons in the image domain. The convex hull uses Jarvis&#39;s march to construct left and right chains, where each point is ordered clockwise based on their occurrence along the polygon. Each polygon is back projected from the local image coordinate frame X j            to the global world coordinate frame Z j               i   . This requires an estimate of altitude, which is based on the mean altitude of the measurements available for the ROI, defined as: 
         [0000]    
       
         
           
             
               
                 
                   z 
                   = 
                   
                     
                       1 
                       n 
                     
                      
                     
                       
                         ∑ 
                         
                           i 
                           = 
                           1 
                         
                         n 
                       
                        
                       
                           
                       
                        
                       
                         
                           Z 
                            
                         
                          
                         
                           ( 
                           
                             
                               P 
                               i 
                             
                              
                             
                               ( 
                               
                                 
                                   z 
                                   ; 
                                   x 
                                 
                                 , 
                                 y 
                               
                               ) 
                             
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   46 
                   ) 
                 
               
             
           
         
       
     
         [0000]    By substituting all points p in X j           , . . . , X m            into Equation 9 we can define Z j           , . . . , Z m            with uniform altitude z as: 
         [0000]        Z   j           ( P   0   ,P   i+1   , . . . , P   n )= C+λh ( X   j           ( p   0   ,p   i+1   , . . . , p   n ))  (47)
 
         [0000]    With the objects now projected into the world, the area of the object (A j ) in m 2  is then computed for Z j           , . . . , Z m            as: 
         [0000]    
       
         
           
             
               
                 
                   
                     A 
                     j 
                   
                   = 
                   
                     
                       1 
                       2 
                     
                      
                     
                        
                       
                         
                           ∑ 
                           
                             i 
                             = 
                             1 
                           
                           
                             n 
                             - 
                             1 
                           
                         
                          
                         
                             
                         
                          
                         
                           ( 
                           
                             
                               
                                 Z 
                                 j 
                                  
                               
                                
                               
                                 ( 
                                 
                                   
                                     
                                       P 
                                       i 
                                     
                                      
                                     
                                       ( 
                                       x 
                                       ) 
                                     
                                   
                                   + 
                                   
                                     
                                       P 
                                       
                                         i 
                                         + 
                                         1 
                                       
                                     
                                      
                                     
                                       ( 
                                       y 
                                       ) 
                                     
                                   
                                 
                                 ) 
                               
                             
                              
                             
                               ( 
                               
                                 
                                   
                                     P 
                                     
                                       i 
                                       + 
                                       1 
                                     
                                   
                                    
                                   
                                     ( 
                                     x 
                                     ) 
                                   
                                 
                                 - 
                                 
                                   
                                     P 
                                     i 
                                   
                                    
                                   
                                     ( 
                                     y 
                                     ) 
                                   
                                 
                               
                               ) 
                             
                           
                           ) 
                         
                       
                        
                     
                   
                 
               
               
                 
                   ( 
                   48 
                   ) 
                 
               
             
           
         
       
     
         [0080]    A lower and upper threshold is then generated by assuming that the size of indications of life-forms have the following normal distribution          (μ μ ,σ μ   2 ). This rule is applied using the A j  for each Z j           , . . . , Z m            by: 
         [0000]    
       
         
           
             
               
                 
                   
                     b 
                      
                     
                       ( 
                       
                         j 
                         , 
                         
                           j 
                           + 
                           1 
                         
                         , 
                         … 
                          
                         
                             
                         
                         , 
                         m 
                       
                       ) 
                     
                   
                   = 
                   
                     { 
                     
                       
                         
                           1 
                         
                         
                           
                             
                               
                                 if 
                                  
                                 
                                     
                                 
                                  
                                 
                                   μ 
                                   γ 
                                 
                               
                               - 
                               
                                 
                                   v 
                                   γ 
                                 
                                  
                                 
                                   σ 
                                   γ 
                                 
                               
                             
                             ≤ 
                             
                               A 
                               j 
                             
                             ≤ 
                             
                               
                                 μ 
                                 γ 
                               
                               + 
                               
                                 
                                   v 
                                   γ 
                                 
                                  
                                 
                                   σ 
                                   γ 
                                 
                               
                             
                           
                         
                       
                       
                         
                           0 
                         
                         
                           otherwise 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   49 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where b is a vector of binary values for each index j of Z j            or X j           , and u μ the confidence interval that takes into account the variance of object size due to natural variation and viewing angle. This defines life-forms as closed, non-complex polygons that are white-hot in the image and of a certain size in the world. 
         [0081]    Finally, we compute a probability for the event e that a region X          contains an object X         . Thus, if n s  is the total number of samples, n e  the number of samples which contained an object, the probability P(e) of the event occurring is approximated by the relative frequency: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       P 
                        
                       
                         ( 
                         e 
                         ) 
                       
                     
                     ≈ 
                     
                       
                         n 
                         e 
                       
                       
                         n 
                         s 
                       
                     
                   
                   = 
                   
                     
                       1 
                       s 
                     
                      
                     
                       
                         ∑ 
                         
                           l 
                           = 
                           1 
                         
                         s 
                       
                        
                       
                           
                       
                        
                       
                         { 
                         
                           
                             
                               1 
                             
                             
                               
                                 
                                   if 
                                    
                                   
                                       
                                   
                                    
                                   
                                     ( 
                                     
                                       
                                         ∑ 
                                         
                                           j 
                                           = 
                                           1 
                                         
                                         m 
                                       
                                        
                                       
                                           
                                       
                                        
                                       
                                         
                                           b 
                                           j 
                                         
                                          
                                         
                                           ℙ 
                                            
                                           
                                             ( 
                                             
                                               
                                                 X 
                                                 j 
                                                  
                                               
                                               , 
                                               
                                                 
                                                   X 
                                                   ^ 
                                                 
                                                 j 
                                                  
                                               
                                             
                                             ) 
                                           
                                         
                                       
                                     
                                     ) 
                                   
                                 
                                 &gt; 
                                 0 
                               
                             
                           
                           
                             
                               0 
                             
                             
                               otherwise 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   50 
                   ) 
                 
               
             
           
         
       
     
         [0082]      FIG. 10  shows some sample results using this rule-based object detector. The green polygons denote objects that meet the intensity requirements for indications of life-forms only. The red polygons denote objects that meet both the intensity and size requirements for indications of life-forms.  FIGS. 10   a - f  all show example candidate objects that only meet the intensity requirement. These are typically building roofs and sections of roads that are correctly not classified as life-forms. The only genuine indication of life-forms is some moving cars in  FIG. 10   a , which are successfully identified.  FIGS. 10   d - f  also show some other classifications of indications of life-forms that are unknown positives since they are not persistent in time. 
         [0083]    In this section we measure the information content in the ROI to understand the landing site terrain characteristics and presence of obstacles. This is achieved by computing the entropy value, which is a single statistical measure of the randomness of the spatial information present. Entropy is based on image intensity and is estimated from a grey-level histogram. We start by estimating the probability of occurrence of a grey-level k in the ROI using the histogram H as: 
         [0000]    
       
         
           
             
               
                 
                   
                     P 
                      
                     
                       ( 
                       k 
                       ) 
                     
                   
                   ≈ 
                   
                     
                       H 
                        
                       
                         ( 
                         k 
                         ) 
                       
                     
                     A 
                   
                 
               
               
                 
                   ( 
                   51 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where A comes from Equation 48 but substituting Z          with X           ′ . The entropy value is then estimated and normalised to [0, 1] as: 
         [0000]    
       
         
           
             
               
                 
                   
                     H 
                     e 
                   
                   = 
                   
                     - 
                     
                       
                         
                           
                             ∑ 
                             
                               k 
                               = 
                               0 
                             
                             
                               
                                 2 
                                 b 
                               
                               - 
                               1 
                             
                           
                            
                           
                               
                           
                            
                           
                             
                               P 
                                
                               
                                 ( 
                                 k 
                                 ) 
                               
                             
                              
                             
                               
                                 log 
                                 2 
                               
                                
                               
                                 ( 
                                 
                                   P 
                                    
                                   
                                     ( 
                                     k 
                                     ) 
                                   
                                 
                                 ) 
                               
                             
                           
                         
                         ) 
                       
                       
                         
                           log 
                           2 
                         
                          
                         
                           ( 
                           
                             
                               2 
                               b 
                             
                             - 
                             1 
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   52 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where H e =1 represents the maximum spatial randomness within the ROI. At a higher level this gives an indication of surface homogeneity and ground-based obstacles. Finally, the complementary estimate of information redundancy is therefore r=b−H e  where b is the smallest number of bits with which the image quantisation levels can be represented. We note that contextual information is ignored since entropy calculated using the co-occurrence matrix is slow. 
         [0084]    To specify the rule based parameters we used the expected thermal radiance of materials based on their emissivity values taken from reference data. The emissivity values for some relevant materials include skin 0.98, soil 0.9, sand 0.8-0.9, water 0.96 and brick 0.9. Assuming suitable sensor bias and gain settings, skin with the highest emissivity should ideally correspond to the highest intensity value. Therefore we used values μ β 255 and σ β   2 =20 2  with a confidence interval of v β =3. However, we also expect the occurrence of pixels within this confidence interval of thermal radiance to be low. This is due to the relatively small size of life-forms as a result of the low resolution of the sensor and high aircraft altitude. With this in mind, the size rule in the object detector used values μ μ =4 m, σ μ   2 =1 2  m with a confidence interval of v μ =3. The model fitting and tracking parameters were set using the intensity reference value K=200, a tracker period of 5 seconds, w=[1, 1, 1, 1], v=[0.1, 0.1, 0.1, 0.1], s=50 samples, the sampling confidence interval of 3a and the maximum time synchronisation error of Δt=0.5 seconds. For all the experiments the system parameters were kept constant throughout. 
         [0085]    The system results for detecting indications of life-forms consist of quantifying, first, the number identified in the tracked landing site ROI, second, the probability they are positioned in the tracked landing site ROI and third, the number identified in the image. These results are shown in  FIGS. 11   a  to  11   d  as blue dotted, red dashed-dotted and green continuous lines respectively. This information is plotted on both left and right y-axes against the system tick on the x-axis, which in these experiments is equivalent to the video frame rate. 
         [0086]    The results show that generally the system did not identify indications of life-forms in the landing site during the flights for data sets  121  and  160 . This was to be expected as none were present in these data sets. Frequently, however, the results do quantify several unexpected detections of indications of life-forms outside of the landing site region. From examining the video data, these detections tend to be moving cars travelling in the vicinity. They are discriminated by the high thermal radiance emitted from the tyres, engine and cabin, which also trigger our life-form size rule. The probability of these being in the position of the landing site is correctly computed as zero. 
         [0087]    Towards the end of data sets  121  and  160  the results show a large spike in the number of detections of indications of life-forms. This occurred when the aircraft was flying at its lowest altitude at less than 100 m. These detections are incorrect. They are caused from the high contrast and life-form sized markings on the runways. Whilst they do appear in the landing site, the probability in position is low, given the error in the parameters used in the observation model. We also show enlarged views of these periods of time in  FIGS. 11   c  and  11   d . These illustrate that the corresponding time period was also very short compared to the overall length of the flight. 
         [0088]    Since we are only interested in the number of indications of life-forms present at each time step, correspondence of life-forms is not performed. This can mean, however, that the system does not give consistent detections in time as a result of subtle changes in object radiance or environmental conditions or changing viewing angle in time. We foresee that future work will represent the position of each indication of a life-form in the state space of the Kalman filter used in Section 8. 
         [0089]    We also show the surface homogeneity results in  FIGS. 11   e  and  11   f  for data sets  121  and  160  respectively. These provide an indication of the texture of the ground surface in the tracked landing site ROI. In general we anticipated that the entropy would increase as the aircraft approached the landing site since its resolution would increase. Whilst this can be seen in the results from data set  121 , the results from data set  160  show a more erratic behaviour. This was mainly due to the camera gain settings being adjusted during the flight, as an attempt to improve the contrast. We anticipate that this measure of information content would be more useful for non-official landing sites, such as agricultural fields, which is the main requirement of the system. 
         [0090]    The geo-referenced camera observation model with corresponding projection uncertainty is a key part of the system. The model allows for any GPS landmark in the FOV to be transformed from the world to the local frame as pixels and back projected into GPS coordinates. This allows applicability to both database approaches (where a target landing site is projected into the image), but also image-based approaches (where a target landing site is extracted from the image). The performance of the observation model used is dependent on the precision of all the intrinsic and extrinsic parameters, the accuracy of the modelling and time synchronisation between INS and video data. Unfortunately, no camera intrinsic and extrinsic geometry or radiometric calibration data was available. This was in part due to the difficulties in generating a sufficiently robust calibration procedure. However, some experiments using known targets were used to estimate the focal length. The results from these correctly aligned with the sensor data sheet and provided an error tolerance to be used by the system. 
         [0091]    The rule based target object detector for identifying indications of life-forms described in used intensity and size information. Both measuring intensity and size are dependent on the quality of the image and observation model. We found that given the data, our results showed promise and that the algorithm performed with linear time complexity. In the future a narrower lens and larger focal length would be specified. This would then be mounted on a motorised pan-tilt turret already supported by our current observation model. This would also remove the contrived setup where the pilot has to fly the aircraft to keep the landing site in the camera FOV, by actively controlling the camera pan and tilt. The improved pixel to metre scaling would also allow the feasibility of including shape information into the rules. 
         [0092]    The information content of the ROI was used to provide a measure of the landing surface topology. The entropy value was expected to increase with the increasing resolution of the ROI as the aircraft altitude decreased. We expected a low entropy to indicate an area of uniform thermal radiance, and a high entropy to indicate different materials and objects within the ROI. We anticipate that this will be more informative for non-official landing sites. Unfortunately, with the current sensor data there seems little alternative due to the low resolution and contrast. 
         [0093]    The performance of the horizon line estimator also uses the geo-referenced observation model. This is apparent in our experiments, since the estimated position of the horizon line in the image shows inaccuracies caused by timing synchronisation errors. However, most importantly the horizon line estimate is completely independent from the image content, allowing it to ensure that the estimated ROI is completely on the ground plane. Uniquely, the horizon line position can be estimated whether it falls in the image or not. A future improvement would be to incorporate the image based position coordinates of the horizon line in the Kalman filter state for tracking. 
         [0094]    The penultimate position estimate of the landing site in the image comes from the shape preserved model fitting with appearance constraint based on the original projection. The accuracy of this depends on the number of samples used and the ability to capture the significant sources of error in the observation model and system. We used the errors in the pose and camera focal length parameters to determine the uncertainty in the projection of the observations. The same errors allowed the generation of a set of sample landing sites in order to select the best fitting model using the image data. The minimisation using the appearance constraint required a reasonable level of image quality but for the most part worked using our data. 
         [0095]    The observation parameters were then updated based on the associated smoothed correction estimates that were used to generate the fitted model. Since samples are generated about the projected ROI the solution is dependent on the observation model being reasonable. We observed that with increasingly unique shaped landing sites such as the designs used on helipads, the better the fitting performance. In the future we will exploit different image based features to extract and a higher number of parameters to increase robustness of the model fitting. 
         [0096]    The final position estimate of the landing site in the image was from using a Kalman filter to track the model fitted ROI in the local coordinate frame. The Kalman filter combined the uncertainty of the model fitted measurements into the estimation process in time. This generated the final position of the landing site from the coordinates stored in the database. The simple use of a Kalman filter acted as a smoother to generate a mean estimate using the observations. 
         [0097]    From the foregoing, there has been presented a computer vision based component to support the online localisation and analysis of pre-surveyed or marked landing sites, for unmanned or manned aircraft at near real-time processing rates. It has been demonstrated that a shape preserved model sampling, fitting and tracking process allows the system to operate at altitudes where feature point extraction and correspondence is implausible. Furthermore, the GPS-driven geographic-spatial-referencing observation model is suitably generic to support our future ambitions. These include actively controlling the camera, deriving GPS positions from image based measurements and supporting the integration into a suitable flight simulation environment. It is a future aim to increase the INS sampling rate, accuracy of the data synchronisation and calibration procedure. 
       APPENDIX 1 
     Histogram Specification for Sensor Selection 
       [0098]    The detector elements in the focal plane array (FPA) of the microbolometer are fairly non-uniform in their response to thermal radiance. This is due to variations in the manufacturing process and detector material characteristics. The Thermoteknix Miricle camera attempts to correct for this by using a one-point non uniform-correction (NUC). This uses the mechanical shutter in the closed position periodically to generate a flat-field uniform image. The difference between the output of each element in the FPA and the far-field image allows an offset parameter O uv  to be calculated for a fixed value of gain G uv . Assuming a linear model these two parameters allow the pixel intensity k correction to be made using: 
         [0000]        I   1 ( k;u,v )= G   uv ( k;u,v )+ O   uv   (53)
 
         [0099]    Positive offsets shift the intensity distribution to the right hand side increasing image brightness and the opposite for negative offsets. The gain value G uv  is factory set and performs a multiplication or division to compress or expand the intensity distribution. Unfortunately the process generates frozen frames in between the integration period (every 45 seconds), the offset coefficients drift over time due to ambient temperature change, assumes the factory gain values remain valid and relies on the thermal radiance of the shutter being a fair representation of the scene. As a result image artefacts exist from non-uniform gain effects, which appear as vertical stripes and images with a low contrast ratio. 
         [0100]    It is desirable to control the offset and gain above and beyond the one-point NUC already applied, in order to control the contrast ratio of the image. This will support downstream algorithms by enforcing that the contrast ratio is optimal for the target and the image intensity distribution not uniform. 
         [0101]    Means et al [11] optimises a set of gain and offsets based using a least-mean-squared algorithm with a reference image based on the current frame. Hardware is used to support real-time performance. Alternatively, many use Vickers [18] histogram plateau equalisation. This does not require hardware support to achieve real-time performance and does not require a reference image. This adaptively sets a gain parameter for the maximum frequency of each grey level value for each image. Where this is either 0 a histogram projection is performed and a histogram equalisation is performed for values greater than the maximum frequency. 
         [0102]    We use histogram specification, which sets the offsets and gains statistically according to a desired non uniform probability distribution function (pdf). To specify the pdf we use the expected distribution of pixels thermal radiance of objects base on their emissivity values in the scene. The emissivity values for objects in our scene that are visible in the image include skin 0.98, soil 0.9, sand 0.8 to 0.9, water 0.96 and brick 0.9. We use normal probability distributions to model the intensities in the image for skin in the scene as k˜         (μ β ,σ β   2 ) and all other intensities for everything else in the scene as k˜         (μ α ,σ α   2 ). Since skin has a high emissivity corresponding to the highest value of intensity in the image, we use values μ β =255 and σ β   2 =20 2 . For the background we use values μ α =100 and σ α   2 =50 2 . However, we also expect the probability of a pixel with thermal radiance value for skin to be low. This is due to the relatively small size of objects with skin and low resolution of the sensor. Therefore we set the a-priori probabilities that a pixel with belongs to skin as P(β)=0.2 and the complement P(α)=1−P(β). Both distributions can be combined to form the bimodal distribution model for a grey level k for the image: 
         [0000]        f ( k )= MN ( P (α) f ( k;μ   α ,σ α   2 )+ P (β) f ( k;μ   β ,σ β   2 ))  (54)
 
         [0000]    The validity of the specified histogram or pdf is understood as the equality between the image size and the sum of histogram bins, that is: 
         [0000]    
       
         
           
             
               
                 
                   
                     
                       ∑ 
                       
                         k 
                         = 
                         0 
                       
                       
                         
                           2 
                           b 
                         
                         - 
                         1 
                       
                     
                      
                     
                         
                     
                      
                     
                       f 
                        
                       
                         ( 
                         k 
                         ) 
                       
                     
                   
                   = 
                   
                     M 
                     × 
                     N 
                   
                 
               
               
                 
                   ( 
                   55 
                   ) 
                 
               
             
           
         
       
     
         [0000]    This model allows us to specify the ideal properties of a sensor for this problem. Our sensor is neither radiometrically calibrated nor compliant with our ideal intensity model. Next, we build a lookup-table (LUT) using both the cumulative histogram of the image {tilde over (F)}(k) and cumulative specified histogram F(k). For each gray level l, we find {tilde over (F)}(l), and then find a k level so that F(k) best matches, by minimising: 
         [0000]    
       
         
           
             
               
                 
                   
                      
                     
                       
                         
                           F 
                           ~ 
                         
                          
                         
                           ( 
                           l 
                           ) 
                         
                       
                       - 
                       
                         F 
                          
                         
                           ( 
                           j 
                           ) 
                         
                       
                     
                      
                   
                   = 
                   
                     
                       min 
                       k 
                     
                      
                     
                        
                       
                         
                           
                             F 
                             ~ 
                           
                            
                           
                             ( 
                             l 
                             ) 
                           
                         
                         - 
                         
                           F 
                            
                           
                             ( 
                             k 
                             ) 
                           
                         
                       
                        
                     
                   
                 
               
               
                 
                   ( 
                   56 
                   ) 
                 
               
             
           
         
       
     
         [0000]    where a LUT entry is LUT[l]=j. Applying the LUT yields the maximum available contrast ratio of 256:1 for the spectral band 7 to 14 μm quantised over 2 b −1 grey levels where b=8 is the number of bits. The only image pre-processing included a median filter and notably the histogram specification described above. The latter was implemented to attempt to improve the image contrast in order to make indications of life-forms more discriminating from the background. Whilst the contrast of the images improved, the images captured in general were too quantized with a poor dynamic range to make a sufficient benefit for our problem. This was due to the auto-ranging, which sets the gains and bias, using a reference cold and hot target measurements that were for a wider range for general scene analysis. This is apparent in data set  121 . This led to adjusting the gain settings during flight based on the histogram specification output. This was performed in data set  160 . Ideally this software based pre-processing of the images would not be required, since it is potentially the most computationally complex algorithm used in the system. Adding each pixel to its appropriate temporary bin in the histogram requires O(MN). This is done twice to generate the histogram equalised image and specified histograms. To generate the LUT requires a linear search over all grey levels O(K) for each grey-level k. The total time complexity is thus stated as O(2MN+KK), which is reduced to O(MN) by generating the LUT off-line.