AttDet

图像增强实验:图像一致性增强滤波器,基于一种各向异性的扩散过程，它首先能够去除图像的噪声，然后在此基础上增强图像纹理的一致性。matlab实现含报告 (image enhance)

用matlab做方差分析的几个例程包括：单因素一元方差分析，双因素一元方差分析 非参数方差分析(ANOVA using matlab to do a few routines include: single-factor analysis of variance one yuan, two-factor analysis of variance one yuan non-parametric analysis of variance)

薄板样条图像变换方法，MATLAB程序，根据控制点变化平滑地变形图像，experiment.m为例子(Thin plate spline image transformation method, MATLAB program, based on the control points change smoothly deformed image, experiment.m for example)

本程序是针对左端铰支，右端固支的连续梁，并且其中的集中荷载是按作用点在单元中点计算。对于初学者可以做为参考。(This program is for the left end of the hinge support right end clamped continuous beam, and the concentrated load action point unit midpoint. Can be used as a reference for beginners.)

MATLAB Simulink Conference 2007 cd1

去除趋势的程序，将数据的均值去除，只留下瞬时变化量--matlab程序(detrending)

program on BAR TRANSMISSION,CROSS TRANSMISSION, FBG SPECTRUM

EMD 算法，消除信号趋势项，可以作为信号预处理的部分(Part of the EMD algorithm to eliminate the signal trend term, can serve as a signal preprocessing)

聚类算法，不是分类算法。分类算法是给一个数据，然后判断这个数据属于已分好的类中的具体哪一类。聚类算法是给一大堆原始数据，然后通过算法将其中具有相似特征的数据聚为一类。这里的k-means聚类，是事先给出原始数据所含的类数，然后将含有相似特征的数据聚为一个类中。所有资料中还是Andrew Ng介绍的明白。首先给出原始数据{x1,x2,...,xn}，这些数据没有被标记的。初始化k个随机数据u1,u2,...,uk。这些xn和uk都是向量。根据下面两个公式迭代就能求出最终所有的u,这些u就是最终所有类的中心位置。(Clustering algorithm, not a classification algorithm. Classification algorithm is to give a figure, and then determine the data belonging to a specific class of good which category. Clustering algorithm is to give a lot of raw data, and then through the algorithm which has similar characteristics data together as a class. Here k-means clustering, is given in advance the number of classes contained in the raw data, then the data contain similar characteristics together as a class. All information presented in or Andrew Ng understand. Firstly, raw data {x1, x2, ..., xn}, the data is not labeled. K random initialization data u1, u2, ..., uk. These are the vectors xn and uk. According to the following two formulas can be obtained final iteration all u, u is the ultimate all these classes the center position.)

说明：  遗传算法计算最短路径问题，完成交换路径不同要求城市交换。(The genetic algorithm calculates the shortest path problem and completes the city exchange with different requirements of the exchange path.)