nurb_code

本压缩文件中，含有3个图像增强的Matlab程序，包括用小波方法及非小波实现图像的增强(The compressed file, containing three of the Matlab image enhancement procedures, including the use of wavelet methods and non-wavelet image enhancement)

dc motor model in simulink

通过介绍判断分析的相关内容，提供了相关的算法，很好，很全面(By introducing the judgments of the relevant content, providing the relevant algorithm, very good, very comprehensive)

说明：  该程序使用系统对象来说明使用光流估计的方法在视频序列中检测并跟踪车辆。(This demo uses System objects to illustrate how to detect and track cars in a video sequence using optical flow estimation. )

matlab 5-32译码器 实现五个通道选择的期间编码(matlab 5-32 Decoder selected during the five-channel coding)

关于有限元分析网格化分的程序，一般用于有限元分析的前处理阶段。(On sub-grid finite element analysis program, generally used for finite element analysis of pre-processing stage.)

散列算法，用于生成原始消息的数字指纹，本算发基于MATLAB编写，本算法包含多种流行的散列算法，包括SHA1和SHA-256等广泛应用的散列算法，通过本程序，可以对几种广泛应用的散列算法进行调用(Hash algorithm used to generate the digital fingerprint of the original message, this is based on MATLAB, this algorithm contains a variety of popular hash algorithm, including SHA1 and SHA- 256 hash algorithm is widely used, through this program, several widely used hash algorithms can be invoked)

实现聚类K均值算法： K均值算法：给定类的个数K，将n个对象分到K个类中去，使得类内对象之间的相似性最大，而类之间的相似性最小。 缺点：产生类的大小相差不会很大，对于脏数据很敏感。 改进的算法：k—medoids 方法。这儿选取一个对象叫做mediod来代替上面的中心 的作用，这样的一个medoid就标识了这个类。步骤： 1，任意选取K个对象作为medoids（O1,O2,…Oi…Ok）。 以下是循环的： 2，将余下的对象分到各个类中去（根据与medoid最相近的原则）； 3，对于每个类（Oi）中，顺序选取一个Or，计算用Or代替Oi后的消耗—E（Or）。选择E最小的那个Or来代替Oi。这样K个medoids就改变了，下面就再转到2。 4，这样循环直到K个medoids固定下来。 这种算法对于脏数据和异常数据不敏感，但计算量显然要比K均值要大，一般只适合小数据量。(achieving K-mean clustering algorithms : K-means algorithm : given the number of Class K, n will be assigned to target K to 000 category, making target category of the similarity between the largest category of the similarity between the smallest. Disadvantages : class size have no great difference for dirty data is very sensitive. Improved algorithms : k-medoids methods. Here a selection of objects called mediod to replace the center of the above, the logo on a medoid this category. Steps : 1, arbitrary selection of objects as K medoids (O1, O2, Ok ... ... Oi). Following is a cycle : 2, the remaining targets assigned to each category (in accordance with the closest medoid principle); 3, for each category (Oi), the order of selection of a Or, calculated Oi Or replace the consumption-E (Or))

TDOA的代码，对无线定位具有一定的好处(TDOA code, has certain advantages for wireless location)

采用口面积分的方法来计算天线方向图，天线设计常用(Orifice area divided by the method to calculate the antenna pattern, antenna design used)