Impulse_Response

根据16点DFT算法得出的运算流程图，得到的16点DFT蝶形运算函数(16 point s DFT algorithm)

NCUT切割，对源码进行了改进，改进后取消了只能压缩到160*160才能切割的限制(NCUT cutting, source code improvements, improved to cancel restrictions can only be compressed to 160* 160 to cut)

《OpenCV基础教程》于仕琪主编，书中所有源代码下载，基于OpenCV的图像处理技术(" OpenCV-based tutorial," in Shi Qi editor of the book to download all the source code, based on OpenCV image processing technology)

说明：  C#+EmguCV机器视觉开发平台，功能：基本的图像处理工具、随意配置执行流程、二维码识别、文字识别等等。(C+EmguCV machine vision development platform, functions: basic image processing tools, arbitrary configuration of the execution process, two-dimensional code recognition, character recognition and so on.)

能够将图像坐标转化为世界坐标，根据图像像素修改参数(Can transform image coordinates into world coordinates, and modify parameters according to image pixels.)

说明：  相机是将三维世界坐标系中的坐标点映射到二维图像平面的过程能够用一个几何过程描述，最简单模型称为针孔模型。 因为相机镜头透镜的存在，使得光线投影到成像平面过程中产生了畸变。(Camera is the process of mapping coordinate points in three-dimensional world coordinate system to two-dimensional image plane, which can be described by a geometric process. The simplest model is called pinhole model. Because of the existence of camera lens, the light rays are distorted when they are projected onto the image plane.)

1、对观测数据进行中心化，； 2、使它的均值为0，对数据进行白化—>Z； 3、选择需要估计的分量的个数m，设置迭代次数p<-1 4、选择一个初始权矢量（随机的W，使其维数为Z的行向量个数）； 5、利用迭代W(i,p)=mean(z(i,:).*(tanh((temp) *z)))-(mean(1-(tanh((temp)) *z).^2)).*temp(i,1)来学习W （这个公式是用来逼近负熵的） 6、用对称正交法处理下W 7、归一化W(:,p)=W(:,p)/norm(W(:,p)) 8、若W不收敛，返回第5步 9、令p=p+1，若p小于等于m,返回第4步 剩下的应该都能看懂了 基本就是基于负熵最大的快速独立分量分析算法(1, on the center of the observation data, 2, making a mean of 0, the data to whitening-> Z 3, select the number of components to be estimated m, setting the number of iterations p < -1 4, select an initial weight vector (random W, so that the Z dimension of the row vectors of numbers) 5, the use of iteration W (i, p) = mean (z (i, :).* (tanh ((temp) ' * z)))- (mean (1- (tanh ((temp)) ' * z). ^ 2)).* temp (i, 1) to learn W (This formula is used to approximate the negative entropy) 6 with symmetric orthogonal treatments W 7, normalized W (:, p) = W (:, p)/norm (W (:, p)) 8, if W does not converge, return to step 5 9 , so that p = p+1, if p less than or equal m, return to step 4 should be able to read the rest of the basic is based on negative entropy of the largest fast independent component analysis algorithm)

说明：  计算两个离散变量x和y的联合熵z = H（x，y）。 输入：x，y：两个相同长度的整数向量输出：z：联合熵 可以使用，有利于学习目的(Compute joint entropy z=H(x,y) of two discrete variables x and y. Input: of x, y: two integer vector of the same length Output: z: joint entropy good for learning purposes)

FCM源代码，专门用于图像分割的，速度很快(FCM source code, specifically for image segmentation, very fast)

图像的平滑函数，对指定区域的图像，并有门限值和魔板大小限制。(the smooth of a bmp image)