Patent Publication Number: US-4925274-A

Title: Correlation techniques

Description:
This is a continuation of application Ser. No. 07/147,191, filed Jan. 22, 1988, which was abandoned upon the filing hereof. 
    
    
     BACKGROUND OF THE INVENTION 
     This invention relates to correlation techniques. 
     In known correlation techniques, a reference image is compared with an image of a viewed scene, the reference image containing an object of interest, for example, a target, which is to be detected within the viewed scene. The reference image is scanned across the image of the viewed scene, and each pixel pair, ie one in the reference image and one in the viewed scene, is compared either by subtraction, multiplication or a more complex operator for each reference image position to form a correlation surface or array. However, these techniques may be sensitive to the presence of bright spots within the viewed scene which are due to external sources and thus may not provide an accurate correlation. 
     SUMMARY OF THE INVENTION 
     According to one aspect of the invention, there is provided a method of forming a correlation array for a target within a viewed scene, the method comprising the steps of: 
     (a) forming a reference array containing the target; 
     (b) forming a scene array corresponding to the viewed scene; 
     (c) scanning the scene array with the reference array and determining the minimum value of (W/S, S/W) for each pixel pair of the scene and reference arrays, where W and S are the pixel values of the reference array and scene array, respectively; 
     (d) summing the minimum values obtained to form a cumulative total for each pixel of the scene array; 
     (e) applying a conditional threshold value to the cumulative total to determine similarity and dissimilarity between the reference and scene arrays; and 
     (f) assigning values of zero and one to the correlation array corresponding to whether its associated pixel in the scene array was found to be dissimilar or similar respectively. 
     Advantageously, a structured sampling pattern may be implemented in which one in four or one in nine pixels are sampled depending upon the target dimensions. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     For a better understanding of the invention, reference will now be made, by way of example, to the accompanying drawings, in which: 
     FIG. 1 illustrates a scanning process for a given memory within a given search area; 
     FIGS. 2 and 3 illustrate pixel sampling patterns; and 
     FIG. 4 illustrates the application of a threshold to the cumulative totals of minimum values of (W/S, S/W) for each pixel being sampled. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
     Consider an image of a scene made up of a two-dimensional matrix of grey level intensities eg ranging between 0 and 255. A search area, S&#39;, and a memory, W&#39;, are defined as shown in FIG. 1. Both search area S&#39; and memory W&#39; comprise a plurality of pixels, each pixel of search area S&#39; and memory W&#39; having a pixel value S and W, respectively. The memory, W&#39;, is just large enough to contain a thermal signature of a target which is to be detected within the scene, whereby the thermal signature may have been obtained from a previous scan of the viewed scene. Thus, the memory W&#39; serves as a reference frame of the target as viewed in the previously viewed scene. The memory is used to search the image of the scene to detect a new target position. It is not necessary to search the whole scene because a search area (as shown in FIG. 1) may be designated which contains a predicted target position and which encompasses all possible target motion between forming the image being correlated and the previous image of the viewed scene. 
     As shown in FIG. 1, the search area S&#39; is scanned by moving the memory W&#39; sequentially over the search area in a horizontal direction one pixel at a time raster fashion. If the memory has dimensions M×N, and the search area has dimensions X×Y, there are (X-M+1)(Y-N+1) memory positions per search. For each position of the memory within the search area, the correlation function is given by: ##EQU1## where L is the correlation function; 
     (W/S, S/W) are comparisons carried out on pixel pairs of the memory and the underlying search area. 
     All values of L obtained form a correlation array or surface, the array having dimensions of (X-M+1)×(Y-N+1). 
     It can be seen from equation (1) that a perfect match between the memory and the search area will produce a value of L=1, and a complete mismatch will produce a value of L=0. 
     As a large part of the search area will not contain any target information at all, a sampling pattern may be implemented ie a given fraction of the total number of pixel pairs (corresponding search area and memory pixels) can be considered. Referring to FIGS. 2 and 3, only one in four and one in nine pixels, respectively, are sampled, the sampling pattern being determined by the size of the target in terms of the number of pixels. 
     Structured sampling is preferable to random sampling as the target may only occupy a small portion of the memory and if a random sampling technique is used, the target may be ignored completely. 
     The value of the minimum of min (W/S, S/W) for each pixel pair referenced is summed together after the total number of samples P has been taken to give a cumulative total. Curves A and B of FIG. 4 are examples of cumulative totals for different positions of the search area S&#39; occupied by the memory M&#39;. This total is then compared with a threshold value T, see FIG. 4. The following criterion applies: 
     is the total &lt;T, dissimilarity ie L=0 
     if the total ≧T, similarity 
     Thus, since the cumulative totals of min (W/S, S/W) exceed the threshold T in curve A, the corresponding position on the search area is designated &#34;similar&#34;; conversely, since the cumulative totals of min. (W/S, S/W) do not exceed the threshold T in curve B, the designation is &#34;dissimilar&#34;. 
     If the position on the search area currently occupied by the memory is designated `dissimilar` the correlation array is assigned a value of zero. However, if the designation is `similar`, all the remaining pixel pairs are referenced and equation (1) is implemented in full. 
     Naturally, the threshold value T varies with the sampling pattern chosen.