IP Library Granted Patent US 12,333,739
Granted Patent B2
US 12,333,739 · App. 17/988,650 · Granted Jun 17, 2025

Machine learning-based re-identification of shoppers in a cashier-less store for autonomous checkout

Inventors: Michele Toni (Castelnuovo di Garfagnana, IT); Atul Dhingra (Sunnyvale, CA); Jordan Fisher (San Francisco, CA)
Assignee: STANDARD COGNITION, CORP.
G06T7/248G06N20/00G06T2207/20081
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,333,739
App. No.
17/988,650
Granted
Jun 17, 2025
Kind
B2
Abstract

Systems and methods for tracking and re-identifying tracked subjects in an area of real space are disclosed. The method includes generating first and second reidentification feature vectors of a first subject identified from a first time interval from the respective first and second sequences of images as obtained from the first time interval. The method includes generating third and fourth reidentification feature vectors of a second subject identified from a second time interval from the respective first and second sequences of images. The method includes matching a second subject identified from a second time interval with the first subject identified from the first time interval when at least one of a first similarity score between the first and the third reidentification feature vectors and a second similarity score between the second and the fourth reidentification feature vectors is above a pre-defined threshold.

Claims (55)

1. A method of re-identifying a previously identified subject in an area of real space, the method including:

receiving, from at least two cameras with overlapping fields of view, respective first and second sequences of images of corresponding fields of view in the area of real space;

generating first and second reidentification feature vectors of a first subject identified from a first time interval by performing operations including:

providing first and second images of the first subject from the respective first and second sequences of images and as obtained from the first time interval, to a trained machine learning model to produce respective first and second reidentification feature vectors; and

matching a second subject identified from a second time interval with the first subject identified from the first time interval by performing operations including:

providing third and fourth images of the second subject, from the respective first and second sequences of images and as obtained from the second time interval, to the trained machine learning model to produce respective third and fourth reidentification feature vectors;

calculating (i) a first similarity score between the first and the third reidentification feature vectors and (ii) a second similarity score between the second and the fourth reidentification feature vectors; and

re-identifying the second subject identified from the second time interval as the first subject identified from the first time interval when at least one of the first similarity score and the second similarity score is above a pre-defined threshold.

2. The method of claim 1 , wherein the re-identifying of the second subject identified from the second time interval, further includes:

calculating an average of the first similarity score and the second similarity score and re-identifying the second subject identified from the second time interval as the first subject identified from the first time interval when the average similarity score is above the pre-defined threshold.

3. The method of claim 1 , wherein the generating of the first, the second, the third, and the fourth reidentification feature vectors, further includes:

placing first, second, third, and fourth bounding boxes respectively around at least a portion of first, second, third, and fourth poses of the identified subjects, as identified from the first, the second, the third, and the fourth images of the respective sequences of images, to provide first, second, third, and fourth cropped out images as the first, the second, the third, and the fourth images.

4. The method of claim 3 , wherein the first pose, as identified from the first image, is identified from the first sequence of images from a first camera, the second pose, as identified from the second image, is identified from the second sequence of images from a second camera, the third pose, as identified from the third image, is identified from the first sequence of images from the first camera, and the fourth pose, as identified from the fourth image, is identified from the second sequence of images from the second camera.

5. The method of claim 3 , further including comparing a count of a number of identified subjects in the second time interval with a number of identified subjects in the first time interval and when the count of the number of identified subjects in the second time interval is less than the count of the number of identified subjects in the first time interval, performing a matching of the subjects identified in the second time interval with subjects identified in a time interval preceding the first time interval.

6. The method of claim 1 , wherein the first similarity score and the second similarity score are cosine similarity measures respectively between (i) the first and the third reidentification feature vectors and (ii) the second and the fourth reidentification feature vectors.

7. The method of claim 1 , further including identifying an error in tracking of the first subject identified from the first time interval, when the first similarity score and the second similarity score are below the pre-defined threshold.

8. The method of claim 7 , wherein the error is a single-swap error when the first subject from the first time interval is incorrectly matched to a third subject from the second time interval.

9. The method of claim 7 , wherein the error is a split error when the first subject from the first time interval is incorrectly matched to a fourth subject from the second time interval and wherein the fourth subject is identified in the second time interval.

10. The method of claim 7 , wherein the error is an enter-exit-swap error indicating that the second subject from the second time interval does not match the first subject from the first time interval and the second subject is a new subject who entered the area of real space in the second time interval and was not in the area of real space in the first time interval and the first subject is not present in the second time interval.

11. The method of claim 1 , wherein each of the respective first and second reidentification feature vectors represents learned visual features of the first subject and each of the respective third and fourth reidentification vectors represents learned visual features of the second subject.

12. The method of claim 1 , wherein the first, the second, the third and the fourth reidentification feature vectors further comprise first, second, third and fourth visual identifiers concatenated with respective first, second, third and fourth learned visual features, and wherein the visual identifiers represent at least a color of hair of the first subject and the second subject and a color of clothing of the first subject and the second subject captured from the first, the second, the third and the fourth images of the respective sequences of images.

13. The method of claim 1 , further including:

generating fifth and sixth reidentification feature vectors of a third subject identified from the first time interval by performing operations including:

providing fifth and sixth images of the third subject from the respective first and second sequences of images and as obtained from the first time interval, to the trained machine learning model to produce respective fifth and sixth reidentification feature vectors; and

matching the second subject identified from the second time interval with the first subject and the third subject identified from the first time interval by performing operations including:

calculating (i) a third similarity score between the between the fifth and the third reidentification feature vectors and (ii) a fourth similarity score between the sixth and the fourth reidentification feature vectors; and

re-identifying the second subject identified from the second time interval as the first subject identified from the first time interval when the third similarity score and the fourth similarity score are below the pre-defined threshold and when at least one of the first similarity score and the second similarity score is above the pre-defined threshold.

14. A system including one or more processors coupled to memory, the memory loaded with computer instructions to re-identify a previously identified subject in an area of real space, the instructions, when executed on the processors, implement actions comprising:

receiving, from at least two cameras with overlapping fields of view, respective first and second sequences of images of corresponding fields of view in the area of real space;

generating first and second reidentification feature vectors of a first subject identified from a first time interval by performing operations including:

providing first and second images of the first subject from the respective first and second sequences of images and as obtained from the first time interval, to a trained machine learning model to produce respective first and second reidentification feature vectors; and

matching a second subject identified from a second time interval with the first subject identified from the first time interval by performing operations including:

providing third and fourth images of the second subject, from the respective first and second sequences of images and as obtained from the second time interval, to the trained machine learning model to produce respective third and fourth reidentification feature vectors;

calculating (i) a first similarity score between the first and the third reidentification feature vectors and (ii) a second similarity score between the second and the fourth reidentification feature vectors; and

re-identifying the second subject identified from the second time interval as the first subject identified from the first time interval when at least one of the first similarity score and the second similarity score is above a pre-defined threshold.

15. The system of claim 14 , wherein the re-identifying of the second subject identified from the second time interval, further implementing actions comprising:

calculating an average of the first similarity score and the second similarity score and re-identifying the second subject identified from the second time interval as the first subject identified from the first time interval when the average similarity score is above the pre-defined threshold.

16. The system of claim 14 , wherein the generating of the first, the second, the third, and the fourth reidentification feature vectors, further implementing actions comprising:

placing first, second, third, and fourth bounding boxes respectively around at least a portion of first, second, third, and fourth poses of the identified subjects, as identified from the first, the second, the third, and the fourth images of the respective sequences of images, to provide first, second, third, and fourth cropped out images as the first, the second, the third, and the fourth images.

17. The system of claim 16 , wherein the first pose of the first subject from the first time interval is one of the at least a front pose, a side pose, and a back pose of the first subject from the first time interval.

18. A non-transitory computer readable storage medium impressed with computer program instructions to re-identify a previously identified subject in an area of real space, the instructions, when executed on a processor, implement a method comprising:

receiving, from at least two cameras with overlapping fields of view, respective first and second sequences of images of corresponding fields of view in the area of real space;

generating first and second reidentification feature vectors of a first subject identified from a first time interval by performing operations including:

providing first and second images of the first subject from the respective first and second sequences of images and as obtained from the first time interval, to a trained machine learning model to produce respective first and second reidentification feature vectors; and

matching a second subject identified from a second time interval with the first subject identified from the first time interval by performing operations including:

providing third and fourth images of the second subject, from the respective first and second sequences of images and as obtained from the second time interval, to the trained machine learning model to produce respective third and fourth reidentification feature vectors;

calculating (i) a first similarity score between the first and the third reidentification feature vectors and (ii) a second similarity score between the second and the fourth reidentification feature vectors; and

re-identifying the second subject identified from the second time interval as the first subject identified from the first time interval when at least one of the first similarity score and the second similarity score is above a pre-defined threshold.

19. The non-transitory computer readable storage medium of claim 18 , wherein the first similarity score and the second similarity score are cosine similarity measures respectively between (i) the first and the third reidentification feature vectors and (ii) the second and the fourth reidentification feature vectors.

20. The non-transitory computer readable storage medium of claim 18 , implementing the method further comprising:

generating fifth and sixth reidentification feature vectors of a third subject identified from the first time interval by performing operations including:

providing fifth and sixth images of the third subject from the respective first and second sequences of images and as obtained from the first time interval, to the trained machine learning model to produce respective fifth and sixth reidentification feature vectors; and

matching the second subject identified from the second time interval with the first subject and the third subject identified from the first time interval by performing operations including:

calculating (i) a third similarity score between the between the fifth and the third reidentification feature vectors and (ii) a fourth similarity score between the sixth and the fourth reidentification feature vectors; and

re-identifying the second subject identified from the second time interval as the first subject identified from the first time interval when the third similarity score and the fourth similarity score are below the pre-defined threshold and when at least one of the first similarity score and the second similarity score is below the pre-defined threshold.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 16, 2023
From: TONI, MICHELE; DHINGRA, ATUL; FISHER, JORDAN
To: STANDARD COGNITION, CORP.
Reel/Frame 062721/0817 →
Continuity (3)
Continuation In Part 17572590 · Jan 10, 2022
Continuation 16388765 · Apr 18, 2019
Related Publication 20230088414A1 · Mar 23, 2023
References Cited (342)
US 6154559A · Beardsley · 2000 [cited by applicant]
US 6561417B1 · Gadd · 2003 [cited by applicant]
US 7050624B2 · Dialameh et al. · 2006 [cited by applicant]
US 7050652B2 · Stanek · 2006 [cited by applicant]
US 7742623B1 · Moon et al. · 2010 [cited by applicant]
US 8009863B1 · Sharma et al. · 2011 [cited by applicant]
US 8219438B1 · Moon et al. · 2012 [cited by applicant]
US 8261256B1 · Adler et al. · 2012 [cited by applicant]
US 8279325B2 · Pitts et al. · 2012 [cited by applicant]
US 8577705B1 · Baboo et al. · 2013 [cited by applicant]
US 8624725B1 · MacGregor · 2014 [cited by applicant]
US 8749630B2 · Alahi et al. · 2014 [cited by applicant]
US 9036028B2 · Buehler · 2015 [cited by applicant]
US 9058523B2 · Merkel et al. · 2015 [cited by applicant]
US 9262681B1 · Mishra · 2016 [cited by applicant]
US 9269012B2 · Fotland · 2016 [cited by applicant]
US 9269093B2 · Lee et al. · 2016 [cited by applicant]
US 9294873B1 · MacGregor · 2016 [cited by applicant]
US 9449233B2 · Taylor · 2016 [cited by applicant]
US 9489623B1 · Sinyavskiy et al. · 2016 [cited by applicant]
US 9494532B2 · Xie et al. · 2016 [cited by applicant]
US 9536177B2 · Chalasani et al. · 2017 [cited by applicant]
US 9582891B2 · Geiger et al. · 2017 [cited by applicant]
US 9595127B2 · Champion et al. · 2017 [cited by applicant]
US 9652751B2 · Aaron et al. · 2017 [cited by applicant]
US 9846810B2 · Partis · 2017 [cited by applicant]
US 9881221B2 · Bala et al. · 2018 [cited by applicant]
US 9886827B2 · Schoner · 2018 [cited by applicant]
US 9911290B1 · Zalewski et al. · 2018 [cited by applicant]
US 10055853B1 · Fisher et al. · 2018 [cited by applicant]
US 10083453B2 · Campbell · 2018 [cited by applicant]
US 10127438B1 · Fisher et al. · 2018 [cited by applicant]
US 10133933B1 · Fisher et al. · 2018 [cited by applicant]
US 10165194B1 · Baldwin · 2018 [cited by applicant]
US 10169677B1 · Ren et al. · 2019 [cited by applicant]
US 10175340B1 · Abari et al. · 2019 [cited by applicant]
US 10176452B2 · Rizzolo et al. · 2019 [cited by applicant]
US 10192408B2 · Schoner · 2019 [cited by applicant]
US 10202135B2 · Mian et al. · 2019 [cited by applicant]
US 10210603B2 · Venable et al. · 2019 [cited by applicant]
US 10210737B2 · Zhao · 2019 [cited by applicant]
US 10217120B1 · Shin et al. · 2019 [cited by applicant]
US 10242393B1 · Kumar et al. · 2019 [cited by applicant]
US 10262331B1 · Sharma et al. · 2019 [cited by applicant]
US 10282720B1 · Buibas et al. · 2019 [cited by applicant]
US 10282852B1 · Buibas et al. · 2019 [cited by applicant]
US 10332089B1 · Asmi et al. · 2019 [cited by applicant]
US 10354262B1 · Hershey et al. · 2019 [cited by applicant]
US 10373322B1 · Buibas et al. · 2019 [cited by applicant]
US 10387896B1 · Hershey et al. · 2019 [cited by applicant]
US 10438277B1 · Jiang et al. · 2019 [cited by applicant]
US 10445694B2 · Fisher et al. · 2019 [cited by applicant]
US 10474877B2 · Huang et al. · 2019 [cited by applicant]
US 10474988B2 · Fisher et al. · 2019 [cited by applicant]
US 10474991B2 · Fisher et al. · 2019 [cited by applicant]
US 10474992B2 · Fisher et al. · 2019 [cited by applicant]
US 10474993B2 · Fisher et al. · 2019 [cited by applicant]
US 10529137B1 · Black et al. · 2020 [cited by applicant]
US 10535146B1 · Buibas et al. · 2020 [cited by applicant]
US 10650545B2 · Fisher et al. · 2020 [cited by applicant]
US 10776926B2 · Shrivastava · 2020 [cited by applicant]
US 10810539B1 · Mohanty et al. · 2020 [cited by applicant]
US 10853965B2 · Fisher et al. · 2020 [cited by applicant]
US 10929829B1 · Hazelwood et al. · 2021 [cited by applicant]
US 11132810B2 · Kume et al. · 2021 [cited by applicant]
US 11232575B2 · Fisher · 2022 [cited by applicant]
US 11232687B2 · Fisher · 2022 [cited by examiner]
US 11354683B1 · Shin et al. · 2022 [cited by applicant]
US 20030078849A1 · Snyder · 2003 [cited by applicant]
US 20030107649A1 · Flickner et al. · 2003 [cited by applicant]
US 20040099736A1 · Neumark · 2004 [cited by applicant]
US 20040131254A1 · Liang et al. · 2004 [cited by applicant]
US 20050177446A1 · Hoblit · 2005 [cited by applicant]
US 20050201612A1 · Park et al. · 2005 [cited by applicant]
US 20060132491A1 · Riach et al. · 2006 [cited by applicant]
US 20060268111A1 · Zhang · 2006 [cited by examiner]
US 20060279630A1 · Aggarwal et al. · 2006 [cited by applicant]
US 20070021863A1 · Mountz et al. · 2007 [cited by applicant]
US 20070021864A1 · Mountz et al. · 2007 [cited by applicant]
US 20070182718A1 · Schoener et al. · 2007 [cited by applicant]
US 20070188318A1 · Cole et al. · 2007 [cited by applicant]
US 20070282665A1 · Buehler et al. · 2007 [cited by applicant]
US 20080001918A1 · Hsu et al. · 2008 [cited by applicant]
US 20080101652A1 · Zhao et al. · 2008 [cited by applicant]
US 20080159634A1 · Sharma et al. · 2008 [cited by applicant]
US 20080170776A1 · Albertson et al. · 2008 [cited by applicant]
US 20080181453A1 · Xu · 2008 [cited by examiner]
US 20080181507A1 · Gope et al. · 2008 [cited by applicant]
US 20080211915A1 · McCubbrey · 2008 [cited by applicant]
US 20080243614A1 · Tu et al. · 2008 [cited by applicant]
US 20080246613A1 · Linstrom et al. · 2008 [cited by applicant]
US 20090041297A1 · Zhang et al. · 2009 [cited by applicant]
US 20090057068A1 · Lin et al. · 2009 [cited by applicant]
US 20090083815A1 · McMaster et al. · 2009 [cited by applicant]
US 20090217315A1 · Malik et al. · 2009 [cited by applicant]
US 20090222313A1 · Kannan et al. · 2009 [cited by applicant]
US 20090307226A1 · Koster et al. · 2009 [cited by applicant]
US 20100021009A1 · Yao · 2010 [cited by applicant]
US 20100103104A1 · Son et al. · 2010 [cited by applicant]
US 20100208941A1 · Broaddus et al. · 2010 [cited by applicant]
US 20100283860A1 · Nader · 2010 [cited by applicant]
US 20110141011A1 · Lashina et al. · 2011 [cited by applicant]
US 20110209042A1 · Porter · 2011 [cited by applicant]
US 20110228976A1 · Fitzgibbon et al. · 2011 [cited by applicant]
US 20110317012A1 · Hammadou · 2011 [cited by applicant]
US 20110317016A1 · Saeki et al. · 2011 [cited by applicant]
US 20110320322A1 · Roslak et al. · 2011 [cited by applicant]
US 20120119879A1 · Estes et al. · 2012 [cited by applicant]
US 20120159290A1 · Pulsipher et al. · 2012 [cited by applicant]
US 20120209749A1 · Hammad et al. · 2012 [cited by applicant]
US 20120245974A1 · Bonner et al. · 2012 [cited by applicant]
US 20120271712A1 · Katzin et al. · 2012 [cited by applicant]
US 20120275686A1 · Wilson et al. · 2012 [cited by applicant]
US 20120290401A1 · Neven · 2012 [cited by applicant]
US 20120324001A1 · Leacock et al. · 2012 [cited by applicant]
US 20130011007A1 · Muriello et al. · 2013 [cited by applicant]
US 20130011049A1 · Kimura · 2013 [cited by applicant]
US 20130076898A1 · Philippe et al. · 2013 [cited by applicant]
US 20130156260A1 · Craig · 2013 [cited by applicant]
US 20130182114A1 · Zhang et al. · 2013 [cited by applicant]
US 20130201339A1 · Venkatesh · 2013 [cited by applicant]
US 20130266181A1 · Brewer et al. · 2013 [cited by applicant]
US 20140168477A1 · David · 2014 [cited by applicant]
US 20140188648A1 · Argue et al. · 2014 [cited by applicant]
US 20140207615A1 · Li et al. · 2014 [cited by applicant]
US 20140214608A1 · Pedley et al. · 2014 [cited by applicant]
US 20140222501A1 · Hirakawa et al. · 2014 [cited by applicant]
US 20140282162A1 · Fein et al. · 2014 [cited by applicant]
US 20140285660A1 · Jamtgaard et al. · 2014 [cited by applicant]
US 20140304123A1 · Schwartz · 2014 [cited by applicant]
US 20140347479A1 · Givon · 2014 [cited by applicant]
US 20140363059A1 · Hurewitz · 2014 [cited by applicant]
US 20150002675A1 · Kundu et al. · 2015 [cited by applicant]
US 20150009323A1 · Lei · 2015 [cited by applicant]
US 20150012396A1 · Puerini et al. · 2015 [cited by applicant]
US 20150019391A1 · Kumar et al. · 2015 [cited by applicant]
US 20150023562A1 · Moshfeghi · 2015 [cited by applicant]
US 20150026010A1 · Ellison · 2015 [cited by applicant]
US 20150026646A1 · Ahn et al. · 2015 [cited by applicant]
US 20150039458A1 · Reid · 2015 [cited by applicant]
US 20150049914A1 · Alves · 2015 [cited by applicant]
US 20150124107A1 · Muriello et al. · 2015 [cited by applicant]
US 20150127485A1 · Kakizawa et al. · 2015 [cited by applicant]
US 20150170354A1 · Mukai · 2015 [cited by applicant]
US 20150193761A1 · Svetal · 2015 [cited by applicant]
US 20150206188A1 · Tanigawa et al. · 2015 [cited by applicant]
US 20150208043A1 · Lee et al. · 2015 [cited by applicant]
US 20150213391A1 · Hasan · 2015 [cited by applicant]
US 20150221094A1 · Marcheselli et al. · 2015 [cited by applicant]
US 20150262116A1 · Katircioglu et al. · 2015 [cited by applicant]
US 20150269740A1 · Mazurenko et al. · 2015 [cited by applicant]
US 20150294397A1 · Croy et al. · 2015 [cited by applicant]
US 20150302593A1 · Mazurenko et al. · 2015 [cited by applicant]
US 20150310459A1 · Bernal et al. · 2015 [cited by applicant]
US 20150327794A1 · Rahman et al. · 2015 [cited by applicant]
US 20150332312A1 · Cosman · 2015 [cited by applicant]
US 20150363868A1 · Kleinhandler et al. · 2015 [cited by applicant]
US 20150379366A1 · Nomura et al. · 2015 [cited by applicant]
US 20160055499A1 · Hawkins et al. · 2016 [cited by applicant]
US 20160095511A1 · Taguchi et al. · 2016 [cited by applicant]
US 20160110760A1 · Herring et al. · 2016 [cited by applicant]
US 20160125245A1 · Saitwal et al. · 2016 [cited by applicant]
US 20160155011A1 · Sulc et al. · 2016 [cited by applicant]
US 20160171707A1 · Schwartz · 2016 [cited by applicant]
US 20160188962A1 · Taguchi · 2016 [cited by applicant]
US 20160189286A1 · Zohar et al. · 2016 [cited by applicant]
US 20160203525A1 · Hara et al. · 2016 [cited by applicant]
US 20160217157A1 · Shih et al. · 2016 [cited by applicant]
US 20160217417A1 · Ma et al. · 2016 [cited by applicant]
US 20160259994A1 · Ravindran et al. · 2016 [cited by applicant]
US 20160358145A1 · Montgomery · 2016 [cited by applicant]
US 20160371726A1 · Yamaji et al. · 2016 [cited by applicant]
US 20160381328A1 · Zhao · 2016 [cited by applicant]
US 20170024806A1 · High et al. · 2017 [cited by applicant]
US 20170032193A1 · Yang · 2017 [cited by applicant]
US 20170068861A1 · Miller et al. · 2017 [cited by applicant]
US 20170116473A1 · Sashida et al. · 2017 [cited by applicant]
US 20170124096A1 · Hsi et al. · 2017 [cited by applicant]
US 20170148005A1 · Murn · 2017 [cited by applicant]
US 20170154212A1 · Feris et al. · 2017 [cited by applicant]
US 20170161555A1 · Kumar et al. · 2017 [cited by applicant]
US 20170168586A1 · Sinha et al. · 2017 [cited by applicant]
US 20170169440A1 · Dey et al. · 2017 [cited by applicant]
US 20170178226A1 · Graham et al. · 2017 [cited by applicant]
US 20170206664A1 · Shen · 2017 [cited by applicant]
US 20170206669A1 · Saleemi et al. · 2017 [cited by applicant]
US 20170249339A1 · Lester · 2017 [cited by applicant]
US 20170255990A1 · Ramamurthy et al. · 2017 [cited by applicant]
US 20170278255A1 · Shingu et al. · 2017 [cited by applicant]
US 20170308911A1 · Barham et al. · 2017 [cited by applicant]
US 20170309136A1 · Schoner · 2017 [cited by applicant]
US 20170323376A1 · Glaser et al. · 2017 [cited by applicant]
US 20180003315A1 · Reed · 2018 [cited by applicant]
US 20180012072A1 · Glaser et al. · 2018 [cited by applicant]
US 20180012080A1 · Glaser et al. · 2018 [cited by applicant]
US 20180014382A1 · Glaser et al. · 2018 [cited by applicant]
US 20180025175A1 · Kato · 2018 [cited by applicant]
US 20180032799A1 · Marcheselli et al. · 2018 [cited by applicant]
US 20180033015A1 · Opalka et al. · 2018 [cited by applicant]
US 20180033151A1 · Matsumoto et al. · 2018 [cited by applicant]
US 20180068431A1 · Takeda et al. · 2018 [cited by applicant]
US 20180070056A1 · DeAngelis et al. · 2018 [cited by applicant]
US 20180088900A1 · Glaser et al. · 2018 [cited by applicant]
US 20180150788A1 · Vepakomma et al. · 2018 [cited by applicant]
US 20180165728A1 · McDonald et al. · 2018 [cited by applicant]
US 20180181995A1 · Burry et al. · 2018 [cited by applicant]
US 20180189600A1 · Astrom et al. · 2018 [cited by applicant]
US 20180217223A1 · Kumar et al. · 2018 [cited by applicant]
US 20180225625A1 · DiFatta et al. · 2018 [cited by applicant]
US 20180232796A1 · Glaser et al. · 2018 [cited by applicant]
US 20180240180A1 · Glaser et al. · 2018 [cited by applicant]
US 20180276480A1 · Peterson et al. · 2018 [cited by applicant]
US 20180295424A1 · Taylor et al. · 2018 [cited by applicant]
US 20180322616A1 · Guigues · 2018 [cited by applicant]
US 20180329762A1 · Li et al. · 2018 [cited by applicant]
US 20180332235A1 · Glaser · 2018 [cited by applicant]
US 20180332236A1 · Glaser et al. · 2018 [cited by applicant]
US 20180343417A1 · Davey · 2018 [cited by applicant]
US 20180365481A1 · Tolbert et al. · 2018 [cited by applicant]
US 20180365755A1 · Bekbolatov et al. · 2018 [cited by applicant]
US 20180373928A1 · Glaser et al. · 2018 [cited by applicant]
US 20180374233A1 · Zhou · 2018 [cited by examiner]
US 20190005479A1 · Glaser et al. · 2019 [cited by applicant]
US 20190034735A1 · Cuban et al. · 2019 [cited by applicant]
US 20190043003A1 · Fisher et al. · 2019 [cited by applicant]
US 20190057435A1 · Chomley et al. · 2019 [cited by applicant]
US 20190147709A1 · Schoner · 2019 [cited by applicant]
US 20190156273A1 · Fisher et al. · 2019 [cited by applicant]
US 20190156274A1 · Fisher et al. · 2019 [cited by applicant]
US 20190156275A1 · Fisher et al. · 2019 [cited by applicant]
US 20190156276A1 · Fisher et al. · 2019 [cited by applicant]
US 20190156277A1 · Fisher et al. · 2019 [cited by applicant]
US 20190156506A1 · Fisher et al. · 2019 [cited by applicant]
US 20190188876A1 · Song et al. · 2019 [cited by applicant]
US 20190244386A1 · Fisher et al. · 2019 [cited by applicant]
US 20190244500A1 · Fisher · 2019 [cited by examiner]
US 20190251340A1 · Brown et al. · 2019 [cited by applicant]
US 20190331273A1 · Vos et al. · 2019 [cited by applicant]
US 20190347611A1 · Fisher et al. · 2019 [cited by applicant]
US 20190377957A1 · Johnston et al. · 2019 [cited by applicant]
US 20190378205A1 · Glaser et al. · 2019 [cited by applicant]
US 20190392318A1 · Ghafoor et al. · 2019 [cited by applicant]
US 20200074165A1 · Ghafoor et al. · 2020 [cited by applicant]
US 20200074393A1 · Fisher et al. · 2020 [cited by applicant]
US 20200074394A1 · Fisher et al. · 2020 [cited by applicant]
US 20200074432A1 · Valdman et al. · 2020 [cited by applicant]
US 20200118400A1 · Zalewski et al. · 2020 [cited by applicant]
US 20200134588A1 · Nelms et al. · 2020 [cited by applicant]
US 20200151692A1 · Gao et al. · 2020 [cited by applicant]
US 20200193507A1 · Glaser et al. · 2020 [cited by applicant]
US 20200234463A1 · Fisher et al. · 2020 [cited by applicant]
US 20200258241A1 · Liu et al. · 2020 [cited by applicant]
US 20200293992A1 · Bogolea et al. · 2020 [cited by applicant]
US 20200334834A1 · Fisher · 2020 [cited by applicant]
US 20200334835A1 · Buibas et al. · 2020 [cited by applicant]
US 20200410713A1 · Auer et al. · 2020 [cited by applicant]
US 20210067744A1 · Buibas et al. · 2021 [cited by applicant]
US 20210158430A1 · Buibas et al. · 2021 [cited by applicant]
US 20210201253A1 · Fisher et al. · 2021 [cited by applicant]
US 20210295081A1 · Berry et al. · 2021 [cited by applicant]
US 20220130220A1 · Fisher et al. · 2022 [cited by applicant]
CN 104778690B · 2017 [cited by applicant]
EP 1574986B1 · 2008 [cited by applicant]
EP 2555162A1 · 2013 [cited by applicant]
EP 3002710A1 · 2016 [cited by applicant]
GB 2560387A · 2018 [cited by applicant]
GB 2566762A · 2019 [cited by applicant]
JP 2011253344A · 2011 [cited by applicant]
JP 2013196199A · 2013 [cited by applicant]
JP 2014089626A · 2014 [cited by applicant]
JP 2016206782A · 2016 [cited by applicant]
JP 2017157216A · 2017 [cited by applicant]
JP 2018099317A · 2018 [cited by applicant]
KR 1020180032400A · 2018 [cited by applicant]
KR 102223570B1 · 2021 [cited by applicant]
TW 201911119A · 2019 [cited by applicant]
WO 0021021A1 · 2000 [cited by applicant]
WO 0243352A2 · 2002 [cited by applicant]
WO 02059836A3 · 2003 [cited by applicant]
WO 2008029159A1 · 2008 [cited by applicant]
WO 2013041444A1 · 2013 [cited by applicant]
WO 2013103912A1 · 2013 [cited by applicant]
WO 2014133779A1 · 2014 [cited by applicant]
WO 2015133699A1 · 2015 [cited by applicant]
WO 2016136144A1 · 2016 [cited by applicant]
WO 2016166508A1 · 2016 [cited by applicant]
WO 2017015390A1 · 2017 [cited by applicant]
WO 2017151241A2 · 2017 [cited by applicant]
WO 2017196822A1 · 2017 [cited by applicant]
WO 2018013438A1 · 2018 [cited by applicant]
WO 2018013439A1 · 2018 [cited by applicant]
WO 2018148613A1 · 2018 [cited by applicant]
WO 2018162929A1 · 2018 [cited by applicant]
WO 2018209156A1 · 2018 [cited by applicant]
WO 2018237210A1 · 2018 [cited by applicant]
WO 2019032304A1 · 2019 [cited by applicant]
WO 2019032305A2 · 2019 [cited by applicant]
WO 2019032306A1 · 2019 [cited by applicant]
WO 2019032307A1 · 2019 [cited by applicant]
WO 2020023795 · 2020 [cited by applicant]
WO 2020023796 · 2020 [cited by applicant]
WO 2020023798 · 2020 [cited by applicant]
WO 2020023799 · 2020 [cited by applicant]
WO 2020023801 · 2020 [cited by applicant]
WO 2020023926 · 2020 [cited by applicant]
WO 2020023930 · 2020 [cited by applicant]
WO 2020047555A1 · 2020 [cited by applicant]
WO 2020214775A1 · 2020 [cited by applicant]
WO 2020225562A1 · 2020 [cited by applicant]
EP 20791434.2—Communication pursuant to Rules 161(2) and 162 EPC dated Nov. 25, 2021, 3 pages. [cited by applicant]
EP 20791434.2—Response to Communication pursuant to Rules 161(2) and 162 EPC dated Nov. 25, 2021, filed May 18, 2022, 18 pages. [cited by applicant]
PCT/US2019/043775—International Preliminary Report on Patentability dated Feb. 4, 2021, 7 pages. [cited by applicant]
PCT/US2019/043775—International Search Report and Written Opinion dated Nov. 13, 2019, 10 pages. [cited by applicant]
PCT/US2020/028454—International Search Report and Written Opinion dated Jul. 27, 2020, 12 pages. [cited by applicant]
PCT/US2020/028454—International Preliminary Report on Patentability dated Oct. 28, 2021, 9 pages. [cited by applicant]
Longuet-Higgens, “A computer algorithm for reconstructing a scene from two projections,” Nature 293, Sep. 10, 1981, pp. 133-135. [cited by applicant]
He et al. “Deep Residual Learning for Image Recognition,” (published at https://arxiv.org/abs/1512.03385), Dec. 10, 2015, 12 pages. [cited by applicant]
Simonyan et al. “Very Deep Convolutional Networks for Large-Scale Image Recognition” (published at https://arxiv.org/abs/1409.1556), Apr. 10, 2015, 14 pages. [cited by applicant]
Zheng et al., “Joint Discriminative and Generative Learning for Person Re-Identification,” Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR), Jun. 16-20, 2019, pp. 2138-2147. [cited by applicant]
Black et al., “Multi View Image Surveillance and Tracking,” IEEE Proceedings of the Workshop on Motion and Video Computing, 2002, pp. 1-6. [cited by applicant]
Camplani et al., “Background foreground segmentation with RGB-D Kinect data: An efficient combination of classifiers”, Journal of Visual Communication and Image Representation, Academic Press, Inc., US, vol. 25, No. 1, … [cited by applicant]
Ceballos, Scikit-Learn Decision Trees Explained, https://towardsdatascience.com/scikit-learn-decision-trees-explained-803f- 3812290d, Feb. 22, 2019, 13 pages. [cited by applicant]
DeTone et al, SuperPoint: Self-Supervised Interest Point Detection and Description, Apr. 19, 2018, arXiv:1712.07629v4 [cs.CV] Apr. 19, 2018, 13 pages. [cited by applicant]
Erdem et al. “Automated camera layout to satisfy task-specific and floor plan-specific coverage requirements,” Computer Vision and Image Undertanding 103, Aug. 1, 2006, 156-169. [cited by applicant]
Gkioxari et al. “R-CNNs for Pose Estimation and Action Detection,” Cornell University, Computer Science, Computer Vision and Pattern Recognition, arXiv.org > cs > arXiv:1406.5212, Jun. 19, 2014, 8 pages. [cited by applicant]
Grinciunaite et al. “Human Pose Estimation in Space and Time Using 3D CNN,” ECCV Workshop on Brave new ideas for motion representations in videos, Oct. 2016, 7 pages. [cited by applicant]
Harville, “Stereo person tracking with adaptive plan-view templates of height and occupancy statistics,” Image and Vision Computing, vol. 22, Issue 2, Feb. 1, 2004, pp. 127-142. [cited by applicant]
He et al. “Identity mappings in deep residual networks” (published at https://arxiv.org/pdf/1603.05027.pdf), Jul. 25, 2016, 15 pages. [cited by applicant]
Huang, et al. “Driver's view and vehicle surround estimation using omnidirectional video stream,” IEEE IV2003 Intelligent Vehicles Symposium. Proceedings (Cat. No. 03TH8683), Jun. 9-11, 2003, pp. 444-449. [cited by applicant]
Jayabalan, et al., “Dynamic Action Recognition: A convolutional neural network model for temporally organized joint location data,” Cornell University, Computer Science, Dec. 20, 2016, 11 pages. [cited by applicant]
Redmon et al., “You Only Look Once: Unified, Real-Time Object Detection,” University of Washington, Allen Institute for Aly, Facebook AI Research, May 9, 2016, 10 pages. [cited by applicant]
Redmon et al., YOLO9000: Better, Faster, Stronger, (available at https://arxiv.org/pdf/1612.08242.pdf), Dec. 25, 2016, 9 pages. [cited by applicant]
Rossi et al., “Tracking and Counting Moving People,” IEEE Int'l Conf. on Image Processing, ICIP-94, Nov. 13-16, 1994. 5 pages. [cited by applicant]
Symons, “Data Fusion Methods for Netted Sensors with Limited Communication Bandwidth”, QinetiQ Ltd and University College London, 2004. [cited by applicant]
Toshev et al. “DeepPose: Human Pose Estimation via Deep Neural Networks,” IEEE Conf. on Computer Vision and Pattern Recognition, Aug. 2014, 8 pages. [cited by applicant]
Vincze, “Robust tracking of ellipses at frame rate,” Pattern Recognition, vol. 34, Issue 2, Feb. 2001, pp. 487-498. [cited by applicant]
Yusoff et al. “Optimal Camera Placement for 3D Environment,” ICSECS 2011: Software Engineering and Computer Systems, Jun. 27-29, 2011, 448-459. [cited by applicant]
Zhang “A Flexible New Technique for Camera Calibration,” IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 22, No. 11, Nov. 2000, 22pages. [cited by applicant]
EP 20791434.2—Extended European Search Report dated Apr. 17, 2023, 12 pages. [cited by applicant]
Jan Prokaj et al.: “Inferring tracklets for multi-object tracking,” Computer Vision and Pattern Recognition Workshops OCVPRW), 2011 IEEE Computer Society Conference on IEEE, Jun. 20, 2011, pp. 37-44. [cited by applicant]
Raul Mohedano et al.: “Robust 3D people tracking and positioning system in a semi-overlapped multi-camera environment,” 15th IEEE International Conference on Image Processing: ICIP 2008; San Diego, CA, USA, Oct. 12-15, … [cited by applicant]
US Office Action in U.S. Appl. No. 17/572,500 dated Aug. 25, 2023, 13 pages. [cited by applicant]