IP Library Granted Patent US 12,525,991
Granted Patent B1
US 12,525,991 · App. 17/897,552 · Granted Jan 13, 2026

Sparse path codes and methods

Inventors: Brett A. Bradley (Portland, OR); Nicholas Anderson (Colorado Springs, CO); William Y. Conwell (Portland, OR)
Assignee: Digimarc Corporation
H03M13/1111G06T7/70H03M13/611G06T2207/20084G06T2207/30204
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,525,991
App. No.
17/897,552
Granted
Jan 13, 2026
Kind
B1
Abstract

A series of marks and absences of marks (voids) arrayed along one or a few mathematically-defined paths, define a message-conveying sparse path code. Multiple improvements in the forms of such codes, and related encoding and reading techniques, are detailed. Some such improvements provide greatly increased robustness and decreased visibility. A variety of other features and arrangements are also detailed.

Claims (28)

1 . A plastic sorting method comprising the acts:

reading a sparse path code defined by features on an item, from imagery of said item on a conveyor and depicting the sparse path code, the sparse path code following a curved line and comprising regularly-spaced candidate marking locations along the curved line at which said features are selectively placed, the reading producing information, in which the reading act includes extracting a bit sequence from the sparse path code, and computing a dot product between an extracted bit sequence, and each of plural candidate sequences, to produce said information by determining which of said plural candidate sequences is most likely to correspond to the extracted bit sequence;

using produced information to determine that the item comprises an item of one plastic, sheathed in a sleeve of a second, different plastic; and

diverting said item into a repository that contains other sheathed items.

2 . The plastic sorting method of claim 1 in which said reading comprises applying the imagery to a network that includes one or more convolutional layers and that is configured to identify a location of at least a sync code portion of the sparse path code in the imagery.

3 . The method of claim 1 in which the reading act includes applying a Laplacian filter, or plural Laplacian filters of different scales, to the imagery depicting the sparse path code.

4 . The method of claim 1 in which the reading act includes examining the imagery depicting the sparse path code for pairs of features located within a predetermined pixel spacing.

5 . The method of claim 1 in which the reading act includes determining a probability value for each sparse path code feature depicted in the imagery, based on a local contrast metric computed over a region centered on the feature, and performing soft-decision decoding employing determined probability values for said features in producing said information.

6 . The method of claim 1 in which the sparse path code comprises a closed-path code.

7 . The method of claim 1 wherein one of said features spans an area on said item that is X microns on a side, and a pixel in said imagery spans a camera focal plane region that is Y microns on a side, wherein the ratio X/Y is less than 1, 1/2, 1/4, or 1/8.

8 . The method of claim 1 in which the features are 150 microns, 120 microns, 100 microns, 75 microns, 66 microns, 50 microns, 40 microns, 33 microns, or 20 microns or less in diameter.

9 . A system for sorting plastic items, comprising:

a conveyor having an item thereon;

a camera system for capturing imagery depicting the conveyor with the item thereon;

means for reading a sparse path code defined by features on the item, from captured imagery depicting the sparse path code on the item, the sparse path code following a curved line and comprising regularly-spaced candidate marking locations along the curved line at which said features are selectively placed, said means producing information, in which said means for reading a sparse path code includes means for extracting a bit sequence from the sparse path code and for computing a dot product between an extracted bit sequence, and each of plural candidate sequences, in producing the information by determining which of the plural candidate sequences is most likely to correspond to the extracted bit sequence;

means for using produced information to determine the item comprises an item of one plastic, sheathed in a sleeve of a second, different plastic; and

means for diverting said item into a repository that contains other sheathed items.

10 . The system of claim 9 in which said means for reading comprises a network including one or more convolutional layers, in which the network is configured to identify a location of at least a sync code portion of the sparse path code in the captured imagery.

11 . The system of claim 9 in which the means for reading a sparse path code includes means for applying a Laplacian filter, or plural Laplacian filters of different scales, to imagery depicting the sparse path code.

12 . The system of claim 9 in which the means for reading a sparse path code includes means for examining the imagery depicting the sparse path code for pairs of features located within a predetermined pixel spacing.

13 . The system of claim 9 in which the means for reading a sparse path code includes means for determining a probability value for each sparse path code feature depicted in the imagery, based on a local contrast metric computed over a region centered on the feature, and performing soft-decision decoding employing determined probability values for said features in producing said information.

14 . The system of claim 9 in which the sparse path code comprises a closed-path code.

15 . The system of claim 9 wherein one of said features spans an area on said item that is X microns on a side, and a pixel in said imagery spans a camera focal plane region that is Y microns on a side, wherein the ratio X/Y is less than 1, 1/2, 1/4, or 1/8.

16 . The system of claim 9 in which the features are 150 microns, 120 microns, 100 microns, 75 microns, 66 microns, 50 microns, 40 microns, 33 microns, or 20 microns or less in diameter.

17 . A non-transitory computer readable medium containing instructions for configuring a computer system in a plastic sorting facility to perform acts including:

reading a sparse path code defined by features on an item, from imagery of said item on a conveyor, the sparse path code following a curved line and comprising regularly-spaced candidate marking locations along the curved line at which said features are selectively placed, the reading producing information, in which the reading a sparse path code includes extracting a bit sequence from the sparse path code, and computing a dot product between an extracted bit sequence, and each of plural candidate sequences, to produce the information by determining which of said plural candidate sequences is most likely to correspond to the extracted bit sequence;

using produced information to determine that the item comprises an item of one plastic, sheathed in a sleeve of a second, different plastic; and

controlling a diverter apparatus to divert the item from the conveyor into a repository that contains other sheathed items.

Assignments (3)
ARTICLES OF CONVERSION Recorded Jun 19, 2026
From: DIGIMARC CORPORATION
To: DIGIMARC LLC
Reel/Frame 075863/0211 →
ARTICLES OF AMENDMENT OFTHE ARTICLES OF ORGANIZATION OF DIGIMARC LLC Recorded Jun 19, 2026
From: DIGIMARC LLC
To: DMRC LLC
Reel/Frame 075863/0266 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 17, 2025
From: BRADLEY, BRETT A.; ANDERSON, NICHOLAS; CONWELL, WILLIAM Y.
To: DIGIMARC CORPORATION
Reel/Frame 073248/0094 →
Continuity (1)
Provisional Application 63240821 · Sep 3, 2021
References Cited (30)
US 4644151A · Juvinall · 1987 [cited by examiner]
US 5301238A · Apter · 1994 [cited by examiner]
US 6988202B1 · Rhoads · 2006 [cited by examiner]
US 7621459B2 · Hovis · 2009 [cited by applicant]
US 7878415B2 · Hovis · 2011 [cited by applicant]
US 8517281B2 · Rupp · 2013 [cited by applicant]
US 9292725B2 · Salvi · 2016 [cited by applicant]
US 20010055407A1 · Rhoads · 2001 [cited by examiner]
US 20130037619A1 · Key · 2013 [cited by examiner]
US 20140060747A1 · Friedlaender · 2014 [cited by examiner]
US 20180345323A1 · Kerver · 2018 [cited by applicant]
US 20180345326A1 · Tsutsumi · 2018 [cited by examiner]
US 20190171856A1 · Sharma · 2019 [cited by examiner]
US 20190306385A1 · Sharma · 2019 [cited by applicant]
US 20190351457A1 · Kerver · 2019 [cited by examiner]
US 20210299706A1 · Filler · 2021 [cited by applicant]
US 20220004832A1 · Doheny, II · 2022 [cited by examiner]
US 20220371055A1 · Kerver · 2022 [cited by examiner]
CN 111144160A · 2020 [cited by examiner]
WO 0200068 · 2002 [cited by applicant]
WO 2021078842 · 2021 [cited by applicant]
Podilchuk et al., “Image-adaptive watermarking using visual models,” in IEEE Journal on Selected Areas in Communications, vol. 16, No. 4, pp. 525-539, May 1998, doi: 10.1109/49.668975. (Year: 1998). [cited by examiner]
Freeman et al., “Performance of a two-dimensional product code with soft-decision decoding,” Proceedings of MILCOM '94, Fort Monmouth, NJ, USA, 1994, pp. 1032-1037 vol. 3, doi: 10.1109/MILCOM.1994.473958. (Year: 1994). [cited by examiner]
Phadikar et al., “Region based QIM digital watermarking scheme for image database in DCT domain,” in ScienceDirect Journal on Computers & Electrical Engineering, vol. 37, No. 3, pp. 339-555, 2011, doi: https://doi.org/1… [cited by examiner]
Schlauweg et al., “Avoiding Hard Decisions in Adaptive Watermarking,” 2007 IEEE International Conference on Image Processing, San Antonio, TX, USA, 2007, pp. IV-453-IV-456, doi: 10.1109/ICIP.2007.4380052. (Year: 2007). [cited by examiner]
Viterbi, “Error bounds for convolutional codes and an asymptotically optimum decoding algorithm,” in IEEE Transactions on Information Theory, vol. 13, No. 2, pp. 260-269, Apr. 1967, doi: 10.1109/TIT.1967.1054010. (Year:… [cited by examiner]
Thomos et al., “List Viterbi decoding of convolutional codes for efficient data hiding,” Proceedings. International Conference on Image Processing, Rochester, NY, USA, 2002, pp. III-III, doi: 10.1109/ICIP.2002.1039005. … [cited by examiner]
Hernandez et al., “Improving data hiding by using convolutional codes and soft-decision decoding”, Proc. SPIE 3971, Security and Watermarking of Multimedia Contents II, (May 9, 2000); https://doi.org/10.1117/12.384985 (… [cited by examiner]
Lucas et al., “On iterative soft-decision decoding of linear binary block codes and product codes,” in IEEE Journal on Selected Areas in Communications, vol. 16, No. 2, pp. 276-296, Feb. 1998, doi: 10.1109/49.661116. (Y… [cited by examiner]
The Spot Platform powered by Google Pay, 2019. [cited by applicant]