搜索资源列表
Kd-tree
- KD 树代码，常见的数据搜索算法，比较实用-KD tree code, common data search algorithms, more practical
sift_robhess.rar
- Rob Hess Linux下的SIFT提取源码，金字塔采样和高斯差分提取特征点，KD树搜索寻找同名点，RANSAC去粗差,Rob Hess Linux source code under the SIFT extraction, sampling and Gaussian pyramid differential extraction of feature points, KD tree search to find the same name, points, RANSAC to gross
c++实现的KNN库:建立高维度的K-d tree
- c++实现的KNN库:建立高维度的K-d tree,实现K邻域搜索，最小半径搜索-K-NN algorithm implementation. It supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions.
KD-Tree
- 光线追踪的cuda程序，基于cuda实现，大大加速了速度。-Cuda ray tracing program, based on cuda implementation, greatly accelerating the speed.
SIFT_area_match
- SIFT算法的区域匹配，比原有的SIFT+KD树匹配更加高效、准确。-different area SIFT algorithm which is better than the original SIFT and KD tree match.
kdtree
- kd树类的实现。内部提供了三种搜索方法。-kd tree class implementation。
kdtree
- K-D树源码，不错的空间查找算法，在三维重建和匹配中应用较多！-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
KD_Tree
- KD_Tree In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a m
sift-1.1.1_20071108_win
- Rob Hess的SIFT算法的C语言实现(基于OpenCV),金字塔采样和高斯差分提取特征点，K-D树寻找同名点，RANSAC去粗差-Rob Hess of the SIFT algorithm C language (based on OpenCV), sampling and Gaussian pyramid differential extraction of feature points, KD tree search for points of the same name, RANS
libkdtree_0.7.0
- 一个KD-tree的类STL模板库，版本为0.7.0-libkdtree++ is an STL-like C++ template container implementation of k-dimensional space sorting, using a kd-tree.
kd_tree
- 一个高效的k-d tree实现，可以广泛的应用与图形图像处理。-K nearest neighbor search based on KD-tree
flann-1.2-src
- 快速近似KNN库，是一个对于kd-tree的实现。可以用它实现特征向量的匹配。-Fast approximate KNN library, is one for the kd-tree implementation. You can use it to achieve the feature vector matching.
An_intoductory_tutorial_on_kd_trees
- 一篇介绍kd-tree算法的比较实用的英文文章，内容详细，有利于初学者使用！-Kd-tree algorithm is a descr iption of the more practical English articles, detailed help beginners to use!
kdtree
- In computer science, a kd-tree (short for k-dimensional tree) is a space-partitioning data structure for organizing points in a k-dimensional space. kd-trees are a useful data structure for several applications, such as searches involving a multidime
kdtree1.2
- kd-tree 是广泛用来处理多维寻找最近点的数据结构。该文件中是由matlab调用c++代码实现的，其中实现包括kd-tree的建立最近点的查找等。-kd-tree is kind of data structure which is widely used to find the nearest point in multi-demensions.The zip file contain matlab and cpp files.The functions implemented inclu
kdtree_in_matlab
- kd-tree 是一种常用的数据结构，它在搜索最近点中有普遍用处。该文件是一个用纯matlab写成的源代码。-kd-tree is a commonly used data structure, it is commonly used in searches for the nearest point. The file is a pure source code written in matlab.
BOS_NLTV_v1
- kd树的结构和分析及其源代码的程序使用matlab-kd tree structure and analytical procedures used and its source code matlab
10.1.1.10.818
- 关于数据库多维索引结构KD树的介绍，包括构建和检索的算法。-Multi-dimensional database index structure on the introduction of KD tree, including the construction and retrieval algorithms
KD-tree
- C++构建简单的KD树并查找K近邻，是一篇文档，内附代码，代码亲测可用(C++ to build a simple KD tree, and find K nearest neighbor, is a document, enclosing code, code pro test available)
kd-tree
- kd-tree点云索引方法，源码以及应用实例解析(kd-tree point cloud code)