WO2009017616A1

WO2009017616A1 - System and method for identifying complex tokens in an image

Info

Publication number: WO2009017616A1
Application number: PCT/US2008/008843
Authority: WO
Inventors: Bruce Allen Maxwell; Casey Arthur Smith; Kristin Jean Dana; Richard Mark Friedhoff
Original assignee: Tandent Vision Science, Inc.
Priority date: 2007-08-01
Filing date: 2008-07-21
Publication date: 2009-02-05
Also published as: JP2010535383A; EP2171645A1; US20090034835A1; CN101802842B; EP2171645B1; CN101802842A; EP2171645A4; JP5409627B2; US8144978B2

Abstract

In a first exemplary embodiment of the present invention, an automated, computerized method is provided for processing an image. According to a feature of the present invention, the method comprises the steps of identifying token regions in the image, each token region comprising a connected image region of similar color and intensity, and utilizing the identified token regions to generate single material token regions for use in processing material and illumination aspects of the image.

Description

[DDK Docket No. 590.1016]

SYSTEM AND METHOD FOR IDENTIFYING COMPLEX TOKENS IN AN IMAGE

Background of the Invention

[0001] A challenge in the utilization of computers to accurately and correctly perform operations relating to images is the development of algorithms that truly reflect and represent physical phenomena occurring in the visual world. For example, the ability of a computer to correctly and accurately distinguish between a shadow and a material object edge within an image has been a persistent challenge to scientists. An early and conventional approach to object edge detection involves an analysis of brightness boundaries in an image. In the analysis it is assumed that a boundary caused by a material object will be sharp, while a boundary caused by a shadow will be soft or gradual due to the penumbra effect of shadows. While this approach can be implemented by algorithms that can be accurately executed by a computer, the results will often be incorrect. In the real world there are many instances wherein shadows form sharp boundaries, and conversely, material object edges form soft boundaries. Thus, when utilizing conventional techniques for shadow and object edge recognition, there are significant possibilities for false positives and false negatives for shadow recognition. That is, for example, a material edge that imitates a shadow and is thus identified incorrectly by a computer as a shadow or a sharp shadow boundary that is incorrectly interpreted as an object boundary. Accordingly, there is a persistent need for the development of accurate and correct techniques that can be utilized in the operation of computers relating to images, to, for example, identify material characteristics of the image.

Summary of the Invention

[0002] The present invention provides a method and system comprising image techniques that accurately and correctly identify regions of an image that correspond to a single material in a scene depicted in the image. [DDK Docket No. 590.1016]

[0003] In a first exemplary embodiment of the present invention, an automated, computerized method is provided for processing an image. According to a feature of the present invention, the method comprises the steps of identifying token regions in the image, each token region comprising a connected image region of similar color and intensity, and utilizing the identified token regions to generate single material token regions for use in processing material and illumination aspects of the image.

[0004] In a second exemplary embodiment of the present invention, an automated, computerized method is provided for processing an image. According to a feature of the present invention, the method comprises the steps of identifying spatio-spectral information for the image, and utilizing the spatio-spectral information to identify single material token regions for use in processing material and illumination aspects of the image.

[0005] In a third exemplary embodiment of the present invention, a computer system is provided. The computer system comprises a CPU and a memory storing an image file. Pursuant to a feature of the present invention, the CPU is arranged and configured to execute a routine to identify token regions in an image depicted in the image file, each token region comprising a connected image region of similar color and intensity and to utilize the identified token regions to generate single material token regions for use in processing material and illumination aspects of the image.

[0006] In a fourth exemplary embodiment of the present invention, a computer system is provided. The computer system comprises a CPU and a memory storing an image file. Pursuant to a feature of the present invention, the CPU is arranged and configured to execute a routine to identifying spatio-spectral information for an image depicted in the image file and to utilize the spatio-spectral information to identify single material token regions for use in processing material and illumination aspects of the image. [DDK Docket No. 590.1016]

[0007] In accordance with yet further embodiments of the present invention, computer systems are provided, which include one or more computers configured (e.g., programmed) to perform the methods described above. In accordance with other embodiments of the present invention, computer readable media are provided which have stored thereon computer executable process steps operable to control a computer(s) to implement the embodiments described above. The automated, computerized methods can be performed by a digital computer, analog computer, optical sensor, state machine, sequencer or any device or apparatus that can be designed or programed to carry out the steps of the methods of the present invention.

Brief Description of the Drawings

[0008] Figure 1 is a block diagram of a computer system arranged and configured to perform operations related to images.

[0009] Figure 2 shows an n X m pixel array image file for an image stored in the computer system of figure 1.

[0010] Figure 3a is a flow chart for identifying Type C token regions in the image file of figure 2, according to a feature of the present invention.

[0011] Figure 3b is an original image used as an example in the identification of Type C tokens.

[0012] Figure 3c shows Type C token regions in the image of figure 3b.

[0013] Figure 3d shows Type B tokens, generated from the Type C tokens of figure 3c, according to a feature of the present invention. [DDK Docket No. 590.1016]

[0014] Figure 4 is a flow chart for a routine to test Type C tokens identified by the routine of the flow chart of figure 3a, according to a feature of the present invention.

[0015] Figure 5 is a flow chart for constructing Type B tokens via an arbitrary boundary removal technique, according to a feature of the present invention.

[0016] Figure 6 is a flow chart for creating a token graph, according to a feature of the present invention.

[0017] Figure 7 is a flow chart for constructing Type B tokens via an adjacent planar token merging technique, according to a feature of the present invention.

[0018] Figure 8 is a flow chart for generating Type C tokens via a local token analysis technique, according to a feature of the present invention.

[0019] Figure 9 is a flow chart for constructing Type B tokens from Type C tokens generated via the local token analysis technique of figure 8, according to a feature of the present invention.

Detailed Description of the Preferred Embodiments

[0020] Referring now to the drawings, and initially to figure 1 , there is shown a block diagram of a computer system 10 arranged and configured to perform operations related to images. A CPU 12 is coupled to a device such as, for example, a digital camera 14 via, for example, a USB port. The digital camera 14 operates to download images stored locally on the camera 14, to the CPU 12. The CPU 12 stores the downloaded images in a memory 16 as image files 18. The image files 18 can be accessed by the CPU 12 for display on a monitor 20, or for print out on a printer 22. [DDK Docket No. 590.1016]

[0021] Alternatively, the CPU 12 can be implemented as a microprocessor embedded in a device such as, for example, the digital camera 14 or a robot. The CPU 12 can also be equipped with a real time operating system for real time operations related to images, in connection with, for example, a robotic operation or an interactive operation with a user.

[0022] As shown in figure 2, each image file 18 comprises an n X m pixel array. Each pixel, p, is a picture element corresponding to a discrete portion of the overall image. All of the pixels together define the image represented by the image file 18. Each pixel comprises a digital value corresponding to a set of color bands, for example, red, green and blue color components (RGB) of the picture element. The present invention is applicable to any multi-band image, where each band corresponds to a piece of the electro-magnetic spectrum. The pixel array includes n rows of m columns each, starting with the pixel p (1,1) and ending with the pixel p(n, m). When displaying or printing an image, the CPU 12 retrieves the corresponding image file 18 from the memory 16, and operates the monitor 20 or printer 22, as the case may be, as a function of the digital values of the pixels in the image file 18, as is generally known.

[0023] In an image operation, the CPU 12 operates to analyze the RGB values of the pixels of a stored image file 18 to achieve various objectives, such as, for example, to identify regions of an image that correspond to a single material depicted in a scene recorded in the image file 18. A fundamental observation underlying a basic discovery of the present invention, is that an image comprises two components, material and illumination. All changes in an image are caused by one or the other of these components. A method for detecting of one of these components, for example, material, provides a mechanism for distinguishing material or object geometry, such as object edges, from illumination and shadow boundaries.

[0024] Pursuant to a feature of the present invention, a token is a connected region of an image wherein the pixels of the region are related to one another in a manner relevant to identification [DDK Docket No. 590.1016]

of image features and characteristics such as identification of materials and illumination. The pixels of a token can be related in terms of either homogeneous factors, such as, for example, close correlation of color among the pixels, or inhomogeneous factors, such as, for example, differing color values related geometrically in a color space such as RGB space, commonly referred to as a texture. Exemplary embodiments of the present invention provide methods and systems to identify various types of homogeneous or inhomogeneous tokens for improved processing of image files. The present invention utilizes spatio-spectral information relevant to contiguous pixels of an image depicted in an image file 18 to identify token regions. The spatio- spectral information includes spectral relationships among contiguous pixels, in terms of color bands, for example the RGB values of the pixels, and the spatial extent of the pixel spectral characteristics relevant to a single material.

[0025] According to one exemplary embodiment of the present invention, tokens are each classified as either a Type A token, a Type B token or a Type C token. A Type A token is a connected image region comprising contiguous pixels that represent the largest possible region of the image encompassing a single material in the scene. A Type B token is a connected image region comprising contiguous pixels that represent a region of the image encompassing a single material in the scene, though not necessarily the maximal region corresponding to that material. A Type C token comprises a connected image region of similar image properties among the contiguous pixels of the token, where similarity is defined with respect to a noise model for the imaging system used to record the image.

[0026] Referring now to figure 3a, there is shown a flow chart for identifying Type C token regions in the scene depicted in the image file 18 of figure 2, according to a feature of the present invention. Type C tokens can be readily identified in an image, utilizing the steps of figure 3a, and then analyzed and processed to construct Type B tokens. [DDK Docket No. 590.1016]

[0027] Prior to execution of the routine of figure 3a, the CPU 12 can operate to filter the image depicted in a subject image file 18. The filters may include a texture filter, to, for example, transform patterns of differing reflectance caused by a textured material into a homogeneous representation that captures the spectral and spatial characteristics of the textured region. Identification of tokens can be difficult in a textured image. A textured image contains materials with, for example, more than one reflectance function that manifests as a defining characteristic. For example, the defining characteristic can be a pattern of colors within the texture, such that the texture displays a certain distribution of colors in any patch or region selected from anywhere within the textured region of the image.

[0028] Other textures can be defined by geometric characteristics, such as stripes or spots. The CPU 12 can execute a software module that implements any well known method, such as, for example, a Laws filter bank, wavelets or textons (see, for example, Randen, T.fTrygve], Husøy, J.H.fJohn Hakon], Filtering for Texture Classification: A Comparative Study, PAMI(21), No. 4, April 1999, pp. 291-310.), or convert a local area around each pixel to an histogram. Any method utilized will convert each pixel value of N color bands to a vector of T values representing the output of one or more functions applied to a local area around the pixel, for example, an 11x11 pixel array.

[0029] For example, an histogram representation for each pixel can be produced using the following algorithm:

Loop over all pixels p in an N-band (for example, RGB) input color image;

A) Initialize N 8 -bin histograms to zero, one for each color band

B) For each pixel q within a neighborhood of p (for example, an 11x11 pixel box) [DDK Docket No. 590.1016]

(i) For each of the N color values Cn of q;

(a) Increment the appropriate bins of the nth histogram;

(b) Use interpolation so that the two bins closest to the color value get incremented proportionally;

(ii) Concatenate the N 8-bin histogram values together into a single 8xN element vector;

(iii) Assign the 8xN element vector to the corresponding pixel p in the output image.

After the transformation from a set of color bands to a set of filter outputs, the image is treated exactly as the original color band image with respect to identifying type C tokens.

[0030] hi many instances, the texture filters may only be required on part of an input image, as much of the image may include homogeneously colored objects. Therefore, prior to application of the texture filters, it is useful to identify and mask off regions of homogeneous color. The texture filters are then only applied to areas where there appear to be textured materials. An example algorithm for identifying textured regions is as follows:

1) Execute a type C tokenization on the N-band color values (e.g. RGB), storing the token results in a region map R, where each pixel in the region map has the tokenDD of the token to which it belongs.

2) Execute a median filter on the region map R (e.g. each pixel P ij is replaced by the median token ID of a 7x7 box around P_ij). Store the result in R-median. [DDK Docket No. 590.1016]

3) Execute a filter on the original image that calculates the standard deviation of the pixels in a box around each pixel (e.g. 7x7) for each color band. Put the result in S.

4) For each pixel in S, divide the standard deviation calculated for each color band by an estimated noise model value. An example noise model is Sn = A*max Value + B*pixelValue, where maxValue is the maximum possible color band value, pixelValue is the intensity of a particular band, and A and B are constants experimentally determined for the imaging system (e.g. A = 0.001 and B = 0.06 are typical). This step converts the standard deviation into a normalized deviation for each color band. Store the results in Sn.

5) For each pixel in Sn, sum the squares of the normalized deviations for all N color bands, take the square root of the result and divide by the number of bands N to create a deviation value D ij. Compare the resulting deviation value D ij to a threshold (e.g. 1.0) assign a 1 to any pixel with a deviation value higher than the threshold, otherwise assign the pixel a 0. Store the results in a texture mask image T.

6) For each pixel in T, if the texture mask value TJj = 1 and the seed size of the token region with the id given in the median region map R-median_ij is less than a threshold (e.g. < 4), label the pixel as a textured pixel. Otherwise, label it as a homogeneous pixel. Store the result in the texture mask Tmask. [DDK Docket No. 590.1016]

The output of the above algorithm is a mask, Tmask, which is the size of the original image. Pixels of Tmask with a 1 value should be treated as part of an image region corresponding to texture materials and pixels with a value of 0 should be treated as part of an image region corresponding to materials of homogeneous color.

[0031] A 1^st order uniform, homogeneous Type C token comprises a single robust color measurement among contiguous pixels of the image. At the start of the identification routine, the CPU 12 sets up a region map in memory. In step 100, the CPU 12 clears the region map and assigns a region ID, which is initially set at 1. An iteration for the routine, corresponding to a pixel number, is set at i = 0, and a number for an N x N pixel array, for use as a seed to determine the token, is set an initial value, N = Nstart. Nstart can be any integer > 0, for example it can be set at set at 11 or 15 pixels.

[0032] At step 102, a seed test is begun. The CPU 12 selects a first pixel, i = (1, 1) for example (see figure 2), the pixel at the upper left corner of a first N x N sample of the image file 18. The pixel is then tested in decision block 104 to determine if the selected pixel is part of a good seed. The test can comprise a comparison of the color value of the selected pixel to the color values of a preselected number of its neighboring pixels as the seed, for example, the N x N array. The color values comparison can be with respect to multiple color band values (RGB in our example) of the pixel or the filter output representation of the pixel, in the event the image was filtered, as described above. If the comparison does not result in approximately equal values (within the noise levels of the recording device) for the pixels in the seed, the CPU 12 increments the value of i (step 106), for example, i = (1, 2), for a next N x N seed sample, and then tests to determine if i = imax (decision block 108).

[0033] If the pixel value is at imax, a value selected as a threshold for deciding to reduce the seed size for improved results, the seed size, N, is reduced (step 110), for example, from N = 15 to N [DDK Docket No. 590.1016]

= 12. In an exemplary embodiment of the present invention, imax can be set at i = (n, m). In this manner, the routine of figure 3a parses the entire image at a first value of N before repeating the routine for a reduced value of N.

[0034] After reduction of the seed size, the routine returns to step 102, and continues to test for token seeds. An Nstop value (for example, N = 2) is also checked in step 110 to determine if the analysis is complete. If the value of N is at Nstop , the CPU 12 has completed a survey of the image pixel arrays and exits the routine.

[0035] If the value of i is less than imax , and N is greater than Nstop, the routine returns to step 102, and continues to test for token seeds.

[0036] When a good seed (an N x N array with approximately equal pixel values) is found (block 104), the token is grown from the seed. In step 112, the CPU 12 pushes the pixels from the seed onto a queue. All of the pixels in the queue are marked with the current region ID in the region map. The CPU 12 then inquires as to whether the queue is empty (decision block 114). If the queue is not empty, the routine proceeds to step 116.

[0037] In step 116, the CPU 12 pops the front pixel off the queue and proceeds to step 118. In step 118, the CPU 12 marks "good' neighbors around the subject pixel, that is neighbors approximately equal in color value to the subject pixel, with the current region ID. All of the marked good neighbors are placed in the region map and also pushed onto the queue. The CPU 12 then returns to the decision block 114. The routine of steps 114, 116, 118 is repeated until the queue is empty. At that time, all of the pixels forming a token in the current region will have been identified and marked in the region map as a Type C token. [DDK Docket No. 590.1016]

[0038] When the queue is empty, the CPU 12 proceeds to step 120. At step 120, the CPU 12 increments the region ID for use with identification of a next token. The CPU 12 then returns to step 106 to repeat the routine in respect of the new current token region.

[0039] Upon arrival at N = Nstop, step 110 of the flow chart of figure 3a, or completion of a region map that coincides with the image, the routine will have completed the token building task. Figure 3b is an original image used as an example in the identification of tokens. The image shows areas of the color blue and the blue in shadow, and of the color teal and the teal in shadow. Figure 3c shows token regions corresponding to the region map, for example, as identified through execution of the routine of figure 3a (Type C tokens), in respect to the image of figure 3b. The token regions are color coded to illustrate the token makeup of the image of figure 3b, including penumbra regions between the full color blue and teal areas of the image and the shadow of the colored areas.

[0040] While each Type C token comprises a region of the image having a single robust color measurement among contiguous pixels of the image, the token may grow across material boundaries. Typically, different materials connect together in one Type C token via a neck region often located on shadow boundaries or in areas with varying illumination crossing different materials with similar hue but different intensities. A neck pixel can be identified by examining characteristics of adjacent pixels. When a pixel has two contiguous pixels on opposite sides that are not within the corresponding token, and two contiguous pixels on opposite sides that are within the corresponding token, the pixel is defined as a neck pixel.

[0041] Figure 4 shows a flow chart for a neck test for Type C tokens. In step 122, the CPU 12 examines each pixel of an identified token to determine whether any of the pixels under examination forms a neck. The routine of figure 4 can be executed as a subroutine directly after a particular token is identified during execution of the routine of figure 3a. AU pixels identified [DDK Docket No. 590.1016]

as a neck are marked as "ungrowable." In decision block 124, the CPU 12 determines if any of the pixels were marked.

[0042] If no, the CPU 12 exits the routine of figure 4 and returns to the routine of figure 3a (step 126).

[0043] If yes, the CPU 12 proceeds to step 128 and operates to regrow the token from a seed location selected from among the unmarked pixels of the current token, as per the routine of figure 3a, without changing the counts for seed size and region ID. During the regrowth process, the CPU 12 does not include any pixel previously marked as ungrowable. After the token is regrown, the previously marked pixels are unmarked so that other tokens may grow into them.

[0044] Subsequent to the regrowth of the token without the previously marked pixels, the CPU 12 returns to step 122 to test the newly regrown token.

[0045] Neck testing identifies Type C tokens that cross material boundaries, and regrows the identified tokens to provide single material Type C tokens suitable for use in creating Type B tokens. Figure 3d shows Type B tokens generated from the Type C tokens of figure 3c, according to a feature of the present invention. The present invention provides several exemplary techniques of pixel characteristic analysis for constructing Type B tokens from Type C tokens. One exemplary technique involves arbitrary boundary removal. The arbitrary boundary removal technique can be applied to Type C tokens wether they were generated using N color band values (RGB in our example) of the pixel or the filter output representation of the pixel, in the event the image was filtered. Actual boundaries of any particular Type C token will be a function of the seed location used to generate the token, and are thus, to some extent arbitrary. There are typically many potential seed locations for each particular token, with each [DDK Docket No. 590.1016]

potential seed location generating a token with slightly different boundaries and spatial extent because of differences among the color values of the pixels of the various seeds, within the noise ranges of the recording equipment.

[0046] Figure 5 is a flow chart for constructing Type B tokens via an arbitrary boundary removal technique, according to a feature of the present invention. In step 200, the CPU 12 is provided with a set (T₀) of Type C tokens generated with a seed size (S) via the routine of figure 3a, with neck removal via the routine of figure 4. The seed size S = S_max, for example, S = 4 pixels. In step 202, for each Type C token, t_c in the set T_c the CPU 12 selects a number (for example 50) of potential seeds s, to S_n. hi our example, each selected seed will be a 4X4 pixel array from within the token region, the pixels of the array being of approximately equal values (within the noise levels of the recording device).

[0047] In step 204, the CPU 12 grows a new Type C token, utilizing the routines of figures 3a and 4, from each seed location, s, to S_n of each token t_c in the set T_c. The newly grown tokens for each token t_c are designated as tokens r_c, to r_cn. The newly grown tokens r_cl to r_cn for each token t_c generally overlap the original Type C token t_c, as well as one another.

[0048] In step 206, the CPU 12 operates to merge the newly generated tokens r_cl to r_cn of each token t_c, respectively. The result is a new token R₁ corresponding to each original token t_c in the set T_c. Each new token R₁ encompasses all of the regions of the respective overlapping tokens r_cl to r_cn generated from the corresponding original token t_c. The unions of the regions comprising the respective merged new tokens R₁ are each a more extensive token than the original Type C tokens of the set. The resulting merged new tokens R₁ result in regions of the image file 18, each of a much broader range of variation between the pixels of the respective token R₁ than the original Type C token, yet the range of variation among the constituent pixels will still be relatively smooth. R₁ is defined as a limited form of Type B token, Type B_abl, to indicate a token [DDK Docket No. 590.1016]

generated by the first stage (steps 200-206) of the arbitrary boundary removal technique according to a feature of the present invention.

[0049] In step 208, the CPU 12 stores each of the Type B_ab, tokens generated in steps 202-206 from the set of tokens T_c, and proceeds to step 210. Type B_abl tokens generated via execution of steps 202-206 may overlap significantly. In step 210, the CPU 12 operates to merge the R, tokens stored in step 208 that overlap each other by a certain percentage of their respective sizes. For example, a 30% overlap is generally sufficient to provide few, if any, false positive merges that combine regions containing different materials. The new set of merged tokens still may have overlapping tokens, for example, previously overlapping tokens that had a less than 30% overlap. After all merges are complete, the CPU 12 proceeds to step 212.

[0050] In step 212, the CPU 12 identifies all pixels that are in more than one token (that is in an overlapping portion of two or more tokens). Each identified pixel is assigned to the token occupying the largest region of the image. Thus, all overlapping tokens are modified to eliminate all overlaps.

[0051] In step 214, the CPU 12 stores the final set of merged and modified tokens, now designated as Type B_ab2 tokens, and then exits the routine. As noted above, the Type B_ab2 tokens were generated from Type C tokens wether the Type C tokens were generated using N color band values (RGB in our example) of the pixel or the filter output representation of the pixel, in the event the image was filtered.

[0052] A second exemplary technique according to the present invention, for using Type C tokens to create Type B tokens, is adjacent planar token merging. The adjacent planar token merging can be implemented when an image depicts areas of uniform color, that is for non- textured regions of an image. Initially, a token graph is used to identify tokens that are near to [DDK Docket No. 590.1016]

one another. Figure 6 shows a flow chart for creating a token graph, according to a feature of the present invention. Each token t_c in the set of Type C tokens T_c, generated through execution of the routines of figures 3a and 4, is evaluated in terms of a maximum distance D_n^_x between tokens defining a neighboring pair of tokens, t_c, t,,, of the set T_c, a minimum number of token perimeter pixels, P_min, in each token of the neighboring pair of tokens, and a minimum fraction of perimeter pixels, F_min, of each token of a neighboring pair of tokens, required to be within D_max.

[0053] hi step 300, the CPU 12 selects a Type C token t_c in the set of Type C tokens T_c, and identifies the pixels of the selected token t_c forming the perimeter of the token, hi a decision block 302, the CPU 12 determines whether the number of perimeter pixels is less than P_min, for example 10 pixels.

[0054] If yes, the CPU 12 proceeds to decision block 304 to determine whether there are any remaining tokens t_c in the set of Type C tokens T_c. If yes, the CPU 12 returns to step 300, if no, the CPU 12 exits the routine 306.

[0055] If no, the CPU 12 proceeds to step 308. In step 308, the CPU 12 generates a bounding box used as a mask to surround the selected token t_c The bounding box is dimensioned to be at least D_1112x larger than the selected token t_c in all directions. A known distance transform (for example, as described in P. Felzenszwalb and D. Huttenlocher, Distance Transforms of Sampled Functions, Cornell Computing and Information Science Technical Report TR2004-1963, September 2004), is executed to find the distance from each perimeter pixel of the selected token t_c to all the pixels in the surrounding bounding box. The output of the distance transform comprises two maps, each of the same size as the bounding box, a distance map and a closest pixel map. The distance map includes the Euclidean distance from each pixel of the bounding box to the nearest perimeter pixel of the selected token t_c. The closest pixel map identifies, for each pixel in the distance map, which perimeter pixel is the closest to it. [DDK Docket No. 590.1016]

[0056] In step 310, the CPU 12 scans the distance map generated in step 308 to identify tokens corresponding to pixels of the bounding box (from the region map generated via the routine of figure 3a), to identify a token from among all tokens represented by pixels in the bounding box, that has a number N_0n of pixels within the distance D_1113x , wherein N_0n is greater than P_min, and greater than F_min * perimeter pixels of the respective token and the average distance between the respective token and t_c is the lowest of the tokens corresponding to the pixels in the bounding box. If these conditions are satisfied, the respective token is designated t_n of a possible token pair t_c, I_n, and a link L_0n is marked active.

[0057] In step 312, the CPU 12 checks to determine whether a reciprocal link L_cn is also marked active, and when it is marked active, the CPU 12 marks and stores in the token graph, an indication that the token pair t_c, t_n is a neighboring token pair. The reciprocal link refers to the link status in the evaluation of the token designated as ^ in the current evaluation. If that token has yet to be evaluated, the pair is not designated as a neighboring token pair until the link L_0n is verified as active in the subsequent evaluation of the token t_n. The CPU 12 then returns to decision block 304 to determine whether there are any further tokens in the set T₀.

[0058] Upon completion of the token graph, the CPU 12 utilizes token pair information stored in the graph in the execution of the routine of figure 7. Figure 7 shows a flow chart for constructing Type B tokens via the adjacent planar token merging technique, according to a feature of the present invention. In the adjacent planer merging technique, pairs of tokens are examined to determine wether there is a smooth and coherent change in color values, in a two dimensional measure, between the tokens of the pair. The color change is examined in terms of a planar representation of each channel of the color, for example the RGB components of the pixels according to the exemplary embodiments of the present invention. A smooth change is defined as the condition when a set of planes (one plane per color component) is a good fit for [DDK Docket No. 590.1016]

the pixel values of two neighboring tokens. In summary, neighboring tokens are considered the same material and a Type B token when the color change in a two-dimensional sense is approximately planar.

[0059] In step 320, the CPU 12 selects a token pair t_c, t_n from the token graph. In decision block 322, the CPU 12 determines whether the mean color in token t_c is significantly different from the mean color in the token t_c. The difference can be a function of a z-score, a known statistical measurement (see, for example, Abdi, H. (2007), Z-scores, in N.J. Salkind (Ed.), Encyclopedia of Measurement and Statistics, Thousand Oaks, CA: Sage), for example, a z-score greater than 3.0.

[0060] If the mean colors of the token pair are different, the CPU 12 proceeds to decision block 324 to determine whether there are any additional token pairs in the token graph. If yes, the CPU 12 returns to step 320. If no, the CPU 12 exits the routine (step 326).

[0061] If the mean colors are within the z-score parameter, the CPU 12 proceeds to step' 328. In step 328, the CPU 12 performs a mathematical operation such as, for example, a least median of squares regression (see, for example, Peter J. Rousseeuw, Least Median of Squares Regression, Journal of the American Statistical Association, Vol. 79, No. 388 (Dec, 1984), pp. 871-880) to fit a plane to each color channel of the pixels (in our example RGB) of the token pair t_c, t_n, as a function of row n and column m (see figure 2), the planes being defined by the equations: R = X_Rn ⁺ Y_Rm ⁺ Z₁₁ G = X_0n + Y_0n, + Z_G B = X_Bn + Y_Bm + Z_B wherein parameter values X, Y and C are determined by the least median of squares regression operation of the CPU 12.

[0062] Upon completion of the plane fitting operation, the CPU 12 proceeds to step 330. In step 330, the CPU 12 examines each pixel of each of the tokens of the token pair t_c, I_n to calculate the z-score between each pixel of the tokens and the planar fit expressed by the equation of the .

[DDK Docket No. 590.1016]

least median of squares regression operation. When at least a threshold percentage of the pixels of each token of the pair (for example, 80%), are within a maximum z-score (for example, 0.75), then the neighboring token pair is marked in the token graph as indicating the same material in the image. After completion of step 330, the CPU 12 returns to decision block 324.

[0063] Upon exiting the routine of figure 7, the CPU 12 examines the token graph for all token pairs indicating the same material. The CPU 12 can achieve the examination through performance of a known technique such as, for example, a union find algorithm. (See, for example, Zvi Galil and Giuseppe F. Italiano. Data structures and algorithms for disjoint set union problems, ACM Computing Surveys, Volume 23, Issue 3 (September 1991), pages 319-344). As a simple example, assume a set of seven Type C tokens T₁, T₂, T₃, T₄, T₅, T₆, T₇. Assume that the result of the execution of figure 7, (performance of the adjacent planar analysis), indicates that tokens T₁ and T₂ are marked as the same material, and tokens T₁ and T₃ are also marked as the same material. Moreover, the results further indicate that tokens T₄ and T₅ are marked as the same material, and tokens T₅ and T₆ are also marked as the same material. The result of execution of the union find algorithm would therefore indicate that tokens (T₁, T₂, T₃) form a first group within the image consisting of a single material, tokens (T₄, T₅, T₆} form a second group within the image consisting of a single material, and token (T₇) forms a third group within the image consisting of a single material. The groups (T₁, T₂, T₃), (T₄, T₅, T₆)and (T₇) form three Type B tokens.

[0064] A third exemplary technique according to the present invention, for using Type C tokens to create Type B tokens, is a local token analysis. A local token approach generates Type C tokens using a window analysis of a scene depicted in an image file 18. Such tokens are designated as Type C_w tokens. Figure 8 is a flow chart for generating Type C_w tokens via the local token analysis technique, according to a feature of the present invention. [DDK Docket No. 590.1016]

[0065] In step 400, the CPU 12 places a window of fixed size, for example, a 33x33 pixel array mask, over a preselected series of scan positions over the image. The window can be a shape other than a square. The scan positions are offset from one another by a fixed amount, for example ¹A window size, and are arranged, in total, to fully cover the image. The window area of pixels at each scan position generates a Type C_w token, though not every pixel within the window at the respective scan position is in the Type C_w token generated at the respective scan position.

[0066] At each scan position (step 402), the CEU 12 operates, as a function of the pixels within the window, to fit each of a set of planes, one corresponding to the intensity of each color channel (for example, RGB), and an RGB line in RGB space, characterized by a start point I₀ and an end point I₁ of the colors within the window. The planar fit provides a spatial representation of the pixel intensity within the window, and the line fit provides a spectral representation of the pixels within the window.

[0067] For the planar fit, the planes are defined by the equations: R = X_RH ⁺ Y_R1H ⁺ Z_R G = X_0n + Y_0n, + Z_G B = X_Bn + Y_Bra + Z_B wherein parameter values X, Y and C are determined by CPU 12 by executing a mathematical operation such as the least median of squares regression discussed above, a least-squares estimator, such as singular value decomposition, or a robust estimator such as RANSAC (see, for example, M. A. Fischler, R. C. Bolles. Random Sample Consensus: A Paradigm for Model Fitting with Applications to Image Analysis and Automated Cartography. Comm. of the ACM, VoI 24, pp 381-395, 1981).

[0068] For the RGB line fit, the line is defined by:

I(r,g,b) = Io(r,g,b) + t(I,(r,g,b) - Io(r,g,b)) wherein the parameter t has a value between 0 and 1, and can be determined by the CPU 12 utilizing any of the mathematical techniques used to find the planar fit. / ;

[DDK Docket No. 590.1016]

[0069] At each scan position, after completion of step 402, the CPU 12 operates in step 404 to examine each pixel in the window in respect of each of the planar fit representation and RGB line representation corresponding to the respective window scan position. For each pixel, the CPU 12 determines an error factor for the pixel relative to each of the established planes and RGB line. The error factor is related to the absolute distance of the pixel to its projection on either from either the planar fit or the RGB line fit. The error factor can be a function of the noise present in the recording equipment or be a percentage of the maximum RGB value within the window, for example 1%. Any pixel distance within the error factor relative to either the spatial planar fit or the spectral line fit is labeled an inlier for the Type C_w token being generated at the respective scan position. The CPU 12 also records for the Type C_w token being generated at the respective scan position, a list of all inlier pixels.

[0070] At each scan position, after completion of step 404, the CPU 12 operates in step 406 to assign a membership value to each inlier pixel in the window. The membership value can be based upon the distance of the inlier pixel from either the planar fit or the RGB line fit. In one exemplary embodiment of the present invention, the membership value is the inverse of the distance used to determine inlier status for the pixel. In a second exemplary embodiment, a zero- centered Gaussian distribution with a standard deviation is executed to calculate membership values for the inlier pixels.

[0071] After all of the scan positions are processed to generate the Type C_w tokens, one per scan position, the CPU 12 operates to compile and store a token data list (step 408). The token data list contains two lists. A first list lists all of the pixels in the image file 18, and for each pixel, an indication of each Type C_w token to which it labeled as an inlier pixel, and the corresponding membership value. A second list lists all of the generated Type C_w tokens, and for each token an indication of the inlier pixels of the respective token, and the corresponding membership value. After compiling and storing the token data list, the CPU 12 exits the routine (step 410). [DDK Docket No. 590.1016]

[0072] Figure 9 is a flow chart for constructing Type B tokens from the Type C_w tokens generated via the local token analysis technique, according to a feature of the present invention. In step 420, the CPU 12 calculates a similarity of parameters of the spatial planer dimensions and spectral RGB lines of adjacent or overlapping Type C_w tokens generated through execution of the routine of figure 8. Overlapping and adjacent Type C_w tokens can be defined as tokens corresponding to scan positions that overlap or are contiguous. A similarity threshold can be set as a percentage of difference between each of the spatial planer dimensions and spectral RGB lines of two overlapping or adjacent Type C_w tokens being compared. The percentage can be a function of the noise of, for example, the camera 14 used to record the scene of the image file 18. All overlapping or adjacent Type C_w token pairs having a calculated similarity within the similarity threshold are placed on a list.

[0073] In step 422, the CPU 12 sorts the list of overlapping or adjacent Type C_w token pairs having a calculated similarity within the similarity threshold , in the order of most similar to least similar pairs. In step 424, the CPU 12 merges similar token pairs, in the order of the sort, and labeling pairs as per degree of similarity. Each merged token pair will be considered a Type _B token. In step 426, the CPU 12 stores the list of Type _B tokens, and exits the routine.

[0074] In one exemplary embodiment of the present invention, the CPU 12 compiles lists of Type _B tokens separately generated through each of and/or a combination of one or more of the arbitrary boundary removal, adjacent planar token merging, and local token analysis techniques. The determination of the combination of techniques used depends in part on whether a particular region of the image was filtered because of texturing of the image. Since each Type _B token generated through the described techniques likely represents a single material under varying illumination conditions, merging sufficiently overlapping Type _B tokens provides a resulting, merged Type _B token that represents a more extensive area of the image comprising a single (DDK Docket No. 590.1016]

material, and approaches the extent of a Type _A token. Sufficiently overlapping can be defined by satisfaction of certain pixel characteristic criteria, such as, for example:

A) The two Type _B tokens have at least n of the original Type _c tokens in common, for example, n = l

B) The two Type _B tokens have at least n pixels in common, for example, n = 20

C) The two Type _B tokens have at least n% overlap, that is at least n% of the pixels in a first one of the two Type _B tokens are also found in the second one of the two Type _B tokens or vice versa, wherein, for example n% = 10%.

D) The percentage of pixels in a smaller one of the two Type _B tokens, also found in the larger one of the two Type _B tokens is above a preselected threshold, for example 15%.

E) A preselected combination of criteria A-D.

[0075] Merging of two sufficiently overlapping Type _B tokens can be accomplished via a mathematical operation such as execution of the union find algorithm discussed above, hi the case of two overlapping Type _B tokens that do not satisfy the above discussed criteria, the overlapping pixels of the two tokens can be assigned to the larger one of the two Type _B tokens.

[0076] As a result of execution of the token generation and merging techniques according to features of the present invention, an image can be accurately divided into tokens representing discrete materials depicted in the scene, thus providing a basis for reduction of inaccuracies in image processing that may be caused by varying illumination conditions, for more robust computer processing of images.

[0077] In the preceding specification, the invention has been described with reference to specific exemplary embodiments and examples thereof. It will, however, be evident that various modifications and changes may be made thereto without departing from the broader spirit and [DDK Docket No. 590.1016]

scope of the invention as set forth in the claims that follow. The specification and drawings are accordingly to be regarded in an illustrative manner rather than a restrictive sense.

Claims

[DDK Docket No. 590.1016]What is claimed is:

1. An automated, computerized method for processing an image, comprising the steps of: identifying token regions in the image, each token region comprising a connected image region of similar color and intensity; and utilizing the identified token regions to generate single material token regions for use in processing material and illumination aspects of the image.

2. The method of claim 1 comprising the further step of modifying the image to filter out effects caused by a textured image.

3. The method of claim 1 wherein the step of utilizing the identified token regions to generate single material token regions for use in processing material and illumination aspects of the image is carried out by analyzing pixel characteristics of each identified token region.

4. The method of claim 3 wherein the step of analyzing pixel characteristics of each identified token region is carried out by performing a preselected set of techniques selected from the group consisting of arbitrary boundary removal, adjacent planar token merging and local token analysis.

5. The method of claim 3 wherein the step of analyzing pixel characteristics of each identified token region is carried out by performing a neck test.

6. The method of claim 3 wherein the step of analyzing pixel characteristics of each identified token region is carried out by performing an arbitrary boundary removal technique.

7. The method of claim 6 wherein the step of performing an arbitrary boundary removal technique is carried out by identifying a set of seed locations within an identified token region [DDK Docket No. 590.1016]

comprising a connected image region of similar color and intensity, and growing a set of token regions corresponding to the set of seed locations.

8. The method of claim 3 wherein the step of analyzing pixel characteristics of each identified token region is carried out by performing an adjacent planar token merging technique.

9. The method of claim 8 wherein the step of performing an adjacent planar token merging technique is carried out by fitting a planar representation of color information for a pair of neighboring identified token regions, and comparing individual pixel color information from each token of the pair to the planar representation.

10. The method of claim 3 wherein the step of analyzing pixel characteristics of each identified token region is carried out by performing a local token analysis technique.

11. The method of claim 10 wherein the step of performing a local token analysis technique is carried out by identifying, at each of a set of preselected window scan positions, a token region comprising a connected image region of similar color and intensity, as a function of a spatial planar fit representation and spectral RGB line representation corresponding to the respective window scan position, and determining a similarity of parameters of the spatial planer fit representation and spectral RGB line representation of tokens identified as a function of the planar fit representation and RGB line representations, for adjacent and contiguous window scan positions..

12. An automated, computerized method for processing an image, comprising the steps of: identifying spatio-spectral information for the image; and utilizing the spatio-spectral information to identify single material token regions for use in processing material and illumination aspects of the image. [DDK Docket No. 590.1016]

13. The method of claim 12 wherein the spatio-spectral information includes color information relevant to contiguous pixels of the image.

14. The method of claim 13 wherein the color information relevant to contiguous pixels of the image includes spectral relationships among contiguous pixels, and spacial extent of the pixel spectral characteristics relevant to a single material.

15. A computer system which comprises: a CPU; and a memory storing an image file; the CPU arranged and configured to execute a routine to identify token regions in an image depicted in the image file, each token region comprising a connected image region of similar color and intensity and to utilize the identified token regions to generate single material token regions for use in processing material and illumination aspects of the image.

16. A computer system which comprises: a CPU; and a memory storing an image file; the CPU arranged and configured to execute a routine to identifying spatio-spectral information for an image depicted in the image file and to utilize the spatio-spectral information to identify single material token regions for use in processing material and illumination aspects of the image.