mixing-matrix-estimate

摘要 本文提出了一种新的基于极大似然法的椒盐噪声滤波算法。在传统BP 算法中引入 了极大似然估计，在训练样本时能够在考虑网络逼近行为的同时对噪声分布进行估计。而且 针对椒盐噪声模型构造了新的鲁棒误差函数，从而使算法本身的抗干扰性增强。实验结果表 明了该算法与传统BP 算法相比具有更好的滤波性能。(Abstract This paper presents a new maximum likelihood method based on impulse noise filter. In the traditional BP algorithm, the introduction of the maximum likelihood estimation, the training samples can also be considered acts of the network approach to estimate the noise distribution. Salt and pepper noise and model construction for a new robust error function, so that the enhanced anti-jamming algorithm itself. Experimental results show that the algorithm compared with the traditional BP algorithm has better filtering performance.)

The basic snake segmentation (2d and 3d). A snake is an active (moving) contour, in which the points are attracted by edges and other boundaries. To keep the contour smooth, an membrame and thin plate energy is used as regularization.

这是香农编码的实验，里面是用matlab编写的(This is the Shannon coding experiment, which is written in matlab)

SIFT algorithm for matching the points in images

这是一种改进的粒子群优化算法，通过简单的测试函数验证(This is an improved particle swarm optimization, through a simple test function verification)

说明粒子滤波器的功能，给了5个例题和他的源代码。(Explain the function of particle filter)

MATLAB结构数据的有关资料，该资料为本人网络收集，如有争议，请告知(materials of MATLAB structural data , the material that I collect from the internet, if disputed, please inform me)

有m台不同的机器，n个不同的工件。每个工件有多道工序，每道工序由指定的机器在固定的时间内完成。一道工序一旦开始处理，就不能中断。每台机器一次只能处理一道工序。一个调度就是决定每台机器上工序的处理顺序，使得机器完成所有工件的时间最短。具体的，该问题就是要求在满足（1）、（2）两个约束条件的前提下，确定每台机器上工序的顺序，使加工的时间跨度（从开始加工到全部工件都加工完所需要的时间）达到最小。其中，（1）表示工件约束条件：对每个工件而言，机器对它的加工路线是事先确定的；（2）表示机器约束条件：对每台机器而言，一次只能对一道工序进行加工。()

自己做的感应电机无速度传感器直接转矩控制仿真模型，特拿来分享，还望大家多多指教。(sensorless direct torque control for induction motor)

Muestreo de se帽ales en matlab