Patent US5877486A successfully refreshed from Google Patents.
← Back to Patent Explorer
US5877486A Expired / Lapsed US ⏱️ 0.0 years remaining

Method and apparatus for enhancing resolution of reflectance signals produced from machine-readable symbols

Assignee: Intermec IP Corp
•
Filing: 1996-10-11
•
Granted: 1999-03-02
•
Expires: 2016-10-11
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract A method and apparatus scans or images a machine-readable symbol to produce several reflectance profiles therefrom. The profiles are averaged to produce an averaged profile. Weighted coefficients for each profile are then computed based on the averaged profile. Using the weighted coefficients, a weighted profile from each of the profiles is then produced. Low pass filtering is applied to the weighted profile to filter noisy or gray level signals therefrom. The resulting filtered profile is transformed using a non-linear technique to enhance high amplitude signals, but suppress low amplitude signals. The resulting transform signal is stretched over the range of reflectance values. The resulting stretched signal is then decoded using, for example, techniques for decoding profiles that fail to resolve narrow (1-wide) elements in the machine-readable symbol.

Inventors

  • 👤 Pavel A. Maltsev
  • 👤 H. Sprague Ackley

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-24 02:45
CPC Classifications
G; G06; G06K; G06K7/00; G06K7/10; G06K7/14

Claims Analysis

Total Claims: 44
Claim 1
Independent Claim 192 words
A method of decoding a machine-readable symbol representing encoded information, the symbol including a plurality of selectively spaced bars, the bars and spaces between the bars having at least a narrow and a wide width in at least one dimension, the method comprising the steps of: producing a plurality of reflectance signals based on light reflected from the symbol, the plurality of reflectance signals having valleys and peaks that represent the reflectance of the bars and spaces having the wide width, but failing to resolve at least some of the bars and spaces having the narrow width; averaging the plurality of reflectance signals to produce an average profile; computing weighting coefficients for at least one of the plurality of reflectance signals based on the averaged profile; producing a weighted profile for at least one of the plurality of reflectance signals based on the weighting coefficients; filtering the weighted profile to produce a filtered profile; transforming the filtered profile to enhance the peaks and valleys that represent the bars and spaces having the wide width, to produce a transformed profile; and decoding the information encoded in the symbol based on the transformed profile.
Claim 2
Independent Claim 192 words
A method of decoding a machine-readable symbol representing encoded information, the symbol including a plurality of selectively spaced bars, the bars and spaces between the bars having at least a narrow and a wide width in at least one dimension, the method comprising the steps of: producing a plurality of reflectance signals based on light reflected from the symbol, the plurality of reflectance signals having valleys and peaks that represent the reflectance of the bars and spaces having the wide width, but failing to resolve at least some of the bars and spaces having the narrow width; averaging the plurality of reflectance signals to produce an average profile; computing weighting coefficients for at least one of the plurality of reflectance signals based on the averaged profile; producing a weighted profile for at least one of the plurality of reflectance signals based on the weighting coefficients; filtering the weighted profile to produce a filtered profile; transforming the filtered profile to enhance the peaks and valleys that represent the bars and spaces having the wide width, to produce a transformed profile; and decoding the information encoded in the symbol based on the transformed profile.
Claim 3
Dependent Claim 30 words
The method of claim 1 wherein the step of producing a plurality of reflectance signals includes the step of producing the plurality of reflectance signals as multiple level digital signals.
Claim 4
Dependent Claim 76 words
The method of claim 1 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, wherein each pixel in the average profile is represented by av j!, wherein the step of computing weighted coefficients includes computing each coefficient w i,j! based on an equation ##EQU3## and wherein grad is a constant representing an overall intensity contrast of the symbol.
Claim 5
Dependent Claim 67 words
The method of claim 1 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile wherein each pixel in the weighted profile is represented by wp j!, and wherein the step of filtering the weighted profile includes filtering the weighted profile based on an equation fwp j!=0.33*wp j-1!+0.33*wp j!+0.33*wp j+1!.
Claim 6
Dependent Claim 140 words
The method of claim 1 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, wherein each pixel in the filtered profile is represented by fwp j!, and wherein the step of transforming the filtered profile includes the steps of: determining a threshold intensity value th for the symbol; transforming the filtered profile based on an equation twp j!=sin(π/2*(fwp j!-th)/(Int-th)), if the intensity of a given pixel fwp j! is greater than the threshold value th, and twp j!=sin(π/2*(th-fwp j!)/(Int-th)) if the intensity of the given pixel fwp j! is less than the threshold value th, wherein the value Int is a highest intensity value in the weighted profile; and stretching the transformed profile to a range of the number of intensity values.
Claim 7
Dependent Claim 38 words
The method of claim 1, further comprising the step of producing a stored image of the symbol; and wherein the step of producing a plurality of reflectance signals produces a plurality of sampling paths through the stored image.
Claim 8
Dependent Claim 89 words
The method of claim 1 wherein the step of decoding includes the steps of: measuring distances between centers of the peaks and valleys that represent the bars and spaces having the wide width in the transformed profile; creating a lost element matrix that identifies a number of the bars and spaces having the narrow width that are unresolved between the wide bars and spaces; and determining a number and location of the bars and spaces having the narrow width by comparing the distances measured to the lost element matrix.
Claim 9
Independent Claim 114 words
A method of decoding a data collection symbol representing encoded information, the symbol including a plurality of spaced two-dimensional shapes with spaces between the shapes, the method comprising the steps of: producing a plurality of reflectance signals based on light reflected from the symbol, the plurality of reflectance signals having valleys and peaks that represent the reflectance of the shapes and spaces comprising the symbol; producing an enhanced resolution profile based on the plurality of profiles; transforming the enhanced resolution profile to exaggerate the peaks and valleys that represent the shapes and spaces comprising the symbol, to produce a transformed profile; and decoding the information encoded in the symbol based on the transformed profile.
Claim 10
Independent Claim 114 words
A method of decoding a data collection symbol representing encoded information, the symbol including a plurality of spaced two-dimensional shapes with spaces between the shapes, the method comprising the steps of: producing a plurality of reflectance signals based on light reflected from the symbol, the plurality of reflectance signals having valleys and peaks that represent the reflectance of the shapes and spaces comprising the symbol; producing an enhanced resolution profile based on the plurality of profiles; transforming the enhanced resolution profile to exaggerate the peaks and valleys that represent the shapes and spaces comprising the symbol, to produce a transformed profile; and decoding the information encoded in the symbol based on the transformed profile.
Claim 11
Dependent Claim 67 words
The method of claim 8 wherein the step of producing an enhanced resolution profile includes the steps of: averaging the plurality of reflectance signals to produce an average profile; computing weighting coefficients for at least one of the plurality of reflectance signals based on the averaged profile; and producing a weighted profile for at least one of the plurality of reflectance signals based on the weighting coefficients.
Claim 12
Dependent Claim 115 words
The method of claim 8 wherein the plurality of reflectance signals have valleys and peaks that represent the reflectance of the shapes and spaces having a wide width, but failing to resolve at least some of the shapes and spaces having a narrow width, and wherein the step of transforming the enhanced resolution profile includes the steps of: filtering the enhanced resolution profile to produce a filtered profile; and transforming the filtered profile based on a non-linear function to enhance the peaks and valleys that represent the shapes and spaces having the wide width and suppress the peaks and valleys that represent the shapes and spaces having the narrow width, to produce the transformed profile.
Claim 13
Dependent Claim 121 words
The method of claim 8 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, wherein the step of producing an enhanced resolution profile includes the steps of: averaging the plurality of reflectance signals to produce an average profile, wherein each pixel in the average profile is represented by av j!; computing weighting coefficients w i,j! for at least one of the plurality of reflectance signals, wherein each coefficient w i,j! is based on an equation ##EQU4## wherein grad is a constant; and producing a weighted profile for at least one of the plurality of reflectance signals based on the weighting coefficients w i,j!.
Claim 14
Dependent Claim 87 words
The method of claim 8 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, and wherein the step of transforming the enhanced resolution profile includes the steps of: producing a weighted profile for at least one of the plurality of reflectance signals, wherein each pixel in the weighted profile is represented by wp j!; and filtering the weighted profile based on an equation fwp j!=0.33*wp j-1!+0.33*wp j!+0.33*wp j+1!. 13.
Claim 15
Dependent Claim 27 words
The method of claim 8 wherein step of transforming the enhanced resolution profile includes the step of filtering the enhanced profile based on a low pass filter.
Claim 16
Dependent Claim 141 words
The method of claim 8 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, and wherein the step of transforming the enhanced resolution profile includes the steps of: producing a filtered profile for at least one of the plurality of profiles, wherein each pixel in the filtered profile is represented by fwp j!; determining a threshold intensity value th for the symbol; and transforming the filtered profile based on an equation twp j!=sin(π/2*(fwp j!-th)/(Int-th)), if the intensity of a given pixel fwp j! is greater than the threshold value th, and twp j!=sin(π/2*(th-fwp j!)/(Int-th)) if the intensity of the given pixel fwp j! is less than the threshold value th, wherein the value Int is a highest intensity value in the filtered profile.
Claim 17
Independent Claim 105 words
A method of producing a signal from a data collection symbol representing encoded information, the symbol including a plurality of spaced two-dimensional shapes with spaces between the shapes, the method comprising the steps of: producing a plurality of reflectance signals based on light reflected from the symbol, the plurality of reflectance signals having valleys and peaks that represent the reflectance of the shapes and spaces comprising the symbol; producing an enhanced resolution profile based on the plurality of profiles; and transforming the enhanced resolution profile to exaggerate the peaks and valleys that represent the shapes and spaces comprising the symbol, to produce a transformed profile.
Claim 18
Independent Claim 105 words
A method of producing a signal from a data collection symbol representing encoded information, the symbol including a plurality of spaced two-dimensional shapes with spaces between the shapes, the method comprising the steps of: producing a plurality of reflectance signals based on light reflected from the symbol, the plurality of reflectance signals having valleys and peaks that represent the reflectance of the shapes and spaces comprising the symbol; producing an enhanced resolution profile based on the plurality of profiles; and transforming the enhanced resolution profile to exaggerate the peaks and valleys that represent the shapes and spaces comprising the symbol, to produce a transformed profile.
Claim 19
Dependent Claim 67 words
The method of claim 15 wherein the step of producing an enhanced resolution profile includes the steps of: averaging the plurality of reflectance signals to produce an average profile; computing weighting coefficients for at least one of the plurality of reflectance signals based on the averaged profile; and producing a weighted profile for at least one of the plurality of reflectance signals based on the weighting coefficients.
Claim 20
Dependent Claim 115 words
The method of claim 15 wherein the plurality of reflectance signals having valleys and peaks that represent the reflectance of the shapes and spaces having a wide width, but failing to resolve at least some of the shapes and spaces having a narrow width, and wherein the step of transforming the enhanced resolution profile includes the steps of: filtering the enhanced resolution profile to produce a filtered profile; and transforming the filtered profile based on a non-linear function to enhance the peaks and valleys that represent the shapes and spaces having the wide width and suppress the peaks and valleys that represent the shapes and spaces having the narrow width, to produce the transformed profile.
Claim 21
Dependent Claim 120 words
The method of claim 15 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, wherein the step of producing an enhanced resolution profile includes the steps of: averaging the plurality of reflectance signals to produce an average profile, wherein each pixel in the average profile is represented by av j!; computing weighting coefficients w i,j! for at least one of the plurality of reflectance signals, wherein each coefficient w i,j! is based on an equation ##EQU5## wherein grad is a constant; and producing a weighted profile for at least one of the plurality of profiles based on the weighting coefficients w i,j!.
Claim 22
Dependent Claim 86 words
The method of claim 15 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, and wherein the step of transforming the enhanced resolution profile includes the steps of: producing a weighted profile for at least one of the plurality of reflectance signals, wherein each pixel in the weighted profile is represented by wp j!; and filtering the weighted profile based on an equation fwp j!=0.33*wp j-1!+0.33*wp j!+0.33*wp j+1!.
Claim 23
Dependent Claim 27 words
The method of claim 15 wherein step of transforming the enhanced resolution profile includes the step of filtering the enhanced profile based on a low pass filter.
Claim 24
Dependent Claim 141 words
The method of claim 15 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, and wherein the step of transforming the enhanced resolution profile includes the steps of: producing a filtered profile for at least one of the plurality of profiles, wherein each pixel in the filtered profile is represented by fwp j!; determining a threshold intensity value th for the symbol; and transforming the filtered profile based on an equation twp j!=sin(π/2*(fwp j!-th)/(Int-th)), if the intensity of a given pixel fwp j! is greater than the threshold value th, and twp j!=sin(π/2*(th-fwp j!)/(Int-th)) if the intensity of the given pixel fwp j! is less than the threshold value th, wherein the value Int is a highest intensity value in the filtered profile.
Claim 25
Independent Claim 114 words
A method of enhancing a signal comprising the steps of: producing a plurality of similar signals, each signal having valleys and peaks that represent information, but each signal having noise, the noise having an amplitude or frequency that differs from an amplitude or frequency of the valleys and peaks; averaging the plurality of signals to produce an average signal; computing weighting coefficients for at least one of the plurality of signals based on the averaged signal; producing a weighted signal for at least one of the plurality of signals based on the weighting coefficients; filtering the weighted signal to produce a filtered signal; and transforming the filtered signal to enhance the peaks and valleys.
Claim 26
Independent Claim 114 words
A method of enhancing a signal comprising the steps of: producing a plurality of similar signals, each signal having valleys and peaks that represent information, but each signal having noise, the noise having an amplitude or frequency that differs from an amplitude or frequency of the valleys and peaks; averaging the plurality of signals to produce an average signal; computing weighting coefficients for at least one of the plurality of signals based on the averaged signal; producing a weighted signal for at least one of the plurality of signals based on the weighting coefficients; filtering the weighted signal to produce a filtered signal; and transforming the filtered signal to enhance the peaks and valleys.
Claim 27
Independent Claim 144 words
A method of decoding a machine-readable symbol representing encoded information, the symbol including a plurality of selectively spaced shapes, the shapes and spaces between the shapes having at least a narrow and a wide width in at least one dimension, the method comprising the steps of: producing a plurality of reflectance signals based on light reflected from the symbol, the plurality of reflectance signals having valleys and peaks that represent the reflectance of at least the shapes and spaces having the wide width; averaging the plurality of reflectance signals to produce an average profile; computing weighting coefficients for at least one of the plurality of reflectance signals based on the averaged profile; producing a weighted profile for at least one of the plurality of reflectance signals based on the weighting coefficients; and decoding the information encoded in the symbol based on the weighted profile.
Claim 28
Independent Claim 144 words
A method of decoding a machine-readable symbol representing encoded information, the symbol including a plurality of selectively spaced shapes, the shapes and spaces between the shapes having at least a narrow and a wide width in at least one dimension, the method comprising the steps of: producing a plurality of reflectance signals based on light reflected from the symbol, the plurality of reflectance signals having valleys and peaks that represent the reflectance of at least the shapes and spaces having the wide width; averaging the plurality of reflectance signals to produce an average profile; computing weighting coefficients for at least one of the plurality of reflectance signals based on the averaged profile; producing a weighted profile for at least one of the plurality of reflectance signals based on the weighting coefficients; and decoding the information encoded in the symbol based on the weighted profile.
Claim 29
Dependent Claim 30 words
The method of claim 23 wherein the step of producing a plurality of reflectance signals includes the step of producing the plurality of reflectance signals as multiple level digital signals.
Claim 30
Dependent Claim 76 words
The method of claim 23 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, wherein each pixel in the average profile is represented by av j!, wherein the step of computing weighted coefficients includes computing each coefficient w i,j! based on an equation ##EQU6## and wherein grad is a constant representing an overall intensity contrast of the symbol.
Claim 31
Dependent Claim 38 words
The method of claim 23, further comprising the step of producing a stored image of the symbol; and wherein the step of producing a plurality of reflectance signals produces a plurality of sampling paths through the stored image.
Claim 32
Dependent Claim 89 words
The method of claim 23 wherein the step of decoding includes the steps of: measuring distances between centers of the peaks and valleys that represent the shapes and spaces having the wide width in the weighted profile; creating a lost element matrix that identifies a number of the shapes and spaces having the narrow width that are unresolved between the wide shapes and spaces; and determining a number and location of the shapes and spaces having the narrow width by comparing the distances measured to the lost element matrix.
Claim 33
Independent Claim 128 words
A method of decoding a machine-readable symbol representing encoded information, the symbol including a plurality of selectively spaced bars, the bars and spaces between the bars having at least a narrow and a wide width in at least one dimension, the method comprising the steps of: producing at least one reflectance signal based on light reflected from the symbol, the reflectance signal having valleys and peaks that represent the reflectance of at least the bars and spaces having the wide width; filtering the reflectance signal to produce a filtered profile; transforming the filtered profile to enhance the peaks and valleys that represent the bars and spaces having the wide width, to produce a transformed profile; and decoding the information encoded in the symbol based on the transformed profile.
Claim 34
Independent Claim 128 words
A method of decoding a machine-readable symbol representing encoded information, the symbol including a plurality of selectively spaced bars, the bars and spaces between the bars having at least a narrow and a wide width in at least one dimension, the method comprising the steps of: producing at least one reflectance signal based on light reflected from the symbol, the reflectance signal having valleys and peaks that represent the reflectance of at least the bars and spaces having the wide width; filtering the reflectance signal to produce a filtered profile; transforming the filtered profile to enhance the peaks and valleys that represent the bars and spaces having the wide width, to produce a transformed profile; and decoding the information encoded in the symbol based on the transformed profile.
Claim 35
Dependent Claim 80 words
The method of claim 28 wherein a plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, and wherein the step of filtering the reflectance signal includes the steps of: producing a weighted profile based on the reflectance signal, wherein each pixel in the weighted profile is represented by wp j!; and filtering the weighted profile based on an equation fwp j!=0.33*wp j-1!+0.33*wp j!+0.33*wp j+1!.
Claim 36
Dependent Claim 140 words
The method of claim 28 wherein a plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, wherein each pixel in the filtered profile is represented by fwp j!, and wherein the step of transforming the filtered profile includes the steps of: determining a threshold intensity value th for the symbol; transforming the filtered profile based on an equation twp j!=sin(π/2*(fwp j!-th)/(Int-th)), if the intensity of a given pixel fwp j! is greater than the threshold value th, and twp j!=sin(π/2*(th-fwp j!)/(Int-th)) if the intensity of the given pixel fwp j! is less than the threshold value th, wherein the value Int is a highest intensity value in the weighted profile; and stretching the transformed profile to a range of the number of intensity values.
Claim 37
Independent Claim 161 words
An apparatus for decoding a machine-readable symbol representing encoded information, the machine-readable symbol including a plurality of selectively spaced two-dimensional shapes, the apparatus comprising: a sensor that receives light that is reflected from the machine-readable symbol and produces a plurality of output signals therefrom that represent the reflectance of the shapes and spaces comprising the symbol; a receiver that receives the output signals and produces a plurality of reflectance signals having peaks and valleys indicative of at least some of the shapes and spaces; and a processor for processing the plurality of reflectance signals and producing a signal indicative of the information encoded in the symbol, the processor (a) producing an enhanced resolution profile based on the plurality of reflectance signals, (b) transforming the enhanced resolution profile to exaggerate the peaks and valleys indicative of the shapes and spaces comprising the symbol and producing a transformed profile, and (c) decoding the information encoded in the symbol based on the transformed profile.
Claim 38
Independent Claim 161 words
An apparatus for decoding a machine-readable symbol representing encoded information, the machine-readable symbol including a plurality of selectively spaced two-dimensional shapes, the apparatus comprising: a sensor that receives light that is reflected from the machine-readable symbol and produces a plurality of output signals therefrom that represent the reflectance of the shapes and spaces comprising the symbol; a receiver that receives the output signals and produces a plurality of reflectance signals having peaks and valleys indicative of at least some of the shapes and spaces; and a processor for processing the plurality of reflectance signals and producing a signal indicative of the information encoded in the symbol, the processor (a) producing an enhanced resolution profile based on the plurality of reflectance signals, (b) transforming the enhanced resolution profile to exaggerate the peaks and valleys indicative of the shapes and spaces comprising the symbol and producing a transformed profile, and (c) decoding the information encoded in the symbol based on the transformed profile.
Claim 39
Dependent Claim 57 words
The apparatus of claim 31 wherein the processor averages the plurality of reflectance signals to produce an average profile, computes weighting coefficients for at least one of the plurality of reflectance signals based on the averaged profile, and produces a weighted profile for at least one of the plurality of reflectance signals based on the weighting coefficients.
Claim 40
Dependent Claim 105 words
The apparatus of claim 31 wherein the plurality of reflectance signals have valleys and peaks that represent the reflectance of the shapes and spaces having a wide width, but failing to resolve at least some of the shapes and spaces having a narrow width, and wherein the processor filters the enhanced resolution profile to produce a filtered profile, and transforms the filtered profile based on a non-linear function to enhance the peaks and valleys that represent the shapes and spaces having the wide width and suppress the peaks and valleys that represent the shapes and spaces having the narrow width, to produce the transformed profile.
Claim 41
Dependent Claim 110 words
The apparatus of claim 31 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, and wherein the processor averages the plurality of reflectance signals to produce an average profile, wherein each pixel in the average profile is represented by av j!, computes weighting coefficients w i,j! for at least one of the plurality of profiles, wherein each coefficient w i,j! is based on an equation ##EQU7## wherein grad is a constant, and produces a weighted profile for at least one of the plurality of profiles based on the weighting coefficients w i,j!.
Claim 42
Dependent Claim 75 words
The apparatus of claim 31 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, and wherein the processor produces a weighted profile for at least one of the plurality of profiles, wherein each pixel in the weighted profile is represented by wp j!, and filters the weighted profile based on an equation fwp j!=0.33*wp j-1!+0.33*wp j!+0.33*wp j+1!.
Claim 43
Dependent Claim 18 words
The apparatus of claim 31 wherein the processor filters the enhanced profile based on a low pass filter.
Claim 44
Dependent Claim 131 words
The apparatus of claim 31 wherein the plurality of reflectance signals are represented by P -- i,j!, having a number i of profiles, and a number j of pixels in each profile, and wherein the processor produces a filtered profile for at least one of the plurality of profiles, wherein each pixel in the filtered profile is represented by fwp j!, determines a threshold intensity value th for the symbol, and transforms the weighted profile based on an equation twp j!=sin(π/2*(fwp j!-th)/(Int-th)), if the intensity of a given pixel fwp j! is greater than the threshold value th, and twp j!=sin(π/2*(th-fwp j!)/(Int-th)) if the intensity of the given pixel fwp j! is less than the threshold value th, wherein the value Int is a highest intensity value in the filtered profile.

References Cited (Backward Citations)

US4687942A Cited
US4916298A Cited
US5097263A Cited
US5504318A Cited
US5376780A Cited
US5276315A Cited
US5389770A Cited
US5486689A Cited
US5514858A Cited
US5539191A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 2002-03-01 2002-08-31 2003-03-02 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2006-03-01 2006-08-31 2007-03-02 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2010-03-01 2010-08-31 2011-03-02 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag