搜索资源列表
kdtree
- 特征点匹配时，采用构造KD-tree，用最优节点优先法寻找最佳匹配点-Matching feature points, the tectonic KD-tree, with the optimal node is preferred method to search for the optimal matching point
kdtree
- KD tree implementation in C by Rajeev Kumar
kdtree1
- KD树在vc++中的实现包含kd树的创建等-the implement of kdtree in vc++
KDTreeTest
- 这是一个名为kdtree的数据结构源码，用来划分高维空间，并且查找最近的点-this source code is a kind of structure to split the space of multi-dimension, which is named kdtree. And you can use it to compute the nearest point in the database.
kdtree
- 建立kd树的源代码，亲测可以使用，能极大提高搜索的速度-Establishment of the kd-tree source code, the pro-test can be used, can greatly improve the search speed
KDTree
- K叉树 < 数据结构与算法分析in C> -K-tree Data Structures And Algorithm Analysis in C
acmkdtree
- kdtree java 实现。。 实现了一个sql优化，减少了回溯次数，家少了执行时间-The kdtree java. . . . A sql optimization, reduce the number of backtracking, the home less execution time
avito
- 基于OPENCV的SIFT特征提取与匹配算法。包含完整的从图像高斯金字塔、DOG、空间极值点提取、关键点描述、KDtree匹配等关键步骤的全部函数实现，对全面深入理解Lowe的SIFT算法有莫大帮助。-OPENCV based SIFT feature extraction and matching algorithms. Extracted from the image Gaussian pyramid, DOG, space ext
av
- 基于OPENCV的SIFT特征提取与匹配算法。包含完整的从图像高斯金字塔、DOG、空间极值点提取、关键点描述、KDtree匹配等关键步骤的全部函数实现，对全面深入理解Lowe的SIFT算法有莫大帮助。-OPENCV based SIFT feature extraction and matching algorithms. Extracted from the image Gaussian pyramid, DOG, space ext
new
- KDtree匹配等关键步骤的全部函数实现，对全面深入理解Lowe的SIFT算法有莫大帮助-Key step KDtree matching function achieved great help in a comprehensive and in-depth understanding of Lowe' s SIFT algorithm
SIFT_VC.rar
- sift算法，支持特征点提取，kdtree算法匹配的程序。,sift algorithm, program support feature point extraction, kdtree algorithm match.
KDTree-SRC
- KD树，用于范围搜索。大家都懂啦，不用多说了-KD tree for range search
KDTree
- k-d树（k-dimensional树的简称），是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索（如：范围搜索和最近邻搜索）。用java实现，可直接运行-kd-tree (k-dimensional tree for short), is a partition the data structure of k-dimensional data space. Mainly used in the search of th
KDTree2KNN
- 基于kdtree的KNN分类算法，利用kdtree在检索方面的优势有效地提高knn分类的性能，减小了分类的时间复杂度-Kdtree of KNN-based classification algorithm, using kdtree retrieval effectively improve knn classification performance, reducing the time complexity of the clas
KDTree2Kmeans
- 基于kdtree的kmeans聚类算法，在选择最近邻中心点时使用kdtree的检索功能，提高了检索效率，特别是当k较大时，效果明显提升-kmeans clustering algorithm based on kdtree，used in selecting the center point of the nearest neighbor the kdtree retrieval function, and improve the re
sift-kdtree
- 程序实现了对图像sift特征的提取，并利用KD-树对图像进行相似度匹配。-Program image sift feature extraction and similarity matching KD-tree image.
kdTree
- 最近邻算法的构建，构造kd-tree。是统计学习方法中的经典方法。是其源码实现。-Nearest neighbor algorithm, constructed kd-tree. The classical method is a statistical learning method. Its source code to achieve.
CollectSample
- 项目中关于kdtree的实际运用，感兴趣的可以看下-failed to translate
numerical-recipe-code4
- 剑桥数据库源代码，包括huffcode、inter_curve、kdtree等算法-Cambridge database source code, including huffcode, inter_curve, kdtree algorithm
kdtree
- KD-Tree的c++实现，并有文档详细介绍了KD-Tree的实现算法。-KD-Tree of c++ implementation, detailing the implementation of the KD-Tree algorithm.