资源列表
xiaobohefft
- 小波变换和傅里叶变换的详细分析，对每一步都进行详细讲解，便于初学者理解，同时书中有源代码，便于实验。-Detailed analysis of the wavelet transform and Fourier transform, to explain in detail every step, easy for beginners to understand, while the book source code, easy to experiment.
CH11
- 重点分析信号在时域中为矩形脉冲具有sinc函数的特点，以此为基础，探讨小波和傅里叶之间的变换关系，既是小波与傅里叶分析基础,也是图像处理方面的资料-Key analytical signal in the time domain characteristic of a rectangular pulse having a sinc function as a basis to explore the relationship between wavelet and Fourier transfo
thueMorse_addonForBlender
- An implementation of the Thue Morse sequence, that is currently set up to act as a blender add-on. The add-on simply iterates through x y & z, and adds a cube whereever there is a 1 in the thue morse sequence. It can also be modified slightly (si
SAE
- 深度学习中的重叠自编码型深度学习网络工具箱，可直接输入数据运行。-deeplearning toolbox of SAE
HorseStack
- 本实验使用顺序栈实现驿站管理程序的编写。学会使用顺序栈存储马匹，并运用顺序栈的各种运输实现马匹的入站和出站管理.-In this study, using sequential write post stack implementation management program. Learn to use the sequence of stack storage horses, and the use of various transport stack order to achieve in
hftree
- 哈夫曼树 c++实现 哈夫曼树(Huffman Tree) 假设有n个权值{ W1，W2，…，W n }，试构造有n个叶子结点的二叉树，每个叶子结点拥有一个权值W ，则其中带权路径长度WPL 最小的二叉树，称为最优二叉树或哈夫曼树。-C++ Huffman tree Huffman tree (Huffman Tree) Suppose there are n weights {W1, W2, ..., W n}, the test structure has n leaf nodes of t
MinPath
- 最短路径的c++实现。从图中某顶点出发，沿图的边到达另一顶点所经过的路径中， 各边上权值之和最小的一条路径——最短路径：从某个源点到其余各顶点的最短路径。 -c++ shortest path implementation. A vertex the figure, the figure reaches the other side along the path through the vertex, each edge and the minimum weight of a path-
PrimTree
- 最小生成树的普里姆算法PrimTree；在一个连通网的所有生成树中，各边的权值之和最小的那棵生成树称为该连通网的最小代价生成树（Minimum Cost Spanning Tree），简称为最小生成树。 -Prim minimum spanning tree algorithm in all spanning a communication network, the weight of each side and a minimum spanning tree is called the
DWTForCompression
- This DWT project. It is useful for student researching in signal processing, compression and decompression data.-This is DWT project. It is useful for student researching in signal processing, compression and decompression data.
K-MEANS
- k-means聚类算法 用C++实现 聚类采用数据为二维数据 保存在当前目录下的data.txt文件中-K-means clustering algorithm C++ implementation
PCA
- PCA_emample1.m zz500为1200*500的矩阵 PCA主成分分析.doc为PCA的原理详解-PCA_emample1.m zz500 matrix PCA 1200* 500 Principal Component Analysis .doc to explain the principles of the PCA
ant
- 蚁群算法 解决TSP问题 程序对20个城市 数据进行计算 通过蚁群算法 计算最短路径 城市数据保存在当前目录下的 1173.txt 文件中-Ant colony algorithm to solve the TSP program for the calculation of 20 urban data through the ant colony algorithm to calculate the shortest path of urban data stored in the curre