Patent US3468428A successfully refreshed from Google Patents.
Patent US5539191A successfully refreshed from Google Patents.
US5539191A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Method and apparatus for decoding unresolved bar code profiles using edge finding circuitry
Assignee: Intermec IP Corp
•
Filing: 1995-06-22
•
Granted: 1996-07-23
•
Expires: 2015-06-22
Abstract
Abstract A method and apparatus for decoding profiles which fail to resolve narrow elements in symbologies employing one element type having only a single width, first begins by producing a series of counts from the symbol using standard waveshaping and counting circuitry. Second, an X-dimension for the 1-wide elements is determined based on the first few counts corresponding to bars after the counts corresponding to the quiet zone. The Start and Stop characters are located and the method determines whether the symbol is in focus. If the symbol is out-of-focus, then groups of an odd number of 1-wide elements are converted to large counts that correspond to pseudo elements (e.g., wide bars in a symbology containing only 1-wide narrow bars). The method groups counts into individual characters, and divides all pseudo elements into individual 1-wide elements. The method thereafter decodes the symbol.
Inventors
- 👤 H. Sprague Ackley
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 04:49
CPC Classifications
G; G06; G06K; G06K7/00; G06K7/10; G06K7/14; G06K7/1404; G06K7/1439; G06K7/1452
Claims Analysis
Total Claims: 24
Claim 1
Independent Claim
258 words
A method of decoding a bar code symbol representing a plurality of characters, the bar code symbol including a plurality of relatively spaced bars having a first width, and spaces between the bars having the first width, one of the bars and the spaces having wide elements that have at least a second width, while the other of the bars and spaces have only the first width, the second width being greater than the first width, the method of decoding the bar code symbol comprising the steps of: receiving light reflected from the bar code symbol and producing an output signal therefrom that represents a reflectance of the bars and spaces comprising the bar code symbol; receiving the output signal and producing a count signal having a series of counts that identifies at least some of the wide elements, and which falsely identifies at least one group of the bars and spaces having the first width as a pseudo wide element having a total width approximately equal to a sum of the first widths of the bars and spaces in the at least one group; determining a narrow width of the bars and spaces having the first width based on the count signal; dividing the pseudo wide element by the narrower width to identify the bars and spaces having the first width in the at least one group; and determining the information encoded in the bar code symbol based on the count signal and the bars and spaces having the first width divided from the pseudo wide element.
Claim 2
Independent Claim
258 words
A method of decoding a bar code symbol representing a plurality of characters, the bar code symbol including a plurality of relatively spaced bars having a first width, and spaces between the bars having the first width, one of the bars and the spaces having wide elements that have at least a second width, while the other of the bars and spaces have only the first width, the second width being greater than the first width, the method of decoding the bar code symbol comprising the steps of: receiving light reflected from the bar code symbol and producing an output signal therefrom that represents a reflectance of the bars and spaces comprising the bar code symbol; receiving the output signal and producing a count signal having a series of counts that identifies at least some of the wide elements, and which falsely identifies at least one group of the bars and spaces having the first width as a pseudo wide element having a total width approximately equal to a sum of the first widths of the bars and spaces in the at least one group; determining a narrow width of the bars and spaces having the first width based on the count signal; dividing the pseudo wide element by the narrower width to identify the bars and spaces having the first width in the at least one group; and determining the information encoded in the bar code symbol based on the count signal and the bars and spaces having the first width divided from the pseudo wide element.
Claim 3
Dependent Claim
64 words
The method of claim 1 wherein the bar code symbol includes a quiet zone adjacent to a first bar in the bar code symbol, and wherein the step of determining a narrow width of the bars and spaces having the first width includes the step of locating, from the series of counts in the count signal, the quiet zone adjacent to the first bar.
Claim 4
Dependent Claim
50 words
The method of claim 2 wherein the step of determining a narrow width of the bars and spaces having the first width includes the steps of: selecting several alternate counts in the count signal proximate to the quiet zone; and averaging the several alternate counts to determine the narrow width.
Claim 5
Dependent Claim
31 words
The method of claim 3 wherein the step of selecting several alternate counts only selects counts that are greater than a first predetermined value and less than a second predetermined value.
Claim 6
Dependent Claim
112 words
The method of claim 2 wherein the step of determining a narrow width of the bars and spaces having the first width includes the steps of: identifying start or stop characters in the bar code symbol based on certain counts in the count signal that are proximate to the quiet zone; selecting several alternate counts from the certain counts, in the count signal; determining if the selected several alternate counts in the count signal are approximately equal; determining that the bar code symbol is out-of-focus if all of the selected several alternate counts are not equal; and averaging only the several alternate counts that are approximately equal to determine the narrow width.
Claim 7
Dependent Claim
54 words
The method of claim 2, further comprising the steps of: determining that the quiet zone cannot be located from the series of counts; selecting a count in a middle of the series of counts; and determining if the selected count corresponds to the other of the bars and spaces having only the first width.
Claim 8
Dependent Claim
116 words
The method of claim 6 wherein the step of selecting a count in a middle of the series of counts selects a count having a small value compared to counts proximate to the selected count, and wherein the step of determining if the selected count corresponds to the other of the bars and spaces having only the first width includes the steps of: examining several alternate counts following the selected count; determining whether the several alternate counts are approximately equal to the selected count; and confirming that the selected count corresponds to the other of the bars and spaces having only the first width if the several alternate counts are approximately equal to the selected count.
Claim 9
Dependent Claim
85 words
The method of claim 7, further comprising the steps of: determining that the several alternate counts are not approximately equal to the selected count; examining an adjacent count adjacent to the selected count and several other counts following the adjacent count; determining whether the several other counts are approximately equal to the adjacent count; and confirming that the adjacent count corresponds to the other of the bars and spaces having only the first width if the other counts are approximately equal to the adjacent count.
Claim 10
Dependent Claim
66 words
The method of claim 8, further comprising the steps of: determining that the other counts are not approximately equal to the adjacent count: and selecting a new count in the middle of the series of counts as corresponding to the other of the bars and spaces having only the first width, the new count having a large value compared to counts proximate to the new count.
Claim 11
Dependent Claim
102 words
The method of claim 9 wherein the step of determining a narrow width of the bars and spaces having the first width includes the steps of: selecting, in the count signal, several bar counts corresponding to bars in the bar code symbol and several space counts corresponding to spaces in the bar code symbol, the selected bar and space counts being proximate to the new count in the series of counts; determining a value from the selected bar and space counts; and dividing the value by a predetermined mount to determine the width of the bars and spaces having the first width.
Claim 12
Dependent Claim
130 words
The method of claim 2 wherein the step of determining a narrow width includes the steps of: identifying start and stop characters in the bar code symbol based on start and stop counts in the count signal that are proximate to the quiet zones; determining a first narrow width of the bars and spaces having a first width based on the start counts in the count signal: determining a second narrow width of the bars and spaces having the first width based on the stop counts in the count signal; determining if the count signal includes an acceleration distortion by comparing the first and second narrow widths; and applying a compensation factor to the count signal to compensate for the acceleration distortion if the count signal includes acceleration or distortion.
Claim 13
Dependent Claim
52 words
The method of claim 1, further comprising the steps of: identifying start or stop characters in the bar code symbol based on the count signal; and determining a type of symbology from which the bar code symbol was generated based on the identified start or stop characters in the bar code symbol.
Claim 14
Dependent Claim
44 words
The method of claim 12 wherein the step of determining a type of symbology determines that the bar code symbol was generated from the Code 53 symbology, and wherein the other of the bars and spaces having only the first width corresponds to bars.
Claim 15
Dependent Claim
36 words
The method of claim 1 wherein the step of dividing the pseudo wide element by the narrow width divides the pseudo wide element into only an odd number of bars and spaces having the first width.
Claim 16
Dependent Claim
86 words
The method of claim 1 wherein the step of dividing the pseudo wide element by the narrow width to identify, the bars and spaces having the first width in the at least one group includes the steps of: dividing the series of counts into separate characters; and if the pseudo wide element falls between two separate characters, then dividing the pseudo wide element into the bars and spaces having the first width between the two characters by dividing the pseudo wide element by the narrow width.
Claim 17
Independent Claim
251 words
A method of decoding a machine-readable symbol representing encoded information, the symbol including a plurality of relatively spaced two-dimensional geometric shapes of first and second types, the shapes of the first type having a first reflectance and the shapes of the second type having a second reflectance differing from the first reflectance, the shapes of the first type having a first width in at least one dimension, and the shapes of the second type having the first width and at least a second width in the one dimension, the second width being greater than the first width, the method of decoding the symbol comprising the steps of: receiving light reflected from the symbol and producing an output signal therefrom that represents the reflectance of the shapes of the first and second types comprising the symbol; receiving the output signal and producing a count signal that identifies at least some of the shapes of the second type having the second width, and which falsely identifies at least one group of the shapes of the first and second type having the first width as a pseudo shape of the second type having a total width approximately equal to a sum of the first widths of the one group; receiving the count signal and dividing the one group falsely identified as the pseudo shape of the second type into shapes of the first and second type; and determining the information encoded in the symbol based on the count signal and the divided one group.
Claim 18
Independent Claim
251 words
A method of decoding a machine-readable symbol representing encoded information, the symbol including a plurality of relatively spaced two-dimensional geometric shapes of first and second types, the shapes of the first type having a first reflectance and the shapes of the second type having a second reflectance differing from the first reflectance, the shapes of the first type having a first width in at least one dimension, and the shapes of the second type having the first width and at least a second width in the one dimension, the second width being greater than the first width, the method of decoding the symbol comprising the steps of: receiving light reflected from the symbol and producing an output signal therefrom that represents the reflectance of the shapes of the first and second types comprising the symbol; receiving the output signal and producing a count signal that identifies at least some of the shapes of the second type having the second width, and which falsely identifies at least one group of the shapes of the first and second type having the first width as a pseudo shape of the second type having a total width approximately equal to a sum of the first widths of the one group; receiving the count signal and dividing the one group falsely identified as the pseudo shape of the second type into shapes of the first and second type; and determining the information encoded in the symbol based on the count signal and the divided one group.
Claim 19
Dependent Claim
59 words
The method of claim 16, further comprising the step of determining a width of the shapes of the first and second types having the first width based on the count signal, and wherein the step of receiving the count signal and dividing the one group falsely identified as the pseudo shape divides the single shape by the determined width.
Claim 20
Dependent Claim
99 words
The method of claim 16 wherein the symbol includes at least one quiet zone and one of a start and stop character adjacent to the quiet zone, and wherein the step of receiving the count signal and dividing the one group falsely identified as the pseudo shape includes the steps of: locating the one of the start and stop characters in the count signal by locating counts in the count signal that correspond to the quiet zone, and determining whether the symbol is in-focus based on the located counts corresponding to the one of the start and stop characters.
Claim 21
Dependent Claim
46 words
The method of claim 18, further comprising the steps of: determining that the quiet zone cannot be located from the count signal; selecting a count in a middle of the count signal; and determining if the selected count corresponds to the shapes of the first type.
Claim 22
Independent Claim
284 words
An apparatus for decoding a machine-readable symbol representing encoded information, the machine-readable symbol including a plurality of relatively spaced two-dimensional shapes of first and second types, the shapes of the first type having a first reflectance and the shapes of the second type having a second reflectance differing from the first reflectance, the shapes of the first type having a first width in at least one dimension, and the shapes of the second type having the first width and at least a second width in the one dimension, the second width being greater than the first width, the apparatus comprising: an electro-optical transducer that receives light that is reflected from the machine-readable symbol and produces an output signal therefrom that represents the reflectance of the shapes and spaces comprising the symbol; count generating circuitry coupled to the electro-optical transducer, that receives the output signal and produces a count signal that identifies at least some of the shapes of the second type having the second width, and which falsely identifies at least one group of the shapes of the first and second type having the first width as a pseudo shape of the second type having a total width approximately equal to a sum of the first widths of the one group; and a processor coupled to the count generating circuitry that processes the count signal and produces a signal indicative of the information encoded in the symbol, the processor (i) receiving the count signal and dividing the one group falsely identified as the pseudo shape of the second type into shapes of the first and second type, and (ii) determining the information encoded in the symbol based count signal and the divided one group.
Claim 23
Independent Claim
284 words
An apparatus for decoding a machine-readable symbol representing encoded information, the machine-readable symbol including a plurality of relatively spaced two-dimensional shapes of first and second types, the shapes of the first type having a first reflectance and the shapes of the second type having a second reflectance differing from the first reflectance, the shapes of the first type having a first width in at least one dimension, and the shapes of the second type having the first width and at least a second width in the one dimension, the second width being greater than the first width, the apparatus comprising: an electro-optical transducer that receives light that is reflected from the machine-readable symbol and produces an output signal therefrom that represents the reflectance of the shapes and spaces comprising the symbol; count generating circuitry coupled to the electro-optical transducer, that receives the output signal and produces a count signal that identifies at least some of the shapes of the second type having the second width, and which falsely identifies at least one group of the shapes of the first and second type having the first width as a pseudo shape of the second type having a total width approximately equal to a sum of the first widths of the one group; and a processor coupled to the count generating circuitry that processes the count signal and produces a signal indicative of the information encoded in the symbol, the processor (i) receiving the count signal and dividing the one group falsely identified as the pseudo shape of the second type into shapes of the first and second type, and (ii) determining the information encoded in the symbol based count signal and the divided one group.
Claim 24
Dependent Claim
34 words
The apparatus of claim 20 wherein the processor determines a width of the shapes and spaces having a first width based on the count signal, and divides the one group by the determined width.
References Cited (Backward Citations)
US1985035A
Cited
US2612994A
Cited
US3359405A
Cited
US3622758A
Cited
US3784792A
Cited
US3909594A
Cited
US4013893A
Cited
US4056710A
Cited
US4335301A
Cited
US4379224A
Cited
US4687942A
Cited
WO1988002521A1
Cited
EP0262924A2
Cited
US4980544A
Cited
US4916298A
Cited
US5097263A
Cited
US5229591A
Cited
EP0385783A2
Cited
US5080456A
Cited
US5268562A
Cited
US5231293A
Cited
US5376780A
Cited
US5276315A
Cited
US5389770A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 1999-07-23 | 2000-01-22 | 2000-07-23 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2003-07-23 | 2004-01-22 | 2004-07-23 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2007-07-23 | 2008-01-22 | 2008-07-23 | $7700.00 | Window Closed / Lapsed |