IP Library Granted Patent US 11,347,965
Granted Patent B2
US 11,347,965 · App. 16/825,987 · Granted May 31, 2022

Training data generation for artificial intelligence-based sequencing

Inventors: Anindita Dutta (San Francisco, CA); Dorna Kashefhaghighi (Menlo Park, CA); Amirali Kia (San Mateo, CA)
Assignee: Illumina, Inc.
G06K9/6218G06F16/907G06K9/628G06K9/6222G06K9/6232G06K9/6256G06K9/6262G06K9/6267G06K9/6277G06N3/04G06N3/08G06N3/084G06N7/005G06V10/751G16B40/00G06N5/046
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 11,347,965
App. No.
16/825,987
Filed
Mar 20, 2020
Granted
May 31, 2022
Kind
B2
Art Unit
2636
USPC
382/225
Abstract

The technology disclosed relates to generating ground truth training data to train a neural network-based template generator for cluster metadata determination task. In particular, it relates to accessing sequencing images, obtaining, from a base caller, a base call classifying each subpixel in the sequencing images as one of four bases (A, C, T, and G), generating a cluster map that identifies clusters as disjointed regions of contiguous subpixels which share a substantially matching base call sequence, determining cluster metadata based on the disjointed regions in the cluster map, and using the cluster metadata to generate the ground truth training data for training the neural network-based template generator for the cluster metadata determination task.

Claims (49)

1. A computer-implemented method of generating ground truth training data to train a neural network-based template generator for cluster metadata determination task, the method comprising:

accessing a series of image sets generated during a sequencing run, each image set in the series generated during a respective sequencing cycle of the sequencing run, each image in the series depicting clusters and their surrounding background, each image in the series having pixels in a pixel domain, and each of the pixels is divided into a plurality of subpixels in a subpixel domain;

obtaining, from a base caller, a base call classifying each of the subpixels as one of four bases (A, C, T, and G), thereby producing a base call sequence for each of the sub pixels across a plurality of sequencing cycles of the sequencing run;

generating a cluster map that identifies the clusters as disjointed regions of contiguous subpixels which share a substantially matching base call sequence;

determining cluster metadata based on the disjointed regions in the cluster map,

wherein the cluster metadata includes cluster centers, cluster shapes, cluster sizes, cluster background, and/or cluster boundaries; and

using the cluster metadata to generate ground truth training data for training a neural network-based template generator for cluster metadata determination task,

wherein the ground truth training data comprises a decay map, a ternary map, or a binary map,

wherein the neural network-based template generator is trained to produce the decay map, the ternary map, or the binary map as output based on the ground truth training data, and

wherein, upon execution of the cluster metadata determination task during inference, the cluster metadata is in turn determined from the decay map, the ternary map, or the binary map that are produced as the output by the trained neural network-based template generator.

2. The computer-implemented method of claim 1 , further including:

using the cluster metadata derived from the decay map, the ternary map, or the binary map produced as the output by the neural network-based template generator for base calling by a neural network-based base caller, in order to increase through put in high-throughput nucleic acid sequencing technologies.

3. The computer-implemented method of claim 1 , further including:

generating the cluster map by identifying as background those subpixels that do not belong to any of the disjointed regions.

4. The computer-implemented method of claim 1 , wherein the cluster map identifies cluster boundary portions between two contiguous subpixels whose base call sequences do not substantially match.

5. The computer-implemented method of claim 1 , wherein the cluster map is generated based on:

identifying origin subpixels at preliminary center coordinates of the clusters determined by the base caller; and

breadth-first searching for substantially matching base call sequences by beginning with the origin subpixels and continuing with successively contiguous non-origin subpixels.

6. The computer-implemented method of claim 1 , further including:

determining hyperlocated center coordinates of the clusters by calculating centers of mass of the disjointed regions of the cluster map as an average of coordinates of respective contiguous subpixels forming the disjointed regions; and

storing the hyperlocated center coordinates of the clusters in the memory for use as the ground truth training data for training the neural network-based template generator.

7. The computer-implemented method of claim 6 , further including:

identifying centers of mass subpixels in the disjointed regions of the cluster map at the hyperlocated center coordinates of the clusters;

upsampling the cluster map using interpolation and storing the upsampled cluster map in the memory for use as the ground truth training data for training the neural network-based template generator; and

in the upsampled cluster map, assigning a value to each contiguous subpixel in the disjointed regions based on a decay factor that is proportional to distance of a contiguous sub pixel from a center of mass subpixel in a disjointed region to which the contiguous subpixel belongs.

8. The computer-implemented method of claim 7 , further including:

generating the decay map from the upsampled cluster map that expresses the contiguous subpixels in the disjointed regions and the sub pixels identified as the background based on their assigned values; and

storing the decay map in the memory for use as the ground truth training data for training the neural network-based template generator.

9. The computer-implemented method of claim 8 , further including:

in the upsampled cluster map, categorizing, on the cluster-by-cluster basis, the contiguous subpixels in the disjointed regions as cluster interior subpixels belonging to a same cluster, the centers of mass subpixels as cluster center subpixels, subpixels containing the cluster boundary portions as boundary subpixels, and the subpixels identified as the background as background subpixels; and

storing the categorizations in the memory for use as the ground truth training data for training the neural network-based template generator.

10. The computer-implemented method of claim 9 , further including:

storing, on the cluster-by-cluster basis, coordinates of the cluster interior subpixels, the cluster center subpixels, the boundary subpixels, and the background subpixels in the memory for use as the ground truth training data for training the neural network-based template generator;

downscaling the coordinates by a factor used to upsample the cluster map; and

storing, on the cluster-by-cluster basis, the downscaled coordinates in the memory for use as the ground truth training data for training the neural network-based template generator.

11. The computer-implemented method of claim 10 , further including:

generating cluster maps for a plurality of tiles of the flow cell;

storing the cluster maps in memory and determining the cluster metadata of clusters in the tiles based on the cluster maps, including the cluster centers, the cluster shapes, the cluster sizes, the cluster background, and/or the cluster boundaries;

in the upsampled cluster maps of the clusters in the tiles, categorizing, on a cluster-by-cluster basis, sub pixels as cluster interior sub pixels belonging to a same cluster, cluster center subpixels, boundary subpixels, and background subpixels;

storing the categorizations in the memory for use as the ground truth training data for training the neural network-based template generator;

storing, on the cluster-by-cluster basis across the tiles, coordinates of the cluster interior subpixels, the cluster center subpixels, the boundary subpixels, and the background subpixels in the memory for use as the ground truth training data for training the neural network-based template generator;

downscaling the coordinates by the factor used to upsample the cluster map; and

storing, on the cluster-by-cluster basis across the tiles, the downscaled coordinates in the memory for use as the ground truth training data for training the neural network-based template generator.

12. The computer-implemented method of claim 11 , wherein the base call sequences are substantially matching when a predetermined portion of base calls match on an ordinal position-wise basis.

13. The computer-implemented method of claim 1 , wherein the cluster map is generated based upon a predetermined minimum number of subpixels for a disjointed region.

14. The computer-implemented method of claim 1 , wherein the flow cell has at least one patterned surface with an array of wells that occupy the clusters, further including: based on the determined shapes and sizes of the clusters, determining

which ones of the wells are substantially occupied by at least one cluster,

which ones of the wells are minimally occupied, and

which ones of the wells are co-occupied by multiple clusters.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 30, 2020
From: DUTTA, ANINDITA; KASHEFHAGHIGHI, DORNA; KIA, AMIRALI
To: ILLUMINA, INC.
Reel/Frame 052264/0863 →
Continuity (6)
Provisional Application 62821602 · Mar 21, 2019
Provisional Application 62821618 · Mar 21, 2019
Provisional Application 62821681 · Mar 21, 2019
Provisional Application 62821724 · Mar 21, 2019
Provisional Application 62821766 · Mar 21, 2019
Related Publication 20200302225A1 · Sep 24, 2020
Cited By (8)
US 12,210,468 US 12,217,831 US 12,229,057 US 12,277,998 US 12,361,525 US 12,380,041 US 12,413,530 US 12,525,320