The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.
The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.
Patent No.:
Date of Patent:
Nov. 29, 2016
Filed:
Apr. 15, 2014
Applicant:
Microsoft Technology Licensing, Llc, Redmond, WA (US);
Inventors:
Kenneth Hiroshi Eguro, Seattle, WA (US);
George E. Smith, Bellevue, WA (US);
Shawn Michael Swilley, Kent, WA (US);
Assignee:
Microsoft Technology Licensing, LLC, Redmond, WA (US);
Attorneys:
Primary Examiner:
Assistant Examiner:
Int. Cl.
CPC ...
G06K 9/62 (2006.01); G06K 9/00 (2006.01); H04N 5/33 (2006.01); H04N 13/02 (2006.01); H04N 13/00 (2006.01); G02B 27/42 (2006.01); B29C 67/00 (2006.01); G06F 12/02 (2006.01); G02B 5/18 (2006.01); G02B 27/44 (2006.01); H04N 5/225 (2006.01); H04N 9/04 (2006.01); H04N 17/00 (2006.01); G01B 11/25 (2006.01); G06T 7/00 (2006.01); G01B 11/22 (2006.01); G06T 1/60 (2006.01); A63F 13/213 (2014.01);
U.S. Cl.
CPC ...
G06K 9/00536 (2013.01); B29C 67/0051 (2013.01); G01B 11/22 (2013.01); G01B 11/25 (2013.01); G01B 11/2513 (2013.01); G01B 11/2527 (2013.01); G01B 11/2545 (2013.01); G02B 5/1895 (2013.01); G02B 27/4205 (2013.01); G02B 27/44 (2013.01); G06F 12/0207 (2013.01); G06K 9/0063 (2013.01); G06K 9/00201 (2013.01); G06K 9/62 (2013.01); G06T 1/60 (2013.01); G06T 7/00 (2013.01); G06T 7/004 (2013.01); G06T 7/0057 (2013.01); G06T 7/0065 (2013.01); G06T 7/0073 (2013.01); H04N 5/2256 (2013.01); H04N 5/33 (2013.01); H04N 5/332 (2013.01); H04N 9/045 (2013.01); H04N 13/0022 (2013.01); H04N 13/02 (2013.01); H04N 13/025 (2013.01); H04N 13/0239 (2013.01); H04N 13/0253 (2013.01); H04N 13/0271 (2013.01); H04N 17/002 (2013.01); A63F 13/213 (2014.09); G06T 2207/30244 (2013.01); H04N 2013/0081 (2013.01);
Abstract
The subject disclosure is directed towards performing connected components in hardware, such as an FPGA, which is facilitated by a linked list structure that does not grow. During a connected components graph labeling process, when a merge is encountered, the data structure comprising labels and associated equivalency data swaps the equivalency data of the two vertices whose different labels produced the merge condition.