# US 2019/0171856 A1 · Generating and reading optical codes with variable density to adapt for visual quality and reliability

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0171856 A1
- Document ID: US20190171856A1
- Status: Published application
- Kind: A1
- Application number: 16/002,989
- Filed: 2018-06-07
- Published: 2019-06-06
- Earliest claimed: 2017-11-07
- Assignees: Digimarc Corporation
- Applicants: Digimarc Corporation
- Inventors: Ravi K. Sharma; Tomas Denemark; Brett A. Bradley; Geoffrey B. Rhoads; Eoin C. Sinclair; Vojtech Holub; Hugh L. Brunk; Trent J. Brundage; John F. Stach; John D. Lord; Joel R. Meyer
- Web page: https://patentgrep.com/patent/US20190171856A1

## CPC

- G06K 7/1417: {2D bar codes}
- G06K 19/06037: {multi-dimensional coding}
- G06K 19/06103: {the marking being embedded in a human recognizable image, e.g. a company logo with an embedded two-dimensional code}
- G06K: GRAPHICAL DATA READING (image or video recognition or understanding G06V); PRESENTATION OF DATA; RECORD CARRIERS; HANDLING RECORD CARRIERS

## Abstract

The parameters of an optical code are optimized to achieve improved signal robustness, reliability, capacity and/or visual quality. An optimization program can determine spatial density, dot distance, dot size and signal component priority to optimize robustness. An optical code generator employs these parameters to produce an optical code at the desired spatial density and robustness. The optical code is merged into a host image, such as imagery, text and graphics of a package or label, or it may be printed by itself, e.g., on an otherwise blank label or carton. A great number of other features and arrangements are also detailed.

## Claims

### Claim 1

A method of generating a machine readable optical code, the method comprising:
constructing an optical code comprising an encoded variable digital payload and configured with reference signal structure for geometric synchronization of the encoded variable digital payload;
mapping elements of the optical code to spatial locations of an output image, the mapping comprising:
a) finding an optical code element value having highest priority in the optical code and forming an optical code element in the output image at a spatial location of the optical code element found to have the highest priority;
b) forming additional optical elements in order of priority of the additional optical elements, with a constraint that the forming adheres to a spatial distance constraint; and
rendering the output image on a substrate.

### Claim at position 2

2-7. (canceled)

### Claim 8 (depends on 1)

The method of claim 1 wherein the constructing comprises assigning a priority to data symbols of the encoded variable digital payload according to location within the optical code to control redundant distribution of instances of a data symbol in the output image.

### Claim 9 (depends on 1)

The method of claim 1 further comprising assigning varying relative priority to data and synchronization components of the optical code, generating output images with an optical code at each of the relative priorities, measuring robustness of the optical codes in the output images, and determining the relative priority that meets a robustness constraint.

### Claim 10 (depends on 1)

The method of claim 1 further comprising assigning varying minimum spacing distances to the mapping of elements of the optical code to the output image, generating output images with an optical code mapped according to different minimum spacing distances, measuring robustness of the optical codes in the output images, and determining a minimum spacing distance that meets a robustness constraint.

### Claim at position 6

11-24. (canceled)

### Claim 25

A method comprising:
(a) a step for obtaining a 2D payload signal comprising an M×M array of elements, each having a first or a second value;
(b) a step for obtaining a 2D reference signal comprising an N×N array of elements, said elements being multi-valued, where N>M; and
(c) a step for generating a sparse 2D signal comprising an array of N×N elements from the 2D payload signal and the 2D reference signal, each of said elements having the first or second values.

### Claim at position 8

26-31. (canceled)

### Claim 32 (depends on 25)

The method of claim 25 in which step (b) comprises summing plural 2D sinusoids of different frequencies and phases, and sampling a result at N×N points to achieve an N×N array of element values.

### Claim 33 (depends on 25)

The method of claim 25 in which step (b) comprises summing plural 2D sinusoids of different amplitudes, frequencies and phases, and sampling a result at N×N points to achieve an N×N array of element values.

### Claim at position 11

34-35. (canceled)

### Claim 36 (depends on 25)

The method of claim 25 in which step (c) comprises:
interpolating the M×M payload signal block to yield an N×N signal block, said interpolating also changing the elements of the payload signal block to multi-valued elements;
combining the N×N reference signal block and the interpolated N×N payload signal block to yield a composite dense code block comprised of N×N multi-valued elements; and
a step for selecting locations to mark in the sparse N×N output signal block, based on values of elements in the N×N composite dense code block.

### Claim 37 (depends on 36)

The method of claim 36 in which the combining act comprises combining the N×N reference signal block and the interpolated N×N payload signal block in a weighted ratio to yield the composite dense code block comprised of N×N multi-valued elements, said ratio being other than 1:1.

### Claim 38 (depends on 36)

The method of claim 36 in which the step for selecting locations comprises identifying locations in the N×N composite dense code block that have element values below a threshold value, and using said locations, or a subset of said locations, as locations to mark in the sparse N×N output signal block

### Claim 39 (depends on 36)

The method of claim 36 in which the step for selecting comprises:
identifying a first element in the composite dense code block having an element value below a threshold value;
evaluating said first element against data stored in a memory, to determine whether a location of the first element is within a keep-out zone;
determining that the first element is not within a keep-out zone, and forming a mark in a sparse output signal block corresponding to the location of said first element within the N×N composite dense code;
identifying a second element in the composite dense code block having an element value below a threshold value;
evaluating said second element against data stored in the memory, to determine whether location of the second element is within a keep-out zone; and
determining that the second element is within a keep-out zone, and not forming a mark corresponding thereto in the sparse output signal block.

### Claim at position 16

40-90. (canceled)

### Claim 91

A method of generating a sparse machine readable 2D code, employing a message signal and a 2D reference signal, comprising the acts:
identifying a first set of locations in a 2D block, said locations corresponding to extrema of the 2D reference signal;
selecting a subset of said first set of locations in accordance with the message signal; and
producing an output signal having marks at the selected subset of locations in an output signal block;
wherein the output signal serves as a sparse machine readable 2D code, in which the marks all represent extrema of the reference signal, and their selection represents the message signal.

### Claim 92 (depends on 91)

The method of claim 91 in which the message symbol comprises a string of symbols, and in which the method further includes establishing plural paired locations of extrema of the 2D reference signal, and selecting between the first and second locations of each pair for marking, to represent a symbol in the message signal as having first or second values, respectively.

### Claim at position 19

93-98. (canceled)

### Claim 99 (depends on 91)

The method of claim 91 in which the message signal comprises a string of plural bits, each having a first or a second value at a respective position in the string, and in which the method further includes:
ranking a list of M 2D reference signal elements by values, each having an ordinal position in the list, and being associated with a location in the 2D reference signal, the list thereby defining plural pairs of elements, having ordinal positions of 2N and 2N+1, for N=0, 1, 2, . . . (M/2)−1, each pair of elements thus comprising an element with an even ordinal position and an element with an odd ordinal position;
associating each position in the message signal with a pair of elements in said ranked list; and
providing a mark in the output signal block at a location corresponding to the location of the even element in a pair, when the associated position in the message signal has the first value, and providing a mark in the output signal block at a location corresponding to the location of the odd element in a pair, when the associated position in the message signal has the second value.

### Claim at position 21

100-115. (canceled)
