Welcome![Sign In][Sign Up]
Location:
Search - kd tree algorithm

Search list

[Other resourcesimkd

Description: kd树的最快实现算法,经过了数次优化后,即使处理数十万个点,也仅仅需要几秒钟,内含使用说明。-kd tree algorithm to achieve the fastest, after a number of optimization, even hundreds of thousands of points. I only need a few seconds, intron use.
Platform: | Size: 208607 | Author: 胖丫 | Hits:

[Data structssimkd

Description: kd树的最快实现算法,经过了数次优化后,即使处理数十万个点,也仅仅需要几秒钟,内含使用说明。-kd tree algorithm to achieve the fastest, after a number of optimization, even hundreds of thousands of points. I only need a few seconds, intron use.
Platform: | Size: 207872 | Author: 胖丫 | Hits:

[OtherKd-tree

Description: KD 树代码,常见的数据搜索算法,比较实用-KD tree code, common data search algorithms, more practical
Platform: | Size: 4096 | Author: nanyuan | Hits:

[Special Effectsbwdistsc

Description: 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 optimized kd-tree for many cases. It also uses cell-array representation for internal data, and thus is less demanding to physical memory.
Platform: | Size: 49152 | Author: fangfei | Hits:

[AI-NN-PRkmlocal-1.7.1.tar

Description: 高效的k-means算法实现,使用了k-d树与局部搜索等提高k-means算法的执行效率,同时包含示例代码,用c++代码实现。 Effecient implementation of k-means algorith, k-d tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are implemented in C++.-Efficient k-means algorithm, the use of a kd tree with local search, such as k-means algorithm to improve the implementation efficiency of the sample code included with c++ Code. Effecient implementation of k-means algorith, kd tree and local search strategy are implementd to improve the effeciency, samples are included to show how to use it. All codes are implemented in C++.
Platform: | Size: 907264 | Author: 陈明 | Hits:

[JSP/JavaKdTree

Description: 用Java编写的KD TREE算法实现, 希望对大家有所帮助-Java prepared using KD TREE algorithm, I hope all of you to help
Platform: | Size: 1024 | Author: 阎贺 | Hits:

[TreeViewNIPS2005_0433

Description: k-d tree 算法介绍,介绍了一种可行的方法,从而实现搜素。-kd tree algorithm, the introduction of a feasible way to achieve the Su-found.
Platform: | Size: 191488 | Author: sunyifeng | Hits:

[Special Effectssift-1.1.1_20071108_win

Description: 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, RANSAC to gross errors
Platform: | Size: 448512 | Author: lonfan | Hits:

[3D Graphickdtree

Description: K-D树源码,不错的空间查找算法,在三维重建和匹配中应用较多!-KD tree source, good space search algorithm, in the three-dimensional reconstruction and matching the application of more!
Platform: | Size: 105472 | Author: yangronghao | Hits:

[Software Engineeringkd-trees

Description: 数据结构的选择与算法效率——从IOI98试题PICTURE谈起 高级数据结构:线段树-The choice of data structure and algorithm efficiency- from IOI98 questions about high-level data structure PICTURE: segment tree
Platform: | Size: 311296 | Author: henry | Hits:

[AI-NN-PRKNN

Description: 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.
Platform: | Size: 624640 | Author: duckur | Hits:

[JSP/JavaKdTree

Description: this class is an implementation of the kd-tree algorithm
Platform: | Size: 1024 | Author: bilz | Hits:

[matlabknnsearch

Description: 寻找测试样本的最近邻,可以有效的用于用于模式识别,信号处理-This is a small but efficient tool to perform K-nearest neighbor search, which has wide Science and Engineering applications, such as pattern recognition, data mining and signal processing. The code was initially implemented through vectorization. After discussions with John D Errico, I realized that my algorithm will suffer numerical accurancy problem for data with large values. Then, after trying several approaches, I found simple loops with JIT acceleration is the most efficient solution. Now, the performance of the code is comparable with kd-tree even the latter is coded in a mex file. The code is very simple, hence is also suitable for beginner to learn knn search.
Platform: | Size: 3072 | Author: 刘晓红 | Hits:

[Data structsAccelerating_Exact_k_means_Algorithms_with_Geometr

Description: 一篇介绍加速kd树算法的英文文章,有比较高的参考价值!-A kd tree algorithm to accelerate introduction of English articles, a relatively high reference value!
Platform: | Size: 333824 | Author: 晨间 | Hits:

[Data structsAn_intoductory_tutorial_on_kd_trees

Description: 一篇介绍kd-tree算法的比较实用的英文文章,内容详细,有利于初学者使用!-Kd-tree algorithm is a description of the more practical English articles, detailed help beginners to use!
Platform: | Size: 133120 | Author: 晨间 | Hits:

[Special EffectsSIFT_area_match

Description: SIFT算法的区域匹配,比原有的SIFT+KD树匹配更加高效、准确。-different area SIFT algorithm which is better than the original SIFT and KD tree match.
Platform: | Size: 6445056 | Author: jiba | Hits:

[Special EffectsAlgorithm-for-Sequence-Image-Automatic-Mosaic-bas

Description: Abstract—Constraining by cameras’ view-angles of the outdoor monitoring systems, the panoramic digital images fail to be obtained directly from photographing. A method is proposed on the basis of the scale invariance feature transform (i.e. SIFT) algorithm to stitch images captured by the turning video cameras together to form panoramic images. Based on the SIFT features and the retrofitted KD- Tree structure, the BBF searching strategy is employed to match feature points. Then in a post-processing pass, the Ransac algorithm is adopted to remove the mismatching feature points. Photos captured by a surveillance camera are taken as the input to test the proposed method. According to the test, the whole processing time of stitch is reduced while the fidelity of resulting stitched panoramic images is ensured.-Abstract—Constraining by cameras’ view-angles of the outdoor monitoring systems, the panoramic digital images fail to be obtained directly from photographing. A method is proposed on the basis of the scale invariance feature transform (i.e. SIFT) algorithm to stitch images captured by the turning video cameras together to form panoramic images. Based on the SIFT features and the retrofitted KD- Tree structure, the BBF searching strategy is employed to match feature points. Then in a post-processing pass, the Ransac algorithm is adopted to remove the mismatching feature points. Photos captured by a surveillance camera are taken as the input to test the proposed method. According to the test, the whole processing time of stitch is reduced while the fidelity of resulting stitched panoramic images is ensured.
Platform: | Size: 345088 | Author: bou33aza | Hits:

[VC/MFCResearch-kd-tree-algorithm

Description: KdTree算法研究,包括原理讲解,结合实例,并列出了伪代码-KdTree algorithm, including the principle to explain, with examples, and lists the pseudo-code
Platform: | Size: 252928 | Author: liulei | Hits:

[Software Engineeringkd-tree

Description: KD TREE implementation easy algorithm
Platform: | Size: 149504 | Author: paplu | Hits:

[Consolekd-tree.cpp

Description: 三维点云配准kd-tree搜索算法,用于特征点的搜索匹配-3 d point cloud registration kd- tree search algorithm, is used to search of feature point matching
Platform: | Size: 20480 | Author: 杜科林 | Hits:
« 12 3 »

CodeBus www.codebus.net