Patent Publication Number: US-9424486-B2

Title: Method of image processing

Description:
CROSS-REFERENCE TO RELATED APPLICATIONS 
     This application is a continuation of U.S. patent application Ser. No. 12/377,490 filed Jun. 12, 2009, which is a U.S. national stage entry under 35 U.S.C. §371 of PCT International Patent Application No. PCT/EP2007/058547, filed Aug. 16, 2007, which claims priority to GB Patent Application No. 0616293.7, filed Aug. 16, 2006. Each of the above-referenced patent applications is hereby incorporated by reference in its entirety. 
    
    
     BACKGROUND OF THE INVENTION 
     1. Field of the Invention 
     The present application relates to a method of identifying a target object in an image using image processing. It further relates to a system and computer software implementing the method. 
     2. Description of the Related Technology 
     Amongst the most generic of techniques for the detection of planar projections of shapes in digital images are the so-called template-matching methods, where a learned image template is compared (matched) against all possible locations in the image. Simple template matching methods operate on luminance values of the template and image and compute a distance metric based on normalized cross-correlation. Normalized cross-correlation is invariant to global and linear illumination changes but not to local non-homogenous changes. It is also not invariant to intra-class variations of a family of objects such as relative luminance values between different regions of the object. 
     An important issue is that of the property used to match between image and template. The most widely used techniques make use of the image pixel values themselves, and use cross-correlation between a template containing the image pixel values from one or more averaged examples of the shape. 
     Template matching between binary edge maps of the image and shape has led to faster, and more selective discrimination of shapes than that using simply the pixel values. 
     European patent application no. EP 1193642 A1 describes a method for recognizing a user defined model object within an image. The model object is searched for in an image by generating a match metric using a normalized cross-correlation technique. 
     It is an object of the application to provide improved object detection in image processing techniques. 
     SUMMARY 
     In accordance with one embodiment, there is provided a method of identifying a target object in an image including a plurality of image features, wherein the method comprises: storing template data, the template data representing a template orientation field indicative of an orientation of each of a plurality of features of a template object; receiving image data representing the image; processing the image data to generate an image orientation field indicating an orientation corresponding to the plurality of image features; processing the image data to generate image confidence data based on at least one characteristic for use in identifying the target object in a given image, the characteristic being indicative of an increased likelihood that at least one part of the given image represents at least part of the target object, relative to other parts of the given image; processing the image orientation field using the template orientation field and the image confidence data to generate a match metric indicative of an extent of matching between at least part of the template orientation field and at least part of the image orientation field; and using the match metric to determine whether or not the target object has been identified in the image. 
     The method described in the present application allows a target object to be identified in images, whether still images or video images, both quickly and efficiently. 
     Use of image confidence data allows the target object to be identified with greater certainty, and thus with more accuracy. The image confidence data may be based on one or more characteristics related to the target object so that matching data of a higher quality may be generated. 
     In accordance with a further embodiment, there is provided a method of identifying a target object in an image including a plurality of image features, wherein the method comprises: storing template data, the template data representing a template orientation field indicative of an orientation of each of a plurality of features of a template object; receiving template confidence data indicating a likelihood that at least one part of the template accurately represents at least part of the target object; receiving image data representing the image; processing the image data to generate an image orientation field indicating an orientation corresponding to the plurality of image features; processing the image orientation field using the template orientation field and the template confidence data to generate a match metric indicative of an extent of matching between at least part of the template orientation field and at least part of the image orientation field; and using the match metric to determine whether or not the target object has been identified in the image. 
     The template confidence data is based on known parameters related to the target object and/or other features of the image. The template confidence data is used to improve a quality of matching with the template data such that the target object may be more accurately and reliably identified in the image. 
     In accordance with yet further aspects of the present invention, there is provided apparatus arranged to perform the method of the present invention, computer software arranged to perform the method of the present invention and a data carrier storing the computer software of the present invention. 
     Further features and advantages will become apparent from the following description of preferred embodiments, given by way of example only, which is made with reference to the accompanying drawings. 
    
    
     
       BRIEF DESCRIPTION OF THE DRAWINGS 
         FIG. 1  shows schematically an apparatus for performing the method of the present invention. 
         FIG. 2  shows a flow diagram giving an overview of the method according to one or more embodiments of the present invention. 
         FIG. 3  shows schematically a method of generating a template orientation field, in accordance with an embodiment of the present invention. 
         FIG. 4  shows schematically a method of generating a template orientation field, in accordance with a different embodiment of the present invention. 
         FIGS. 5 a  and 5 b    show exemplary masks in accordance with an embodiment of the present invention. 
         FIGS. 5 c , 5 d , 5 e    show exemplary orientation fields in accordance with the invention. 
         FIG. 6  shows schematically a method of generating a template phase map in accordance with an embodiment of the present invention. 
         FIG. 7  shows schematically a method of generating a match metric in accordance with an embodiment of the present invention. 
         FIG. 8  shows schematically a method of generating a match metric in accordance with a different embodiment of the present invention. 
     
    
    
     DETAILED DESCRIPTION OF CERTAIN INVENTIVE EMBODIMENTS 
     Embodiments of the present invention provide a method of identifying a target object in an image. In the exemplary embodiments of the invention described below, the target object is a human face, however, it is envisaged that the target object may be an alternative object. 
     Image Processing System 
     In the embodiments of the method of the application to be described, the method is performed by computer software which the image processing system is arranged to run. The computer software may be stored on a suitable data carrier such as a compact disc (CD). 
       FIG. 1  shows schematically a system  1  arranged to perform the method in accordance with at least one embodiment of the invention. The system  1  includes a computer terminal CT which includes a central processing unit (CPU)  8 , memory  10 , a data storage device such as a hard disc drive  12  and I/O devices  6  which facilitate interconnection of the computer CT with an optional image capture device such as a camera  13  arranged to record image data in accordance with the present invention. Alternatively, the CT may be arranged to receive image data from a remote image data source such as an image database. 
     The I/O devices  6  further facilitate interconnection of a display element  32  of a screen  28  via a screen I/O device  30 . Operating system programs  14  are stored on the hard disc drive  12  and control, in a known manner, low level operation of the computer terminal CT. Program files and data  20  are also stored on the hard disc drive  12 , and control, in a known manner, outputs to an operator via associated devices and output data stored on the hard disc drive  12 . The associated devices include the display  32  as an element of the screen  28 , a pointing device (not shown) and keyboard (not shown), which receive input from, and output information to, the operator via further I/O devices (not shown). Included in the program files  20  stored on the hard drive  12  is a database  22  for storing image data and data related to the image data, including data related to the characteristics described further below, and a database  24  for storing data related to the template data, including the template data. 
     Method of Identifying a Target Object in an Image 
     An overview of methods according to embodiments of the invention will first be given, with reference to  FIG. 2  which is a flow diagram indicating steps of the method according to an embodiment of the invention. This will be followed by a description of steps of the embodiment of the method in greater detail 
     With reference to  FIG. 2 , template data is stored, in step S 1 , in the template data store  24 . The template data represents a template orientation field indicative of an orientation of each of a plurality of features of a template object. Further details of the template data will be described later. 
     Next, image data is received, in step S 2 . The image data may be recorded by the camera  13 , or may have been received from a remote image data source. The image data represents a digital image which includes a plurality of image features. The image data may represent a colored image or a grayscale image. 
     Each of the image features represents, in the image, a boundary which separates a region of higher light intensity from a region of lower light intensity. Each boundary corresponds with an edge or, in some embodiments, a line in the image. For the example where the image includes a human face, a boundary may define an edge which separates the face from an image background. In embodiments of the invention to be described, the boundary may also separate two regions from each other, these two regions each having a similar light intensity, with the boundary being a line of different intensity from these two regions. For example, the boundary may define a structural line of a human face. 
     Template confidence data is received, in step S 3 , which indicates a likelihood that at least one part of the template represents at least part of the target object. In parts of the template where correspondence with the template orientation field is not highly indicative of a target object, the template confidence data is relatively low. In parts of the template where correspondence with the template orientation field is highly indicative of a target object, the template confidence data is relatively high. 
     In step S 4 , the image data is processed to generate an image orientation field which indicates an orientation of each of the plurality of image features. 
     Next, the image data is processed, in step S 5 , to generate image confidence data which is based on at least one characteristic for use in identifying the target object in a given image. Further details of the characteristic, or characteristics, involved will be explained later. 
     In step S 6 , the image orientation field is processed using the template orientation field, the image confidence data and the template confidence data to generate, in step S 7 , a match metric which is indicative of an extent of matching between at least part of the template orientation field and at least part of the modified image orientation field. 
     In step S 8 , the match metric is used to determine whether or not the target object has been identified in the image. 
     At least one of the image data, template data, image confidence data and template confidence data is arranged according to a matrix format. 
     In the description below, a divisive normalization function is used. Divisive normalization is a refinement of local contrast normalization. Rather than normalizing image pixels by local image contrast or brightness over a neighborhood of pixels, image gradient values are normalized by the sum of their own squared values on a pixel-by-pixel basis. 
     Template Data 
     The template object, which is represented by the template orientation field of the template data, corresponds with the target object to be identified in the image. In the embodiments to be described, the target object is a human face but it should be appreciated that other target objects may be desired, such as an animal or a vehicle, for example a car. The template object has a plurality of features having similar properties to the image features. The template orientation field may comprise a field of orientation vectors, arranged in this embodiment in a matrix format, which may have a rectangular grid form. 
       FIG. 3  shows schematically a method of generating the template orientation field according to an embodiment of the present invention. Training image data representing a training image  40  is input data for use in generating the template orientation field. The template data has similar properties to the image data. The training image data is convolved, using a suitable convolution function  41  for example, a convolution function C k,l  calculated in accordance with equation 1: 
     
       
         
           
             
               
                 
                   
                     C 
                     
                       k 
                       , 
                       l 
                     
                   
                   = 
                   
                     
                       ∑ 
                       m 
                       
                           
                       
                     
                     ⁢ 
                     
                       
                         ∑ 
                         n 
                         
                             
                         
                       
                       ⁢ 
                       
                         
                           A 
                           
                             m 
                             , 
                             n 
                           
                         
                         · 
                         
                           B 
                           
                             
                               k 
                               + 
                               m 
                             
                             , 
                             
                               l 
                               + 
                               n 
                             
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   1 
                   ) 
                 
               
             
           
         
       
     
     where A m,n  and B k,l  are exemplary masks for convolving, and the convolution produces results for all values of k and l. 
     In the present embodiment, each of at least one x axis gradient mask  42  and at least one y axis gradient mask  44  are convolved with the training image data. Such a gradient mask may alternatively be referred to as an image boundary filter. The x axis gradient mask(s)  42  and the y axis gradient mask(s)  44  may be applied either in parallel or sequentially to the training image data. The training image  40  is, in this embodiment, a mean image of a plurality of human face images. In this way, the template data, and consequently the template object, corresponds with the mean human face image. 
     Data of the at least one x axis gradient mask  42  and the at least one y axis gradient mask  44  is arranged according to a matrix format. The gradient mask(s)  42 ,  44  correspond with different possible boundary edges which may be identified in the image, in the x axis or y axis direction, appropriately. 
     Where a plurality of different x axis gradient masks  42  are applied to the training image data, each x gradient mask  44  may correspond with a different pattern of higher and lower light intensity regions which are separated by a boundary running at least partly in the x axis direction. 
     Similarly, where a plurality of different y axis gradient masks  44  are applied to the training image data, each y gradient mask  44  may correspond with a different pattern of higher and lower light intensity regions, separated by a boundary running at least partly in the y axis direction. 
     Application of the x axis and y axis gradient masks  42 ,  44  yields gradient direction vectors for x axis and y axis features, respectively. These gradient direction vectors are converted into orientation vectors by wrapping their angles to the range from −π/2 to π/2. Alternatively, a double angle representation may be used to increase the selectivity in generating the orientation vectors. 
     The output of each of these two convolutions may comprise a plurality of orientation vectors corresponding with a plurality of features of the training image along the x axis and the y axis, accordingly, which are similar to the image features. These convolution outputs are each squared, using a squaring function  46 , and then summed together, using a summation function  48 , with a tuneable constant parameter γ, the value of which is determined according to an amount of image noise identified in the image data. The parameter may preferably be set at a value of less than 25%, for example 10% of the maximum gradient of the image data. 
     A square root function  49  is applied to the output of the summation function  48 , and the result of the summation function  48  is used to divisively normalize, using a divisive normalization function  50 , the output data of each of the convolution functions  41 , to produce an x axis template orientation field component t x   m,n  and a y axis template orientation field component t y   m,n . The length of each vector, which may otherwise be referred to as the gradient intensity, in the appropriate template orientation field component is thus normalized by the sum of itself and the parameter γ. The two template orientation field components together form a template orientation field t m,n  where m and n are template coordinates referring to values of a vector matrix of the template data. These coordinates may be defined with the origin at the center of the template orientation field. 
       FIG. 4  shows schematically an alternative method of generating the template orientation field using a steerable quadrature filter, according to a different embodiment of the present invention. Features of this alternative method are similar to the method described previously using  FIG. 3 , and such features will be referred to using the same reference numerals, incremented by 100; corresponding descriptions should be taken to apply also. 
     The training image data representing the training image  140  is convolved, using a convolution function  52 , separately with each of a pair of masks consisting of a symmetric mask and an antisymmetric mask. The symmetric mask responds most strongly to local image structure that is exactly symmetric about an axis that is aligned with the mask direction of the boundary, and has overlapping spatial frequency support, in magnitude, to that of the mask. The associated antisymmetric mask responds most strongly to local image structure that is exactly antisymmetric about an axis aligned with the mask direction of the boundary and has overlapping spatial frequency content, in magnitude, to that of the mask. The masks are used in pairs and an exemplary 0 radian and vertically oriented symmetric mask and antisymmetric mask is shown, respectively, in  FIGS. 5 a  and 5 b   . Further details may be found in “A Steerable Complex Wavelet Construction and Its Application to Image Denoising”, A. Bharath and J. Ng, IEEE Transactions on Image Processing. 14(7):948-959. July 2005, the contents of which are included herein by reference. 
     The output of each of these convolutions is wrapped by using an intermediate double angle representation. The output of each convolution is then squared, using the square function  63 , and summed together using the summation function  64 . The steps of generating the template orientation field described so far, using  FIG. 4 , are performed with respect to one of a total number K of direction channels. Each direction channel provides phase-invariant information concerning identification of boundaries between different light intensity regions of the training image, corresponding with the features of the training image. Each direction channel corresponds to a directional phase invariant unit. As illustrated in  FIG. 4 , a first directional channel  54  corresponds with 0 radians, a second directional channel  56  corresponds with (K−1)π/K radians and a further number of K−2 directional channels  58  may be utilized, indicated by dashed lines, which correspond with the formula kπ/K radians, where k refers to a certain one of K−2 further directional channels. 
     Each direction channel can provide phase-invariant information concerning the boundaries present in the training image  140  and the plurality of direction channels together encode the direction of local energy in the training image  140 . More channels provide a better ability to distinguish between shape boundaries of the training image  140  that have sharp curvatures. 
     The output from each direction channel is fed through a first  60  and a second  62  path. Following the first path  60 , the output of the direction channel is unchanged and is summed with the unchanged output of each of the other direction channels, using the summation function  65 . The output of this summation is fed through the square root function  66  and then added to the constant γ, which was described earlier in further detail, using a further summation function  67 . This summed result is used for divisive normalization upon the x and y axis processing channels as described below. 
     Following the second path  62 , the output of each direction channel is fed through the square-root function  68 , and then is split into an x axis channel and a y axis channel. The total number K of x axis channels are weighted with a gain function W k   C , as calculated according to equation 2, with k taking integer values from 1 up to K.
 
 W   k   C =cos(2π( k− 1)/ K )  (2)
 
     Similarly, the total number of K of y-channels are weighted with a gain function W k   S , as calculated according to equation 3, with k taking integer values from 1 up to K.
 
 W   k   S =sin(2π( k− 1)/ K )  (3)
 
     The weighted x channels are summed, using the summation function  69  and divisively normalized with the output of the first path  60  following summation with the constant γ using the divisive normalizing function  70 . In this way the length of each vector, otherwise referred to as the steered energy of the template data, is normalized by the sum of the energy of each basis filter at that position in the template and the tuneable parameter γ to yield the x axis template orientation field component t x   m,n . For the divisive normalization function, the output of each directional unit is modified by dividing it by the square root of the sum of the squared magnitude outputs at each location in the image. The purpose of this is that each feature measurement used for subsequent detection is normalized by other feature measures that share similar properties. 
     The weighted y channels are summed, using the summation function  69  and divisively normalized with the output of the first path  60  following summation with the constant γ using the divisive normalizing function  70 . Similarly, in this way the length of each vector is normalized by the sum of the energy of each basis filter at that position in the template and the tuneable parameter γ to yield the y axis template orientation field component t y   m,n . 
     The x axis template orientation field component t x   m,n  and the y axis template orientation field component t y   m,n  in combination form the template orientation field t m,n . 
     In accordance with this embodiment,  FIG. 5 c    shows an exemplary template orientation field applied over a training image of a mean human face.  FIG. 5 d    shows the same as  FIG. 5 c   , but without the training image.  FIG. 5 e    shows an exemplary template orientation field with a cosine weighting from the center of the field. 
     Template Confidence Data 
     The template orientation field will be affected by both the representation of the target object in the training image data and the background near the boundary of the target object in the training image. The template object corresponds to the target object. The effect of background clutter in the template orientation field may be controlled. 
     The template confidence data indicates parts of the template data which have a greater likelihood of representing the template object than other parts of the template data. The template confidence data may indicate a known parameter of the template object such as the size of the template object which may, for example, correspond to an expected extent of a human face (for example, a radial extent). In this way the template confidence data indicates a reliability of each vector in the template orientation field, for example due to background clutter, using a measure proportional to the distance between the position of the vector and the boundary of the template object. Such a measure may, alternatively, be taken between the vector position and any particular location of the template, such as the center point. Further known parameters relating to the template object may also be used to generate the template confidence data. 
     Template Phase Map 
     In accordance with an embodiment of the invention,  FIG. 6  shows schematically a method of generating template phase data, namely a template phase map t p   m,n , indicative of a phase of at least one of the plurality of features of the template data. The template phase map t p   m,n  includes a plurality of template phase values, each value corresponding with one of the plurality of features of the template data, each feature having certain template coordinate m,n values. The values of the template phase map t p   m,n  are arranged in this embodiment in a matrix format. 
     Generation of the template phase map t p   m,n  according to a steerable quadrature filter method will now be described with reference to  FIG. 6 . Some features and method steps described using  FIG. 6  are similar to those described previously with reference to  FIG. 4 ; corresponding reference numerals will be used, incremented by 200, and corresponding descriptions should be taken to apply here also. 
     Training image data, for example the training image  240 , is convolved using the convolution function  252 , separately for each of the pair of symmetric and antisymmetric masks, as described previously. Such convolutions are performed for each of the directional channels. 
     To generate the template phase map t p   m,n,  the x axis template orientation field component t x   m,n  and the y axis template orientation field component t y   m,n  which correspond with one feature of the training image  240  are used to determine template angle data, namely a template angle a t   m,n , of the one feature. A template angle a t   m,n  is similarly determined for at least one, preferably each, of the plurality of features to generate, for example, a template angle matrix of the template angle a t   m,n  values. 
     Using an interpolation weight function  72 , the magnitude of each template angle a t   m,n  value is used to determine a magnitude of weighting applied to the corresponding feature of the result of the convolution by the symmetric and anti-symmetric masks at the template coordinates m,n for each directional channel. Thus, the interpolation weight function  72  weights the value of each feature of the convolution outputs of each directional channel according to the magnitude of the corresponding template angle a t   m,n  For the directional channel with directional phase invariant unit of 0 radians, this results in a matrix of weight values, represented schematically in  FIG. 6  as a grid  74 . 
     A matrix of weight values is generated for each directional channel. For example, for the directional channel  256  having the directional phase invariant unit (K−1)pi/K radians, a matrix  75  of weight values is generated. A weight matrix is similarly generated for the further directional channels  258 , as indicated in  FIG. 6  using dashed lines. 
     For the directional channel having a directional phase invariant unit of 0 radians, the training image  240  convolved with the symmetric mask is multiplied element-wise by the matrix  74  of weight values using a multiplication function  76 . The multiplication function  76  is an element-wise multiplication of two data arrays. Similarly, for the other directional channels, including the directional channel with directional phase invariant unit (K−1)pi/K radians, the training image  240  convolved with the symmetric mask is multiplied  76  with the matrix of weight values generated using the angle a t   m,n . 
     For each directional channel, the training image  240  convolved with the anti-symmetric mask is multiplied  76  with the corresponding matrix of weight values generated using the appropriate interpolation weighting function. 
     For each directional channel, the output of each multiplication function  76  using the symmetric masks is summed using summation function  78  to provide a symmetric filter output. Similarly, the output of each multiplication function  76  corresponding with the antisymmetric masks is summed using summation function  80 , to provide an antisymmetric filter output. 
     The ratio of the antisymmetric filter output to the symmetric filter output is determined, and an arctangent function  82  is applied to the ratio to generate the template phase map t p   m,n . Thus, the template phase map t p   m,n  represents the symmetry of the responses for each feature of the template data in a direction perpendicular to that provided by the orientation fields. 
     Image Orientation Field 
     The methods of generating the template orientation field described previously using  FIG. 3  or  FIG. 4  may be used to generate the image orientation field from the image data. Instead, however, for generating the image orientation field, the input data should be the received image data instead of the training image data. Consequently, the output of either of the methods described using  FIG. 3  or  FIG. 4  is an x axis image orientation field component i x   k,l  and a y axis image orientation field component i y   k,l  where k and l are image coordinates referring to vector values of the matrix of the image data. Together, these two generated image orientation field components form an image orientation field i k,l . 
     Image Confidence Data 
     The generated image confidence data may be based on a plurality of different characteristics. Each characteristic is indicative of an increased likelihood that at least one part of a given image, in this example namely the image represented by the received image data, represents at least part of the target object, relative to other parts of the given image. 
     Generation of image confidence data according to a different characteristic will now be described for different embodiments. In further embodiments, image confidence data may alternatively be used which is generated according to more than one of the different characteristics described below. 
     i. Image Error Characteristic 
     In an embodiment of the present invention, the characteristic indicated by the image confidence data relates to an extent of image errors expected in the image data and the method includes using the image confidence data to generate the match metric according to the expected extent of image data errors. 
     The image data may include data errors including, for example, errors incurred during transmission of the image data to the CT of the system  1  and errors incurred when recording the image data due to, for example, use of a poor quality camera or dust particles lying on a lens of the camera  13  which thus prevents recording of a true image. 
     In an embodiment of the invention, error characteristic data indicating an extent of expected image errors is received by the system  1 . The error characteristic data may include data of the quality of the camera and/or statistical data of a proportion of image data which is successfully received when transmitted over a given transmission means, such as a computer network. Further, image error corrections algorithms or image denoising algorithms may be used to generate the image confidence data. 
     By using the error characteristic data to generate image confidence data, this image confidence data may be used to successfully identify the target object from the image data where identification of the target object from the image orientation field without using image confidence data would have been unsuccessful. 
     ii. Image Occlusion Characteristic 
     In an alternative embodiment of the present invention, the characteristic indicated by the image confidence data relates to a possible occlusion of part of the target object in the image and the method includes using the image confidence data to generate the match metric according to the possible occlusion. 
     Where the image includes an image of the target object, it is possible that part of the target object may be occluded by other objects in the image, such that image data only represents part of the target object. 
     In one embodiment of the invention, image occlusion characteristic data is received by the apparatus  1 . The image occlusion characteristic data may represent a plurality of possible forms of an occlusion of the target object in an image, for example a shape occluding horizontally and/or vertically a middle part of the target object or a shape occluding horizontally and/or vertically a top, bottom and/or side part of the target object in the image. Further, if details of the type of objects present in the image scene recorded in the image are known, data may be available of shapes of objects commonly found in such a scene which may occlude the target object. 
     Additionally, the image occlusion characteristic data may include data of a percentage of an area of the object in the image which may be occluded whilst still allowing the target object to be successfully identified in the image using the template data. 
     iii. Object Motion Characteristic 
     In a further alternative embodiment of the present invention, the image data is video data and the characteristic relates to a possible movement of the target object. In one embodiment, the method may include identifying a movement of the target object in the image using, for example, an image background subtraction algorithm or using data relating to a learned image background. 
     Movement of the target represented by the video image data may cause the shape of the target object represented by the video image data to change. The identified movement of the target object is used to determine a modified shape of the target object which is modified from a shape of the target object represented by the template data. 
     Without using the image confidence data based on the object motion characteristic, such movement, which consequently changes the shape of the target object to a different shape from that of the template object, would prevent successful identification of the target object in the video image data. Use of the image confidence data based on the object motion characteristic therefore allows the target object to be successfully identified in video image data. 
     iv. Object Color Characteristic 
     In another alternative embodiment of the present invention, the image data represents the image in color, such that the image data includes image color data, and the characteristic relates to at least one color indicative of the target object. In this example the characteristic relates to a color indicative of human skin. 
     In some embodiments, object color characteristic data indicating at least one color of human skin is received and is applied to the image data to generate the image confidence data. Parts of the image data which indicate parts of the image having a human skin color are thus identified. 
     Processing the image confidence data based on the color characteristic with the image orientation field allows parts of the image data to be identified which have a greater likelihood to represent the target object than other parts of the image data. In this way, parts of the image data are assigned a higher certainty of may be representative of the target object than other parts of the image data. 
     Image Phase Map 
     The method of generating the template phase map t p   m,n  described previously using  FIG. 6  may be used to generate image phase data, namely an image phase map i p   k,l  using the image data. The image phase data is indicative of a phase of at least one of the plurality of image features. For generating the image phase map i p   m,n , the received image data is used instead of the training image data. Further, instead of inputting the template orientation field components t x   m,n , t y   m,n  for the x and y axes, the image orientation field components i x   k,l , i y   k,l  for the x and y axes are inputted. Further, the template angles a t   m,n  are not determined; image angle data, namely image angles a i   k,l  corresponding with at least one of the plurality of image features is determined instead. 
     Generation of Match Metric 
     As described previously, a match metric is generated by processing the image orientation field using the template orientation field, the image confidence data and the template confidence data. 
     Matching between template data and image data may be generalized to matching between template and image vector fields, which are normalized by combinations of non-linear functions of the outputs of linear spatial operators at each pixel. 
     The matching may be performed using banks of cross-correlators that operate in parallel upon the normalized orientation field components. This has significance for speed and ease of implementation on a variety of hardware and software platforms. The outputs of such correlators are generally mapped through non-linear functions, then weighted and combined to create accumulator spaces. The accumulator spaces are similar in spirit to those of Hough Transform techniques, but are more selective to the specific shapes of the training. Detection therefore relies on thresholding or detecting local maxima in the accumulator spaces. 
     In the embodiments to be described, at least one of the image confidence data and the template confidence data described previously is used. The image confidence data CI m,n  includes x axis image confidence data CI x   k,l  and y axis image confidence data CI y   m,n . The template confidence data CT m,n  includes x axis template confidence data CT x   m,n  and y axis template confidence data CT y   m,n . The x axis and y axis image confidence data and the x and y axis template confidence data is arranged according to a matrix format, where, in this example, each value of the confidence data matrix represents a likelihood that a part of the image represents the target object or a likelihood that a part of the template represents the template object, appropriately. Each matrix element is a vector. 
       FIG. 7  shows schematically a method of generating a cross correlation match metric m c   k,l  at a position k,l in the image data, according to an embodiment of the invention. 
     The match metric m c   k,l  is based on the cross correlation calculation according to equation 4, which doesn&#39;t yet incorporate the image and template confidence data. 
     
       
         
           
             
               
                 
                   
                     m 
                     
                       k 
                       , 
                       l 
                     
                     c 
                   
                   = 
                   
                     
                       ∑ 
                       m 
                       
                           
                       
                     
                     ⁢ 
                     
                       
                         ∑ 
                         n 
                         
                             
                         
                       
                       ⁢ 
                       
                         〈 
                         
                           
                             t 
                             
                               m 
                               , 
                               n 
                             
                           
                           , 
                           
                             i 
                             
                               
                                 k 
                                 + 
                                 m 
                               
                               , 
                               
                                 l 
                                 + 
                                 n 
                               
                             
                           
                         
                         〉 
                       
                     
                   
                 
               
               
                 
                   ( 
                   4 
                   ) 
                 
               
             
           
         
       
     
     The computation of the match metric m c   k,l  over the image, according to equation 4, can be broken into the sum of two convolution operations: CCX is the convolution of the 2D-flipped x axis template orientation field component (t x   m,n ) f  with the x axis image orientation field component i x   m,n  and CCY is the convolution of the 2D-flipped y axis template field component (t u   m,n ) f  with the y axis image field component i y   m,n . 
     The operators of equation 4, namely the inner product and the two norm of difference can be generalized to a kernel K(a,b), as defined in equation 5. 
     
       
         
           
             
               
                 
                   
                     m 
                     
                       k 
                       , 
                       l 
                     
                   
                   = 
                   
                     
                       ∑ 
                       m 
                       
                           
                       
                     
                     ⁢ 
                     
                       
                         ∑ 
                         n 
                         
                             
                         
                       
                       ⁢ 
                       
                         K 
                         ⁡ 
                         
                           ( 
                           
                             
                               t 
                               
                                 m 
                                 , 
                                 n 
                               
                             
                             , 
                             
                               i 
                               
                                 
                                   k 
                                   + 
                                   m 
                                 
                                 , 
                                 
                                   l 
                                   + 
                                   n 
                                 
                               
                             
                           
                           ) 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   5 
                   ) 
                 
               
             
           
         
       
     
     Image confidence data CI m,n  and template confidence data CT m,n  which may otherwise be referred to as an image confidence map and a template confidence map, are introduced into equation 5 to improve the match metric, as defined in equation 6. 
     
       
         
           
             
               
                 
                   
                     m 
                     
                       k 
                       , 
                       l 
                     
                     cf 
                   
                   = 
                   
                     
                       ∑ 
                       m 
                       
                           
                       
                     
                     ⁢ 
                     
                       
                         ∑ 
                         n 
                         
                             
                         
                       
                       ⁢ 
                       
                         
                           CT 
                           
                             m 
                             , 
                             n 
                           
                         
                         · 
                         
                           CI 
                           
                             k 
                             , 
                             l 
                           
                         
                         · 
                         
                           K 
                           ⁡ 
                           
                             ( 
                             
                               
                                 t 
                                 
                                   m 
                                   , 
                                   n 
                                 
                               
                               , 
                               
                                 i 
                                 
                                   
                                     k 
                                     + 
                                     m 
                                   
                                   , 
                                   
                                     l 
                                     + 
                                     n 
                                   
                                 
                               
                             
                             ) 
                           
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   6 
                   ) 
                 
               
             
           
         
       
     
     Thus, CCX becomes a convolution of (t x   m,n ·CT x   m,n ) f  and (i x   k,l ·CI x   k,l ), and CCY becomes a convolution of (t y   m,n ·CT y   m,n ) f  and (i y   k,l ·CI y   k,l ). 
     Calculation of the product of the image confidence data CI k,l , either for the x axis or they axis, and the image orientation field, either for the x axis or they axis, respectively, involves applying the image confidence data to the image orientation field to generate the element-wise product. The element-wise product may otherwise be referred to as a modified image orientation field MI k,l  (including MI x   k,l  for the x axis and MI y   k,l  for the y axis) which indicates both an orientation of each of the plurality of image features and a likelihood that at least one part of the image orientation field represents at least part of the target object. 
     Calculation of the element-wise product of the template confidence data CT m,n  either for the x axis or the y axis, and the template orientation field, either for the x axis or the y axis, respectively, involves applying the template confidence data to the template orientation field to generate the element-wise product. The element-wise product may otherwise be referred to as a modified template orientation field MT m,n  (MT x   m,n  for the x axis and MT y   m,n  for the y axis) which indicates both an orientation of each of the plurality of features of the template object and a likelihood that at least one part of the template orientation field represents at least part of the target object. 
     The 2D flipping converts the convolution operation into correlation that is required for template matching. The operation may comprise a flip along the x-axis followed by a flip along the y-axis or vice-versa. 
     The advantage of breaking down the computation of the match metric into convolution operations is that fast optimized convolution implementations already exist in both software libraries and hardware and only minimal change to these implementations is required. 
       FIG. 8  shows schematically a method of generating a Euclidean distance based match metric m d   k,l  at a position in the image data, as an alternative to generating the cross correlation match metric described using  FIG. 7 , according to a different embodiment of the present application. 
     The cross-correlation match metric described using  FIG. 7  can give high values to undesired image orientation field neighborhoods containing relatively longer vectors than the template for unnormalized orientation fields or vectors whose lengths approach unity for normalized orientation fields. 
     The Euclidean distance based match metric m d   k,l  is more selective to matching of the template data by using a negated Euclidean Distance, which only gives a zero value match metric when the template and the image orientation field neighborhoods are exactly the same. Otherwise the Euclidean distance based match metric m d   k,l  produces negative values. The Euclidean distance based match metric m d   k,l , without incorporation of the image and template confidence data, is defined according to equation 7. 
                     m     k   ,   l     d     =       ∑   m             ⁢       ∑   n             ⁢     -              t     m   ,   n       -     i       k   -   m     ,     l   -   n                2                   (   7   )               ∥ t   m,n   −i   k+m,l−n μ 2 =( t   x   m,n   −i   x   k+m,l+n +) 2 +( t   y   m,n   −i   y   k+m,l+n ) 2   (8)
 
     The computation of the match metric m d   k,l  over the whole image involves a non-linear inner kernel, defined in equation 8, that can be broken down into the sum of two series of linear convolutions, m d =CDX+CDY, where CDX and CDY can be obtained by the addition of two convolution operations each to CCX and CCY. 
     CDX is defined according to equation 9 and CDY is defined according to equation 10.
 
 CDX= 2 CCX−CCXT−CCXI   (9)
 
 CDY= 2 CCY−CCYT−CCYI   (10)
 
     With reference to equations 5 and 6, the Euclidean distance based match metric can be generalized to a kernel K(a,b). Image confidence data CI m,n  and template confidence data CT m,n , are introduced into equation 5 to improve the match metric such that: 
     CCX becomes a convolution of (t x   m,n ·CT x   m,n ) f  and (i x   k,l ·CI x   k,l ), and CCY becomes a convolution of (t y   m,n ·CT y   m,n ) f  and (i y   k,l ·CI y   k,l ). 
     CCXT becomes a convolution of the x axis image confidence data CI x   k,l  and the 2D flipped element-wise product of the x axis template confidence data CT x   m,n  and the element-wise squared x axis template orientation field (t x   m,n ) 2 . CCXI becomes a convolution of the 2D flipped x axis template confidence data (CT x   m,n ) f  and the element-wise product of the x axis image confidence data CI x   k,l  and the element-wise squared x axis image orientation field (i x   k,l ) 2 . Namely, CCXT is a convolution of ((t x   m,n ) 2 ·CT x   m,n ) f  and CI x   k,l  and CCXI is a convolution of ((i i x   k,l ) 2 ·CI x   k,l ) and (CT x   m,n ) f . 
     CCYT becomes a convolution of the y axis image confidence data CI y   k,l  and the 2D flipped element-wise product of the y axis template confidence data CT y   m,n  and the element-wise squared y axis template orientation field (t y   m,n . CCYI becomes a convolution of the 2D flipped y axis template confidence data (CT y   m,n ) f  and the element-wise product of the y axis image image confidence data CI y   k,l  and the element-wise squared y axis image orientation field (i y   k,l ) 2 . Namely, CCYT is a convolution of ((t y   m,n ) 2 ·CT y   m,n ) f  and CI y   k,l , and CCYI is a convolution of ((i y   k,l ) 2 ·CI y   k,l ) and (CT y   m,n ) f . 
     When generating the Euclidean distance based match metric without image confidence data, the x axis or y axis image confidence data CI x   k,l , CI y   k,l  is set to a default value of 1. The described convolution operations involving image confidence data use values of 0 outside of the bounds (in other words valid grid values) of the input masks. Since summation functions described above can use coordinates k+m and l+n that are outside the bounds of the input masks, values of 0 are used for these coordinates, according to a boundary handling technique. 
     Similarly, generating the Euclidean distance based match metric without template confidence data, the x axis or y axis template confidence data CT x   m,n , CT y   m,n  is set to a default value of 1. 
     In accordance with a further embodiment of the present application, the Euclidean distance match metric m d   k,l  may be modified to obtain an alternative match metric m d   k,l , by using the template phase map t p   m,n  and the image phase map i p   k,l  generated as described above.
 
 abs ( t   p   m,n   −i   p   k+m,l+n )· abs (cos( a   t   m,n   −a   i   k+m,l+n ))= D   k,l   m,n   (11)
 
     Using equation 11, the absolute value of the phase difference between the template phase map t p   m,n  and a portion of the image phase map i p   k+m,+l+n , centered on a location with coordinates k,l, is multiplied by the absolute value of the cosine of the difference between the template angle a t   m,n  of each feature of the template orientation field and the image angle a i   k+m,l+n  of each feature of a portion of the image orientation field, to determine deformation data D k,l   m,n . If an angle of a feature of the portion of the image orientation field is the same as the corresponding angle of a feature of the template data, the cosine of the difference of the orientation angles equals 1, and thus this uses the entire value of the displacement provided by the difference of the template and image phase at the location of the feature. If, however, a template and an image angle are perpendicular to each other, the deformation cannot be resolved and there is no contribution of the displacement at the location of this feature to the match metric. 
     The deformation data D k,l   m,n  is in this embodiment a matrix including a plurality of scalar deformation values, each value corresponding with the matching of one of the features of the template data at coordinate m,n to a feature from a portion of the image data centered at coordinate k,l. Each deformation value corresponds with a phase difference between the template data and a portion of the image data. The deformation data is indicative of a deformation of the template with respect to the image data. Larger deformation values may indicate a greater deformation to fit the template data to the portion of the image data, and vice versa. Such deformation values may be considered to represent a mismatch between the template data and the portion of the image data. The magnitude of the value indicates the extent of the mismatch. 
     The deformation data D k,l   m,n  described so far relates to matching template data to image data of a still image. The deformation data may also be applied to video image data. Accordingly, deformation data D k,l  may be determined for a series of image frames of video image data, and a mismatch between the image data from consecutive frames may be used to indicate motion of a feature at coordinate k,l in the video image data. 
     In this embodiment, and using a similar method as that described using  FIG. 8 , a modified Euclidean distance match metric m e   k,l  is generated using the deformation data D k,l   m,n . Accordingly, the non-linear inner kernel described above with reference to  FIG. 8  is modified to equation 12: 
     
       
         
           
             
               
                 
                   
                     m 
                     
                       k 
                       , 
                       l 
                     
                     e 
                   
                   = 
                   
                     
                       m 
                       
                         k 
                         , 
                         l 
                       
                       d 
                     
                     - 
                     
                       
                         ∑ 
                         m 
                         
                             
                         
                       
                       ⁢ 
                       
                         
                           ∑ 
                           n 
                           
                               
                           
                         
                         ⁢ 
                         
                           
                             
                               ( 
                               
                                 D 
                                 
                                   m 
                                   , 
                                   n 
                                 
                                 
                                   k 
                                   , 
                                   l 
                                 
                               
                               ) 
                             
                             2 
                           
                           . 
                         
                       
                     
                   
                 
               
               
                 
                   ( 
                   12 
                   ) 
                 
               
             
           
         
       
     
     In the non-linear inner kernel of equation 12, the sum of the square of each scalar value of the deformation data D k,l   m,n  matrix is subtracted from the distance match metric m d   k,l  to determine the modified Euclidean distance match metric m e   k,l . Thus, the calculated match metric m e   k,l  advantageously takes into account any deformation between the template data and the image data, to allow a target object to be identified in the image data more accurately. The deformation data D k,l   m,n  therefore provides for deformable or warping matching of a template with image data, rather than being limited to rigid matching. In particular, use of the deformation data D k,l   m,n  provides for improved identification of a target object when phase characteristics of the target object are known. For example, if a target object is sought in image data representing a line drawing, the known phase characteristics can allow the system to be made more responsive to line drawings than to solid objects. 
     Identification of Target Object 
     One of the match metrics described above may be computed for each vector of the matrix of the image data, as determined by the matrix coordinates, or for each vector value of a region of interest (ROI) which is determined in the image data by a user of by a computer vision algorithm. 
     In order to determine whether the target object has been identified in the image data, each value of the calculated match metric is thresholded by a threshold value that can be set by a user or by a different object detector. For example, if one of the calculated match metrics has a value greater than the threshold, then it is determined that the target object has been identified in the image, with the center of the target object being represented by that match metric value. If, however, the match metric value is lower than the threshold, then that match metric does not identify the target object. 
     Use of the image and/or template confidence data influences the values of the calculated match metrics, such that, in this example, the value of the match metric is increased where the corresponding part of the image has a relatively high likelihood of including the target object, as indicated by the confidence data. Further, the value of the match metric is decreased for parts of the image having a relatively low likelihood of including the target object. In this way the confidence data improves identification of the target object in the image. 
     The above embodiments are to be understood as illustrative examples of the invention. Further embodiments of the invention are envisaged. For example, further characteristics of the target object may be used to generate the image confidence data. Also, further known parameters of the target object may be used to generate template confidence data. 
     In further embodiments of the present invention, one of the image confidence data and the template confidence data may not be used to generate the match metric. For example, only template confidence data may be used, or only image confidence data may be used. 
     The determination of an orientation field using a training image that may be a mean human face image has been described above. In alternative embodiments, an orientation field may be determined for each of a plurality of different training images representing, for example, different human faces, and a mean orientation field may be generated from the plurality of determined orientation fields. 
     The template and/or image phase map may be used to provide certainty data based upon detecting patterns of deformation. For example, higher deformation values localized to a region of image data compared with other regions of the image data during the matching of a template to a portion of the image data may be used to indicate occlusion of a target object in the image data. 
     Examples of image processing methods have been described, including methods for generating image orientation fields and template orientation fields methods for generating a match metric. Further image processing methods, known in the art, may be applied in the method of the present invention, either additionally, or alternatively, to those described. Further, the image data of any of the embodiments described may include video image data. In such an embodiment, the method of the present application may, for example, be utilized to provide a focus of attention operator. 
     It is to be understood that any feature described in relation to any one embodiment may be used alone, or in combination with other features described, and may also be used in combination with one or more features of any other of the embodiments, or any combination of any other of the embodiments. Furthermore, equivalents and modifications not described above may also be employed without departing from the scope of the invention, which is defined in the accompanying claims.