package_emd

说明：  MATLAB的一些例子，PPT格式，方便易懂(MATLAB some examples PPT format to facilitate easy)

多尺度几何分析contourlet工具，包括去噪演示(Contourlet geometric analysis tools, including Noise Demo)

Queuing theory it is a simulation for M/M/1 queue and find its state probabilites in steady state for n=5 and find expected delay time

采用Hopfield网络解决旅行商问题，收敛速度快。(using Hopfield network to solve the traveling salesman problem, and fast convergence.)

说明：  zernike矩的Matlab实现，可以计算任意阶矩(Matlab implementation zernike moments, moments of any order can be calculated)

该上传为数字图像处理实验资料，包括实验原理和实验程序，有四个实验：图像的显示和视觉特性，图像的变换与量化实验，图像压缩综合实验，图像增强实验。可供朋友们学习数字图像处理方面参考。(The uploading of digital image processing experimental data, including the experimental principle and the experimental procedure, there are four experiments: an image display and visual characteristics, image transform and quantization experiments, a comprehensive experimental image compression, image enhancement experiments. For friends to learn digital image processing reference.)

这是用复化simpson方法求解数值积分的一种方法(This is the method used to solve complex numerical integration of the simpson' s method)

Canny edge detector algorithm matlab codes This part gives the algorithm of Canny edge detector. The outputs are six subfigures shown in the same figure: • Subfigure 1: The initial "lena" • Subfigure 2: Edge detection along X-axis direction • Subfigure 3: Edge detection along Y-axis direction • Subfigure 4: The Norm of the image gradient • Subfigure 5: The Norm of the gradient after thresholding • Subfigure 6: The edges detected by thinning

matlab GUI 练习之作，用以演示矩形窗及其频谱的图形，通过改变参数，及时显示二者之间的关系。(The MATLAB GUI exercises to make, to demo rectangular window spectrum graphics, by changing the parameters, the relationship between the two in a timely manner.)

如果G的边集E(G)中有个子集M，满足M中的任何两条边 都不邻接，则M就是图G的一个匹配。包含边数最多的匹配 称为最大匹配，最大匹配所包含的边数称为最大匹配数。当 G是二分图时，问题就比较特殊了，这就是我们要解决 的问题——最大二分匹配。(If there is a subset M in the edge set E (G) of G, if any two edges in M are not adjacent, then M is a match of graph G. The match with the largest number of edges is called the maximum matching, and the number of edges contained in the maximum matching is called the maximum matching number. When G is a two point graph, the problem is very special. This is the problem we want to solve -- the biggest two points matching.)