全部的稀疏压缩感知算法程序

说明：   使用二分法对样本集进行剪辑，剪辑法的思想，就是将样本集分成训练集与考试集， 利用训练集样本对考试集的样本进行分类（使用近邻法），如果考试集中某个样本分类错误的话，将这个样本删除。在该函数中，使用最近邻法，只进行一次剪辑（遍历完考试集中的样本以后退出）。还有一种重复剪辑法（适用于样本比较多的情况），把样本随机分为多个样本集，将相邻的两个样本前一个作为考试集，后一个作为训练集，调用二分剪辑。所有的样本子集剪辑完毕以后，在递归调用，直到没有样本被剪辑掉,没得讲，重复剪辑的效果肯定好一些。 (The sample sets using the dichotomy of the clips, editing law idea is to sample set into training set and test set, using the training set samples to the test set of samples (using the nearest neighbor algorithm), if the examination focused on a sample of classification error then delete this sample. In the function, use the nearest neighbor method, only once clips (focused on a sample of traversal finished after the exit exam). There is also a repeat clip method (samples are more applicable to the case), the samples were randomly divided into multiple sample set, the two adjacent samples of the former one as a test set, the latter one as a training set, call the two sub-clips. All the samples were a subset of the clips after they have finished, in the recursive call, until there are no samples were clip out, did not have to say that the effect of repeated clips definitely better.)

dds 用simulink模块在matlab中的仿真(dds simulink simulation)

ecg signal compression sampling using mat ecg file in matlab

Generador de señ ales Seno y Coseno

说明：  该代码通过匹配滤波的方法对FMCW信号进行距离压缩(Distance compression by matched filtering)

蒙特卡罗算法,本人做毕业设计时用的! 有兴趣的可以交流!(Monte Carlo algorithm, I graduated to do the design used! Are interested in the exchange!)

光纤光栅法布里—珀罗腔（FBG F-P）的matlab仿真程序。利用光纤光栅的矩阵传输特性。(Fiber Bragg Grating Fabry- Perot cavity (FBG FP) of matlab simulation program. Optical fiber grating transmission characteristics of the matrix.)

基于matlab开发的通用有限元软件的源程序部分，最新版本(Matlab-based general-purpose finite element software development source part, the latest version)

实现matlab 界面的人脸检测算法，通过点击人眼中心，实现识别(Achieve matlab interface face detection algorithm, by clicking on the center of the human eye to achieve recognition)

用matlab去实现基于dijkstra算法实现最小生成树(Using matlab to dijkstra algorithm based on minimum spanning tree)