公开(公告)号：US20170270390A1

公开(公告)日：2017-09-21

申请号：US15071111

申请日：2016-03-15

Applicant: Microsoft Technology Licensing, LLC

Inventor： Sean Ryan Francesco Fanello ,  Shahram Izadi ,  Pushmeet Kohli ,  Christoph Rhemann ,  Shenlong Wang

IPC: G06K9/62

CPC classification number: G06K9/6282 ,  G06K9/00208 ,  G06K9/6219 ,  G06K9/6256

Abstract: Correspondences in content items may be determined using a trained decision tree to detect distinctive matches between portions of content items. The techniques described include determining a first group of patches associated with a first content item and processing a first patch based at least partly on causing the first patch to move through a decision tree, and determining a second group of patches associated with a second content item and processing a second patch based at least partly on causing the second patch to move through the decision tree. The techniques described include determining that the first patch and the second patch are associated with a same leaf node of the decision tree and determining that the first patch and the second patch are corresponding patches based at least partly on determining that the first patch and the second patch are associated with the same leaf node.

公开(公告)号：US09886652B2

公开(公告)日：2018-02-06

申请号：US15071111

申请日：2016-03-15

Applicant: Microsoft Technology Licensing, LLC

Inventor： Sean Ryan Francesco Fanello ,  Shahram Izadi ,  Pushmeet Kohli ,  Christoph Rhemann ,  Shenlong Wang

IPC: G06K9/62

CPC classification number: G06K9/6282 ,  G06K9/00208 ,  G06K9/6219 ,  G06K9/6256

Abstract: Correspondences in content items may be determined using a trained decision tree to detect distinctive matches between portions of content items. The techniques described include determining a first group of patches associated with a first content item and processing a first patch based at least partly on causing the first patch to move through a decision tree, and determining a second group of patches associated with a second content item and processing a second patch based at least partly on causing the second patch to move through the decision tree. The techniques described include determining that the first patch and the second patch are associated with a same leaf node of the decision tree and determining that the first patch and the second patch are corresponding patches based at least partly on determining that the first patch and the second patch are associated with the same leaf node.