Hot Search : Source embeded web remote control p2p game More...
Location : Home Search - Binary Tree
Search - Binary Tree - List
关于二叉树的生成插入删除等的操作,使用VC++环境新建一个类,并简要介绍了画图等一般的操作.-binary tree on the formation of the insert or delete operation, the use of a new VC categories, and gave a briefing on the general drawing operation.
Date : 2008-10-13 Size : 55.52kb User : 黎明

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.
Date : 2008-10-13 Size : 48.55kb User : fangfei

关于二叉树的生成插入删除等的操作,使用VC++环境新建一个类,并简要介绍了画图等一般的操作.-binary tree on the formation of the insert or delete operation, the use of a new VC categories, and gave a briefing on the general drawing operation.
Date : 2025-12-19 Size : 55kb User : 黎明

基于颜色直方图的图像检索_矩阵旋转算法,有需要的下载.-color histogram-based image retrieval _ rotation matrix algorithm, it is necessary to download.
Date : 2025-12-19 Size : 39kb User : abcde

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.
Date : 2025-12-19 Size : 48kb User : fangfei

属性均值聚类二叉树及其在人脸识别中的应用-Attribute Means Clustering Binary Tree and Its Application to Face Recognition
Date : 2025-12-19 Size : 105kb User : 刘文

二叉树的用法,深入理解了树和二叉树在计算机中的存储和读取方式,-Binary tree is used, in-depth understanding of the tree and binary tree in computer memory and reading method
Date : 2025-12-19 Size : 113kb User : 王超

提出一种基于搜索矩阵的自适应防碰撞算法.该算法有效利用碰撞信息,通过构造搜索矩阵,克服自适应 二又树搜索算法逐位搜索效率低的缺点.同时提出碰撞堆栈的概念,根据时隙状态,来自适应调整搜索路径,从而 减少碰撞和空闲时隙数以及传输的比特量.理论和仿真实验表明,该算法有效实用,可有效减少识别时间,提高搜 索效率-Presents a matrix of adaptive search-based anti-collision algorithm. The algorithm is the effective use of collision information, by constructing a search matrix, to overcome the self-adaptive binary tree search algorithm for low bit-searching efficiency shortcomings. At the same time put forward the concept of the stack collision, according to slot the state, from adjustments to the search path, thereby reducing the number of collisions and idle slots, as well as the amount of transmitted bits. Theory and simulation results show that the algorithm is effective and practical, which can effectively reduce the recognition time and improve search efficiency
Date : 2025-12-19 Size : 236kb User : 吴晓彦

markov random fields的各类优化算法及应用Optimization methods included: 1) ICM 2) Graph Cuts 3) Max-Product Belief Propagation 4) Sequential tree-reweighted message passing (TRW-S) Applications include: (1)binary (2)denoise (3)stereomatch (4)Photomontage 源码(http://vision.middlebury.edu/MRF/code/)已经过本人修改,替换,更新等,目前可在VS2008上编译运行。 如有疑问,请添加本人QQ:1150271506-Implementation of various optimization algorithms and applications of markov random fields. You can run directly on VS2008.
Date : 2025-12-19 Size : 32.78mb User : jhdai

基于内容的图像检索技术的关键在于特征提取,是利用图像的颜色、形状、纹理、轮廓、对象的空间关系等客观独立的存在于图像中的基本视觉特征作为图像的索引,计算查询图像和目标图像的相似距离,按相似度匹配进行检索。综合国内外研究现状,可将基于内容的图像检索技术分为如下几种类型:基于颜色特征的检索、基于纹理特征的检索、基于形状及区域的检索、基于空间约束关系的检索。-Based on comparing various affine invariant regional basis, selection of image stabilization exremum area biggest content segmentation and extraction. It has the affine invariants, the neighboring territory, stability and multi-scale characteristics, but also because of regional only by grey value of decision, so the size relations is not sensitive illumination change. In images all the pixel, then through sorting for barrel separated binary tree forest-- set the extreme area all obtained images and construct component tree, finally through the biggest stable delay-independent conditions MSER area is MSER, obtain the area without rules boundary shape of its, in order to facilitate to quantification description, using covariance matrix region neat optimization, made the final output of extreme value for the oval areas regional.
Date : 2025-12-19 Size : 2.46mb User : 陈利华

为了准确地对监控场景中的运动目标进行语义上的分类, 提出了一种基于聚类的核主成分分析梯度方向直方图和二叉决策树支持向量机的运动目标分类算法.利用背景减法提取运动目标前景区域, 并识别出潜在候选运动目标.利 用提出的基于聚类的核主成分分析的梯度直方图描述子提取候选运动目标的特征, 以较低维数的数据有效地描述运动目标的有效特征. 将提取的运动目标特征输入二叉决策树支持向量机, 实现多类目标的准确分类. 通过在不同视频序列上的实验验证, 提出的算法对运动目标进行较好地分类, 而且在运算速度方面较传统目标分类方法有了明显的提高. 实验结果证明了算法对运动目标分类具有较好的准确性 可靠性和鲁棒性.-For the purpose of semantically classifying moving objects accurately in a surveillance scene,a moving objects classification method based on the clustered kernel principal component analysis ( CKPCA) of the histogram of oriented gradients ( HOG) and support vector machine ( SVM) was proposed. Firstly,the moving areas in the foreground were extracted by means of the background subtraction method,and some of them were identified as potential candidates of moving objects. Secondly,the characteristics of the moving objects were obtained by the CKPCA- HOG descriptor,which could describe the moving objects' effective features at a lower data dimension. Finally,the data characteristics were fed into a binary SVM decision tree,and the final multi- class classification results were obtained accurately. After verifying different video sequences,the algorithm was able to classify moving targets very well. Compared with traditional classification methods,the proposed method makes obvious improv
Date : 2025-12-19 Size : 266kb User : 高峰

二叉树的生成,适合图形图像处理和数据结构的学习。-Binary tree generation, suitable for image processing and the data structure of learning.
Date : 2025-12-19 Size : 1kb User : 恩齐

该算法一种结合改进的基于独立分量分析(ICA)提取算法和基于多层感知器和单向二叉决策树的多类支持向量机分类方法。-The algorithm is a combination of improved based on independent component analysis (ICA) algorithm and multi-class support vector machine classification method based on binary decision tree of the multilayer perceptron and unidirectional.
Date : 2025-12-19 Size : 6kb User : 谭立国

[原创]基于自适应扫描次序的二叉树图像压缩方法BTCA源代码.本方法作为一部分于2012年10月发表在IEEE TGRS(2012IF=3.467),附有相应pdf论文及中文说明. 关键字:自适应扫描次序,二叉树编码,星载应用,遥感图像压缩,基于扫描的模式.-Binary Tree Coding with Adaptive scanning order(BTCA). Published on IEEE Trans. Geosci. Remote Sens. (2012IF=3.467) Index Terms: Adaptive scanning order, binary tree coding, on-board application, remote sensing image compression, scan-based mode.
Date : 2025-12-19 Size : 1.87mb User : kk.h

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: range search and nearest neighbor search). KD tree is a special case of binary space partitioning tree.
Date : 2025-12-19 Size : 1kb User : 刺客

是C++实现的四叉树索引可以实现2D、3D图像的插入、删除、查找,源码使用使用C++11标准实现的。值得学习。-C++ implementation of the four binary tree index can achieve 2D, 3D images of the insert, delete, search, the use of source code to achieve the use of C++11. Worth learning.
Date : 2025-12-19 Size : 612kb User : gaohang

一种新的基于线性四叉树的图像分割算法,内涵算法和Demo,适合初学者学习使用-A new image segmentation algorithm based on linear four binary tree, the connotation of algorithms and examples, suitable for learners to use
Date : 2025-12-19 Size : 24kb User : Ralph

二叉决策树能很好地运行,适合初学者,希望能帮助大家更好地学习算法-Binary decision tree can run well, suitable for beginnersHope I can help you better learning algorithm
Date : 2025-12-19 Size : 1kb User : 解俊雄
CodeBus is one of the largest source code repositories on the Internet!
Contact us :
1999-2046 CodeBus All Rights Reserved.