US5481620A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Adaptive vision system
Assignee: EIDP Inc
•
Filing: 1991-09-27
•
Granted: 1996-01-02
•
Expires: 2011-09-27
Abstract
Abstract The present invention relates to image analysis methods and systems for identifying objects in a background by generating a description, which may be either a histogram or co-occurrence matrix, of the gray level space of the image by using an entropic kernel to recursively analyze the gray level space for candidate objects and validating the presence of valid objects by comparing the candidate object attribute values to a defined set of valid object attribute values contained in a driver. The present invention includes recursive, iterative and parallel processing methods. The methods may be used in a wide variety of industrial inspection techniques, including colony counting and the identification of discrete features in carpets and of pigment elements embedded in a polymer.
Inventors
- 👤 Akhileswar G. Vaidyanathan
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 22:03
CPC Classifications
G; G06; G06T; G06T11/00; G06T11/40; G06T7/00; G06T7/0002; G06T7/0012; G06T7/10; G06T7/11; G06T7/136; G06T9/00; G06T9/20; G06V; G06V10/00; G06V10/40; G06V10/46; G06V20/00; G06V20/60; G06V20/69; G06V20/695; G06T2207/00; G06T2207/30; G06T2207/30004; G06T2207/30024; G06T2207/30108; G06T2207/30128
Claims Analysis
Total Claims: 70
Claim 1
Independent Claim
192 words
A method of identifying at least one valid object having at least one predetermined attribute value in a background, comprising the steps of: (a) generating an image of the object and the background; (b) generating a gray level histogram of the image, the gray level histogram having an entropy function; (c) entropically selecting a threshold gray level such that the entropy function of the histogram is maximized; (d) searching the image using the entropically selected threshold gray level for at least one candidate object, wherein the candidate object has at least one candidate object attribute value; (e) validating the candidate object having the valid object predetermined attribute value to identify [the]a valid object; (f) subdividing the gray level histogram into an upper histogram and a lower histogram using the entropic threshold gray level as defined by step (c) as an upper delimiter and a lower delimiter; and (g) recursively repeating steps (c)-(f) for each of the upper and lower histograms, wherein the repetition of step (c) selects a next successive entropic threshold gray level, thereby recursively partitioning the gray level histogram until a predetermined minimum number of new valid objects is identified.
Claim 2
Independent Claim
192 words
A method of identifying at least one valid object having at least one predetermined attribute value in a background, comprising the steps of: (a) generating an image of the object and the background; (b) generating a gray level histogram of the image, the gray level histogram having an entropy function; (c) entropically selecting a threshold gray level such that the entropy function of the histogram is maximized; (d) searching the image using the entropically selected threshold gray level for at least one candidate object, wherein the candidate object has at least one candidate object attribute value; (e) validating the candidate object having the valid object predetermined attribute value to identify [the]a valid object; (f) subdividing the gray level histogram into an upper histogram and a lower histogram using the entropic threshold gray level as defined by step (c) as an upper delimiter and a lower delimiter; and (g) recursively repeating steps (c)-(f) for each of the upper and lower histograms, wherein the repetition of step (c) selects a next successive entropic threshold gray level, thereby recursively partitioning the gray level histogram until a predetermined minimum number of new valid objects is identified.
Claim 3
Independent Claim
199 words
A method of identifying at least one valid discrete feature in a carpet, the discrete feature having at least one valid feature predetermined attribute value, comprising the steps of: (a) generating an image of the feature and the carpet; (b) generating a gray level histogram of the image, the gray level histogram having an entropy function; (c) entropically selecting a threshold gray level such that the entropy function of the histogram is maximized; (d) searching the image using the entropically selected threshold gray level for at least one candidate feature, wherein the candidate feature has at least one candidate feature attribute value; (e) validating the candidate feature having the valid feature predetermined attribute value to identify a valid feature; (f) subdividing the gray level histogram into an upper histogram and a lower histogram using the entropically selected threshold gray level as defined in step (c) as an upper delimiter and a lower delimiter; and (g) recursively repeating steps (c)-(f) for each of the upper and lower histograms, wherein the repetition of step (c) selects a next successive entropic threshold gray level, thereby recursively partitioning the gray level histogram until a predetermined minimum number of new valid features is identified.
Claim 4
Independent Claim
199 words
A method of identifying at least one valid discrete feature in a carpet, the discrete feature having at least one valid feature predetermined attribute value, comprising the steps of: (a) generating an image of the feature and the carpet; (b) generating a gray level histogram of the image, the gray level histogram having an entropy function; (c) entropically selecting a threshold gray level such that the entropy function of the histogram is maximized; (d) searching the image using the entropically selected threshold gray level for at least one candidate feature, wherein the candidate feature has at least one candidate feature attribute value; (e) validating the candidate feature having the valid feature predetermined attribute value to identify a valid feature; (f) subdividing the gray level histogram into an upper histogram and a lower histogram using the entropically selected threshold gray level as defined in step (c) as an upper delimiter and a lower delimiter; and (g) recursively repeating steps (c)-(f) for each of the upper and lower histograms, wherein the repetition of step (c) selects a next successive entropic threshold gray level, thereby recursively partitioning the gray level histogram until a predetermined minimum number of new valid features is identified.
Claim 5
Dependent Claim
14 words
The method as claimed in claim 1, wherein the predetermined minimum number is zero.
Claim 6
Dependent Claim
80 words
The method as claimed in claim 1, wherein the selecting step includes the sub-steps of: (i) sequentially partitioning the gray level histogram at each gray level into a first and a second partition, (ii) computing the entropy function for each partition, where the entropy function of the histogram is defined as the sum of the entropy functions for the first and second partitions, and (iii) selecting the threshold gray level such that the entropy function of the histogram is maximized.
Claim 7
Independent Claim
208 words
A method of identifying at least one valid pigment element embedded in a polymer, the pigment element having at least one valid pigment element predetermined attribute value, comprising the steps of: (a) generating an image of the pigment element and the polymer; (b) generating a gray level histogram of the image, the gray level histogram having an entropy function; (c) entropically selecting a threshold gray level such that the entropy function of the histogram is maximized; (d) searching the image using the entropically selected threshold gray level for at least one candidate pigment element, wherein the candidate pigment element has at least one candidate pigment element attribute value; (e) validating the candidate pigment element having the valid pigment element predetermined attribute value to identify a valid pigment element; (f) subdividing the gray level histogram into an upper histogram and a lower histogram using the entropically selected threshold gray level as defined in step (c) as an upper delimiter and a lower delimiter; and (g) recursively repeating steps (c)-(f) for each of the upper and lower histograms, wherein the repetition of step (c) selects a next successive entropic threshold gray level, thereby recursively partitioning the gray level histogram until a predetermined minimum number of new valid elements is identified.
Claim 8
Independent Claim
208 words
A method of identifying at least one valid pigment element embedded in a polymer, the pigment element having at least one valid pigment element predetermined attribute value, comprising the steps of: (a) generating an image of the pigment element and the polymer; (b) generating a gray level histogram of the image, the gray level histogram having an entropy function; (c) entropically selecting a threshold gray level such that the entropy function of the histogram is maximized; (d) searching the image using the entropically selected threshold gray level for at least one candidate pigment element, wherein the candidate pigment element has at least one candidate pigment element attribute value; (e) validating the candidate pigment element having the valid pigment element predetermined attribute value to identify a valid pigment element; (f) subdividing the gray level histogram into an upper histogram and a lower histogram using the entropically selected threshold gray level as defined in step (c) as an upper delimiter and a lower delimiter; and (g) recursively repeating steps (c)-(f) for each of the upper and lower histograms, wherein the repetition of step (c) selects a next successive entropic threshold gray level, thereby recursively partitioning the gray level histogram until a predetermined minimum number of new valid elements is identified.
Claim 9
Dependent Claim
81 words
The method as claimed in claim 2, wherein the searching step includes the sub-steps of: (i) scanning a portion of the image for at least one candidate object using the entropically selected threshold gray level, wherein the portion of the image comprises a plurality of pixels and each pixel has a gray level value less than the upper delimiter plus a predetermined increment, and (ii) tracing the candidate object having boundary gray levels determined by the entropically selected threshold gray level.
Claim 10
Dependent Claim
41 words
The method as claimed in claim 1, wherein the validating step includes the sub-steps of: (i) calculating the candidate object attribute values, and (ii) comparing the candidate object attribute values to the valid object predetermined attribute values to validate candidate objects.
Claim 11
Dependent Claim
22 words
The method as claimed in claim 7, wherein the calculating sub-step further includes the sub-step of storing the candidate object attribute values.
Claim 12
Dependent Claim
27 words
The method as claimed in claim 1, wherein the validating step further includes the sub-step of checking whether the candidate objects are relatively lighter than the background.
Claim 13
Dependent Claim
36 words
The method as claimed in claim 1, wherein the validating step further includes the sub-steps of: (i) inverting the image after step (a), and (ii) checking whether the candidate objects are relatively darker than the background.
Claim 14
Dependent Claim
35 words
The method as claimed in claim 1, wherein the validating step further includes the sub-step of checking for redundancies of the valid object and resolving the redundancies to prevent multiple identification of the valid object.
Claim 15
Dependent Claim
90 words
The method as claimed in claim 11, wherein the valid object comprises an homogeneous object and inhomogeneous object and further wherein the redundancy checking sub-step further includes the sub-steps of: (i) comparing the areas of a plurality of valid objects and designating one of the valid objects as a large valid object and another of the valid objects as a small valid object, and (ii) determining whether the small valid object is contained within the large valid object as defined by the four extremum points of the large valid object.
Claim 16
Dependent Claim
41 words
The method as claimed in claim 12, wherein the redundancy checking sub-step is performed to resolve redundancies in the inhomogeneous objects and further includes the sub-step of deleting the large object when the large object contains more than one small object.
Claim 17
Dependent Claim
61 words
The method as claimed in claim 12, wherein the redundancy checking sub-step is performed to resolve redundancies in the inhomogeneous objects and further includes the sub-steps of: (i) calculating the average edge contrast of the large and small valid objects, and (ii) deleting the object having the smaller edge contrast when the large valid object contains only one small valid object.
Claim 18
Dependent Claim
75 words
The method as claimed in claim 12, wherein the redundancy checking sub-step is performed to resolve redundancies in the homogeneous objects and further includes the sub-steps of: (i) calculating the average edge contrast of the large and small valid objects, and (ii) deleting the large object where the average edge contrast of the large object is less than the average edge contrast of the small object and is less than a predetermined minimum edge contrast.
Claim 19
Dependent Claim
77 words
The method as claimed in claim 12, wherein the redundancy checking sub-step is performed to resolve redundancies in the homogeneous objects and further includes the sub-steps of: (i) calculating the edge contrast of the large and small valid objects, and (ii) deleting the small valid object where the average edge contrast of the large valid object is greater than the average edge contrast of the small valid object and is greater than a predetermined minimum edge contrast.
Claim 20
Dependent Claim
34 words
The method as claimed in claim 1, further including the step of performing a final check for redundancies of the valid object and resolving the redundancies to prevent multiple identification of the valid object.
Claim 21
Dependent Claim
88 words
The method as claimed in claim 17, wherein the valid objects comprise a plurality of homogeneous objects or a plurality of inhomogeneous objects and further wherein the final redundancy checking step further includes the sub-steps of: (i) comparing the areas of a plurality of valid objects and designating one of the valid objects as a large valid object and the other of the valid objects as a small valid object, and (ii) deleting the large valid object when the small valid object and the large valid object overlap.
Claim 22
Dependent Claim
33 words
The method as claimed in claim 1, further including the step of filtering the image after step (e), and wherein the valid object comprises a homogenous valid object or an inhomogeneous valid object.
Claim 23
Dependent Claim
33 words
The method as claimed in claim 1, further including the step of filtering the image after step (g) and wherein the valid object comprises a homogeneous valid object or an inhomogeneous valid object.
Claim 24
Dependent Claim
62 words
The method as claimed in claim 20, wherein the filtering step includes the sub-step of deleting the inhomogeneous valid object if both of the following conditions are met: (i) the inhomogeneous valid object has an area less than a predetermined minimum area, (ii) the inhomogeneous valid object is located within a predetermined minimum pixel distance from the edge of the image boundary.
Claim 25
Dependent Claim
41 words
The method as claimed in claim 20, wherein the filtering step includes the sub-step of determining when the number of inhomogeneous valid objects retained after the final redundancy check is performed is greater than or equal to a predetermined maximum number.
Claim 26
Dependent Claim
97 words
The method as claimed in claim 22, wherein the filtering step further includes the sub-step of deleting the inhomogeneous valid object if: (i) the inhomogeneous valid object was never contained in another valid object, (ii) the inhomogeneous valid object has an area less than a predetermined minimum area, and (iii) at least one of the following conditions is met: (A) the inhomogeneous valid object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the inhomogeneous valid object has an area greater than or equal to a predetermined minimum area.
Claim 27
Dependent Claim
150 words
The method as claimed in claim 22, wherein the filtering step further includes the sub-step of deleting the inhomogeneous valid object if: (i) the inhomogeneous valid object was never contained in another valid object, (ii) the inhomogeneous valid object has an area greater than or equal to a predetermined minimum area, (iii) both of the following conditions are met: (A) the inhomogeneous object has an edge contrast less than a predetermined minimum edge contrast, and (B) the inhomogeneous object has a center of mass gray level less than the entropically selected threshold gray level for the lower histogram of step (f), and (iv) at least one of the following conditions is met: (A) the inhomogeneous valid object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the inhomogeneous valid object has an area greater than or equal to a predetermined minimum area.
Claim 28
Dependent Claim
45 words
The method as claimed in claim 20, wherein the filtering step includes the sub-step of determining when the number of inhomogeneous valid objects retained after the final redundancy check is performed is greater than a predetermined minimum number and less than a predetermined maximum number.
Claim 29
Dependent Claim
92 words
The method as claimed in claim 25 wherein the filtering step includes the sub-step of deleting the inhomogeneous valid object if: (i) the inhomogeneous object was never contained within another valid object, (ii) the inhomogeneous object area is less than a predetermined area, and (iii) at least one of the following conditions is met: (A) the inhomogeneous valid object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the inhomogeneous valid object has an area greater than or equal to a predetermined minimum area.
Claim 30
Dependent Claim
146 words
The method as claimed in claim 25, wherein the filtering step includes the sub-step of deleting the inhomogeneous valid object if: (i) the inhomogeneous valid object was previously contained in another valid object: (ii) all of the following conditions are met: (A) the inhomogeneous valid object edge contrast is less than a predetermined minimum edge contrast, (B) the inhomogeneous valid object center of mass gray level is less than the entropically selected threshold gray level as defined in step (c), and (C) the inhomogeneous valid object area is less than or equal to a predetermined minimum area, and (iii) at least one of the following conditions is met: (A) the inhomogeneous valid object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the inhomogeneous valid object has an area greater than or equal to a predetermined minimum area.
Claim 31
Dependent Claim
145 words
The method as claimed in claim 25, wherein the filtering step includes the sub-step of deleting the inhomogeneous valid object if: (i) the inhomogeneous valid object was never contained in another valid object, (ii) the inhomogeneous valid object area is greater than or equal to a predetermined minimum area, (iii) both of the following conditions are met: (A) the inhomogeneous valid object edge contrast is less than a predetermined minimum edge contrast, and (B) the inhomogeneous object center of mass gray level is less than the entropically selected threshold gray level as defined in step (c), and (iv) at least one of the following conditions is met: (A) the inhomogeneous valid object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the inhomogeneous valid object has an area greater than or equal to a predetermined minimum area.
Claim 32
Dependent Claim
41 words
The method as claimed in claim 20, wherein the filtering step includes the sub-step of determining when the number of inhomogeneous valid objects retained after the final redundancy check is performed is less than or equal to a predetermined minimum number.
Claim 33
Dependent Claim
91 words
The method as claimed in claim 29, wherein the filtering step includes the sub-step of deleting the inhomogeneous valid object if: (i) the object was never contained in another valid object, (ii) the object area is less than a predetermined minimum area, and (iii) at least one of the following conditions is met: (A) the inhomogeneous valid object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the inhomogeneous valid object has an area greater than or equal to a predetermined minimum area.
Claim 34
Dependent Claim
142 words
The method as claimed in claim 29, wherein the filtering step includes the sub-step of deleting the inhomogeneous valid object if: (i) the inhomogeneous valid object was never contained in another valid object, (ii) the inhomogeneous valid object area is greater than or equal to a predetermined minimum area, (iii) both of the following conditions are met: (A) the inhomogeneous valid object edge contrast is less than a predetermined minimum edge contrast, and (B) the inhomogeneous valid object area is greater than a predetermined minimum area and less than a predetermined maximum area, and (iv) at least one of the following conditions is met: (A) the inhomogeneous valid object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the inhomogeneous valid object has an area greater than or equal to a predetermined minimum area.
Claim 35
Dependent Claim
139 words
The method as claimed in claim 29, wherein the filtering step includes the sub-step of deleting the inhomogeneous valid object if: (i) the inhomogeneous valid object was previously contained in another valid object, (ii) both of the following conditions are met. (A) the inhomogeneous valid object center of mass gray level is less than the entropically selected threshold gray level of step (c), (B) the inhomogeneous object area is greater than a predetermined minimum area, and (c) the inhomogeneous object area is greater than or equal to a predetermined maximum area, (iii) at least one of the following conditions is met: (A) the inhomogeneous valid object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the inhomogeneous valid object has an area greater than or equal to a predetermined minimum area.
Claim 36
Dependent Claim
174 words
The method as claimed in claim 29, wherein the filtering step includes the sub-step of deleting the inhomogeneous valid object if: (i) the inhomogeneous valid object was previously contained within another valid object, (ii) at least one of the following conditions is met: (A) the inhomogeneous valid object center of mass gray level is greater than or equal to the entropically selected threshold gray level as defined in step (c), (B) the object area is less than or equal to a predetermined minimum area, and (C) the inhomogeneous object area is greater than or equal to a predetermined maximum area, (iii) the inhomogeneous object center of mass gray level is less than the entropically selected threshold gray level for the lower histogram of step (f), and (iv) at least one of the following conditions is met: (A) the inhomogeneous valid object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the inhomogeneous valid object has an area greater than or equal to a predetermined minimum area.
Claim 37
Dependent Claim
63 words
The method as claimed in claim 20, wherein the filtering step includes the sub-step of deleting the homogenous valid object if both of the following conditions are met: (i) the homogenous valid object is located within a predetermined minimum pixel distance from the edge of the image boundary, and (ii) the homogeneous valid object has an area less than a predetermined minimum area.
Claim 38
Dependent Claim
83 words
The method as claimed in claim 20, wherein the filtering step includes the sub-step of deleting the homogeneous valid object if: (i) the homogeneous valid object has an area smaller than a predetermined minimum area, and (ii) at least one of the following conditions is met: (A) the homogeneous valid object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the homogenous valid object area is greater than or equal to a predetermined minimum area.
Claim 39
Dependent Claim
120 words
The method as claimed in claim 20, wherein the filtering step includes the sub-step of deleting the homogeneous valid object if: (i) the homogeneous valid object has an area greater than or equal to a predetermined minimum area, and (ii) at least one of the following conditions is met: (A) the homogenous object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the homogenous object area is greater than or equal to a predetermined minimum area, and (iii) both of the following conditions are met: (A) the homogeneous object edge contrast is less than a predetermined minimum edge contrast, and (B) the homogeneous object area is less than a predetermined minimum area.
Claim 40
Dependent Claim
171 words
The method as claimed in claim 20, wherein the filtering step includes the sub-step of deleting the homogeneous valid object if: (i) the homogeneous valid object has an area greater than or equal to a predetermined minimum area, (ii) at least one of the following conditions is met: (A) the homogenous object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the homogenous object area is greater than or equal to a predetermined minimum area, (iii) at least one of the following conditions is met: (A) the homogeneous object edge contrast is greater than or equal to a predetermined minimum edge contrast, and (B) the homogenous object area is greater than or equal to a predetermined maximum area, and (iv) both of the following conditions are met: (A) the homogenous object center of mass gray level is less than the entropically selected threshold gray level of step (c), and (B) the homogeneous object edge contrast is less than a predetermined minimum edge contrast.
Claim 41
Dependent Claim
215 words
The method as claimed in claim 20, wherein the filtering step includes the sub-step of deleting the homogeneous valid object if: (i) the homogeneous valid object has an area greater than or equal to a predetermined minimum area, (ii) at least one of the following conditions is met: (A) the homogenous object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the homogenous object area is greater than or equal to a predetermined minimum area, (iii) at least one of the following conditions is met: (A) the homogeneous object edge contrast is greater than or equal to a predetermined minimum edge contrast, and (B) the homogenous object area is greater than or equal to a predetermined maximum area, (iv) at least one of the following conditions is met: (A) the homogenous object center of mass gray level is greater than or equal to the entropically selected threshold gray level of step (c), and (B) the homogeneous object edge contrast is greater than or equal to a predetermined minimum edge contrast, and (v) both of the following conditions are met: (A) the homogenous object shape factor is less than a predetermined shape factor, and (B) the homogenous object edge contrast is less than a predetermined minimum edge contrast.
Claim 42
Dependent Claim
238 words
The method as claimed in claim 20, wherein the filtering step includes the sub-step of deleting the homogeneous valid object if: (i) the homogeneous valid object has an area greater than or equal to a predetermined minimum area, (ii) at least one of the following conditions is met: (A) the homogenous object is located outside a predetermined minimum pixel distance from the edge of the image boundary, and (B) the homogenous object area is greater than or equal to a predetermined minimum area, (iii) at least one of the following conditions is met: (A) the homogeneous object edge contrast is greater than or equal to a predetermined minimum edge contrast, and (B) the homogenous object area is greater than or equal to a predetermined maximum area, (iv) at least one of the following conditions is met: (A) the homogenous object center of mass gray level is greater than or equal to the entropically selected threshold gray level of step (c), (B) the homogeneous object edge contrast is greater than or equal to a predetermined minimum edge contrast, and (v) at least one of the following conditions is met: (A) the homogenous object shape factor is greater than or equal to a predetermined shape factor, and (B) the homogenous object edge contrast is greater than or equal to a predetermined minimum edge contrast, and (vi) the homogenous object edge contrast is less than a predetermined absolute minimum edge contrast.
Claim 43
Dependent Claim
81 words
The method as claimed in claim 1, wherein the image comprises at least one isolated object identified by the degree of circularity thereof and at least one candidate clump of valid objects, the candidate clump having an area greater than the mean area of the isolated valid objects and a shape factor less than a predetermined clump shape factor, further including the steps of: (i) identifying the candidate clump, and (ii) determining the number of valid objects in the candidate clump.
Claim 44
Dependent Claim
138 words
The method as claimed in claim 40, wherein the determining sub-step includes the sub-steps of: (i) creating a distance buffer, wherein the distance buffer comprises a plurality of distance values representing the distance of each perimeter point of the candidate clump to the center of mass of the candidate clump, the distance values including a plurality of valleys and peaks; (ii) searching the buffer for a first valley using a hysteresis-based, valley-finding algorithm, (iii) shifting the distance buffer by a distance equal to the distance to the first valley from a first distance value as defined by a first predetermined point on the perimeter of the candidate clump, and (iv) counting the number of peaks in the shifted buffer using a hysteresis-based, peak-finding algorithm to calculate a first value for the number of valid objects in the clump.
Claim 45
Dependent Claim
44 words
The method as claimed in claim 41, wherein the counting sub-step further includes the sub-step of dividing the number of peaks by two to obtain a result, rounding the result up to the next higher integer and adding one to the next higher integer.
Claim 46
Independent Claim
53 words
The method as claimed in claims 41, wherein the determining step further includes the sub-step of calculating the area of the candidate clump and dividing the area of the candidate clump by the mean area of isolated valid object to calculate a second value for the number of valid objects in the clump.
Claim 47
Independent Claim
68 words
The method as claimed in claims 43, wherein the determining step further includes the sub-step of calculating the area of the candidate clump and dividing the area of the candidate clump by the mean area of the isolated valid objects minus one-half the standard deviation of the mean area of the isolated valid object to calculate a third value for the number of valid objects in the clump.
Claim 48
Dependent Claim
58 words
The method as claimed in claim 44, wherein the determining step further includes the sub-steps of: (i) computing the average value of the second and third values, (ii) comparing the average value to the first value, and (iii) selecting the average value as the number of valid objects if the average value is greater than the first value.
Claim 49
Dependent Claim
61 words
The method as claimed in claim 44, wherein the determining step further includes the sub-steps of: (i) computing the average value of the second and third values, (ii) comparing the average value to the first value, and (iii) selecting the first value as the number of valid objects if the average value is less than or equal to the first value.
Claim 50
Dependent Claim
56 words
The method as claimed in claim 44, wherein the determining step further includes the sub-steps of: (i) computing the average value of the second and third values, (ii) comparing the average value to the first value, and (iii) selecting the average value as the number of valid objects if the first value is greater than three.
Claim 51
Dependent Claim
59 words
The method as claimed in claim 44, wherein the determining step further includes the sub-steps of: (i) computing the average value of the second and third values, (ii) comparing the average value to the first value, and (iii) selecting the first value as the number of valid objects if the average value is less than or equal to three.
Claim 52
Independent Claim
31 words
The method as claimed in 45 or 47, further including the step of tracing the clump in a singular color indicative of the number of valid objects in the candidate clump.
Claim 53
Independent Claim
60 words
The method as claimed in 46 or 48, further including the step of tracing the clump in a color plurality of colors indicative of the number of valid objects in the candidate clump, wherein all the points of the perimeter of the clump of valid objects between the adjacent valleys on the distance buffer are traced in the same color.
Claim 54
Independent Claim
205 words
A system for identifying at least one valid object having at least one predetermined attribute value in a background, comprising: (a) means for generating an image of the object and the background; and (b) computer means including: (i) a driver for storing the definition of the valid object, and (ii) an entropic kernel for: (A) generating a gray level histogram of the image, (B) entropically selecting a threshold gray level such that the entropy function of the histogram is maximized, (C) searching the image using the entropically selected threshold gray level for at least one candidate object, wherein the candidate object has at least one candidate object attribute value, (D) validating the candidate object having the valid object predetermined attribute value to identify a valid object, (E) subdividing the gray level histogram into an upper histogram and a lower histogram using the entropic threshold gray level as defined by step (B) as an upper delimiter and a lower delimiter, and (F) recursively repeating steps (B)-(E) for each of the upper and lower histograms, wherein the repetition of step (B) selects a next successive entropic threshold gray level, thereby recursively partitioning the gray level histogram until a predetermined minimum number of new valid objects is identified.
Claim 55
Independent Claim
205 words
A system for identifying at least one valid object having at least one predetermined attribute value in a background, comprising: (a) means for generating an image of the object and the background; and (b) computer means including: (i) a driver for storing the definition of the valid object, and (ii) an entropic kernel for: (A) generating a gray level histogram of the image, (B) entropically selecting a threshold gray level such that the entropy function of the histogram is maximized, (C) searching the image using the entropically selected threshold gray level for at least one candidate object, wherein the candidate object has at least one candidate object attribute value, (D) validating the candidate object having the valid object predetermined attribute value to identify a valid object, (E) subdividing the gray level histogram into an upper histogram and a lower histogram using the entropic threshold gray level as defined by step (B) as an upper delimiter and a lower delimiter, and (F) recursively repeating steps (B)-(E) for each of the upper and lower histograms, wherein the repetition of step (B) selects a next successive entropic threshold gray level, thereby recursively partitioning the gray level histogram until a predetermined minimum number of new valid objects is identified.
Claim 56
Dependent Claim
15 words
The system as claimed in claim 51, wherein the image generating means comprises a camera.
Claim 57
Dependent Claim
20 words
The system as claimed in claim 51, wherein the computer means further includes a frame grabber for storing the image.
Claim 58
Dependent Claim
17 words
The system as claimed in claim 51, wherein the computer means further includes a video digitizer for
Claim 59
Dependent Claim
23 words
The system as claimed in claim 51, wherein the computer means further includes a post-scan filter for removing redundancies in overlapping valid objects.
Claim 60
Independent Claim
194 words
A method of counting at least one valid biological colony having at least one predetermined attribute value in a background, comprising the steps of: (a) generating an image of the colony and the background; (b) generating a gray level histogram of the image, the gray level histogram having an entropy function; (c) entropically selecting a threshold gray level such that the entropy function of the histogram is maximized; (d) searching the image using the entropically selected threshold gray level for at least one candidate colony, wherein the candidate colony has at least one candidate colony attribute value; (e) validating the candidate colony having the valid colony predetermined attribute value to identify a valid colony; (f) subdividing the gray level histogram into an upper histogram and a lower histogram using the entropically selected threshold gray level as defined in step (c) as an upper delimiter and a lower delimiter; and (g) recursively repeating steps (c)-(f) for each of the upper and lower histograms, wherein the repetition of step (c) selects a next successive entropic threshold gray level, thereby recursively partitioning the gray level histogram until a predetermined minimum number of new valid colonies is counted.
Claim 61
Independent Claim
194 words
A method of counting at least one valid biological colony having at least one predetermined attribute value in a background, comprising the steps of: (a) generating an image of the colony and the background; (b) generating a gray level histogram of the image, the gray level histogram having an entropy function; (c) entropically selecting a threshold gray level such that the entropy function of the histogram is maximized; (d) searching the image using the entropically selected threshold gray level for at least one candidate colony, wherein the candidate colony has at least one candidate colony attribute value; (e) validating the candidate colony having the valid colony predetermined attribute value to identify a valid colony; (f) subdividing the gray level histogram into an upper histogram and a lower histogram using the entropically selected threshold gray level as defined in step (c) as an upper delimiter and a lower delimiter; and (g) recursively repeating steps (c)-(f) for each of the upper and lower histograms, wherein the repetition of step (c) selects a next successive entropic threshold gray level, thereby recursively partitioning the gray level histogram until a predetermined minimum number of new valid colonies is counted.
Claim 62
Dependent Claim
80 words
The method as claimed in claim 56, wherein the selecting step includes the sub-steps of: (i) sequentially partitioning the gray level histogram at each gray level into a first and a second partition, (ii) computing the entropy function for each partition, where the entropy function of the histogram is defined as the sum of the entropy functions for the first and second partitions, and (iii) selecting a threshold gray level such that the entropy function of the histogram is maximized.
Claim 63
Dependent Claim
53 words
The method as claimed in claim 56, wherein the searching step includes the sub-steps of: (i) scanning the image for at least one candidate colony using the entropically selected threshold gray level, and (ii) tracing the candidate colony having at least one boundary gray level determined by the entropically selected threshold gray level.
Claim 64
Dependent Claim
42 words
The method as claimed in claim 56, wherein the validating step includes the sub-steps of: (i) calculating the candidate colony attribute values, and (ii) comparing the candidate colony attribute values to the valid colony predetermined attribute values to validate the candidate colony.
Claim 65
Dependent Claim
35 words
The method as claimed in claim 56, wherein the validating step further includes the sub-step of checking for redundancies of the validated colony and resolving the redundancies to prevent multiple identification of the valid colony.
Claim 66
Dependent Claim
34 words
The method as claimed in claim 56, further including the step of performing a final check for redundancies of the valid object and resolving the redundancies to prevent multiple identification of the valid object.
Claim 67
Dependent Claim
18 words
The method as claimed in claim 56, further including the step of filtering the image after step g.
Claim 68
Dependent Claim
32 words
The method as claimed in claim 56, further including the step of determining the number of valid colonies in a candidate clump, wherein the candidate clump comprises a plurality of valid colonies.
Claim 69
Independent Claim
157 words
A method of identifying at least one valid object having at least one predetermined attribute value in a background, comprising the steps of: (a) generating an image of the object and the background; (b) generating a histogram representative of the entire image, the gray level histogram having an entropy function; (c) generating a plurality of gray level upper and lower histograms of the image from the histogram, each gray level upper and lower histogram having a respective entropy function; (d) automatically selecting a threshold gray level value for each upper and lower histogram such that the entropy function of each histogram is maximized; (e) searching the image using the automatically selected threshold gray level value for each upper and lower histogram for at least one candidate object, wherein the candidate object has at least one candidate object attribute value; and (f) validating the candidate object having the valid object predetermined attribute value to identify the valid object.
Claim 70
Independent Claim
157 words
A method of identifying at least one valid object having at least one predetermined attribute value in a background, comprising the steps of: (a) generating an image of the object and the background; (b) generating a histogram representative of the entire image, the gray level histogram having an entropy function; (c) generating a plurality of gray level upper and lower histograms of the image from the histogram, each gray level upper and lower histogram having a respective entropy function; (d) automatically selecting a threshold gray level value for each upper and lower histogram such that the entropy function of each histogram is maximized; (e) searching the image using the automatically selected threshold gray level value for each upper and lower histogram for at least one candidate object, wherein the candidate object has at least one candidate object attribute value; and (f) validating the candidate object having the valid object predetermined attribute value to identify the valid object.
References Cited (Backward Citations)
US3736432A
Cited
US3999047A
Cited
US3811036A
Cited
US3873974A
Cited
US4183013A
Cited
US4453266A
Cited
US4618989A
Cited
US4747153A
Cited
US4637053A
Cited
US4959869A
Cited
JPS6260069A
Cited
FR2602074A1
Cited
US4809349A
Cited
US5046118A
Cited
US5083313A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-01-01 | 1999-07-03 | 2000-01-02 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-01-01 | 2003-07-03 | 2004-01-02 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-01-01 | 2007-07-03 | 2008-01-02 | $7700.00 | Window Closed / Lapsed |