搜索资源列表
kdtree
- KD-Tree的c++实现，并有文档详细介绍了KD-Tree的实现算法。-KD-Tree of c++ implementation, detailing the implementation of the KD-Tree algorithm.
kdtree
- 用matlab进行图像拼接时，可以用到的程序，或可参考。K-D树。我没看懂-Using matlab for image stitching, you can use a program, or a reference. KD tree. I did not understand
kdtree
- KD树 KDtree的建立到最近领域的搜索，简单易懂-KD tree KDtree establishment to the nearest field of search, easy to understand
KD_Tree
- 基于K维空间索引的点查询算法KD树，本代码实现一般的查询功能-K-dimensional space-based index point KD tree search algorithm, the code search function in general
siftPransac
- SIFT点提取，KD树特征匹配，再用随机抽样一致算法去除无匹配-SIFT extraction, KD tree feature matching, and then remove the non-random sample consensus algorithm matches
Angle-cosine--diffusion-distance
- 详细讲解了夹角余弦，扩散距离，KD-tree，他们的原理以及优势-In detail the included Angle cosine, diffusion distance, KD- tree, their principles and advantages
icp3d
- 基于K-D tree的ICP算法的C代码，可以用于点云匹配。代码有注释。简单易懂。适合初学者研究学习。-ICP algorithm based KD tree C code that can be used to match point cloud. Code annotated. Easy to understand. Suitable for beginners to learn.
sift_robkdtree
- sift算法寻找特征点，并用KD树法匹配特征点-sift algorithm to find the feature points and match with KD tree method feature points
crosscode
- 自己编写的C++小程序，十字算法，用到KD树，能够有效进行点云去噪，压缩数据-I have written a small program C++, cross algorithm used in KD tree, the point cloud can be effectively de-noising, compression of data
kdtree_3
- here is matlab code for Kd tr-here is matlab code for Kd tree
kdtree11
- 用matlab编写的关于Kd树算法，很实用的-About using matlab Kd tree algorithm, a very practical
Processing.tar
- 包内为探测图像极值，检测SIFT特征和构建K-D树等功能的源码。- Package for the detection of extreme images, detecting SIFT features and functions to build the source code KD tree.
ICPdemo_test
- 迭代最近点（ICP）算法 包括Kd-tree搜索实现-Iterative Closest Point (ICP) algorithm includes Kd-tree search implementation
kdtree
- k-d树（k-dimensional树的简称），是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索（如：范围搜索和最近邻搜索）。K-D树是二进制空间分割树的特殊的情况。-kd tree (k-dimensional tree for short), is a data structure split k-dimensional data space. Mainly used in multi-dimensional space-critical data search (eg:
asift_Algorithm
- 实现图像的自动配准，是SIFT算法的改进算法，同时在ASIFT匹配阶段，对算法进行了修改，采用KD树结构进行搜索。-Automatic registration of images is SIFT algorithm improved algorithm, while ASIFT matching stage, the algorithm was modified using the KD tree search.
kdtree_search
- k-d树是一种分割k维数据空间的数据结构。主要应用于多维空间关键数据的搜索-kd tree is a k-dimensional data structure segmentation data space. Mainly used in multi-dimensional space-critical data search
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.
ICPandKD_TREE-function
- icp算法的实现和kd-tree功能的实现，实现了三维激光扫描仪获取的多视点云配准和建立离散点间的拓扑关系，实现基于领域关系的快速查找。-kd-tree implementation and realization of function icp algorithm to achieve a multi-view point cloud registration and establish topological relations between discrete points, field-
KDTREE
- kd树，一个简单的kd树实现，只能用于简单的理解-kd tree, a simple kd tree implementation, only for simple understanding
MyKD_Tree
- KD树算法，能够实现对点云数据进行压缩，非常简单，适用于初学者-KD tree algorithm, can achieve the point cloud data compression, very simple, suitable for beginners