Patent US6201901B1 successfully refreshed from Google Patents.
US6201901B1
Expired / Lapsed
US
⏱️ 0.0 years remaining
Border-less clock free two-dimensional barcode and method for printing and reading the same
Assignee: Panasonic Holdings Corp
•
Filing: 1998-06-01
•
Granted: 2001-03-13
•
Expires: 2018-06-01
Abstract
Abstract Inventive two-dimensional barcodes, each having encoded digital information in a bitmap representing preferably randomized encoded data bits, are printed onto a printed medium. Preferably, error correction codes are added to the digital information to ensure that the decoding process accurately reproduce the digital information. In one embodiment, the bitmap may further include "anchor" bits in each corner, which are used as part of the skew estimation and deskewing processes during decoding. In a second embodiment, no "anchor" bits are required. The encoded digital information is mapped into the two-dimensional barcode in such a way as to minimize the errors caused by damage to particular rows and/or columns, for example, row damage caused by faxing the printed barcode. To extract the encoded digital information from the printed medium, the printed medium is scanned, then the bitmap is located within the printed medium. The skew of the bitmap, if any, is determined, and the bitmap is deskewed if necessary. The bitmap is then cropped, and the randomized digital information is read from the bitmap. The digital information is derandomized and any error correction codes are removed, in the process correcting and/or recording any errors discovered, thereby reproducing the original encoded digital information.
Inventors
- 👤 Jiangying Zhou
- 👤 Daniel P. Lopresti
- 👤 Andrew Tomkins
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-24 04:17
CPC Classifications
G; G06; G06K; G06K7/00; G06K7/10; G06K7/14; G06K19/00; G06K19/06; G06K19/06009; G06K19/06018; G06K19/06028; G06K19/06037
Claims Analysis
Total Claims: 15
Claim 1
Independent Claim
225 words
A method of decoding randomized information printed on a printed medium in the form of a bitmap of rows and columns of data pixels representing encoded data bits, each of said data pixels being either a first or second color, said printed medium further having other printed information thereon, comprising the steps of: scanning said printed medium to digitize said bitmap and said other information; formatting said bitmap and said other information to a pixel based grayscale representation; setting the threshold intensity level based on said grayscale representation such that pixels above said threshold correspond to said first color and pixels below said threshold correspond to said second color; determining the row and column boundaries by determining the number of first color pixels in each row and each column of the scanned printed medium, and sequentially comparing the number of first pixels in each row and column, respectively, to a predetermined threshold; determining the skew angle of said digitized bitmap; deskewing said digitized bitmap so that said skew angle is reduced to substantially zero; cropping said digitized bitmap; reading out binary data from said digitized bitmap in a predetermined pattern to produce a one-dimensional array of digital data; derandomizing said one-dimensional array of digital data; and error-correcting the derandomized one-dimensional array of digital data to produce a substantially error-free digital representation of the encoded information.
Claim 2
Independent Claim
225 words
A method of decoding randomized information printed on a printed medium in the form of a bitmap of rows and columns of data pixels representing encoded data bits, each of said data pixels being either a first or second color, said printed medium further having other printed information thereon, comprising the steps of: scanning said printed medium to digitize said bitmap and said other information; formatting said bitmap and said other information to a pixel based grayscale representation; setting the threshold intensity level based on said grayscale representation such that pixels above said threshold correspond to said first color and pixels below said threshold correspond to said second color; determining the row and column boundaries by determining the number of first color pixels in each row and each column of the scanned printed medium, and sequentially comparing the number of first pixels in each row and column, respectively, to a predetermined threshold; determining the skew angle of said digitized bitmap; deskewing said digitized bitmap so that said skew angle is reduced to substantially zero; cropping said digitized bitmap; reading out binary data from said digitized bitmap in a predetermined pattern to produce a one-dimensional array of digital data; derandomizing said one-dimensional array of digital data; and error-correcting the derandomized one-dimensional array of digital data to produce a substantially error-free digital representation of the encoded information.
Claim 3
Independent Claim
175 words
A method of decoding randomized information printed on a printed medium in the form of a bitmap of rows and columns of data pixels representing encoded data bits, each of said data pixels being either a first or second color, comprising the steps of: scanning said printed medium to digitize said bitmap; formatting said bitmap to a pixel based grayscale representation; setting the threshold intensity level based on said grayscale representation such that pixels above said threshold correspond to said first color and pixels below said threshold correspond to said second color; determining the skew angle of said digitized bitmap by either a template matching procedure or a Hough-transform procedure; deskewing said digitized bitmap so that said skew angle is reduced to substantially zero; cropping said digitized bitmap; reading out binary data from said digitized bitmap in a predetermined pattern to produce a one-dimensional array of digital data; derandomizing said one-dimensional array of digital data; and error-correcting the derandomized one-dimensional array of digital data to produce a substantially error-free digital representation of the encoded information.
Claim 4
Independent Claim
175 words
A method of decoding randomized information printed on a printed medium in the form of a bitmap of rows and columns of data pixels representing encoded data bits, each of said data pixels being either a first or second color, comprising the steps of: scanning said printed medium to digitize said bitmap; formatting said bitmap to a pixel based grayscale representation; setting the threshold intensity level based on said grayscale representation such that pixels above said threshold correspond to said first color and pixels below said threshold correspond to said second color; determining the skew angle of said digitized bitmap by either a template matching procedure or a Hough-transform procedure; deskewing said digitized bitmap so that said skew angle is reduced to substantially zero; cropping said digitized bitmap; reading out binary data from said digitized bitmap in a predetermined pattern to produce a one-dimensional array of digital data; derandomizing said one-dimensional array of digital data; and error-correcting the derandomized one-dimensional array of digital data to produce a substantially error-free digital representation of the encoded information.
Claim 5
Independent Claim
175 words
A method of decoding randomized information printed on a printed medium in the form of a bitmap of rows and columns of data pixels representing encoded data bits, each of said data pixels being either a first or second color, comprising the steps of: scanning said printed medium to digitize said bitmap; formatting said bitmap to a pixel based grayscale representation; setting the threshold intensity level based on said grayscale representation such that pixels above said threshold correspond to said first color and pixels below said threshold correspond to said second color; determining the skew angle of said digitized bitmap; deskewing said digitized bitmap so that said skew angle is reduced to substantially zero by either a shear rotation procedure or a trigonometric procedure; cropping said digitized bitmap; reading out binary data from said digitized bitmap in a predetermined pattern to produce a one-dimensional array of digital data; derandomizing said one-dimensional array of digital data; and error-correcting the derandomized one-dimensional array of digital data to produce a substantially error-free digital representation of the encoded information.
Claim 6
Independent Claim
175 words
A method of decoding randomized information printed on a printed medium in the form of a bitmap of rows and columns of data pixels representing encoded data bits, each of said data pixels being either a first or second color, comprising the steps of: scanning said printed medium to digitize said bitmap; formatting said bitmap to a pixel based grayscale representation; setting the threshold intensity level based on said grayscale representation such that pixels above said threshold correspond to said first color and pixels below said threshold correspond to said second color; determining the skew angle of said digitized bitmap; deskewing said digitized bitmap so that said skew angle is reduced to substantially zero by either a shear rotation procedure or a trigonometric procedure; cropping said digitized bitmap; reading out binary data from said digitized bitmap in a predetermined pattern to produce a one-dimensional array of digital data; derandomizing said one-dimensional array of digital data; and error-correcting the derandomized one-dimensional array of digital data to produce a substantially error-free digital representation of the encoded information.
Claim 7
Independent Claim
183 words
A method of decoding randomized information printed on a printed medium in the form of a bitmap of rows and columns of data pixels representing encoded data bits, each of said data pixels being either a first or second color, comprising the steps of: scanning said printed medium to digitize said bitmap; formatting said bitmap to a pixel based grayscale representation; setting the threshold intensity level based on said grayscale representation such that pixels above said threshold correspond to said first color and pixels below said threshold correspond to said second color; determining the skew angle of said digitized bitmap; deskewing said digitized bitmap so that said skew angle is reduced to substantially zero; cropping said digitized bitmap; reading out binary data from said digitized bitmap in a predetermined pattern in each of four alternative directions to produce four alternative one-dimensional arrays of digital data; derandomizing said four one-dimensional arrays of digital data; and error-correcting said four derandomized one-dimensional arrays of digital data and selecting the one-dimensional array of digital data with the least number of errors for output of the decoded information.
Claim 8
Independent Claim
183 words
A method of decoding randomized information printed on a printed medium in the form of a bitmap of rows and columns of data pixels representing encoded data bits, each of said data pixels being either a first or second color, comprising the steps of: scanning said printed medium to digitize said bitmap; formatting said bitmap to a pixel based grayscale representation; setting the threshold intensity level based on said grayscale representation such that pixels above said threshold correspond to said first color and pixels below said threshold correspond to said second color; determining the skew angle of said digitized bitmap; deskewing said digitized bitmap so that said skew angle is reduced to substantially zero; cropping said digitized bitmap; reading out binary data from said digitized bitmap in a predetermined pattern in each of four alternative directions to produce four alternative one-dimensional arrays of digital data; derandomizing said four one-dimensional arrays of digital data; and error-correcting said four derandomized one-dimensional arrays of digital data and selecting the one-dimensional array of digital data with the least number of errors for output of the decoded information.
Claim 9
Independent Claim
162 words
A method of decoding randomized information printed on a printed medium in the form of a bitmap of rows and columns of data pixels representing encoded data bits, each of said data pixels being either a first or second color, comprising the steps of: scanning said printed medium to digitize said bitmap; formatting said bitmap to a pixel based grayscale representation; setting the threshold intensity level based on said grayscale representation such that pixels above said threshold correspond to said first color and pixels below said threshold correspond to said second color; determining the skew angle of said digitized bitmap; deskewing said digitized bitmap so that said skew angle is reduced to substantially zero; cropping said digitized bitmap; reading out binary data from said digitized bitmap in a predetermined pattern to produce a one-dimensional array of digital data; and derandomizing and error-correcting said a one-dimensional array of digital data by alternative designated keys until the errors determined fall below a predetermined level.
Claim 10
Independent Claim
162 words
A method of decoding randomized information printed on a printed medium in the form of a bitmap of rows and columns of data pixels representing encoded data bits, each of said data pixels being either a first or second color, comprising the steps of: scanning said printed medium to digitize said bitmap; formatting said bitmap to a pixel based grayscale representation; setting the threshold intensity level based on said grayscale representation such that pixels above said threshold correspond to said first color and pixels below said threshold correspond to said second color; determining the skew angle of said digitized bitmap; deskewing said digitized bitmap so that said skew angle is reduced to substantially zero; cropping said digitized bitmap; reading out binary data from said digitized bitmap in a predetermined pattern to produce a one-dimensional array of digital data; and derandomizing and error-correcting said a one-dimensional array of digital data by alternative designated keys until the errors determined fall below a predetermined level.
Claim 11
Dependent Claim
29 words
The method as in claim 1 , 3 , 4 or 5 , wherein said skew angle determining step uses either a template matching procedure or a Hough-transform procedure.
Claim 12
Independent Claim
27 words
The method as in claims 1 , 2 , 4 or 5 , wherein said deskewing step uses either a shear rotation procedure or a trigonometric procedure.
Claim 13
Independent Claim
53 words
The method as in claims 1 , 2 or 3 , wherein said reading step reads said binary data in each of four alternative directions creating four alternative one-dimensional arrays of digital data, and said error correcting step selects the one-dimensional array of digital data with the least number of errors for output.
Claim 14
Independent Claim
41 words
The method as in claims 1 , 2 or 3 , wherein said derandomizing step repeatedly derandomizes said one-dimensional array of digital data by alternative designated keys until the errors detected by said error correcting step fall below a preset threshold.
Claim 15
Independent Claim
100 words
The method as in claims 1 , 2 , 3 , 4 or 5 , wherein said reading step comprises the steps of: determining the number of horizontal and vertical edges in each respective row and column of said bitmap; determining the row center lines from the local minima in the horizontal edge counts; determining the column center lines from the local minima in the vertical edge counts; and reading out binary data located at the intersection of each row center line and column center line in a predetermined pattern to produce a one-dimensional digital representation of said digitized bitmap.
References Cited (Backward Citations)
US5073954A
Cited
US5790715A
Cited
US5065437A
Cited
US5091966A
Cited
US5487115A
Cited
US5337362A
Cited
US5862260A
Cited
USD377501S
Cited
US6006993A
Cited
US5517587A
Cited
US5737442A
Cited
US5862270A
Cited
US6014464A
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2004-03-12 | 2004-09-11 | 2005-03-13 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2008-03-12 | 2008-09-11 | 2009-03-13 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2012-03-12 | 2012-09-11 | 2013-03-13 | $7700.00 | Window Closed / Lapsed |