VECTOR CORRELATION SYSTEM FOR AUTOMATICALLY LOCATING PATTERNS IN AN IMAGE

Abstract: The present invention relates to a combined approach of image and template correlation, and vector correlation wherein edge detection and pattern searching are joined in a single operation to provide great flexibility without requiring extensive computational facilities. A template is devised from a sparse set of coordinate points that model only the important edges of an object to be located within an image. Different templates are dynamically reconstructed as an estimation of the object location within the image becomes more precise.

Description: VECTOR CORRELATION SYSTEM FOR AUTOMATICALLY LOCATING PATTERNS IN AN IMAGE TECHNICAL FIELD The present invention relates to a system for digital processing of images and deals more particularly with a system for automatically locating patterns that are characterized by edges. A specially constructed template is moved about various points in the image to locate a pattern. As the template scans the image, it is altered in a manner that is dependent on how well it fits the image pattern at the various points. BACKGROUND OF THE INVENTION Introduction In electronic digital image processing hardware, images are stored in discrete memory devices. The image is often segmented into an array of values, where each memory location corresponds to a particular spatial coordinate point and the value at that memory location, called a picture element (pixel), corresponds to the brightness ofthe image at that coordinate point. Figure 1 A shows an example of an object in an image where the brightness is given by numbers at each pixel coordinate point. Image and Template Correlation One common technique to automatically locate objects in an image of a machine vision system is to use a correlation or convolution. There are several types of image correlation methods including convolution, normalized correlation, the least mean squares error, and the least mean absolute error. A definition of a correlation method requires the determination and use of a template or kernel which is a separate small image with the same shape as the object to be located. Figure IB shows a template shaped like the object shown in the image of Figure 1 A Like the object, the template may be represented by spatial coordinate points with a brightness value for each point The template is selectively displaced and moved from location to location around a region of interest in the image At each new template location in the image, the sum of products is computed for the value of each template pixel with the corresponding value of each image pixel at a common spatial coordinate point Figure IC shows one location of the template in Figure IB displaced on the image In this case there is no overlap at that displacement, and the sum of products is zero The computational output of the correlation or convolution is at a maximum at the location where the shape of the template pattern most closely matches the shape ol a pattern in the image Figure ID shows the correlation for all possible displacements of the template across the image The numeric values are rather large, so Figure ID shows only an approximate and relative indication of the correlation by the intensity of shading The formula for a discrete two dimensional convolution is given by corr(x, y) = ∑∑I(x - u, y - v)K(u,v) (1) where / is an image, K is a kernel, and x and y are image coordinates defining a spatial coordinate point The summation over u and v range over the template In practice, the template is smaller than the image containing the object whose location is being determined Normalized correlation is a well known method similar to correlation, except that the value of each element of the template is multiplied by a constant scale factor, and a constant offset is added At each template displacement the scale factor and offset are independently adjusted to give a minimum error in the correlation of the template at each image location The normalized correlation method in template matching is covered in detail in an article entitled "Alignment and Gauging Using Normalized Correlation Search" by William Silver, in VISION '87 Conference Proceedings, pp. 5-33 - 5-55, which is incoφorated herein by reference -2- SUBSTmJTtSHET (RULE26) In the least mean squared error method each template point is subtracted from the corresponding image point; each difference is squared; and the average of all differences are computed. The formula for the least squared error is E 2 (x, y) = —∑∑(I(x - u, y - v)K(u, v) f (2) ^ ' u v where N is the number of pixels in the kernel. The computational output of the least mean squared error is at a minimum where the template pattern matches a pattern in the image. In the least mean absolute error method each template point is subtracted from the corresponding image point; the absolute value of each difference is computed; and the average of all differences are computed. The formula for the least absolute error is E(x, y) = —∑∑ abs\ I(x - u, y - v)K(u, v)\ (3) N „ v The computation output of the least mean absolute error is also at a minimum where the patterns match. The techniques described above are substantially the same in the sense that a template, itself is a gray level image, is displaced from location to location about a corresponding gray level image containing an object whose coordinate location is within the image is of interest. At each location a function is applied to neighboring image pixel values and the corresponding template values at common coordinate points. The result is another image where each pixel at a coordinate point is a single number that represents how well the template fits the object in the image at that point. SUBSΠΠJIE SHEET (RUIE 26) Binary Vector Correlation Vector correlation or convolution provides an alternative approach to the correlation methods discussed above. In vector correlation the image and selected template are composed of pixels which are vectors. The theory behind binary vector correlation is covered in a paper entitled "Vector Moφhology and Iconic Neural Networks" by S. S. Wilson in IEEE Transactions on Systems, Man, and Cybernetics, Nov./Dec, 1989, vol. 19, no. 6, pp. 1636-1644, which is incoφorated by reference. A similar technique was further discussed in the paper entitled "Teaching network connections for real-time object recognition", by S. S. Wilson in Neural and Intelligent Systems Integration, pp. 135-160, Wiley-Interscience, 1991. Briefly, the most common form of binary vector correlation consists of transforming a gray level image to several binary images, where the composite of binary images represents a vector in the sense that each pixel in the vector image has several components - each from one ofthe binary images. Next, a vector template is defined for the puφose of recognizing a pattern. The vector template also consists ofthe same number of components as the vector image. The position of the vector template is displaced and moved from location to location around the region of interest in the image. At each location, the sum of inner products (or dot product) is computed for a vector pixel in the template and a vector pixel in the image for a corresponding coordinate point. In mathematical terms, the formula for a discrete two dimensional vector convolution is given by corr{x,y) = Σ Σ/(x -u,y -v)'K(u,v) (4) where / is a vector image and K is a vector kernel, and x andy are image coordinates. The summation over u and v range over the template. A detailed description of one technique of vector correlation follows. Starting with an input image, the first step is to form another image called the horizontal finite difference by subtracting from the value of a pixel ofthe input image, the value of a neighboring pixel displaced a small distance to the right. The resulting image will contain large positive or negative values around those coordinate points where there is a significant vertical edge. A positive value in the horizontal finite difference image is called an east edge and represents an edge that decreases in intensity from left to right. A negative value in the horizontal finite difference image is called a west edge and represents an edge that increases in intensity from left to right. The second step is to form another image called the vertical finite difference by subtracting from the value of a pixel ofthe input image, the value of a neighboring pixel displaced a small distance upward. The resulting image will contain large positive or negative values around those coordinate points where there is a significant hoπzontal edge. A positive value in the vertical finite difference image is called an north edge and represents an edge that decreases in intensity in the upward direction. A negative value in the vertical finite difference image is called a south edge and represents an edge that increases in intensity in the upward direction. The third step in binary vector correlation is to form a binary vector image where each pixel contains a vector comprised of four binary numbers labeled N, S, E, and W which correspond to the four compass directions. The N binary number is computed by comparing the vertical finite difference to a small positive number called a threshold, and associating a binary 1 for those values that exceed the threshold, and a binary zero otherwise. The S binary component is computed by comparing the vertical finite difference to the negative of the threshold, and associating a binary 1 for those values that are smaller than the threshold, and a binary zero otherwise. The E and W binary components are computed in a similar manner using the horizontal finite difference image. The fourth and final step is to displace the position ofthe vector template from location to location within a region of interest in the original image. At each new location in the image, the sum of inner products is computed for the value of each vector pixel in the template with each corresponding vector pixel in the original image for a corresponding coordinate point. Figure 2A is an example of a vector image after edge detection using both horizontal finite difference and vertical finite difference. Although each coordinate point in the image should illustrate a vector it is easier to illustrate only the label ofthe non-zero component. A coordinate point having a blank pixel represents a vector where all elements are zero. Although in practice it is possible for two components to be non-zero such as N and W, none are shown by way of example in Figure 2A. Figure 2B is a corresponding vector template formed using both the horizontal finite difference image and the vertical finite difference image and a predetermined threshold. It is apparent that when the template in Figure 2B is moved from location to location about the image in Figure 2A, the correlation response as roughly indicated in Figure 2C will result. Benefits of Vector Correlation Vector correlation is very accurate because the correlation is with the edges of a pattern. Referring to Figure 2C a slight offset ofthe template from the actual location ofthe pattern in the image means that most of the edges of the template complete miss contact with the pattern and results in no correlation. However, as shown in Figure ID, there is a large area of partial contact ofthe image with the template if an ordinary correlation is used. Vector correlation is very capable of locating degraded patterns in an image as long as the edges ofthe pattern are not severely degraded. A degraded image consists of a large amount of clutter surrounding the pattern of interest, or missing pieces within the pattern. An ordinary correlation may fail to distinguish the pattern from the surrounding clutter. In an ordinary correlation a template image is used. Thus, template matching will fail to give accurate results if the visual nature ofthe object is substantially different from the object used as the template. Vector correlation is superior to ordinary correlation because only the important edge features of an object are used in identifying the object. Problems with Vector Correlation Vector correlation is computationally intensive because ofthe extra steps in forming and operating with vector images. First, there is an increased requirement for memory storage in order to store the finite differences and computed edges. Second, the templates used in characterizing patterns to be found are vectors and are more complex to define. Third, diagonal edges are not represented accurately. A diagonal in the north and east direction must be represented by a template that has both the north and east edges represented at the same point. A diagonal point in a template is more difficult to handle. Finally, the method is restricted to a high performance parallel processor. The use of a small finite difference coordinate displacement encompassing one or two units produces very narrow edges in the finite difference images. As the correlation template is moved over the vector image, narrow edges allow a strong localization ofthe correlation, and leads to high accuracy of the pattern matching ofthe template to the image. However, since the pattern location is unknown, the template must be moved over a large number of positions, in general, before the pattern can be found. This is referred to as a fine grained search. The unknown pattern in this case might be lost if it is slightly rotated so that the template does not fit anywhere. The finite difference can be made larger for simple images. For example, a finite difference coordinate displacement encompassing ten units would lead to edges that are ten pixels wide and allow rotated patterns to be found. Additionally, the pattern could be found by sampling the template over the image, not exhaustively, but in a coarse grid in steps encompassing up to ten units in both the horizontal and vertical directions. In this example, the search would be ten squared, or one hundred times faster. However the accuracy, once the pattern is found, would be very poor. A compromise would be to provide a coarse grained search to get a rough location of the pattern, and then a fine grained search to zero in on the pattern. The edge detection would have to be performed twice, once for the large finite differences, and once for the small finite differences. A large amount of memory storage and a high performance parallel processor are still required. SUMMARY OF THE INVENTION The invention teaches a system for automatically locating objects within images. The images are defined by a plurality of image pixels, each image pixel having a known intensity value and a known coordinate point. The invention uses a combination of edge detection and pattern searching that are combined into a single operation to provide great flexibility with limited computational complexity. First, a manual template is determined which corresponds to an estimation ofthe object. The manual template is translated into an abstract template which is comprised of a sparse set of vectors comprising a set of coordinate points and corresponding edge directions. Each coordinate point lies on an edge ofthe manual template and a corresponding edge direction passes through the coordinate point peφendicular to the edge at the coordinate point. Next, the abstract template is converted into a ranging template. The ranging template comprises pairs of coordinate points which are defined to be equally spaced from the coordinate point for each vector of the abstract template along the corresponding edge direction. A positive coordinate point corresponds to a positive value of a preselected displacement and a negative coordinate point corresponds to a negative value of the same displacement. The ranging template is displaced to each of a plurality of known coordinate point locations within the image. At each location the ranging template is correlated with the image. Different abstract and ranging templates are reconstructed dynamically and rotated as correlation improves and an estimation of the object's location within the image becomes more precise. The advantages of vector correlation are retained, but the computational burden is reduced since edge detection is eliminated and only a limited number of coordinate points are required. Less computational memory is required in part because edge detected images are not stored. BRIEF DESCRIPTION OF THE DRAWINGS The features and inventive aspects ofthe present invention will become more apparent upon reading the following detailed description, claims, and drawings, of which the following is a brief description: Figure 1 A is an example of a gray level image with an object. Figure IB is an example of a template to find the location ofthe object in the image of Figure IA. Figure IC shows one location ofthe template of Figure IB displaced on the image of Figure IA. Figure ID shows an approximate indication of a correlation between an object in an image and a template moved around the image illustrated by the intensity of shading. Figure 2A is an example of a binary vector image. Figure 2B is an example of a binary vector template. Figure 2C shows the resulting vector correlation between an object in a binary vector image and a binary vector template moved around the image. Fig 3A illustrates a manually determined template converted into a simplified vector form according to the present invention. Fig 3B illustrates a table for the abstract vector template of Figure 3 A. Figure 3C shows a ranging template derived from the abstract template of Fig 3B having a displacement of 6=3. Figure 3D shows the ranging template of Figure 3C fitting an object which is off-set and rotated within an image. Figure 4A is a horizontal profile ofthe correlation for the ranging template of Figure 3C. Figure 4B is a ranging template constructed with a displacement δ = 1. Figure 4C is a horizontal profile ofthe correlation for the ranging template of Fig 4B. Figure 5 is a flow diagram that shows an efficient method of searching for an object using the system ofthe present invention. DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS As illustrated in Figures 3A through 3D, the present invention relates to an automatic image processing system used for locating a coordinate point position of an object 20 within an image 22. The illustrated image 22 is two-dimensional with a plurality of image pixels, each image pixel having a known intensity value and a known coordinate point. The coordinate points are defined by a horizontal x-axis and a vertical y-axis. The goal of the system is to determine the coordinate position of object 20 within image 22. Initially, the system relies on the manual determination of a possible template 24, the boundary of which has well defined edges 26. As illustrated, template 24 is shaped and dimensioned to correspond as closely as possible to object 20. Once template 24 has been defined, it is translated to an abstract template 28 defined by a series of N vectors (u,, v,, θ^, (u 2 , v 2 , θ^ ... (u N , v N , θ^j which is easily stored in memory locations of a computer. As shown schematically in Figure 3 A and in table form in Figure 3B, each vector A tlirough I is given as a set of coordinate points u, and v, which are respectively the horizontal and vertical coordinates (u, vj of template edges 26. The coordinate points may be mapped to the coordinate system of image 20, as discussed further below. Associated with each coordinate point is an edge direction illustrated by a corresponding arrow θ, that is peφendicular to a corresponding edge 26 at the location of the coordinate point. The tail of each arrow lies inside the boundary of template 24 while the head of each arrow lies outside the template. To allow for equal accuracy in determining the location of object 20 along the x and y axis of image 22 there should be roughly an equal number of vectors N along substantially vertical and substantially horizontal extents of manual template 24. The same vectors may simultaneously have both a horizontal and a vertical component. As shown in Figure 3A, three vectors exist for each horizontal and vertical extent and include more than one edge. For example, three such edges comprise the rightmost vertical extent in Figure 3A. To minimize computational complexity, only a limited number of edge points need to be translated into vector (u„ v„ θ). However, at least one vector should preferably be used for each different edge of a manually determined template unless adjacent edges lack a sufficiently large angular difference between them. As shown in Figure 3 A, each of edges 26 include at least one vector comprising a portion of abstract template 28. Once template 24 is converted into the vectors of abstract template 28, a ranging template 30 is formed as shown in Figure 3C. Ranging template 30 is defined using a pair of coordinate points (up p vp) and (un, vn) for each vector (u r v„ θ,) of abstract template 28. Point (up,, vp) is constructed by a positive displacement δ along direction θ, and point (un,, vn) is constructed by a negative displacement δ along direction θ ; . The former coordinate points should reside outside the boundary defined by edges 26 of manually determined template 24 while the latter coordinate points should reside inside the boundary. Mathematically, (up p vp) = (u, + δcosθ,, v, + δsinθ,) and (un,, vn) - (u, -δcosθ,, v, - δsinθ,). Before ranging template 30 can be used, however, weights must be assigned to the coordinate points ofthe template. For example, in the illustrated embodiment, the weights for points (up, vp) having the positive displacement are +1, and the weights for (un„ vn) having the negative displacement are -1. A small open square represents a ranging template coordinate point with a negative weight and a small dark square represents a ranging coordinate template point with a positive weight. By having weights of +1 or -1 in combination with a very sparse set of coordinate points in ranging template 30, the formula for a correlation is very simple: corrix, y) = ∑I(x - up t , y - vp - ∑ I(χ - un, , y - vn, ) (5) where I is image 22, x and y are the coordinate points of the image, and u and v are the coordinate points of ranging template 30 as defined above. The notation in this formula is simplified by letting positive terms P, = I(x-up„ y-vp,) and negative terms N, = I(x-un„ y-vn,): corr(x, y) = ∑ P, - ∑ N, ( 6 ) Processing speed can be enhanced if displacement δ is large, but it should be no larger than about half the smallest dimension of an edge of template 24 having at least one vector. Otherwise, computational inaccuracies may result. As illustrated in Figure 3C, the coordinate points (un,,vn,) determined using vectors C and D of abstract template 28 are closely adjacent to one another. If the displacement δ were much greater, the coordinate points may or extend past one another resulting in undesirable uncertainty. For example, for abstract template 28, the shortest dimension is approximately 10 units in length. The displacement δ is set to 3 units, and the resulting ranging template 30 will allow a detection of object 20 pattern even if ranging template 30 is off the center of the object by up to 3 units. Thus, object 20 can be found by sparsely searching using a 6 x 6 grid. However the location of object 20 in image 22 cannot be found to an accuracy greater than ±3 pixels. Figure 3D shows a match between ranging template 30 and object 20 within image 22 even though the template is significantly off center and object 20 is significantly rotated. Figure 4A is a profile of the correlation using equation (6) as a function of ranging template movement along the x-axis for a non-rotated object. Ranging template 30 has a displacement δ = 3 units, so the maximum correlation has a width of six units. The irregular and slightly blurry edges of real objects in industrial environments in which the present invention will be used results in a gradual fall-off from the maximum correlation as it falls to a zero correlation. -12- SUBSiπUTE SHEET (ROLE 26) Referring to Figure 4B, another ranging template 30' can be constructed by choosing a displacement δ = 1 unit. The resulting ranging template 30' will allow a detection of object 20 in image 22 only if the template is off the center of object 20 by no more than one unit. Thus, object 20 can only be found by searching over every location in input image 22. However, the center of object 20 can be found to an accuracy of one unit. Figure 4C is a profile of the correlation using equation (6) for movement of ranging template 30' with δ = 1 unit along the horizontal direction ofthe x-axis. For images in industrial environments the correlation profile approximates an inverted parabola about the peak ofthe correlation. It can be seen that the mathematical center of a best fitting parabola will lead to an accuracy significantly smaller than the size of a pixel. The profiles shown in Figures 4A and 4C suggest that the formula for vector correlation in formula (6) may be altered according to a method of normalized correlation. The normalized formula for this invention is ∑P -∑N corr(x,y) =- (7) ∑ , 2 +ΣN, 2 --(Σ/ > +ΣN) 2 i ' , ' N \ ' , ' It can be easily verified by those skilled in the art that if the illumination value of each coordinate point representing a pixel in image 22 is multiplied by an arbitrary constant and another arbitrary constant is added to the value at each coordinate point representing a pixel then the results ofthe correlation corr(x,y) do not change. Thus, the normalized correlation formula produces a correlation value that is independent of light level and contrast. Furthermore, the value of the correlation is no greater than unity for a perfect correlation and no less than zero for a poor correlation. The dynamic operation ofthe system ofthe present invention is illustrated in the flow chart of Figure 5. For purposes of illustration it is assumed that an object 20 to be located in an image 22 has a minimum horizontal or vertical length of approximately 16 units. The displacement δ is set to a maximum value of 8 units which is half the 16 units for the reasons discussed above. It is initially assumed that object 22 is not rotated. Therefore, a value of θ τi equals 0. Nevertheless, a possible positive change in rotation Δθ τ is set to a predetermined value to be used later. For puφoses of illustration, it is set to 8. Then a possible template 24' is determined manually at location 52. The manual template is converted to an abstract template 28' using simplified vector notation at location 54 as discussed above. Next, abstract template 28' in vector notation form is converted to a ranging template 30" at location 56. At location 58 ranging template 30" is moved to a new location within image 22. Because the size of ranging template 30" involves the use of δ at a value of 8 units, the ranging template is moved over the image in a 16 by 16 search grid and a normalized correlation computed at location 60 for each new location. After a normalized vector correlation is computed at each new location, the value is compared to a pre-set threshold at location 62. For puφoses of illustration, this value is set to 0.5. If the value is less than 0.5 then the ranging template 30" is moved to the next search location within image 22 as long as not all image locations have been tried as shown at location 64. If all image locations have been tried and an acceptable minimum threshold is not reached then it is possible that an object 20 was not in image 22, and the system has responded correctly at location 65 in not finding an object. However, if it is verified that an object indeed exists even though the system was not able to find it, one of three options are possible as shown by dotted arrows 66, 68, and 70. Typically, a larger value of displacement δ is selected at location 56. Alternatively, more vectors may be used to convert manual template 24 to abstract template 28' at location 54. Finally, it may be necessary to manually select a different manual template 24 at location 52. Then the normalized vector notation is again computed at each of the different locations within image 22 until the threshold at location 62 is satisfied. Once the minimum threshold value of a normalized correlation is satisfied at location 62, the location x m , y m of ranging template 30" within image 22 at which the correlation was performed that most closely corresponds to the coordinate position of object 20 in image 22 is saved at location 74. Then, at location 76 the displacement δ is cut in half and a possible range of rotation Δθ τ for object 20 is also cut in half. Thus, using the information provided above, δ and Δ θ r arc both 4. The value for θ r corresponding to an angle of rotation for object 22 is -4 when θ Ti equals 0. Using the new values, abstract template 28' is converted to a new abstract template 28" at location 78 according to standard formulae for rotating coordinate points in a two dimensional space: θ; *w =θ i +θ r (10) The angles ofthe edge directions in the abstract template are also rotated:Then, new abstract template 28" is converted to a new ranging template 30'" as shown at location 80 ofthe flowchart of Figure 5. Unlike the initial grid size of 16 by 16 for ranging template 30", the grid size is half or 8 by 8 for ranging template 30'". By moving ranging template 30'" to different locations around originally stored location x m , y m as shown at flow chart location 82, a maximum normalized correlation can be determined for a more accurate specification of x m , y m with the best location corresponding to the maximum normalized correlation for that value of θ τ stored. As shown at location 84, θ τ is then recomputed taking the last value of θ τ and adding the value of Δ θ τ determined at location 76. As long as θ τ ≤ θ Ti + ΔΘ T| as required at flow chart location 86, the steps at locations 78, 80, 82 and 84 are repeated. Thus, for the illustration, maximum correlation values are saved for three different ranging template locations x ml y m in image 22 corresponding to different values of θ τ of -4, 0, and +4. The stored value of θ τ that gives the maximum correlation for δ=4 is determined at location 88 and the corresponding determination ofthe location of object 22 by ranging template 30'" is -15- SϋBSi iTE SHEET (RDIE 26) saved at location 74 as x m , y and θ Tl . The location and angle of the strongest correlation of template 30'" with displacement δ=4 becomes the starting point for a new searching using a ranging template 30"" having a yet smaller displacement δ = 2 units. Angles of rotation d j = -2, 0, and +2 degrees from the previous best angle are used to find a better approximation of the rotation θ τ and location x m , y m . Smaller displacements and angles are used to calculate new ranging templates from abstract template 28 and the search for the pattern of interest is continued in a likewise manner until displacement δ is at a predetermined minimum value. The value shown in the flowchart at location 90 is 1. Once the displacement is 1 , the system of the present invention stops having determined a coordinate location X m , y m of object 20 within image 22 corresponding to an appropriate angle of rotation θ τ as shown at location 92. Those skilled in the art will recognize a portion of the above procedure as similar to a method for locating a maximum value of a function in a multidimensional space. Gradient methods in multidimensional spaces are discussed in Numerical Recipes the Art of Scientific Computing, by W. Press, B Flannery, S. Teukolsky, and W. Vetterling, Chapter 10, Cambridge University Press, 1986, which is incoφorated by reference. The use of edge detection and pattern searching in one operation reduces the need for complex computer manipulation while providing great flexibility. Thus, a great advantage to using an abstract template 28 with simplified vector notation is that it can be easily altered dynamically to produce a wide range of different ranging templates 30 which can be moved to different locations around image 22 with ever increasing resolution. The location x m , y m and angle of rotation Θ T of an object 20 within an image 22 can be pinpointed quickly with a desired accuracy without having to store each of the coordinate locations and corresponding brightness of each point comprising the edges 26 for the originally manually determined template 24. Preferably, the system of the present invention may be implemented using standard computer hardware and software known to those skilled in the art. Object 20 of image 22 may be displayed on a normal screen of a cathode ray tube ("CRT"). The system may be loaded as software by means of various storage media including, but not limited to, magnetic discs and tapes, optical drives, compact disc drives, and paper. Preferred embodiments of the present invention have been disclosed. A person of ordinary skill in the art would realize, however, that certain modifications would come within the teachings of this invention. Therefore, the following claims should be studied to determine the true scope and content ofthe invention.

Claims: What is Claimed is: 1. For use in an automatic image processing system, a method for locating a position of an object within an image, the image defined by a plurality of image pixels, each image pixel having a known intensity value and a known coordinate point, comprising the steps of: manually determining a template corresponding to an estimation of the object; translating said template to an abstract template; converting said abstract template to a ranging template; displacing said ranging template to each of a plurality of known coordinate point locations within said image; correlating said ranging template with said image at each of said locations; and saving said location corresponding to said correlating once a pre-defined threshold is reached. 2. A method as recited in claim 1, wherein said translating step comprises the further step of defining said abstract template using a number of vectors comprising a set of coordinate points and corresponding edge directions, each coordinate point lying on an edge of said template and a corresponding edge direction passing through said coordinate point peφendicular to said edge at said coordinate point. 3. A method as recited in claim 2, comprising the further step of using an equal number of vectors along substantially vertical and substantially horizontal extents of said template. 4. A method as recited in claim 3, comprising the further steps of: minimizing said number of said vectors; and selecting at least one vector for each different edge of said template subject to a threshold determination of a sufficiently large angular difference between adjacent edges. 5. A method as recited in claim 2, said converting step comprising the steps of determining a displacement defined from said coordinate points of said vectors and extending along corresponding edge directions; positioning, for each vector of said abstract template, a pair of coordinate points lying equally spaced from said coordinate point for said vector along said corresponding edge direction, a positive coordinate point corresponding to a positive value of said displacement and a negative coordinate point corresponding to a negative value of said displacement. 6. A method as recited in claim 5, comprising the step of assigning a weight to each of said coordinate points of said ranging template, a negative weight assigned to said negative coordinate point and a positive weight assigned to said positive coordinate point. 7. A method as recited in claim 5, wherein said displacement is no larger than one half the smallest dimension of an edge of said template having one of said vectors. 8. A method as recited in claim 5, comprising the further steps of: A. cutting said displacement in half; B. converting a revised ranging template; C. searching for maximum correlation at a plurality of locations surrounding said location corresponding to said saving step; and D. continuing steps A through C until said displacement is equal to a minimum value. 9. A storage as recited in claim 5, comprising the further steps of: A. setting a possible angle of rotation equal to an initial angle of rotation minus a range of rotation. B. deriving a revised abstract template from said abstract template; C. deriving a revised ranging template from said revised abstract template; D. displacing said revised ranging template to each of a plurality of known coordinate point locations within said image; E. searching for a maximum correlation corresponding to one of said known coordinate point locations; F. storing said location from step E and said corresponding angle of rotation; and G. calculating a new angle of rotation by adding said angle of rotation plus said range of rotation. 10. A method as recited in claim 9, comprising the further steps of: H. repeating steps B through G until said new angle of rotation is greater than said initial angle of rotation plus said range of rotation; I. choosing said location and said angle of rotation from step F giving maximum correlation and substituting said angle of rotation for said initial angle of rotation; K. cutting said displacement in half and said range in rotation in half; and L. repeating steps A through K until said displacement is at a minimum threshold. 1 1. An apparatus for locating a position of an object within the image, the image defined by a plurality of image pixels, each image pixel having a known intensity value and a known coordinate point, comprising: means for determining a template corresponding to an estimation of the object; means for translating said template to an abstract template; means for converting said abstract template to a ranging template; means for displacing said ranging template to each of a plurality of known coordinate point locations within said image; means for correlating said ranging template with said image at each of said locations; and means for saving said location corresponding to a correlation meeting a pre¬ defined threshold. 12. An apparatus as recited in claim 1 1, further comprising means for defining said abstract template using a series of vectors comprising a set of coordinate points and corresponding edge directions, each coordinate point lying on an edge of said template and a corresponding edge direction passing through said coordinate point peφendicular to said edge at said coordinate point. 13. An apparatus as recited in claim 12, said converting means further comprising: means for determining a displacement defined from said coordinate points of said vectors and extending along corresponding edge direction; and means for positioning, for each vector of said abstract template, a pair of coordinate points lying equally spaced from said coordinate point for said vector along said corresponding edge direction, a positive coordinate point corresponding to a positive value of said displacement and a negative coordinate point corresponding to a negative value of said displacement. 14. A storage medium containing software capable of performing process steps for locating a position of an object within an image, the image defined by a plurality of image pixels, each image pixel having a known intensity value and a known coordinate point, the process steps comprising: manually determining a template corresponding to an estimation ofthe object; translating said template to an abstract template; converting said abstract template to a ranging template; displacing said ranging template to each of a plurality of known coordinate point locations within said image; correlating said ranging template with said image at each of said locations; and saving said location corresponding to said correlating once a pre-defined threshold is reached. 15. A storage medium as recited in claim 14, wherein said translating step comprises the further step of defining said abstract template using a series of vectors comprising a set of coordinate points and corresponding edge directions, each coordinate point lying on an edge of said template and a corresponding edge direction passing through said coordinate point peφendicular to said edge at said coordinate point. 16. A storage medium as recited in claim 15, said converting step comprising the steps of: determining a displacement defined from said coordinate points of said vectors and extending along corresponding edge directions; positioning, for each vector of said abstract template, a pair of coordinate points lying equally spaced from said coordinate point for said vector along said corresponding edge direction, a positive coordinate point corresponding to a positive value of said displacement and a negative coordinate point corresponding to a negative value of said displacement. 17. A storage medium as recited in claim 16, comprising the further process steps of: A. cutting said displacement in half; B. converting a revised ranging template; C. searching for maximum correlation at a plurality of locations surrounding said location corresponding to said saving step; and D. continuing steps A through C until said displacement is equal to a minimum value. 18. A storage medium as recited in claim 16, comprising the further process steps of: A. setting a possible angle of rotation equal to an initial angle of rotation minus a range of rotation. B. deriving a revised abstract template from said abstract template; C. deriving a revised ranging template from said revised abstract template; D. displacing said revised ranging template to each of a plurality of known coordinate point locations within said image; E. searching for a maximum correlation corresponding to one of said known coordinate point locations; F. storing said location from step E and said corresponding angle of rotation; and G. calculating a new angle of rotation by adding said angle of rotation plus said range of rotation. 19. A storage medium as recited in claim 18, comprising the further process steps of: H. repeating steps B through G until said new angle of rotation is greater than said initial angle of rotation plus said range of rotation; I. choosing said location and said angle of rotation from step F giving maximum correlation and substituting said angle of rotation for said initial angle of rotation; K. cutting said displacement in half and said range in rotation in half; and L. repeating steps A through K until said displacement is at a minimum threshold.

Inventors: WILSON STEPHEN S, WILSON, STEPHEN, S.
Applicants: APPLIED INTELLIGENT SYST INC, APPLIED INTELLIGENT SYSTEMS, INC.
Application year: 1996
Main classification: G06K
IPC codes: G06K9, G06T7