搜索资源列表
SIFT_matlabe1
- This a MATLAB implementation of the SIFT keypoint detector and descr iptor -do_gaussian: generate Gaussian scale space of input image do_diffofg: generate Difference of Gaussian (DoG) scale space do_localmax: local extrema as the potential keyp
xxglj.tar
- 灵感来源于《选择你的冒险历程》系列图书,本代码采用《吸血鬼邻居》的故事情节,在读完一段文字后,用数字选择你下一步的方向,这样故事的情节会在你自己的掌控下进行。还是没有gui,偶尔玩玩也是很有意思的,当时花了很长时间处理数据。-Inspired by choose your adventure series of books, this code is the use of vampire neighbor, the story, after reading a text, choose
Classification-1
- Nearest Neighbor Classification
KNN
- SOPHISTICATED WAY FIND THE SHORTEST DISTANCE AMONG THE NEIGHBOR POINTS
ann_test
- 最近邻域搜索(k-Nearest Neighbor algrithmn
KNN
- K-NN k-Nearest Neighbor classification algorithm-K-NN k-Nearest Neighbor classification algorithm
KNNC
- 提出基于优化K-最近邻域分类器(K-Nearest Neighbor Classifier,KNNC)的轴承故障模式识别方-proposed K-Nearest Neighbor Classifier(KNNC), diagnosing method
E2LSH-0.1
- 局部敏感哈希算法进行数据查找和召回。可以实现最近邻查找、局部敏感哈希算法查找,并且比较两者的召回率。-Local sensitive hashing algorithm to find and recall data. Find the nearest neighbor can be achieved, local sensitive hash algorithm to find and compare the recall.
06906053.
- Computation and routing in Mobile Ad hoc Network (MANET) is strongly co-related with power resource. Recent trend is to minimize the power consumption and maximize the computation without hampering the quality of service in MANET. To increase
KNN
- 自己编写的最近邻KNN算法,采用的距离是欧氏距离,附加了详细的中文注释,还有一个测试集和一个训练集- I have written KNN nearest neighbor algorithm, the distance is the Euclidean distance, additional detailed notes in Chinese, as well as a test set and a training set
HellokinectMAT
- 感知行为的影响因素包括单个关节的动作和不同关节的组态。因此提出一种新的基于关节的位置差异的特征类型,联合包括静态姿势、动作、位移在内的行为信息进行识别。采用关节在两个时间和空间区域的差异来明确地模拟个别关节动力学和不同关节的组态。然后应用主成分分析(PCA)来获得所需的特征。同时应用非参数的简捷的贝叶斯最近邻(NBNN)分类器进行多类行为的分类。这个NBNN分类器避免了帧描述符的量化,计算“图像到类别”的距离而不是“图像到图像”的距离。15到20帧的数据就足以实现手势以及动作的识别,无需应用整个
29a2fbce684e
- 在matlab环境下,用最邻近数据关联算法实现目标跟踪。--In the matlab environment, with the nearest neighbor data association target tracking algorithm.-
CK-1_Repro.v1.02
- 有时间序列方法和技术的兴趣大增。从人,自然收集的信息几乎每一件,和生物过程是容易随时间的变化,以及这些变化如何发生的研究是一个中心问题充分理解这样的过程。所有的时间序列数据挖掘任务的分类中,可能是最突出的一个。在时间序列的分类有大量的实证研究,在时间域表明近邻规则是非常有效的。然而,一定的时间序列特征不在这个领域很容易地识别和表达的变化可能揭示了一些重要的和未知的特征。在这项工作中我们提出了递归图的使用对于时间序列的分类表示域。我们的方法复发措施地块使用坎帕纳基奥之间的相似性(CK-1)的距离,
recognition-forme_2
- Application of rule d nearest neighbor to build the partition of the Vornoi
Vornoi-partition
- Application of rule d nearest neighbor to build the partition of the Vornoi
knnalgorithm
- k最近邻算法,给出训练样本和测试样本,通过样本间欧氏距离或是绝对距离来寻找测试样本的k个近邻,并根据k个实例里多数所属的类将该测试样本归为该类。-k-nearest neighbor algorithm, given the training and testing samples by the Euclidean distance between the samples or the absolute distance to find the k nearest neighbors of th
data-asso--introduction
- 详细介绍数据关联的相关知识,包含最近邻,JPDA的算法的详细推导。-Detailed data related knowledge, including the nearest neighbor, detailed derivation JPDA algorithm.
GNN
- 路网环境下的聚集最近邻查询,基于网络V图和查询点集的影响区域确定一个候选集,以此减少了距离的计算量-Clustered network environment nearest neighbor query, determine a candidate set based on the affected area network V diagram and query point set, thereby reducing the amount of computation distance
www2
- 一种改进的最近邻聚类算法,能够改进普通的最近邻聚类算法的不足-An improved nearest neighbor clustering algorithm, it is possible to improve the lack of common nearest neighbor clustering algorithm
knndemo
- K近邻分类器,实现了对iris数据集的分类,并且使用了交叉验证的方法,来验证求得的最优的K值。-K-nearest neighbor classifier to achieve the classification of iris data set and cross-validation of the method used to verify the optimal value of K obtained.