Patent US6959100B2 successfully refreshed from Google Patents.
US6959100B2
Expired / Lapsed
US
⏱️ 0.0 years remaining
Secure document design with machine readable, variable message encoded in a visible registration pattern
Assignee: Digimarc Corp
•
Filing: 2003-06-11
•
Granted: 2005-10-25
•
Expires: 2023-06-11
Abstract
Abstract A secure document design has a visible graphical structure that forms part of the aesthetic features on the document and carries encoded message information. A method for generating this design starts with a visible structure used for geometric registration. It then generates a variable auxiliary message comprising message values, and maps the message values to a two dimensional pattern of locations in the visible structure on the document. It repeats the auxiliary message and represents the auxiliary message differently in the two dimensional pattern according to a key. An implementation of this method may be used to create design artwork for printed security documents that is aesthetically pleasing, carries a robust machine readable message, and can be used to authenticate other information on the security document.
Inventors
- 👤 Geoffrey B. Rhoads
Bibliographic Details
Application Number
—
Jurisdiction
US
Data Source
google_patents
Last Synchronized
2026-11-09 13:16
CPC Classifications
G; G07; G07F; G07F17/00; G07F17/16; G06; G06V; G06V10/00; G06V10/88; B; B42; B42D; B42D25/00; B42D25/20; B42D25/29; G06Q; G06Q20/00; G06Q20/30; G06Q20/34; G06Q20/341; G06Q20/38; G06Q20/40; G06Q20/401; G06Q20/4014; G06Q20/40145; G06T; G06T1/00; G06T1/0021; G06T1/005; G06T1/0064; G06V30/00; G06V30/40; G07C; G07C9/00; G07C9/20; G07C9/22; G07C9/25; G07C9/253; G07D; G07D7/00; G07D7/003; G07D7/0032; G07D7/0034; G07D7/004; G07F7/00; G07F7/08; G07F7/086; G07F7/10; G07F7/1008; G07F7/1016; G07F7/12; G10; G10L; G10L19/00; G10L19/018; G11; G11B; G11B20/00; G11B20/00086; G11B20/00094; G11B20/00166; G11B20/0021; G11B20/00217; G11B20/00224; G11B20/00485; G11B20/00557; G11B20/00855; G11B20/00884; G11B20/00891; H; H04; H04B; H04B1/00; H04B1/66; H04B1/665; H04N; H04N1/00; H04N1/00002; H04N1/00005; H04N1/00026; H04N1/00037; H04N1/00071; H04N1/00074; H04N1/00079; H04N1/00838; H04N1/0084; H04N1/00843; H04N1/00846; H04N1/00856; H04N1/00864; H04N1/00867; H04N1/0087; H04N1/00875; H04N1/32; H04N1/32101; H04N1/32144; H04N1/32149; H04N1/32203; H04N1/32208; H04N1/32219; H04N1/32251; H04N1/32261; H04N1/32288; H04N1/32304; H04N1/32352; H04N21/00; H04N21/20; H04N21/23; H04N21/238; H04N21/2389; H04N21/23892; H04N21/80; H04N21/83; H04N21/835; H04N21/8358; H04N5/00; H04N5/76; H04N5/91; H04N5/913; B29; B29C; B29C45/00; B29C45/14; B29C45/1418; G06T2201/00; G06T2201/005; G06T2201/0051; G06T2201/0052; G06T2201/0061; G06T2201/0065; G11B20/00876; H04N1/32106; H04N1/32122; H04N2005/91307; H04N2005/91321; H04N2005/91335; H04N2201/00; H04N2201/32; H04N2201/3201; H04N2201/3204; H04N2201/3205; H04N2201/3207; H04N2201/3225; H04N2201/3226; H04N2201/3233; H04N2201/3239; H04N2201/3269; H04N2201/327; H04N2201/3271; H04N2201/3274; H04N2201/328; Y; Y10; Y10S; Y10S428/00; Y10S428/916; Y10T; Y10T428/00; Y10T428/24; Y10T428/24802
Claims Analysis
Total Claims: 28
Claim 1
Independent Claim
67 words
A method of generating a machine readable code on a printed document comprising: providing a visible structure used for geometric registration; generating a variable auxiliary message comprising message values; mapping the message values to a two dimensional pattern of locations in the visible structure on the document; and repeating the auxiliary message and representing the auxiliary message differently in the two dimensional pattern according to a key.
Claim 2
Independent Claim
67 words
A method of generating a machine readable code on a printed document comprising: providing a visible structure used for geometric registration; generating a variable auxiliary message comprising message values; mapping the message values to a two dimensional pattern of locations in the visible structure on the document; and repeating the auxiliary message and representing the auxiliary message differently in the two dimensional pattern according to a key.
Claim 3
Dependent Claim
20 words
The method of claim 1 wherein the key is used to spread the message redundantly over the two dimensional pattern.
Claim 4
Dependent Claim
22 words
The method of claim 2 wherein the key is used in a randomization process spread the message over the two dimensional pattern.
Claim 5
Dependent Claim
17 words
The method of claim 3 wherein the randomization process randomizes the mapping of message values to locations.
Claim 6
Dependent Claim
14 words
The method of claim 3 wherein the randomization process randomizes values of the message.
Claim 7
Dependent Claim
19 words
The method of claim 5 wherein the randomization process randomizes message values into binary values of substantially equal probability.
Claim 8
Dependent Claim
14 words
The method of claim 1 wherein the key is used to randomize the message.
Claim 9
Dependent Claim
20 words
The method of claim 1 wherein the auxiliary message is spread over the two dimensional pattern using a random number.
Claim 10
Dependent Claim
26 words
The method of claim 8 wherein the message comprises binary values and the binary values are randomized into substantially equal probability of two different binary values.
Claim 11
Dependent Claim
15 words
The method of claim 1 wherein line structures are used carry the machine readable code.
Claim 12
Dependent Claim
49 words
The method of claim 1 wherein the machine readable code carries information that correlates with or is redundant to readable information on the printed document for authentication of the document by comparing at least a part of the machine readable code with the readable information printed on the document.
Claim 13
Dependent Claim
16 words
A tangible medium on which is stored instructions for performing the method of claim 1 .
Claim 14
Independent Claim
86 words
A method for detecting a machine readable code on a printed document, the method comprising: receiving an image scanned of the printed document; detecting a visible registration pattern in the image to perform geometric registration for the machine readable code; finding locations of a variable machine readable message arranged in the registration pattern, wherein the message is repeated and represented differently in a two dimensional pattern according to a key; extracting message values from image structures at the locations to decode the variable machine readable message.
Claim 15
Independent Claim
86 words
A method for detecting a machine readable code on a printed document, the method comprising: receiving an image scanned of the printed document; detecting a visible registration pattern in the image to perform geometric registration for the machine readable code; finding locations of a variable machine readable message arranged in the registration pattern, wherein the message is repeated and represented differently in a two dimensional pattern according to a key; extracting message values from image structures at the locations to decode the variable machine readable message.
Claim 16
Dependent Claim
20 words
The method of claim 13 wherein the key is used to spread the message redundantly over the two dimensional pattern.
Claim 17
Dependent Claim
22 words
The method of claim 14 wherein the key is used in a randomization process spread the message over the two dimensional pattern.
Claim 18
Dependent Claim
17 words
The method of claim 15 wherein the randomization process randomizes the mapping of message values to locations.
Claim 19
Dependent Claim
14 words
The method of claim 15 wherein the randomization process randomizes values of the message.
Claim 20
Dependent Claim
19 words
The method of claim 17 wherein the randomization process randomizes message values into binary values of substantially equal probability.
Claim 21
Dependent Claim
14 words
The method of claim 13 wherein the key is used to randomize the message.
Claim 22
Dependent Claim
20 words
The method of claim 13 wherein the auxiliary message is spread over the two dimensional pattern using a random number.
Claim 23
Dependent Claim
26 words
The method of claim 20 wherein the message comprises binary values and the binary values are randomized into substantially equal probability of two different binary values.
Claim 24
Dependent Claim
15 words
The method of claim 13 wherein line structures are used carry the machine readable code.
Claim 25
Dependent Claim
17 words
The method of claim 13 wherein ink dot structures are used to carry the machine readable code.
Claim 26
Dependent Claim
27 words
The method of claim 13 wherein varying ink structures are used to carry message elements having the same value at different locations in the two dimensional pattern.
Claim 27
Dependent Claim
49 words
The method of claim 13 wherein the machine readable code carries information that correlates with or is redundant to readable information on the printed document for authentication of the document by comparing at least a part of the machine readable code with the readable information printed on the document.
Claim 28
Dependent Claim
16 words
A tangible medium on which is stored instructions for performing the method of claim 13 .
References Cited (Backward Citations)
DE2943436A1
Cited
US4660859A
Cited
US5471533A
Cited
US5337361A
Cited
US5337361C1
Cited
US5471533B1
Cited
US5091966A
Cited
US5374976A
Cited
US5550932A
Cited
US5668898A
Cited
US5832119C1
Cited
US5832119A
Cited
US6343138B1
Cited
US5862260A
Cited
US5629770A
Cited
US6086706A
Cited
US6345104B1
Cited
US20030215112A1
Cited
WO1995026274A1
Cited
US5611575A
Cited
US5572010A
Cited
US6185683B1
Cited
US5799092A
Cited
US5636292A
Cited
US5636292C1
Cited
US6449377B1
Cited
US6754377B2
Cited
US5838814A
Cited
US5919730A
Cited
US5843564A
Cited
US20010019611A1
Cited
US6018593A
Cited
US5772250A
Cited
US6011857A
Cited
US6181813B1
Cited
US5949055A
Cited
US6104812A
Cited
US6081345A
Cited
US6205249B1
Cited
US20040170299A1
Cited
US6871789B2
Cited
US20030063319A1
Cited
US6782116B1
Cited
USPTO Annuity & Maintenance Windows
| Annuity Stage | Window Opens | Payment Deadline | Surcharge Period Until | Estimated Fee | Status |
|---|---|---|---|---|---|
| 3.5 Years (Year 4) | 2008-10-24 | 2009-04-25 | 2009-10-25 | $2000.00 | Window Closed / Lapsed |
| 7.5 Years (Year 8) | 2012-10-24 | 2013-04-25 | 2013-10-25 | $3760.00 | Window Closed / Lapsed |
| 11.5 Years (Year 12) | 2016-10-24 | 2017-04-25 | 2017-10-25 | $7700.00 | Window Closed / Lapsed |