搜索资源列表
kdtree
- kd树的实现，用到matlab-kd tree realization used Matlab
OPENCV_SIFT_VC6
- 基于OPENCV的SIFT特征提取与匹配算法。包含完整的从图像高斯金字塔、DOG、空间极值点提取、关键点描述、KDtree匹配等关键步骤的全部函数实现，对全面深入理解Lowe的SIFT算法有莫大帮助。程序运行前须安装（1）OpenCV: http://opencvlibrary.sourceforge.net （2）SIFT: http://web.engr.oregonstate.edu/~hess/index.html，并配置其环境参数。
KDTree
- k-d 树的类模板,比较简短.c++代码
KDTreeTest
- kd-tree c++类模板实现的演示例子. 是从国外网站上下的,结构简单,容易看懂. 文章在: http://www.codeproject.com/KB/architecture/KDTree.aspx
kdtree
- Implementation of k-d tree(including insertion/deletion). Well suited for beginners in advanced Multi-dimensional datastructures and algorithms
kdtree
- kd 近邻查找. 一般用在图像拼接等领域-k-d tree to find the nearest one
kdtree-0.5.6.tar
- kdtree的C语言实现，便于用户使用和翻译-kdtree realize
kdtree
- Kdtree 搜索算法，建树方法，邻近点搜索，查询-Kdtree searching algorithm，build tree， search neigbhor， query
@kdtree
- kd树在matlab下的实现主要包含4个子函数-The following code implements a KDTree search algorithm in MATLAB.There are 4 main functions
KDTree
- 图像配准中，采用基于SIFT求得的特征点配准方法中需要用到的KDTree，求出2最近邻-Image registration needed based on SIFT feature points matching obtained KDTree, find the nearest neighbor
kdtree
- 用matlab语言写的kdtree函数(k-d树，是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索)-failed to translate
kdtree
- kd树，matlab源码 kd树，matlab源码-kdtree wiritten in matlab
kdtree
- 完整实现了数据的kdtree划分，适用于最近点搜索，验证可用。-Full implementation of the data kdtree division, search for the nearest point to verify availability.
kdtree
- KD树 KDtree的建立到最近领域的搜索，简单易懂-KD tree KDtree establishment to the nearest field of search, easy to understand
kdtree
- k-d树的matlab程序，包含了KDTREE, KDTREEIDX and KDRANGEQUERY functions。提供了两个Demo scr ipts(kdtree_demo.m & kdrange_demo.m),很实用- This distribution contains the KDTREE, KDTREEIDX and KDRANGEQUERY functions. Included are the source code files in kdtree/s
kdtree
- PCL中KdTree搜索程序，适合初学者了解PCL中KdTree的搜索方法-PCL KdTree search procedure, suitable for beginners to understand the PCLS KdTree search method
kdtree
- kdtree 数据挖掘使用 最快的方式找到最近的点阵 动态规划-KDTREE used for data mining
kdtree-realization
- K-d树实现。采用matalb和C++混合编译的方式实现。-kdtree provides a minimalistic implementation of kd-tree. The implementation can be used either inside MATLAB by means of MEX calls, or as a standalone tool, directly a C/C++ program.
KdTree
- kdtree的建立，实现k近邻搜索，已经按半径搜索-Kdtree establishment, and k nearest neighbor search and radius of the index
kdTree-master
- C ++模板化的KD-Tree实现 这是KD-Tree空间数据结构的仅头部实现。 你只需要提供一个 具有已知编译时间“维度”字段的矢量类型和双重getDimension（size_t维度）方法。 目前支持以下操作： - 从点矢量创建 - 在一个点中心的立方体中查找点 - 从树中删除点（但不是从点的内部列表） - 采用任意函数参数的遍历方法 我已经成功地使用它来删除邻居太近的修剪一组点。(C++ templated KD-Tree implementation T