Sparse modulation for robust signaling and synchronization

Patent metadata

Field	Value
Publication number	US-11308571-B2
Application number	US-201916579667-A
Country	US
Kind code	B2
Filing date	Sep 23, 2019
Priority date	Mar 20, 2015
Publication date	Apr 19, 2022
Grant date	Apr 19, 2022

Abstract

The present disclosure relates to advanced image processing and encoded signal processing. One claim currently recites an image processing method comprising the acts: receiving a digital representation of artwork, the artwork having an area of uniform color; generating a two-dimensional data signal that redundantly encodes a plural-bit message, the data signal comprising plural elements, each of which has a single bit value; receiving a two-dimensional synchronization signal comprising plural elements, each of which has a plural-bit value, each element of said data signal having an element of the synchronization signal corresponding thereto; processing the two-dimensional data signal with the two-dimensional synchronization signal and with a gradient function to yield a two-dimensional gradient marking signal; and printing an ink counterpart of the gradient marking signal on a medium with the artwork, said printing comprising printing plural dithered two-dimensional blocks of at least four contiguous elements each, in which one or more elements of each block are printed to be dark. Of course, other claims and combinations are described as well.

First claim

We claim:

1. A method of generating a signaling pattern for printing on a substrate, the method comprising the acts:
defining a 2D synchronization signal in a spatial-frequency domain;
applying an NM×NM inverse Fourier transform to said signal, to yield an NM×NM array of sync signal values in a spatial domain;
logically combining said NM×NM array of sync signal values with an N×N array of variable data, wherein each datum of variable data corresponds to an M×M sub-block of sync signal values, yielding an NM×NM array of composite values defining a pattern;
in an M×M sub-block within said NM×NM array of composite values, identifying a first set of P elements as candidates for darkening, wherein said identifying comprises determining the P elements whose values are most extreme among said M×M sub-block from the array of composite values; and
producing a pattern including a second set of P elements that are darkened for printing.

2. The method of claim 1 that further comprises printing a label with said pattern.

3. The method of claim 1 in which the first set of P elements and the second set of P elements are identical.

4. The method of claim 1 that further includes determining existence of edge-adjoining elements among the first set of P elements, and identifying the second set of P elements by revising the first set of P elements to avoid edge-adjoining elements.

5. The method of claim 1 in which N is 128 and M is 4.

6. A non-transitory computer readable medium comprising instructions stored therein that, when executed by one or more processors, cause said one or more processors to perform the following acts:
defining a 2D synchronization signal in a spatial-frequency domain;
applying an NM×NM inverse Fourier transform to said signal, to yield an NM×NM array of sync signal values in a spatial domain;
logically combining said NM×NM array of sync signal values with an N×N array of variable data, wherein each datum of variable data corresponds to an M×M sub-block of sync signal values, yielding an NM×NM array of composite values defining a pattern;
in an M×M sub-block within said NM×NM array of composite values, identifying a first set of P elements as candidates for darkening, wherein said identifying comprises determining the P elements whose values are most extreme among said M×M sub-block from the array of composite values; and
producing a pattern including a second set of P elements that are darkened for printing.

7. The non-transitory computer readable medium of claim 6 that further comprises outputting printing instructions for a label with said pattern.

8. The non-transitory computer readable medium of claim 6 in which the first set of P elements and the second set of P elements are identical.

9. The non-transitory computer readable medium of claim 6 that further includes instructions for determining existence of edge-adjoining elements among the first set of P elements, and identifying the second set of P elements by revising the first set of P elements to avoid edge-adjoining elements.

10. The non-transitory computer readable medium of claim 6 in which N comprises 128 and M comprises 4.

11. An apparatus comprising:
an input for receiving variable data;
one or more electronic processors configured for:
defining a 2D synchronization signal in a spatial-frequency domain; applying an NM×NM inverse Fourier transform to said signal, to yield an NM×NM array of sync signal values in a spatial domain;
logically combining said NM×NM array of sync signal values with an N×N array of variable data, wherein each datum of variable data corresponds to an M×M sub-block of sync signal values, yielding an NM×NM array of composite values defining a pattern;
in an M×M sub-block within said NM×NM array of composite values, identifying a first set of P elements as candidates for darkening, wherein said identifying comprises determining the P elements whose values are most extreme among said M×M sub-block from the array of composite values;
producing a pattern including a second set of P elements that are darkened for printing; and

an output for outputting the pattern.

12. The apparatus of claim 11 in which the first set of P elements and the second set of P elements are identical.

13. The apparatus of claim 11 in which said one or more electronic processors are configured for determining existence of edge-adjoining elements among the first set of P elements, and identifying the second set of P elements by revising the first set of P elements to avoid edge-adjoining elements.

14. The apparatus of claim 11 in which N comprises 128 and M comprises 4.

Assignees

• Digimarc Corp

Inventors

• Holub Vojtech
• Haaga Donald
• Sharma Ravi K
• Schulte Jeffrey B
• Evans Eric D

Classifications

• G06T1/005 Primary

  Robust watermarking, e.g. average attack or collusion attack resistant · CPC title

• G06T2201/0061

  Embedding of the watermark in each block of the image, e.g. segmented watermarking · CPC title

• G06T2201/0065

  Extraction of an embedded watermark; Reliable detection · CPC title

• H04N2201/3236

  Details of authentication information generation · CPC title

• G06T1/0028

  Adaptive watermarking, e.g. Human Visual System [HVS]-based watermarking · CPC title