Traitement en cours

Veuillez attendre...

Paramétrages

Paramétrages

Aller à Demande

1. WO1997043733 - SYSTEME D'EVALUATION D'UN MODELE POLYCHROME POUR DES OBJETS ORIENTES DE MANIERE ALEATOIRE

Note: Texte fondé sur des processus automatiques de reconnaissance optique de caractères. Seule la version PDF a une valeur juridique

[ EN ]

COLOR PATTERN EVALUATION
SYSTEM FOR RANDOMLY ORIENTED ARTICLES

BACKGROUND OF THE INVENTION

The present invention relates to image processing, and more particularly relates to image processing systems for the inspection of items decorated with a multicolored pattern.
Several systems have been proposed to determine quality of a color decoration of an item. Some of these systems use an electronic image processor to evaluate coloration as part of an assembly line process. Typically, these systems employ an array of optical sensors to generate a pixelated image of the item for analysis by the processor. One problem with this approach is that the decoration is usually randomly oriented with respect to the optical sensors, making electronic image evaluation difficult.
One attempt to overcome this problem is to transform the physical space image of the object undergoing inspection into a color space representation. This color space
representation is typically independent of physical space orientation of the object. U.S. Patent Nos. 5,120,126 to Wertz et al., 5,374,988 to Wertz et al., and 5,339,963 to Tao are cited as sources of general information concerning color space applications to inspection and sorting systems. FIG. IA provides a perspective view of color space defined in terms of Red, Green, Blue (RGB) coordinates.
This form of color space is convenient for characterizing colors of -images supplied by the RGB output of many types of cameras. Another color space representation is presented in FIG. IB in terms of the Hue, Saturation, Intensity (HSI) color space coordinates. Methods to convert between RGB and HSI color space image representations are well known. The "Line of Grays" common to both FIGS. IA and IB indicates the nature of this conversion. Notably, color space could also be defined in terms of the Yellow, Cyan, Magenta (YCM) color space coordinate triad or some other triad of coordinates as would occur to one skilled in the art. Furthermore, a two dimensional color space may be defined in terms of two independent coordinates of a three coordinate system.
One type of color image evaluation process, which typically utilizes color space transformations, partitions a color image into uniformly colored regions using a process commonly called "segmentation." The resulting "segmented image" looks like a stained glass portrayal or a comic strip cartoon of the item. The uniform color regions are
generally determined by correlating each color of the actual image to the closest color in a set of reference colors.
There are usually significantly fewer colors in the
reference color set than are initially presented in the actual image. Segmentation typically eliminates gradual color changes, reflection differences, and other minor variations that may hamper image processing. Furthermore, segmentation generally simplifies the evaluation process by reducing the part image to a pre-defined number of known reference colors. For segmentation systems where the actual image is provided in a pixelated format, each region is typically correlated by addressing a segmentation look-up table with each pixel color value. These systems output a common reference color for a selected range of pixel color values to provide a corresponding segmented image. U.S. Patent Nos. 4,414,635 to Gast et al. and 5,335,293 to
Vannelli et al. are cited generally as sources of additional information concerning segmentation.
Although typically free from the random orientation problem, color space inspection systems frequently suffer from being unable to cost effectively indicate the nature of a detected variation in a multicolor pattern for subsequent confirmation by an operator. Also, the detection of pattern variations, deviations, or defects often requires complex processing equipment and a significant amount of processing "time. Unfortunately, these systems may even become the principle limiting factor for the speed of an assembly line. Thus, a need remains for faster and more reliable evaluation of color decorations on items moving on a
conveyor .

SUMMARY OF THE INVENTION

One feature of the present invention is inspecting a multicolor pattern on an item with a processor and an imaging device. The imaging device generates a number of image signals corresponding to the multicolor pattern while the item is in motion. With the processor, each of a number of regions of the multicolor pattern is correlated to one of a number of reference color values using the image signals. The processor models the multicolor pattern by deriving a number of test value sets. Each set corresponds to one of the regions and is independent of orientation of the
multicolor pattern. Each set has at least a first value representative of a first characteristic of a corresponding region and a second value representative of a second
characteristic of the corresponding region. The sets are compared to reference data with the processor to detect variation of the multicolor pattern.
Another feature of the present invention is to inspect an item with an imaging device and a processor that includes conveying the item by the imaging device to provide an item image which is randomly oriented with respect to orientation of a model image of the item. The item image is
characterized by generating a number of characteristic values within the processor. Each characteristic value corresponds to one of a number of rotational positions about an item image point and is determined as a function of an optical property of a portion of the item image
corresponding to each of the rotational positions. The item image is rotationally correlated to the model image as a function of the characteristic values. The item image is compared to the model image to evaluate the item after rotational correlation.
Still another feature of the present invention is inspecting a multicolor pattern on an item with a processor by establishing a first set of color values with the
processor as a function of a number of color space
coordinates. The processor determines a second set of color values from a sample as a function of the coordinates. A number of reference colors are generated with each being determined from a corresponding one of a number of color pairs. Each pair has a first member from the first set and a second member from the second set with the first member being closer in color space to the second member than any other color of the second set and the second member being closer in color space to the first member than any other color of the first set. A number of detected color values corresponding to the multicolor pattern are compared to the reference color values with the processor to evaluate the multicolor pattern on the item. Among the advantages of this feature is the ability to eliminate inconsistent or spurious colors from the reference colors.
Accordingly, it is one object of the present invention to provide a model of a multicolor pattern on a item based on a segmented image of the pattern.
Another object of the present invention is to
efficiently eliminate spurious colors from a reference color table within a processor which may be used to evaluate colored items.
Still another object of the present invention is to efficiently re-orient a randomly oriented image of an item for comparison to a model image.
Further objects, aspects, features, and advantages of the present invention will be apparent from the following discussion and drawings provided herein.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. IA is a graphic depiction of RGB color space.
FIG. IB is a graphic depiction of HSI color space.
FIG. 2 is diagrammatic view of an inspection system of one embodiment of the present invention.
FIG. 3 is a diagram of an imaging area used in
conjunction with the embodiment of FIG. 2.
FIG. 4 is a flow chart of one process of the present invention using the embodiment of FIG. 2.
FIG. 5 is a flow chart illustrating calibration of FIG. 4 in greater detail.
FIG. ΘA is a flow chart depicting phase A training of the process of FIG. 4 in greater detail.
FIG. 6B is a flow chart depicting one stage of FIG. 6A in greater detail.
FIG. 6C is a flow chart depicting another stage of FIG. 6A in greater detail.
FIG. 6D is an example of a color distance matrix of the type which may be used in performing the process of FIG. 4. FIG. 6E is an example of a color matching matrix of the type which may be used in performing the process of FIG. 4.

FIG. 7A depicts a flow chart showing phase B training of the process of FIG. 4 in greater detail.
FIG. 7B is an example of an angular histogram of the type which may be used in performing the process of FIG. 4.

FIG. 7C diagrammatically illustrates a stage in the determination of an angular histogram of the type used in performing the process of FIG. 4.
FIG. 8 is a flow chart depicting inspection of the process of FIG. 4 in greater detail.

DESCRIPTION OF THE PREFERRED EMBODIMENT

For the purposes of promoting an understanding of the principles of the invention, reference will now be made to the embodiment illustrated in the drawings and specific language will be used to describe the same. It will
nevertheless be understood that no limitation of the scope of the invention is thereby intended. Any alterations and further modifications in the illustrated device, and any further applications of the principles of the invention as illustrated therein are contemplated as would normally occur to one skilled in the art to which the invention relates.
FIG. 2 depicts inspection system 10 of one embodiment of the present invention. System 10 includes conveyor 20 which transports a number parts A, B, C, D, E past camera 30 in the direction indicated by arrow T. Each part A-E is decorated with a multicolored pattern which may be randomly oriented with respect to a field of view of camera 30.
Camera 30 is operatively coupled to processor 40 to provide image signals corresponding to the multicolored pattern of each part as it passes by the field of view. In the case of FIG. 2, part D is depicted in the field of view of camera 30. Processor 40 is configured to analyze image signals from camera 30 to determine variation of the corresponding multicolor pattern from expected parameters and respond to detected variation in a specified manner.
Processor 40 includes frame grabber 42 and interface 44 both operatively coupled to camera 30. Frame grabber 42 digitizes and stores image signals from camera 30
corresponding to an imaged item in the field of view of camera 30, such as part D. Frame grabber 42 provides the digitized image signals to processor 40 for further
processing and evaluation.
Interface 44 is operatively coupled to part sensor 50. Part sensor 50 is of a conventional type which detects the presence of an object in the field of view of camera 30 and generates a corresponding part present signal. Processor 40 receives the part present signal and responds by sending a control signal to camera 30 to provide corresponding imaging signals to frame grabber 42 via interface 44.
In addition, interface 44 is operatively coupled to sorter 60 which is encountered by parts after they move by camera 30 on conveyor 20. Sorter 60 is an output device configured to respond to an output signal from processor 40 via interface 44 to route defective parts, such as part B illustrated, to bin 62. In contrast, acceptable parts, such as part A, depart from sorter 60 on conveyor 64. In
alternative embodiments, a different type of sorter may be used or a sorter may not be utilized. U.S. Patent Nos.
4,241,835 to Lockett, 4,790,022 to Dennis, 4,992,949 to Arden are generally cited as additional sources of
information concerning color processing sorters which may be adapted for use with the present invention.
Processor 40 may be comprised of one or more electronic circuit components. Similarly, processor 40 may be
comprised of digital circuitry, analog circuitry, fuzzy logic circuitry, or a combination thereof. Also, processor 40 may be programmable, an integrated state machine, or a combination of both. Preferably, processor 40 is a
ruggedized industrial grade programmable personnel computer customized with suitable circuitry and software
corresponding to frame grabber 42, interface 44, and various processing requirements. In one preferred configuration, processor 40 includes communication interfaces such as a modem or network link (not shown) and subsystems to
accommodate removable media, such as compact disks, (CDs) or floppy disks (not shown) .
Processor 40 includes memory 46. Memory 46 may be one or more components of the electronic (e.g. solid state), magnetic, optical, or other variety as would occur to those skilled in the art. Preferably, memory 46 includes a collection of electronic random access memory components (RAMs) and one or more hard disk drives.
Processor 40 is operatively coupled to input system 70 and display 80. Input system 70 provides a way for an operator to input commands and relevant data into processor 40. Input system 70 is preferably a keyboard and/or mouse arrangement, but alternatively may be a microphone input with associated voice recognition software, or such other device as would occur to one skilled in the art.
Display 80 is an output device responsive to processor 40 which prompts an operator to provide inputs via input system 70 and also selectively presents images of parts obtained via camera 30. Display 80 may also provide a visual indication of a defective part, and may furthermore indicate the defect on a displayed image of the part.
Display 80 is preferably of the conventional color cathode ray tube variety readily available for integration with personal computers. Alternatively, a liquid crystal display or other visual display responsive to processor 40 may be used.
Camera 30 is a color video area camera with a
charge-coupled device (CCD) sensor array capable of
providing a 640x480 (640 column by 480 row) pixel frame matrix having two interlaced 640x240 pixel field matrices per frame. Preferably, camera 30 is a three chip camera with any gamma correction disabled (gamma correction typically compensates for non-linear voltage-to-intensity mapping of video monitors). Camera 30 employs a color signal format which has a separate channel corresponding to each of the three RGB color components, Red (R) , Green (G), and Blue (B) , and a separate channel for a synchronization (sync) signal.
Preferably the frame rate of camera 30 is about 30 Hz. A 30 Hz frame rate permits capturing of generally unblurred images of items moving on conveyor 20 at a rate of about 30 per second. One way to acquire an image of an object moving relative to camera 30 without motion blur, is by
shuttering. Preferably, the control signal from processor 40 generated in response to a part-present signal from sensor 50 is used to shutter camera 30. A few examples of shuttering approaches are electronic gating of a camera's CCD element photo-integration period, strobing an
illumination source (not shown), and using a dedicated mechanical device (not shown) . Camera 30 is preferably electronically gated. For this type of shuttering, constant illumination of the objects to be imaged is preferably provided by fluorescent tubes with a high frequency
balance. Furthermore, the intensity of this illumination source is preferably stabilized by feedback from a photo sensor (not shown) in the vicinity of the camera 30.
It should be understood that camera 30 has an interlaced 640x480 pixel frame so that only one of two 640x240 pixel fields is generally available at a 30 Hz image capture rate. The resulting 640x240 pixel image is distorted, appearing vertically compressed by a factor of one half. To compensate for this distortion, every other pixel of each row is discarded to provide an undistorted 320x240 pixel image.
Referring additionally to FIG. 3, a field image matrix M is illustrated. Matrix M corresponds to a 320x240 (320 column by 240 row) pixel image from camera 30 with the bottom row discarded because it is typically interrupted by a vertical retrace. Coordinate axes x,y are indicated to define a number of regions A, B, and G of matrix M.
Active region A shows a multicolor pattern image MP corresponding to an object decorated with four colors CI, C2 , C3 , and C4. Region A is a nearly square 240x239 pixel space situated between gray region G and black region B. Region A is indexed by (X/y) coordinates ranging from x=0 , 1, ... , 239 and y=0 , 1 , ... , 238. A pixel of image MP is represented as IP where the subscript "xy" corresponds
cxy
to the (x,y) coordinates of the the pixel and the subscript

" c" collectively represents the three RGB color coordinates (or "color components") used to specify pixel color.
Similarly, the separate RGB color coordinates may be
individually represented by subscripts "r," "g , " and "b."

Thus, pixel IP may alternatively be represented by:
IPrxy for the red coordinate, IPgxy for the g3reen
coordinate, and IP, for the blue coordinate. The
subscripts "x," "y," "c, " "r," "g," and "b" are used with various variables and values hereinafter to similarly represent the color coordinates thereof.
A typical pixel IP of image MP is illustrated at (x,y) coordinates x=60, y=60, such that: IP = IP 6060- Furthermore, unless otherwise indicated, it is assumed that each of the three RGB color coordinates has an 8 bit binary resolution corresponding to a base ten range of 0 to 255. This convention results in 24 bits of binary color
information per pixel.
Region B refers to a black reference region used to correct an image in region A for low frequency noise due to drift of dark response by camera 30. Region B may be provided by a black felt rectangle. Region B is a 40x239 pixel rectangle indexed by (x,y) coordinates ranging from x = 240,241, ... ,279 and y = 0,1, ...,238.
Region G refers to a gray reference region used to correct an image in region A for noise from the illumination source and drift in the gain of various channels of camera 30. Region G may be provided by a gray strip of paper.
Region G is a 40x239 pixel rectangle indexed by (x,y) coordinates ranging from x « -1, -2, . . ., -40 and y = 0, 1, • . ., 238.
The standards and conventions used herein are selected for convenience only and should not be construed as limiting. Indeed, these standards and conventions
preferably vary with the capability and configuration of the selected hardware and any associated software. For example, the color coordinates, the image color and dimensional resolution, and the image format may vary. Also, various other signal standards may be employed, including, but not limited to the S-video standard (sync on one channel with chrominance on another) and the composite standard
(luminance, chrominance, and sync all on one channel). In still other embodiments, a single chip camera, a line scan camera, a customized collection of optical sensors, or another type of imaging device may be used as would occur to one skilled in the art.
In one alternative embodiment, part sensing is not utilized. Instead, camera 30 is triggered on a periodic basis as a function of speed of conveyor 20 and spacing between items being carried on conveyor 20 for inspection. In still other embodiments, the provision of imaging signals may be selectively triggered by an operator, or triggering is not necessary to acquire an acceptable image of each item submitted for inspection.
Referring also to FIG. 4, process 100 of one embodiment of the present invention utilizing system 10 is
illustrated. Implementation process 100 includes
calibration 120 for calibrating the equipment of system 10 periodically. Process 100 also includes phase A training 130 which builds coloration information tables from selected samples of a multicolor pattern to be inspected. Phase B training 140 employs the coloration information tables determined during phase A training 130 to create reference data by utilizing additional samples of the selected
multicolor pattern. This reference data is then used to conduct inspection 150 on a number of items with the
selected multicolor pattern as they move by camera 30 on conveyor 20. Each of operations 120, 130, 140, 150 is preferably under control of an operator via input system 70. Preferably, these processes may be started and stopped at the operator's discretion. Additional details concerning each operation follows.
FIG. 5 further illustrates selected details of
calibration 120. Calibration 120 results in "uniformity correction" for various non-uniformities of system 10 equipment. Calibration 120 begins with preparation 205.
Preparation 205 includes placement of a uniform white sheet (such as a thick sheet of high quality paper) over region A leaving region B uncovered. Gain of camera 30 and white balance (relative gains of channels corresponding to the color components RGB) are adjusted to a constant, WHITEAVG, corresponding to a bright unsaturated image. For 8 bit pixel color coordinate values, a value of WHITEAVG = 200 for each of the coordinates is preferred (IPcxy = IPrxy
IPgxy = IPb,xy = 200)' .
After preparation 205, buffer images AVG and SIG
(240x239 pixel matrices) are cleared and allocated in stage 210. Image buffer AVG holds the average color components of a number of images of the white sheet which is used to identify and compensate for non-uniform pixels over region A. Such non-uniformities are typically a kind of fixed pattern image noise. Image buffer SIG corresponds to the standard deviation of each pixel color value over the number of white images used to create image buffer AVG.
In stage 212 a counter variable, COUNT, corresponding to the number of white images is initially assigned COUNT=l. Next, an image acquisition and processing loop is entered. Each repetition of the loop corresponds to the acquisition and processing of another white image. In stage 214 of this loop, a white image is obtained using camera 30 and frame grabber 42. In stage 216, the grabbed image is submitted to offset correction as explained hereinafter.
Offset correction is provided for each color component from a group of pixels located in region B. In one
embodiment, the central 128 pixels (y=56 to y=183) of column

278 (x=278) are selected and the color component of each of the 128 pixels is averaged and stored in a three component array designated B . Generally, these average pixels represent an amount of offset of each color component from the ideal zero value for a black image. Typically, the offset values for each color are about 5-10 for the selected

0-255 base ten range of each color component. The offset values may drift with temperature and time so that it is preferred to perform an offset correction on every image using a portion of representative pixels from region B.
To provide pixel by pixel offset corrections for
representative pixel IPcxy of image MP of FIG. 3, an
offset corrected pixel, designated OPcxy is determined as follows :

OPcxy = max(0, IPcxy-Bc ) ,

where the max() function provides the greatest value listed in the parentheses to prevent negative offset-corrected pixel values. This determination is repeated for each pixel of interest over the active region to provide an offset corrected image.
After offset correction, the white image is averaged into the AVG buffer in stage 218. Also, the standard deviation value is stored in the SIG buffer in stage 220. In conditional 222 a determination is made whether enough white images have been obtained. For the illustrated example, eight images have been selected, corresponding to COUNT=8 as a number sufficient to provide adequate
uniformity correction; however, more or less white images may be used.
Once eight white images have been acquired and
processed, control flows from conditional 222 to conditional 230. A region of pixels with color values from image buffer AVG that are significantly below the selected WHITEAVG constant corresponds to dark, noisy areas of the image and tends to indicate a defective portion of the CCD sensor """array of camera 30. As a result, conditional 230 determines whether pixels from image buffer AVG fall below a selected threshold corresponding to possibly defective equipment. If this threshold is exceeded, control flows to warning 232 to warn the operator that the equipment may be defective.
If it is determined that pixel values for AVG are not too low, then control flows to conditional 234. In
conditional 234 pixels from image buffer SIG are compared to a threshold to determine whether any pixels exceed a
pre-selected value indicative of bad equipment. If SIG values are too high, control once more flows to warning 232 to inform the operator of the possible equipment problem. On the other hand, if SIG values are not too high then control flows to stage 236. In stage 236 image buffer AVG is stored for correction of images, then control returns to process 100.
Notably, the pixel level defect detection capability of the AVG and SIG buffers may be variously configured. For example, the blocks 230, 232, 234 may be configured to warn the operator only when a certain pixel quantity, density, or a function of both AVG and SIG values indicates failure.

Furthermore, warning 232 may include information relating to the nature, location, number, density, and severity of suspected pixel flaws. Alternatively, an auto correction feature may be incorporated to replace bad pixels as a function of the value of neighboring pixels as part of calibration 120.
Uniformity correction using image buffer AVG after offset correction to produce a pixel is next discussed. An "average calibration pixel" of the image buffer AVG is represented by AVGt.*Xjf . The following equation provides a pixel having offset and uniformity correction as represented by variable UOIcxy :

UOIcxy = (WHITEAVG/AVGcxy)' * OPcxy

where OPcxy is a pixel with offset correction. Uniformity J correction of an image is provided by applying this
correction to each image pixel after offset correction.
Typically, for most pixels, the value in parentheses is close to unity corresponding to only a minor correction.
Unlike the determination of B for offset correction, the determination of image buffer AVG via calibration 120 is generally computationally inefficient. As a result, calibration 120 is preferably performed only occasionally to reestablish a new image buffer AVG. Typically, calibration 120 is performed when equipment changes are made or when a long period of use has passed since the previous calibration 120. In contrast, new values B are preferably recomputed for each image.
Similarly, another correction factor, gain correction G is also preferably computed for each image. Gain
correction G corresponds to noise from the illumination source and drift in the gain of channels for camera 30 over time. Gain correction is preferably determined by using the central 128 pixels (y = 56 to y = 183) of column x=-39 of region G. Gain correction G represents average color values for the selected pixels. As part of initially setting up system 10, reference gains, RG , are determined for a selected reference image and stored as the average color values for the central 128 pixels of column x=-39. Typically, the reference image will be the first image generated during phase A training 130.

A fully corrected pixel pV*»Λ.y is determined by
providing gain correction to a pixel UOI as follows:

p = min(255,nint((RG /G )*UOI )),
cxy c c cxy

where the function min() assures that color values do not exceed the maximum end of the color value range (255) and the function nint() selects the nearest integer value. This operation is performed for each pixel of interest to
generate a fully corrected image.
FIG. 6A is a flow chart depicting phase A training 130 in greater detail. Phase A training 130 begins with stage 310 by loading image buffer AVG for uniformity correction. Next, in stage 312, a counter, PartCount, is set to 0.
PartCount corresponds to a count of sample parts used during phase A training 130. Each sample part is decorated with a multicolor pattern which is characterized during training for subsequent inspection of parts bearing the pattern.
After stage 312, a loop is entered beginning with stage 314. Each successive execution of this loop corresponds to a different sample image to be processed. In stage 314, processor 40 waits until sensor 50 generates a part present signal indicating alignment of a sample part on conveyor 20 with camera 30. Correspondingly, processor 40 triggers shuttering of camera 30 to generate a sample image of the aligned part.
in stage 316 the sample image is grabbed with frame grabber 42 and digitized resulting in an uncorrected pixel image. This uncorrected pixel image then undergoes offset, uniformity, and gain corrections in stage 318. These corrections are performed on the image in accordance with the procedures previously described in connection with calibration 120. Specifically, offset correction is performed as a function of B , uniformity correction is performed as a function of values from image buffer AVG, and gain correction is performed as a function of RG and
Gc . The correction factors Bc„ and GC are p trreferably j
determined for each image grabbed. Uniformity correction of stage 318 is determined using image buffer AVG determined in accordance with calibration 120 and RG is preferably
c
already established.
In stage 330, a number of principal colors for the multicolor pattern of the sample image are determined. One object of phase A training 130 is to identify and
characterize the most prominent colors of the parts to be submitted to inspection by system 10. These colors are designated "principal colors" and correspond to color clusters of highly occupied and generally highly dense pixel sites in a digitized color space. The principal colors are described by a numeric table generated from a set of
principal color arrays. The principal color table is saved at the end of phase A training for subsequent use in phase B training 140 and inspection 150.
An 8 bit range for each pixel color coordinate
corresponds to a digitized, cubic RGB color space lattice with about 16.9 x 10 sites. The 240x239 pixels of region

A result in a pixel density in this digitized color space of
-3 . .
about 3.42 X 10 per site. This sparsely occupied site generally tends to make identification of principal colors difficult. As a result, a method to coarsen color space by reducing the number of bits per color coordinate -is utilized in this embodiment of the present invention. The number of

bits per color versus pixels per site is illustrated in the following table:


Where η is the number of bits per color and p is
determined as: p = (240x239)/2 (3*η) An empirically
determined preferred value of η is 3; however, greater or smaller values may be selected for other embodiments.
Assuming a selected value of η=3, the number of
corresponding digitized lattice sites of the resulting coarsened color space will be 512. This coarsened color space representation may be indexed by the 3 bit coordinates i,j,k, which correspond to the three RGB coordinates of the coarsened color space lattice sites.
Referring also to FIG. 6B, stage 330 is shown in greater detail. Stage 332 includes allocation which is performed by allocating^ four color sprace arrayJs Nι.j..k,' Rl.j..k, Gi.n.,k ,'
and Bi.n..k . Each of these arrays has 512 locations
corresponding to all values of each of the i,j,k
coordinates. Initially, each array location is set to zero. Next, a pixel reading loop is entered beginning with stage 334 and the 8 bit RGB color component values of a pixel ρu__x_y, from the sample image are read and stored in variables r,g,b in accordance with: r=p
rxy g=p and
gxy
b=pbxy ' In stage 336, the color component values r,g,b for the pixel read in stage 334 are used to determine the coarsened color space index values i,j,k in accordance with the following :

= r%2<8"τl),
c2(8-η)
= g
- b%2(8~Tl),

where (%) represents integer division. This puts the upper η bits of r,g,b into i,j,k, respectively.
In stage 338, each location of the color space arrays are updated with numeric data corresponding to the color values r,g,b and pixel occupancy in accordance with the following substitutions for all i,j,k:


Generally, N... corresponds to the number of pixels from the 240x239 corrected sample image indexed to a given coarsened color space lattice site. As a result, array

N 1. J. K, indicates sample image pixel occupancy in each of the

512 coarsened color sp *ace lattice sites. Each Ri.l.k, array J location contains a summation of the 8 bit r color component value for each sample image pixel occupying the coarsened color space lattice site having the same i,j,k index as the

Rl.j.k, array J. Similarly J, the Gι.ι..k and B1.3.,k arrays
respectively correspond to summations of the g and b color component values of each sample image pixel occupying the same coarsened color space lattice site.
Next, conditional 340 is encountered to determine whether any more pixels from the corrected sample image need to be processed. Specifically, for the 240x239 pixel matrix of region A, about 57,400 pixels may need to be processed.
If any more pixels are required then control loops back to stage 334 to read the next pixel and repeat stages 336 and
338 accordingly.
If all the pixels have been read, as determined by
conditional 340, then control flows to stage 342. In stage

342 the quantity of occupancy array N 1.]. K, of each i,j,k
site is examined to look for local maxima. Although a local

10 maxima may be variously defined, one preferred method of
determination is when N 1.3..K is greater than all 26 of its
nearest neighbors. These local maxima correspond to the
principal colors for a given image. Stage 342 also
determines the number of local maxima as N . Furthermore,
P
15 the color space arrays are reorganized to be indexed by
coordinates in,jn,kn where n corresponds to a given local maximum and cannot exceed the number of local maxima, N .
In stage 344, the color space arrays are sorted by
decreasing occupancy of Ni.nj.n,kn as a function of the local

20 maxima determined in stage 342, so that Nι.l,3.l,.k,l (e.g. n=l) corresponds to the largest local maximum.
In stage 346 the number of principal colors to be used are determined as a function of NMAX, where NMAX is a
maximum number of principal colors permitted. This
2*5J substitution is expressed as follows: Np = min(NP ,
NMAX), where min() is a function to determine the minimum number listed within the parentheses.
In stage 348, the principal color arrays are generated from the Color space arrays as follows:

3on0 PCNn - Nm. j.n.kn/(N240x239)'
PCRn = Rι.n3.nk,n/Nι.n3.n.kn
PCG„n = Gm. j.n,kn/Ni.nj.nk,n
PCBn = Bm. j.nk,n/Ni.nj.nk.n for n=l, 2,. . ., N . The color space location (PCR ,
PCGn, PCB ) is designated the nth principal color, and
PCN is the fraction of sample image pixels associated with the nth principal color. Once the principal color "arrays have been generated for the given image, control returns to the next stage of training 130.
Returning to FIG. 6A, the next stage after the
determination of principal colors in stage 330 is a loop counter 360 which increments PartCount. Next, conditional 362 is encountered where it is determined whether this is the first sample image processed, corresponding to PartCount = 1. If it is the first image, the control flows to stage 364 where a principal colors table is initially generated from the principal colors arrays determined from the first sample image. Control then loops back to stage 314 to await the next part present signal and determine principal color arrays corresponding to the corrected sample image for the next sample part.
On the other hand, if this is not the first image processed, then control flows to stage 370 to update the existing principal colors table and reduce or eliminate any inconsistent or spurious colors. Generally, "spurious colors" are artifacts of the image digitation process due to pixels which straddle two regions of different color. For example, the boundary between a red region and a green region of a multicolor pattern can produce yellow pixels (red + green = yellow) even if the part image contains no yellow. If such a boundary is long, there can be enough yellow pixels to yield a spurious yellow principal color. Spurious principal colors can be unstable from image to image because of their relatively small occupancy and the fact that their color coordinates are sensitive to sub-pixel positioning of color boundaries. Indeed, spurious principal colors may appear in some images but not in others so that the number of principal colors may change from part to part. This instability may be used to identify and remove spurious principal colors through a pairing function as described in greater detail in connection with FIG. 6C.

As shown in FIG. 6C, a color distance matrix C is created in stage 372. Each element of matrix C corresponds to the distance between each of the N colors of the
P
principal color table determined from previous samples and and the N , principal colors determined from principal color arrays for current sample image. As such, color distance matrix C has Np rows and N_p ,' columns. The
equation to determine each element of color distance matrix

C is: Cnn .' PCGn )'2 +
(PCB ,-PCB
principal
colors from the principal colors table and all
n'=l,2,...,N , of the principal colors from the principal color arrays PCR ,, PCG , , and PCB for the current sample image (where primes correspond to variables associated with the current image as opposed to previous images) . An example of the color distance matrix C is illustrated in FIG. 6D for a principal colors table having N = 4 corresponding to 4 rows and N , = 5 corresponding to 5 columns. Each entry of the color distance matrix of FIG. 6D corresponds to the distance between the colors heading the intersecting row and column. For C~ ~ (row 3 and column 2), the color space distance separating these principal colors is 2, C__ = 2. Similarly, C, ='2, corresponds to a color space distance of 2 separating the designated principal color 1 from the principal color table and principal color 1 from the principal color arrays for the current sample image.
Once the color space distance matrix C is created, a color matching matrix CM is created in stage 374. Similar to matrix C, matrix CM has N rows and N , columns.
P P
Each location CM , is assigned a value of zero (0) unless the corresponding element C , is the minimum element in both row n and column n' of color distance matrix C. Using this criteria, FIG. 6E illustrates an example of matrix CM corresponding matrix C illustrated in FIG. 6D.
Specifically, N = 4 and N = 5. Applying the color matching matrix CM criteria, C„, <= 1 is a minimum value for both row 2 and column 1 of the example color distance matrix, so that CM_, = 1. Similarly, C, ~ and C__ are minimums corresponding to CM-_ = CM., = 1. Otherwise columns 4 and 5 of the color distance matrix shown in FIG. 6D do not meet the criteria to provide a color match and so these columns correspond to spurious principal colors of the principal color arrays of the current sample image.
Likewise, row 4 of the color matching matrix shown in FIG. 6E contains no matches and corresponds to an inconsistent principal color in the principal color table. In effect, color distance matrix C and color matching matrix CM
correspond to a determination of which pairs of colors are closest in color space, where each pair has one member from the principal color table and another member from the principal color arrays of the current image. Notably, in making this determination for each pair, the color from the principal color table is closer to the paired principal color of the current image than any other of the principal colors in the current image; and the principal color from the current image of each pair is closer to the principal color from the principal color table than any other
principal color in the principal color table.
The principal color table is updated in stage 376 with only those colors from the current sample image found to match to one of the colors in the principal color table. For the example shown in FIG. 6D and 6E, principal colors from the principal color arrays corresponding to columns 4 and 5 are eliminated.
in stage 378, spurious colors of the principal color table which do not produce a match in the color matching matrix are eliminated. For the example of FIGS. 6D and 6E, a spurious color of the principal color table is represented in row 4 and would therefore be eliminated. Once spurious colors are eliminated, control is returned to complete the remainder of phase A training as detailed in FIG. 6A.
Returning to FIG. 6A, after stage 370, conditional 390 is encountered to determine whether principal colors in the principal color table have become stable. One preferred criteria for this determination is to track whether the number of principal colors N has changed with the last 10 sample images. If the principal colors of the principal color table are not stable, then control returns to stage 314 to await a part present signal and grab another image for subsequent correction and principal colors
determination. If the principal colors of the principal color table are stable, then control flows to stage 392.
In stage 392, the background color — the color
surrounding the image parts of phase A training 130 — is determined. It is preferred that the background color be indicated by organizing the principal colors table with decreasing occupancy and having the background color
inserted in the first position. Notably, the background color is generally a rather high occupancy principal color. Thus, one way to determine the background color is by occupancy. Another way to determine the background color is to determine which color appears on the periphery of each image. Still another approach is to have the operator select the background color from among the various principal colors in the table, and then rearrange the table
accordingly. In one embodiment, an operator may edit the principal colors table to change values or add or delete rows in a verification stage. Indeed, the principal colors may alternatively be determined by a manual process instead of phase A training 130.

Once the principal colors table is complete, it is saved to disk for later use in phase B training 140 and inspection 150. Furthermore, a segmentation look-up table (LUT) is established. Generally, the segmentation LUT maps each combination of the 8 bit color component values possible for image pixels to the nearest principal color n in the range n=l,2,...,N . Thus, one example of a segmentation LUT has a 24 bit look-up address corresponding to the permutations of the three 8 bit RGB color coordinate values. However, a segmentation LUT with a 24 bit input address may be
cumbersome to process. Thus, in one preferred embodiment, an approximation is utilized by employing only the upper 6 bits of each of the RGB color components to index the segmentation LUT. This approach results in only about
262,144 elements for the segmentation LUT. With this 6 bit approximation, the bottom two bits are preferably replaced with binary 10. In other embodiments, the segmentation LUT may use a different approximation, forego approximations, or otherwise devise a segmentation LUT suitable to the selected coloration format of the image as would occur to one skilled in the art .
The segmentation LUT may be used to correlate each pixel of an image to one of the principal colors. The color components for the correlated principal color may then be used to replace the color components of the image pixel to produce a segmented image. This segmented image may be displayed to an operator to confirm principal color
processing. Alternatively or in addition, RGB to HSI conversion may be performed and the HSI coordinates mapped to a standard color vocabulary (e.g., light saturated red, dark yellow-green, etc...). In either case, it is preferred the operator review the results of phase A training and determine whether parameters should be adjusted and the training repeated before proceeding to phase B training.

-21-.

Among the factors which should be considered by the operator in making this evaluation are illumination, field of view, quality of sample parts used for phase A training 130, and value of η.
Referring to FIG. 7A, phase B training 140 is next discussed. Phase B training 140 builds on information developed during phase A training 130. Among the objects of phase B training 140 is to develop a reference model. This reference model includes a reference table with sets of test values, a reference map, and a reference image. Phase B training 140 is determined by evaluating images of a number of samples having a multicolor pattern. The number of samples used to develop the phase B training reference model can vary; however, it is preferable to use about 100 parts. in stage 402 of phase B training 140, image buffer AVG from calibration 120 and the segmentation LUT developed from phase A training 130 are loaded. In stage 404, a reference map is initialized which is used to track all colors
observed during phase B training 140. Initialization 406 sets loop counter PartCount to 0. PartCount corresponds to each image processed during phase B training 140.
Next, an image processing loop is entered beginning with stage 408. In stage 408, a part present signal from sensor 50 is awaited. Once a part present signal is detected, the image is grabbed by frame grabber 42 in stage 410 and then corrections 412 are performed including offset, uniformity, and gain corrections previously discussed in connection with calibration 120 and phase A training 130.
In stage 414, various reference table test values are calculated for the sample image after corrections 412.
Generally, the test values are derived from a segmented image of the sample image having various regions of uniform principal color. This segmented image representation of the sample image is generated by addressing the segmentation LUT with each sample image pixel color value to obtain the closest principal color value. The reference table test values characterize the color scheme of the multicolor pattern and its geometry in a way that is independent a part location and orientation with respect to the field of view of camera 30. Preferably, these numbers are a function of uniformly colored regions of the segmented image
representation of the sample image with a set of test values corresponding to each such region. Frequently, each test value set is a function of size of the region. Region size may be variously represented, including surface area or the number of pixels belonging to the region.
One type of test value preferred for the reference table are moments representative of the principal color regions of the sample image. These moments are calculated in color space and physical space with respect to the principal color regions. The zero order moment (0th) moment (in both color and physical space) of a principal color region n
corresponds to the number of pixels assigned to the region and may be written:

NΛ
xyζn

where the notation xy ε n indicates the summation is over all pixels assigned to a principal color region n of the image. The color space first moments of region n correspond

to average RGB components of that region given by:


Nn xx ^yyeern, ' sy

Nn xyζn

The physical space moments of region n of an image are the x and y locations of the region's centroid, given by:


Higher order moments are also defined. The physical-space central second moments of region n are defined by:


χyy £( n
\ n χyζ.n
It is preferred that the test values be invariant with respect to part position and orientation. Such invariant quantities permit inspection of a part having a multicolor pattern randomly oriented with respect to the field of view of the camera 30. One preferred invariant quantity is the fraction of the image area covered by a principal color region n which relates the size of region n to the total image size. An expression describing this fractional image area in terms of the nth principal color region is as follows :


The quantities An are invariant and are preferably
included in the reference table. Furthermore, it should be nnootteedd tthhjat An is p crop cortional to the zeroth moment Nn, and that:


All color space moments are invariant because spatial translations and rotations generally do not affect color space. As such, the first color space moments are
preferably included in the reference table.
Generally, physical space moments are not invariant, but certain preferred invariant quantities are determined as a function of physical space moments. For example, a
principal color region n may generally correspond to a two-dimensional object with unit mass and uniform density (mass per unit area) , so a corresponding inertia tensor may be created as follows:


Furthermore, the eigenvalues of I are the principal moments of inertia corresponding to the following expression:

1/2
e = MXXn + Mγγn f f MχXn - Myyn + u,
'n

With the exception of the background region, the principal moments of inertia are also invariant. Additional
invariants include the principal radii of gyration as defined by:

Similarly, except for the background region, each principal radius of gyration is also invariant and is preferably included in the reference table. Notably, the principal radii of gyration characterize the shape of each
corresponding principal color region of the image.
Additional invariants preferably included in the reference table are the inter-centroid distances for each possible pair of non-background regions. These distances may be included in a matrix D , , where n corresponds to one region and n' corresponds to the other region for each p rossible region pair. The calculation of matrix Dnn , is as follows:

1/2
Dnn< = ((*„ - Xn>)2 + (Y„ - Yn,f)

The inter-centroid distance is invariant for all pairs except those involving background regions. The
0 inter-centroid distances generally characterize the
inter-region geometry of the parts.
A symbolic representation of a preferred reference table corresponding to a fully corrected and segmented sample image is shown as follows with the quantities A , R ,
5 J Gn , Bn, Un Vn and Dnn , calculated for each region
n and n' over the range of 1,2, .,N where N is the
P P
total number of principal colors in the principal color table .

0

5


After these values are calculated, then averages and
standard deviations of the reference table values are
updated. The terms μ. (Q) and σ. (Q) represent the
average and standard deviation of some quantity Q over the first i sample images, respectively. The averages and standard deviations are updated recursively as follows:


) *'<*>

where Q. is the ith sample of Q and μ,(Q) « Q, , and
o~, (Q) = 0. In other embodiments the recursive updating scheme may not be used; however, it generally facilitates on the fly updating to improve overall computational efficiency.

The reference table is saved for subsequent use in inspection 150. Notably, compared to the space occupied by the pixels of region A, reference table values may be
determined and used to detect color defects in the
multicolor pattern while occupying only a small fraction of the memory space occupied in systems which compare the inspection image to a reference image pixel by pixel. In one preferred embodiment, the reference table test values occupy no more than 10% of the memory space occupied by the sample image pixels. In a more preferred embodiment, the test values occupy no more than 5% of the memory space occupied by the sample image pixels. In a most preferred embodiment, the test values corresponding to the reference table occupy no more than 2% of the memory space occupied by the pixels of the sample image pixels. One advantage of the small amount of memory space occupied by the test values for the reference table is that comparison of test values for a sample to reference table test values may be performed without resorting to a less efficient pixel by pixel
comparison of some systems.
One advantage of the reference table approach is in identifying multicolor pattern flaws or color shifts. As used herein, a "pattern flaw" means an improper physical space arrangement of the colors of the multicolor pattern. One example of a pattern flaw is the inadvertent placement of a color of a multicolor pattern on a portion of the pattern not intended to have that color. As used herein, a "color shift" means the shift of a colored portion of an item from one color to another color. One example of a color shift is when a light blue region of a multicolor pattern shifts to dark blue. In alternative embodiments, other test value functions of the principal color regions, either invariant or dependent on physical orientation of the object being inspected, may be used as would occur to one skilled in the art.
After determination of reference table values in stage 414, stage 416 is encountered which marks a reference map with colors that are observed in the current sample image. Preferably, this reference map is coarsened using the same i,j,k coordinate indexing used during phase A training 130 to determine principal colors as discussed in connection with the process described in FIG. 6B. This coarsened reference map has 512 locations initially set to zero. But as a pixel is read from an image acquired during phase B training 140, its corresponding i,j,k index is determined from the color component values r,g,b of the current sample image pixel and the corresponding site of the reference map is marked with a 1 indicating it is occupied. This process is repeated for each pixel of the image.
After stage 416, stage 418 increments PartCount in preparation for the next sample image. Conditional 420 is next encountered which determines whether the current image is the first image during phase B training 140 by testing for PartCount = 1. If it is, then control flows to stage 422 to initialize the reference table with the determined test values and to stage 424 to initialize a reference image for later use. Control then returns to stage 408 to wait for the next part present signal and grab the next
corresponding image for correction, determination of
reference table test values, and to mark corresponding sites of the reference map.
On the other hand, if Part Count > 1, then control flows to stage 426 to update μ. (Q) and σ. (Q) of the
reference table with the current test values from stage 414 and then onto stage 428.
in stage 428, a reference image initialized in stage 424 is updated. Preferably, the reference image includes an average image and an error image. Both images are formed by superimposing all training images and arithmetically
combining them: the average corresponds to a pixel by pixel average of the images obtained during phase B training, and the error image is the pixel by pixel maximum deviation from the average.
To obtain a properly superimposed image on the reference image, the global centroid of an image is determined which corresponds to a centroid of all portions of the image except the background region. Also, an angular histogram of an image is determined which represents a
radially-integrated non-background monochromic intensity of the image as a function of angle about the global centroid. Using the first image from phase B training 140 as a
geometric reference or model image, all later images are effectively superimposed onto it. To superimpose a given image onto the model image, the given image is translated so that both global centroids coincide; then the given image is rotated about its global centroid until the correlation between the angular histograms of the model image and the current image is at a maximum. The average and error images are then updated recursively from the superimposed images. -The transformation which superimposes the ith sample image onto the model image is:

x' sin Θ™ +



y' ,

where nint () is a function providing the nearest-integer within the parenthesis, and pixel coordinates x',y' are invalid if they do not lie within region A. Such invalid pixel positions are then replaced by the average pixel for the previous image corresponding to the same location. The point (X^1 ^Y'1') is the global centroid — the centroid excluding the background region — of the ith image as given by:

.

In this case, xy ε 1 indicates that the summation is over all pixels not included in the background region. The quantity θ^1' is the counter-clockwise angle through
which the ith image must be rotated in order to superimpose it on the model image.
The value of θ*1' is obtained by correlating the
angular histograms of monochrome renditions of the first and ith sample images. The angular histograms are calculated as follows :



*=0

where j = 0,1,..., 511 is the angular index, and k is the radial index. The maximum value of k is 339 which
corresponds to the length of the diagonal of the nearly square 240 x 239 pixel image space of region A, and:

^ li(i,), = ϊ i (r£V} + *# + *#) iϊ xy t
y ' 0 if xy e 1

is the monochrome rendition of the ith training image with all background prixels set to zero, where rxy, gaxy,' and bxy correspond to the RGB color components of a sample image pixel, and:

yjk = nintfyW + Arsin(2τrj7512))

are the pixel coordinates corresponding to j and k, and it is understood that only terms with valid pixel coordinates -r.> (0 <. xi.k. i 339 and O± y3.k. (_ 238) are included in the summation over k. The p eixel coordinates x].,k and y J j.k, correspond to the closest pixel of the sample image to the given jk coordinates for integer values of j = 0,1,..., 511 and k =* 0,1,... ,339.
0 The correlation between the angular histograms of the ith image and the model image is given by:

511
γ. _ rΛ(-') Λ(υ
j'zzO

where the j + j' is treated as cyclic, so that it is computed modulo 512. Then:

0(,') = 2π;max/512,
5 where j is the value of j for which X. is maximum,
max 3
It is preferred that many of the recursive aspects of these calculations be stored in look-up tables to enhance computational efficiency. Furthermore, it should be noted that the error image reveals how consistent the superimposed training images were from part to part. Typically, the largest pixel values in the error image correspond to a pattern edge, which are sensitive to slight misregistration errors during image superimposition. Also, the error image serves to locally adjust the sensitivity of the inspection process .
Referring additionally to FIGS. 7B and 7C, certain aspects of the angular histogram and superimposition process are illustrated by way of non-limiting example. First, in FIG. 7B, an example graphically depicting a portion of an angular histogram is provided. Specifically, columns corresponding to angular coordinate j values 2-13 indicate summations over k of the mxy values corresponding to the monochrome renditions of pixels closest to each integer value of j and k. Notably, the histogram is only partial, including dashed lines to represent the portion of the histogram from j = 14 through j = 511.
In FIG. 7C, an image T is shown with a representative radial diagonal D through global centroid GC corresponding to the k coordinate. Diagonal D is depicted with increments of k from k = 0 to k = 339. Furthermore, a radial value of coordinate j is indicated as j = 45. Also, the j=0 position is shown in dashed lines. In addition, the end portion of radial diagonal D is shown in phantom to correspond to a region which would be excluded as invalid because it is outside region A.
Image I also includes a number of representative pixels PI, P2 , P3 determined to be closest to a jk coordinate pair for j=45. Each pixel is represented as a small cirle near a tick mark indicating a value of k. For example, for PI, j=45, k=100 corresponding to Pl-k = P14t: ion"
Similarly, P2jJς = P245 150 and for P3jk L P345/20().
The color values of these nearest pixels will be summed in accordance with the determination of the monochrome value mxy to g3enerate h3. = h4Λ5t- . Similarly * the remaining
h. are determined to form an angular histogram for
comparison to the angular histogram of the model image.
Generally, the angular histogram transformation
procedure may be use to rotationally correlate a given image to the model image to enhance evaluation. For example, this correlation may be used to provide side by side comparison of the given image and model image each having the same rotational orientation. Furthermore, by translationally correlating the given image to the reference image so that the global centroid of the given image and the reference image coincide, a superimposed combination of the given image and model image may be generated.
Control flows from stage 428 to conditional 430 to determine if the sample PartCount for phase B training 140 has been exceeded. If it has not been exceeded, then

control flows to the top of the loop once more waiting for a part present signal at stage 408. However, if a sufficient number of samples have been collected, 100 in the
illustrated case, then control flows to stage 432.
In stage 432, the reference map corresponding to a coarsened color space marked with all colors found in the previous 100 training images is dilated by marking all 26 nearest neighbors of each originally marked site in the coarsened lattice. This further coarsens the reference map or dilates it so that small color shifts will not be
identified as color flaws in inspection 150 using the reference map. Next, control flows to stage 434 to filter the reference image obtained by recursive performance of stage 428. One preferred filter effectively replaces every color component of every pixel by the maximum value of that color component in a nine pixel neighborhood centered upon that pixel. Such filtering typically reduces the number of false failures. In an alternative embodiment, a different filtering process known to those skilled in the art may be used. After stage 434, control flows to the stage 436 to save the reference model including the reference table of test values, the reference map, and reference image
including both the average and error images.
FIG. 8 depicts a flow chart describing in more detail inspection 150. Inspection 150 begins with stage 502 by loading the uniformity correction image buffer AVG, the segmentation LUT determined during phase A training 130, and the reference model determined during phase B training 140. Control then flows to stage 504 at the top of an inspection loop. In stage 504, a part present signal is awaited. Once the part present signal is detected, an inspection image of a part submitted for inspection on conveyor 20 is grabbed by frame grabber 42 in stage 506, and offset, uniformity, and gain corrections are performed on that image in stage 508.

The inspection image includes the multicolor pattern
characterized by phase A training 130 and phase B training 140.
In stage 510, a reference map inspection is performed. In reference map inspection, a pixel counter is maintained to determine which pixels of the image of the part
undergoing inspection fail to correspond to a pixel marked in the reference map developed during phase B training 140. Correspondingly, each pixel is used to address the reference map and locations not marked with one are flagged as bad pixel colors with the counter. If the number of bad pixels is greater than a threshold value, then the part is flagged as defective in accordance with conditional 512. Notably, a failure of reference map inspection corresponds to colors which are distinct from any color expected in any region of the inspection image. If such a "color flaw" is detected, it is highlighted in stage 514 and the part is subsequently failed in stage 516. Control then flows back to the top of the inspection loop to stage 504 to await the next part present signal.
If no color flaws are detected as determined in
conditional 512, then control passes to stage 518 to perform reference table inspection. During reference table
inspection, each pixel from the inspection image is used to address the segmentation LUT for correlation to one of the principal colors and to identify regions of the inspection image correlating to a uniform principal color. Next, invariant quantities corresponding to the test values of the reference table are calculated for the inspection image. Preferably, these invariant quantities include An , Rn ,

Gn, Bn, Un ,' Vn, and Dnn ,' using the same
expressions as were used to initially determine the
reference table values during stage 414 of phase B training 140. Employing the average and standard deviation values generated during phase B training 140, positive standard errors corresponding to the current inspection image test values are generated in accordance with the following equations :

e{An) = \An - μ{An)\ /σ{Λn)

c(D„„/) = |Dnn/ - /i(D„„0lMDnn.) ,

where μ() and σ( ) represent the reference table average and standard deviation. In the above expressions ε() corresponds to the positive standard error for the type of test value included in the paretheses. The positive
standard errors ε(A ) , ε(U ) , ε(V ) , and
ε(Dnn ,) generallyJ correspond to color pattern variation indicative of a pattern flaw. The ε(R ) , ε(G ), and
ε(B ) positive standard errors generally correspond to color shifts. The largest positive standard error for the inspection image is identified as ERR. Conditional 520 corresponds to a test of whether ERR exceeds a flaw
threshold value, ERR_, indicative of a pattern flaw or color shift flaw. If there is such a failure, then control passes to stage 522 to describe this flaw. The type of test value associated with ERR and the associated region or regions may be identified and highlighted as part of stage 522 to visually identify the flaw on a displayed inspection image. Control then flows onto stage 516 to fail the part and return to the beginning of the loop at stage 504.
If no color shifts or pattern flaws are detected in conditional 520, then control flows to reference image inspection in stage 524. For reference image inspection, the inspection image is used to generate a positive standard error imag3e E cxy = abs(vq^ cx ,'y ,' - μ^ cxy)'/σ cxy,
where μ and σ are the average and error images, x' and y' are calculated in accordance with the
transformation described in connection with the reference image determination in phase B training 140, and it is understood the E = 0 if pixel (x', y'), is invalid
(i.e., it is not the case that 0 <. x ' ± 239 and 0 ± y' A

238). The function abs() returns the absolute value of the argument. The transformation values x', y* are used to superimpose the image q onto the reference image.
Next, all pixels for which Ecxy > a prre-set threshold

E, are flagged as bad pixels. Then, a number of bonds are determined between bad pixels -- where a bond is defined as the side where two adjacent pixels touch. In correspondence with conditional 526, if the number of bad pixel bonds exceeds a threshold Z, then the bad pixels of the part image are highlighted in stage 528 -- such as blinking the bad pixels or setting them to a designated color in a displayed image. The part is subsequently failed in stage 516 before returning control to stage 504 to await inspection of the next part. On the other hand, if the number of bad pixels determined during reference image inspection stage 524 does not exceed Z as tested in conditional 526, then control flows to stage 530 and the part is deemed acceptable.
Control then loops back to stage 504 to await the next part for inspection. Alternatively, an operator or external signal (not shown) may be used to halt inspection 150.
Notably, sorter 60 may be controlled by processor 40 in response to a failed part at stage 516 as shown in FIG. 8. Also, in other embodiments, a number of levels of deviation or variation of a part image may be determined to sort the parts into two or more acceptable or defective classes. In other words, more than two classes of parts could result from the inspection 150.
In still other embodiments, it is contemplated that various operations, stages, conditionals, procedures, thresholds, and processes described in connection with the present invention could be altered, rearranged,
substituted, deleted, duplicated, combined, or added to -~t>ther processes as would occur to those skilled in the art without departing from the spirit of the present invention.

As used herein, the terms "image," "region" of an image, "pixel," "color," "pattern" and "coloration" refer not only to visibly detectable items or qualities, but also to any representation of these items or qualities as one or more signals, values, constants, variables, or any other
identifiable representation utilized by a processor,
controller, or other processing equipment. Furthermore it should be be appreciated that as used herein: "variable," "value," "buffer," "constant," "flag," "threshold," "pixel," "image" (or a region thereof), "matrix," "input," "output," "command," or "memory location" each generally correspond to one or more signals within processing equipment of the present invention.
All publications, patents, and patent applications cited in this specification are herein incorporated by reference as if each individual publication, patent, or patent
application were specifically and individually indicated to be incorporated by reference.
While the invention has been illustrated and described in detail in the drawings and foregoing description, the same is to be considered as illustrative and not restrictive in character, it being understood that only the preferred embodiment has been shown and described and that all changes and modifications that come within the spirit of the
invention are desired to be protected.