IP Library Granted Patent US 12,282,979
Granted Patent B2
US 12,282,979 · App. 17/716,416 · Granted Apr 22, 2025

Serialized digital watermarking for variable data printing

Inventors: Tomas Filler (Beaverton, OR); Matthew M. Weaver (Portland, OR); Tony F. Rodriguez (Portland, OR); Donald Haaga (Portland, OR); Mark-Andrew Ray Tait (Beaverton, OR); Jeremy Cattone (Tigard, OR)
Assignee: Digimarc Corporation
G06T1/0092G06F3/122G06F3/1243G06F3/1282G06T1/0028G06T1/005H04N1/32H04N1/32256G06T2201/0051G06T2201/0061G06T2201/0202G06T2201/0601
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,282,979
App. No.
17/716,416
Granted
Apr 22, 2025
Kind
B2
Abstract

Variable data printing workflows are enhanced for use with content that includes 2D code patterns, such as digital watermark data. One arrangement includes applying a filter to a content stream within a PDF document to extract both first variable pattern data for a first watermark pattern and second variable pattern data for a second watermark pattern. A first composite watermark pattern is then defined based on the extracted first variable watermark pattern data in conjunction with static watermark pattern data, and a second composite watermark pattern is defined based on the extracted second variable watermark pattern data in conjunction with the static watermark pattern data. A variety of other features and arrangements are also detailed.

Claims (28)

1. A method comprising the acts:

from a first content stream in a portable document format data structure, applying a filter to extract both first variable pattern data for a first watermark pattern and second variable pattern data for a second watermark pattern;

defining a first composite watermark pattern based on the first variable pattern data and a static watermark pattern data;

defining a second composite watermark pattern, different than the first composite watermark pattern, based on the second variable pattern data and said static watermark pattern data; and

rendering both the first composite watermark pattern and the second composite watermark pattern on a common substrate, in which said rendering renders both the first composite watermark pattern and the second composite watermark pattern adjacent each other on the common substrate.

2. The method of claim 1 in which said filter is a run length decoding filter, a CCITT FAX decoding filter, or a JBIG2 decoding filter.

3. The method of claim 1 that further includes applying a filter to obtain said static watermark pattern data using a second content stream in said portable document format data structure.

4. The method of claim 3 that includes extracting a batch identifier from the second content stream, and accessing a data structure with said batch identifier to obtain said static watermark pattern data.

5. The method of claim 3 in which the first content stream and the second content stream comprise a single content stream.

6. The method of claim 1 that includes printing said watermark patterns adjacent each other on a tape substrate, for later use in sealing cartons.

7. In a method of compiling multiple 2D code patterns for labeling multiple respective items, each 2D code pattern comprising plural marks, each mark occupying a corresponding location in its respective 2D code pattern, each of said multiple 2D code patterns being different, each 2D code pattern expressing a payload signal component and a reference signal component, the reference signal component enabling a compliant decoder to determine scale and rotation of a 2D code pattern depicted within a camera-captured image of a labeled item, an improvement comprising the acts:

identifying a first set of locations that are consistently occupied by marks in said multiple 2D code patterns;

storing first data identifying said first set of locations in a first data structure;

for each of said multiple 2D code patterns, identifying a second set of locations occupied by marks, excluding locations included in the first set of locations; and

for each of said multiple 2D code patterns, storing second data identifying said second set of locations in a second data structure;

wherein said second data structure expresses each mark location by a single datum rather than two or more data, said single datum being a single binary number, thereby effecting a reduction in storage medium capacity required for data structure storage.

8. The method of claim 7 in which said identifying act comprises identifying a first set of locations that are all occupied by marks in all of said multiple 2D code patterns.

9. The method of claim 7 that includes storing the first data identifying said first set of locations, and said second data identifying said second set of locations, in a shared data structure.

10. The method of claim 7 in which the first data structure and the second data structures share a common storage medium.

11. In a method of printing multiple 2D code patterns for labeling multiple respective items, each 2D code pattern comprising plural marks, each mark occupying a corresponding location in its respective 2D code pattern, each of said multiple 2D code patterns being different, each 2D code pattern expressing a payload signal component and a reference signal component, the reference signal component enabling a compliant decoder to determine scale and rotation of a 2D code pattern depicted within a camera-captured image of a labeled item, an improvement comprising the acts:

(a) reading first data from a first data structure, the first data indicating a first set of mark locations;

(b) reading second data from a second data structure, the second data indicating a second set of mark locations, the second data expressing each mark location by a single datum rather than two or more data, said single datum being a single binary number;

(c) printing a composite 2D code pattern having marks placed at mark locations indicated by the first data and the second data; and

(d) repeating at least acts (b) and (c) multiple times, each with a different second set of mark locations, yielding different composite 2D code patterns.

12. The method of claim 11 in which the second data indicates a group of locations at which marks are to be added, and a group of locations at which marks are to be removed, the group of locations at which marks are to be removed being a subset of locations indicated by the first data.

13. The method of claim 12 in which the first data comprises data indicating a set of mark locations corresponding to the reference signal component, and additionally indicating a set of mark locations not corresponding to the reference signal component but instead corresponding to payload signal component mark locations for one or more of said 2D code patterns.

14. The method of claim 11 that includes reading the first data and the second data from a common data structure.

15. The method of claim 11 that includes printing plural of said composite 2D code patterns on a common substrate, for later separation and labeling of the multiple respective items.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 20, 2022
From: FILLER, TOMAS; WEAVER, MATTHEW M.; RODRIGUEZ, TONY F.; HAAGA, DONALD; TAIT, MARK-ANDREW RAY; CATTONE, JEREMY
To: DIGIMARC CORPORATION
Reel/Frame 059976/0880 →
Continuity (7)
Continuation In Part 16789992 · Feb 13, 2020
Continuation 16356806 · Mar 18, 2019
Continuation 15928628 · Mar 22, 2018
Continuation 15167932 · May 27, 2016
Provisional Application 63323833 · Mar 25, 2022
Provisional Application 62168694 · May 29, 2015
Related Publication 20220301094A1 · Sep 22, 2022
References Cited (45)
US 6614914B1 · Rhoads · 2003 [cited by applicant]
US 7352878B2 · Reed · 2008 [cited by applicant]
US 8300884B2 · Sharma · 2012 [cited by examiner]
US 8355525B2 · McKinley · 2013 [cited by applicant]
US 8594364B2 · Hein · 2013 [cited by applicant]
US 9380186B2 · Reed · 2016 [cited by examiner]
US 9401001B2 · Reed · 2016 [cited by applicant]
US 9449357B1 · Lyons · 2016 [cited by applicant]
US 9565335B2 · Reed · 2017 [cited by applicant]
US 9635378B2 · Holub · 2017 [cited by applicant]
US 9747656B2 · Stach · 2017 [cited by applicant]
US 9928561B2 · Filler · 2018 [cited by applicant]
US 10235731B2 · Filler · 2019 [cited by applicant]
US 10565669B2 · Filler · 2020 [cited by applicant]
US 10580103B1 · Falkenstern · 2020 [cited by applicant]
US 11062108B2 · Bradley · 2021 [cited by applicant]
US 11288764B2 · Kamath · 2022 [cited by applicant]
US 11386517B2 · Filler · 2022 [cited by applicant]
US 11636565B1 · Evans · 2023 [cited by applicant]
US 11900497B1 · Falkenstern · 2024 [cited by applicant]
US 20020099943A1 · Rodriguez · 2002 [cited by applicant]
US 20020118394A1 · McKinley · 2002 [cited by applicant]
US 20030033530A1 · Sharma · 2003 [cited by examiner]
US 20030112974A1 · Levy · 2003 [cited by applicant]
US 20040263911A1 · Rodriguez · 2004 [cited by examiner]
US 20060115110A1 · Rodriguez · 2006 [cited by applicant]
US 20070187505A1 · Rhoads · 2007 [cited by applicant]
US 20070253027A1 · Hiebert · 2007 [cited by applicant]
US 20080219503A1 · Di Venuto · 2008 [cited by applicant]
US 20080301767A1 · Picard · 2008 [cited by applicant]
US 20100150434A1 · Reed · 2010 [cited by examiner]
US 20110280480A1 · Simske · 2011 [cited by examiner]
US 20120127513A1 · Gloukhenki · 2012 [cited by examiner]
US 20130329006A1 · Boles · 2013 [cited by applicant]
US 20140119593A1 · Filler · 2014 [cited by applicant]
US 20150016664A1 · Rodriguez · 2015 [cited by applicant]
US 20150156369A1 · Reed · 2015 [cited by applicant]
US 20150187039A1 · Reed · 2015 [cited by applicant]
US 20170024840A1 · Holub · 2017 [cited by applicant]
US 20170061563A1 · Falkenstern · 2017 [cited by applicant]
US 20170132465A1 · Kutter · 2017 [cited by applicant]
US 20190332840A1 · Sharma · 2019 [cited by applicant]
US 20210390358A1 · Filler · 2021 [cited by applicant]
Anh Thu Phan Ho, Bao An Hoang Mai, Wadih Sawaya, Patrick Bas. Document Authentication Using Graphical Codes: Reliable Performance Analysis and Channel Optimization. EURASIP Journal on Information Security, Hindawi, 2014… [cited by applicant]
Voloshynovskiy, S.; Diephuis, M.; Beekhof, F.; Koval, O.; Keel, B., “Towards reproducible results in authentication based on physical non-cloneable functions: The forensic authentication microstructure optical set (FAMO… [cited by applicant]