grasp-data-from-figure

需要进行特征分解的MUSIC法的计算了很大，通过改进，不需要特征分解就可以测向。(Necessary characteristic decomposition of MUSIC method of calculating a lot, through the improved features of decomposition can be measured without the.)

The get of an animal are the offspring of a particular individual male animal. It is derived from the term "begat," meaning to father children. The term is frequently used in horse breeding to describe the offspring of a stallion.

matlab实现Preisach模型，画出Everett函数以及Preisach平面(- approximate measured hysteresis loops - simulate arbitrary minor hysteresis loops - plot the Preisach function, the Everett function, the reversible component)

R3LS的matlab程序，最小二乘法的递推算法(R3LS the matlab program, recursive least squares algorithm)

基于MATLAB环境下的运用迭代法求解线性方程组的对应的代码 简单易学 便于初学者消化使用(Based on MATLAB environment using iterative method for solving linear equations corresponding code is easy to learn for beginners to use digest)

The matlab source code about SIFT algorithm with Accurate Key locations.

Matlab编写的一个翼型分析软件，且包含了大量常见的翼型数据(An airfoil analysis software written in Matlab, and contains a large number of common airfoil data)

ami码的波形及功率谱仿真，直接下载就可以运行。(ami code waveform and power spectrum simulation, direct download to run.)

首先从n个数据对象任意选择 k 个对象作为初始聚类中心；而对于所剩下其它对象，则根据它们与这些聚类中心的相似度（距离），分别将它们分配给与其最相似的（聚类中心所代表的）聚类；然后再计算每个所获新聚类的聚类中心（该聚类中所有对象的均值）；不断重复这一过程直到标准测度函数开始收敛为止。一般都采用均方差作为标准测度函数. k个聚类具有以下特点：各聚类本身尽可能的紧凑，而各聚类之间尽可能的分开。(First, a data object from the n choose k objects as initial cluster centers and for the rest of the other objects, according to their similarity with the cluster center (distance), respectively, assign them to their most similar (represented by cluster center) clustering then calculated for each cluster center received a new clustering (all objects in the cluster mean) repeats this process until the convergence criteria begin until the measure function. Standard deviation is generally used as a standard measure function. K a cluster has the following characteristics: the cluster itself as a compact, but separated as much as possible between each cluster.)

This is a simple a gorithm for fingerprint image thinning. The image should be of good quality and binarized prior to the thinning. The thinning process is by using morphological mathematics.