搜索资源列表
bwdistsc
- This function computes Euclidean distance transform for 3D binary image with non-trivial aspect ratio (i.e. anisotropic pixels). The algorithm uses fast optimized line-scans and is actually faster than MATLAB s BWDIST implementation of search on opti
ann
- ANN is a library written in the C++ programming language to support both exact and approximate nearest neighbor searching in spaces of various dimensions. 可以直接用于工程 支持 Kd tree，BBF(best bin first)
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
- K-D树源码，不错的空间查找算法，在三维重建和匹配中应用较多！-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
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
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.
ReadBundleOutFile
- 分析读取Bundler输出的.txt,.key文件，对三维点云sift特征建立KD树索引。-Parsing Bundler Output including .txt& .key Files to construct a KD tree Index.
ImageStitch
- 基于SIFT算法的图像拼接 主要是运用SIFT算法求得特征点，然后用kd_tree进行特征点匹配，根据匹配点求得2x2的变换矩阵，然后利用变换矩阵变换图像（需要插值）。-Image Stitch Based on SIFT
rtree
- RTree - KD Tree Used In Graphics Programming VS Version-RTree- KD Tree Used In Graphics Programming VS Version
kdtree
- kd 近邻查找. 一般用在图像拼接等领域-k-d tree to find the nearest one
kdtree
- 基于手机系统图像拼接中kd树算法的实用程序-a program of kd tree arithmetic
kdtree
- 在图像处理中，用最优节点优先法，建造kd树，用于特征点匹配-In the image processing, the optimal node with priority method, build kd tree, used for matching feature points
kdtree
- 特征点匹配时，采用构造KD-tree，用最优节点优先法寻找最佳匹配点-Matching feature points, the tectonic KD-tree, with the optimal node is preferred method to search for the optimal matching point
KD-Tree
- 基于opencv的一个KD-树的一个简单实现 可用-A simple implementation of KD tree
SIFT-KD-tree-image-panorama-opencv
- SIFT KD树 图像拼接 全景图_多幅图 opencv -SIFT KD tree image mosaic panorama _ Multiple Figure opencv
kd-tree
- KD-Tree是一种由二叉搜索树推广而来的用于多维检索的树的结构形式-KD-Tree is a binary search tree by a promotion the tree is used to retrieve the multidimensional structure
sift-kd-treePsansac
- 基于SIFT 的电子稳像技术。用SIFT+KDTREE+RANSCA实现-image stabilization based on sift+kd tree+ransac
creat kd_tree2
- 多维KD树建立的完整代码，用于最近邻匹配。(The complete code created by the multidimensional KD tree is used for nearest neighbor matching.)