Location:
Search - matlab k-d tree
Search list
Description: kd树的实现,用到matlab-kd tree realization used Matlab
Platform: |
Size: 114688 |
Author: 请不要用公用帐号上载 |
Hits:
Description: 用matlab实现的kdtree,kdtree适合用于数据挖掘中用于寻找最近邻。-Using matlab to achieve kdtree, kdtree suitable for data mining used to find the nearest neighbors.
Platform: |
Size: 102400 |
Author: 项龙江 |
Hits:
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:
Description: 用matlab编写的k-dtree,加快搜索,在点云拼合中应用广泛。-Matlab prepared with k-dtree, to speed up the search, put together in the point cloud in a wide range of applications.
Platform: |
Size: 302080 |
Author: 翟乐 |
Hits:
Description: ) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
-) Compression using huffman code
-with a number of bits k per code word
-provide huffman table
Huffman coding is optimal for a symbol-by-symbol coding with a known input probability distribution.This technique uses a variable-length code table for encoding a source symbol. The table is derived in a particular way based on the estimated probability of occurrence for each possible value of the source symbol .Huffman coding uses a specific method for representing each symbol, resulting in a prefix code that expresses the most common characters using shorter strings of bits than those used for less common source symbols.The Huffman coding is a procedure to generate a binary code tree.
Platform: |
Size: 1024 |
Author: ria |
Hits:
Description: 一个高效的k-d tree实现,可以广泛的应用与图形图像处理。-K nearest neighbor search based on KD-tree
Platform: |
Size: 24576 |
Author: 南亮亮 |
Hits:
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:
Description: kd 近邻查找.
一般用在图像拼接等领域-k-d tree
to find the nearest one
Platform: |
Size: 114688 |
Author: alisha |
Hits:
Description: k-d tree的matlab与VC混合实现,可直接使用-using matlab and VC mix programming to realize kd tree.can be used used directly
Platform: |
Size: 126976 |
Author: |
Hits:
Description: 用matlab进行图像拼接时,可以用到的程序,或可参考。K-D树。我没看懂-Using matlab for image stitching, you can use a program, or a reference. KD tree. I did not understand
Platform: |
Size: 302080 |
Author: 余金 |
Hits:
Description: 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.
Platform: |
Size: 171008 |
Author: 王淑丹 |
Hits:
Description: k d clustering in matlab
Platform: |
Size: 15360 |
Author: mahbob
|
Hits: