Patent US5937110A successfully refreshed from Google Patents.
US5937110A
Expired / Lapsed
US
⏱️ 0.0 years remaining
Parallel propagating embedded binary sequences for characterizing objects in N-dimensional address space
Assignee: Xerox Corp
•
Filing: 1996-12-20
•
Granted: 1999-08-10
•
Expires: 2016-12-20
Abstract
Abstract Machine readable fragments of a code pattern that is parameterized in N-dimensional space, where N≧2, are affixed to two or three dimensional physical objects, such that the objects are uniquely identified by the addresses of the machine readable address space fragments affixed thereto.
Inventors
- 👤 Glen W. Petrie
- 👤 David L. Hecht
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-10-26 14:06
CPC Classifications
G; G06; G06K; G06K19/00; G06K19/06; G06K19/06009; G06K19/06037; G06K7/00; G06K7/10; G06K7/14
Claims Analysis
Total Claims: 11
Claim 1
Independent Claim
98 words
A process for discriminating between physical objects in a machine readable format, said process comprising: digitally parameterizing a two dimensional code pattern comprising elements in conformance with a machine readable address space having at least two dimensions, said address space being composed of a plurality of different absolute addresses that map on to said code pattern to provide a unique one of said plurality of different absolute addresses for each one of said elements in said code pattern; affixing respective distinct machine readable fragments of said code pattern to said objects to discriminate said objects from each other.
Claim 2
Dependent Claim
98 words
A process for discriminating between physical objects in a machine readable format, said process comprising: digitally parameterizing a two dimensional code pattern comprising elements in conformance with a machine readable address space having at least two dimensions, said address space being composed of a plurality of different absolute addresses that map on to said code pattern to provide a unique one of said plurality of different absolute addresses for each one of said elements in said code pattern; affixing respective distinct machine readable fragments of said code pattern to said objects to discriminate said objects from each other.
Claim 3
Dependent Claim
20 words
The process of claim 1 wherein said code pattern is parameterized in conformance with an N-dimensional address space, where N>2.
Claim 4
Dependent Claim
29 words
The process of claim 1 wherein said code pattern is a self-clocking glyph code pattern wherein said elements are glyphs registered on each one of a lattice of centers.
Claim 5
Dependent Claim
31 words
The process of claim 3 wherein said glyphs are slash-like marks which are tilted to the left and right at about +45° and -45° for encoding binary "1's" and "0's", respectively.
Claim 6
Dependent Claim
112 words
A process for identifying and discriminating between physical objects in a machine readable format, said process comprising: digitally parameterizing a two dimensional code pattern comprising elements in conformance with a machine readable address space having at least two dimensions, said address space being composed of a plurality of different absolute addresses that map on to said code pattern to provide a unique one of said plurality of different absolute addresses for each one of said elements in said code pattern; affixing respective distinct machine readable fragments of said code pattern to said objects to uniquely identify said objects; and registering said machine readable fragments with said objects in an organized look-up table.
Claim 7
Dependent Claim
112 words
A process for identifying and discriminating between physical objects in a machine readable format, said process comprising: digitally parameterizing a two dimensional code pattern comprising elements in conformance with a machine readable address space having at least two dimensions, said address space being composed of a plurality of different absolute addresses that map on to said code pattern to provide a unique one of said plurality of different absolute addresses for each one of said elements in said code pattern; affixing respective distinct machine readable fragments of said code pattern to said objects to uniquely identify said objects; and registering said machine readable fragments with said objects in an organized look-up table.
Claim 8
Dependent Claim
20 words
The process of claim 5 wherein said code pattern is parameterized in conformance with an N-dimensional address space, where N>2.
Claim 9
Dependent Claim
29 words
The process of claim 5 wherein said code pattern is a self-clocking glyph code pattern wherein said elements are glyphs registered on each one of a lattice of centers.
Claim 10
Dependent Claim
31 words
The process of claim 7 wherein said glyphs are slash-like marks which are tilted to the left and right at about +45° and -45° for encoding binary "1's" and "0's", respectively.
Claim 11
Dependent Claim
12 words
The process of claim 5 wherein said look-up table is hierarchically organized.
References Cited (Backward Citations)
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2002-08-09 | 2003-02-08 | 2003-08-10 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2006-08-09 | 2007-02-08 | 2007-08-10 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2010-08-09 | 2011-02-08 | 2011-08-10 | $7700.00 | Window Closed / Lapsed |