搜索资源列表
3DTree
- 在vc中利用OpenGL实现树木建模，用两个垂直交叉的多边形来代替视点计算-use OpenGL tree modeling, using two vertical cross-polygon calculated to replace Perspective
huffman_f
- huffman_f 在huffman_e的基础上，将排序改为利用堆排序原理选择最小的两个权值。也即，将所有元素的权值组织成堆后，每次堆内的根结点就是最小值了。每取出一个根结点后，就把堆尾元素调到根结点重建堆。取出两个最小值合并成一个子树后，再把子树作为叶子结点放到堆中，并让其上升到合适的位置，保持堆性质不变。因为每次不必完成整个排序过程，而只是组织成堆，因此，这种方法要比使用快速排序更快。上述算法参考了mg-1.2.1中Huffman编码的实现，见http://www.cs.mu.oz.au/m
A09
- 二维树，实现一个三维的树林空间，优点可以减小程序的体积。能实现三维的效果，它把二维树的正面始终对着视点，从而可见的总是一棵树，而不会出现失真-two-dimensional tree, to achieve a three-dimensional space woods advantage of the procedure can reduce the volume. To achieve the 3-D effect, two-dimensional tree always facing th
fengchuifenxing
- 风吹分形树：本例采用WIN32 + 字符替换法 模拟从2阶到N阶 经典分形树的实现。而经典的算法采用递归实现。 其中的字符替换法 可作为此类问题的通解-wind fractal tree : the characters WIN32 cases using replacement simulation from two bands of N-classic fractal tree realized. The classic recursive algorithm to achieve. T
dualtreewavelettransform
- 双树复小波变换的源代码，可用于一维信号与二维图像的变换-double-tree Complex Wavelet transform the source code can be used in one-dimensional and two-dimensional image signal transformation
CTree
- 实现VC三态树功能，使用方便，功能齐全，外观美观，有双向互动功能-VC three state tree functional, easy to use, multifunctional and aesthetic appearance, a two-way interactive functions
PhotoPrecess200705011006
- 包含图像的中值滤波、直方图均衡化、边缘检测（Sobel,Robert两种算子）、图像的Huffman编码。并计算图像熵，平均码长，编码效率及码树长度。附加可压缩与解压缩任意文件的功能和查看直方图的功能。但只能处理bmp格式的文件。-contain images of the median filtering, histogram equalization, edge detection (Sobel. Robert Two Operator), the image of Huffman codi
TRW_S-v1.1
- The two algorithms are max-product belief propagation (BP, Pearl 88) and sequential tree-reweighted max-product message passing (TRW-S, Kolmogorov 05)
Huffman
- 迄今为止见过的最方便的huffman编码，效率很高 一个外国人写的，很具有研究价值 Constructing a Huffman Tree according to the number of times each symbol appears in the data stream: 1) Create an array of N nodes, representing N possible symbols (ranging between 0 and N-1). 2) Set
基于DCT变换的图像编码方法研究
- 本文结合DCT变换的特性，利用分形的Peano一hilbert扫描曲线，对基于DCT变换的图像编码方法进行了研究，并提出了改进方法。主要工作分为两个部分: 一是在分块DCT基础上的改进。对分块后生成的各图像块矩阵，不直接作二维DCT变换，而是先进行扫描，使之重排成一维向量，再进行一维DCT变换，这样可以减少运算量。 其次是对层次余弦变换编码部分的改进。使用层次DCT变换与零树编码相结合的方法，并在扫描编码过程中，按Peano一hilbert扫描顺序进行编码。这样不仅可以减少“块效应”，而且可以加
htmlib7_860
- HTM（Hierarchical Temporal Memory）技术是利用模拟大脑来实现识别的一种方法，nupic公司有开源实现，上面的htmlib包是另一种实现，适合VC++开发，容易集成-Hierarchical Temporal Memory: What s In a Name? The name was chosen for a reason: Hierarchical-- HTMs are organized as a tree-shaped hierarchy of
dtcwt_toolbox4_3
- One of the advantages of the dual-tree complex wavelet transform is that it can be used to implement 2D wavelet transforms that are more selective with respect to orientation than is the separable 2D DWT. There are two versions of the 2D dual-tr
ImageSegmentation
- 用MFC编写的图像分割处理程序，采用了FCM和最小生成树两种方法来对图像进行分割-MFC prepared with the process of image segmentation using the FCM and the minimum spanning tree in two ways to partition images
25856223liangzhongbianlishu
- 图像遍历树...两种方法实现，实用，方便，里面包含说明文件，以及方法描述-Image ... two ways to traverse the tree implementation, practical, convenient, which contains documentation, as well as the method of descr iption and so on
A_Spatial_Index_to_Improve_the_Response_Speed_of_W
- 多尺度特性是指地图比例尺决定着地图显示内容的详略.基于R-tree的数据访问方法与多尺度性和成批性不相适应,存在“同级要素弱簇聚”和“I/O粒度偏小”两大问题- The access method based on R-tree is not adaptive to the multiscale and batch feature. It has two problems: (1) the data records of features of the same level are not cl
GenFraTree
- 包含二维分形树实现算法的一个程序，希望对毕业设计做这个方向研究的同学有所帮助-Contains two-dimensional fractal tree algorithm of a program, would like to do graduate design studies in this direction will help students
NNclust
- Neural Network Based Clustering using Self Organizing Map (SOM) in Excel Here is a small tool in Excel using which you can find clusters in your data set. The tool uses Self Organizing Maps (SOM) - originally proposed by T.Kohonen as the metho
tree
- 分形树摇曳的动画实现，通过设置双缓冲区，解决绘制和输出速度不匹配的问题-Animated fractal tree swaying achieved by setting the two-buffer, rendering and output speed to solve the problem does not match the
ff
- 对偶复树小波以及去噪， 包含1维二维三维的程序实现-Dual tree complex wavelet and the noise, including the one-dimensional two-dimensional three-dimensional program -The dual tree complex wavelet and denoising, including 1-dimensional 2D and 3D programs to achieve-Dual tree c
The-complex-3D-dual-tree-DWT
- 复杂的3 d双树离散小波变换(DWT)同样也引起了小波的两倍作为真正的3 d双树离散小波变换(DWT)。这两个小波在每一个方向,可以解释为真实的和虚构的部分一个复数的3 d小波。复杂的3 d双树被实现为八严格采样可分3 d DWTs操作在并行。然而,不同的过滤器集用于每个三个维度。 -3 d complex- Doubletree discrete wavelet transform (DWT) also caused the wavelet twice as a real 3 d Doub