| 摘要 |
<P>PROBLEM TO BE SOLVED: To reduce processing time by reducing the cost of calculating template matching. <P>SOLUTION: The differences Δgn, Δg1n; Δg2n, Δg3n of values gn, g1n; g2n, g3n related to the densities of adjacent pixels on a pixel line G in a template S0 and in a plurality (m0) of image areas Sj of concern which are scanned within one window are determined. Based on their magnitude relation, binary logical values bn, b1n are set for each of the pixels. A determination is made as to whether there is a mismatch between the binary logical values for each of the corresponding pixels between the template and each of the image areas of concern, to obtain a mismatch number criterion value Ujn. For each of the pixels, the criterion values are sequentially counted to determine the number Vjn of mismatches. When the number Vjn of mismatches counted is equal to or greater than a predetermined threshold Vr, a variety of computations about the remaining pixels is aborted and a scan is performed for the next image area of concern. By thus stopping the computations, the need to do computations for the pixels of all of the numbers n0 in each of the image areas of concern is eliminated. The position of the image area of concern where the number Vj of mismatches is at a minimum is determined. <P>COPYRIGHT: (C)2004,JPO&NCIPI |
