METHOD AND APPARATUS FOR IMPLEMENTING A NEAREST NEIGHBOR SEARCH ON A GRAPHICS PROCESSING UNIT (GPU)
    2.
    发明申请
    METHOD AND APPARATUS FOR IMPLEMENTING A NEAREST NEIGHBOR SEARCH ON A GRAPHICS PROCESSING UNIT (GPU) 审中-公开
    用于在图形处理单元(GPU)上执行最近邻域搜索的方法和装置

    公开(公告)号:US20160055611A1

    公开(公告)日:2016-02-25

    申请号:US14581490

    申请日:2014-12-23

    CPC classification number: G06T1/20

    Abstract: An apparatus and method are described for implementing a nearest neighbor search on a graphics processing unit. For example, one embodiment of an apparatus comprises: a host processor; and a graphics processor unit (GPU) to execute a nearest neighbor (NN) tree build operation and a NN tree search operation in response to signals from the host processor; the NN tree build operation comprising dividing a first set of data points to define each tree node to form a plurality of buckets, each bucket comprising at least one of the first set of data points, the number of buckets to be limited based on a threshold value, resulting in at least some buckets with multiple data points; and the NN tree search operation comprising traversing the tree by comparing each of a second set of input data points to data points in the tree to identify a bucket and then comparing one of the second data points to data points in the bucket to identify a nearest neighbor data point in the bucket.

    Abstract translation: 描述了用于在图形处理单元上实现最近邻搜索的装置和方法。 例如,设备的一个实施例包括:主机处理器; 以及响应于来自主处理器的信号执行最近邻(NN)树构建操作和NN树搜索操作的图形处理器单元(GPU); NN树构建操作包括划分第一组数据点以定义每个树节点以形成多个桶,每个桶包括第一组数据点中的至少一个,基于阈值限制的桶的数量 值,导致至少有一些具有多个数据点的桶; 以及NN树搜索操作,包括通过将第二组输入数据点中的每一个与树中的数据点进行比较来遍历树,以识别桶,然后将第二数据点中的一个与桶中的数据点进行比较,以识别最近的 桶中的邻居数据点。

Patent Agency Ranking