gmsk

系统辨识源码，包含参数模型辨识算法程序和非参数模型辨识算法程序。(Source system identification, model identification algorithm contains parameters of procedures and non-parametric procedures for model identification algorithm.)

这是模糊C均值的matlab源程序，只要输入原始数据就可以按要求井陉分类~(This is the fuzzy C-means matlab source, as long as the original input data required Jingxing Category ~)

蚁群算法的matlab源码,对matlab初学者有一定帮助，对了解蚁群算法也有易处(Ant colony algorithm matlab source)

With this source you can use your Hantek oscilloscope with matlab.

This package contains a collection of classes and functions, which allow to comfortably work with medical images and meshes. It provides a intuitive and transparent way of dealing with spacing, origin, image orientation, etc. The package includes functions for input-output with common image formats (mhd, gipl) and mesh formats (vtk, stl), and basic (although not necessarily simple) image processing operations such as image resample, image reslice and image transform.

mmread.m是matlab官方网站上公布的一个函数，可以读取任意的视频格式。(mmread.m is published on the official website of matlab a function, can read any video format.)

实现聚类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))

方程求根的是抛物线法则，写的不好。仅供参考(Roots of the equation is parabolic law, badly written. Reference)

Jackknife距离的matlab实现，短小精悍，矩阵运算的小技巧。附有数据(Jackknife distance MATLAB, dapper, little skill matrix.Attached data)

说明：  music算法','capon算法','bartlett算法',对比(MUSIC algorithm ','capon algorithm','bartlett algorithm ', comparison)