PDollar-Unity:PDollar算法Unity友好

  • T1_928524
    了解作者
  • 517.1KB
    文件大小
  • zip
    文件格式
  • 0
    收藏次数
  • VIP专享
    资源类型
  • 0
    下载次数
  • 2022-04-09 09:40
    上传日期
$ P点云识别器 。 。 这是Unity原始C#代码的改编。 在演示中,仅为16种手势类型中的一种加载了点云模板。 您可以根据需要添加其他模板,甚至可以定义自己的自定义手势模板。 关于 点云识别器是一种二维手势识别器,用于基于手势的用户界面的快速原型制作。 用机器学习的术语来说,$ P是基于实例的最近邻分类器,具有欧几里得评分功能,即几何模板匹配器。 $ P是美元识别器系列中的最新款,其中包括表示非误报, 表示多冲程。 尽管$ P的代码中大约有一半来自$ 1,但不同于$ 1和$ N,$ P并不将手势表示为有序的点序列(即笔触),而是无序的点云。 通过将手势表示为点云,$ P可以等效地处理非
PDollar-Unity-master.zip
内容介绍
$P Point-Cloud Recognizer ========================= [Original article](http://depts.washington.edu/aimgroup/proj/dollar/pdollar.html). [Unity Web demo](http://aymericlamboley.fr/blog/wp-content/uploads/2014/07/index.html). This is an adaptation of the original C# code for Unity. In the demo, only one point-cloud template is loaded for each of the 16 gesture types. You can add additional templates as you wish, and even define your own custom gesture templates. ![](http://aymericlamboley.fr/blog/wp-content/uploads/2014/07/multistrokes.gif) About ----- The [$P](http://depts.washington.edu/aimgroup/proj/dollar/pdollar.html) Point-Cloud Recognizer is a 2-D gesture recognizer designed for rapid prototyping of gesture-based user interfaces. In machine learning terms, $P is an instance-based nearest-neighbor classifier with a Euclidean scoring function, i.e., a geometric template matcher. $P is the latest in the dollar family of recognizers that includes [$1](http://depts.washington.edu/aimgroup/proj/dollar/index.html) for unistrokes and [$N](http://depts.washington.edu/aimgroup/proj/dollar/ndollar.html) for multistrokes. Although about half of $P's code is from $1, unlike both $1 and $N, $P does not represent gestures as ordered series of points (i.e., strokes), but as unordered point-clouds. By representing gestures as point-clouds, $P can handle both unistrokes and multistrokes equivalently and without the combinatoric overhead of $N. When comparing two point-clouds, $P solves the classic [assignment problem](http://en.wikipedia.org/wiki/Assignment_problem) between two bipartite graphs using an approximation of the [Hungarian algorithm](http://en.wikipedia.org/wiki/Hungarian_algorithm). The $P recognizer is distributed under the [New BSD License](http://en.wikipedia.org/wiki/BSD_licenses#3-clause_license_.28.22Revised_BSD_License.22.2C_.22New_BSD_License.22.2C_or_.22Modified_BSD_License.22.29) agreement.
评论
    相关推荐