AN008_SurfaceFittingWithDMIFs

基于模糊自动控制的分形滤波算法。通过计算分形维数选定滤波器实现自适应滤波去噪。(Automatic control based on fuzzy fractal filtering algorithm. By calculating the fractal dimension ， select adaptive filter to achieve de-noising .)

遗传算法工具箱 // 蛮好使得 (genetic algorithm toolbox// makes very good)

程序可以用于支持向量机分类算法，只有源代码，使用时需要改进(Program can be used to support vector machine (SVM) classification algorithm, only the source code, when using, need to improve)

给定一个三次方程,用改进的Newton法求解,并研究各种算法的收敛阶数.(Given a cubic equation, using the improved Newton method and to study the convergence of various algorithms order.)

说明：  通带截止频率 =2 4k rad/s，阻带截止频率 =2 8k rad/s，通带波纹系数 =0.3dB, 阻带波纹系数 =50dB,采样频率fs=20000Hz。(The digital filter are the digital signal processing important content, the digital filter may divide into IIR and the FIR two main kinds. As for the IIR digital filter design, we need the help of analog prototype filter, and then transform analog filter into digital filter.)

用vs2013写的霍夫曼编码程序，可将.txt中的英文字符串（包括各种字符如：逗号）编码后输出到一个.txt中，并且可输出构建的霍夫曼树,保存编码方式。(Huffman coding using vs2013 to write programs in English can be txt string (including a variety of characters such as: the comma). Encoded output to a txt, and can output to build Huffman tree, save the encoding. .)

模糊系统的simulink仿真，控制一阶和二阶系统(Simulink fuzzy system simulation, control first-order and second-order system)

三维重建技术的研究是计算机视觉学科的一个重要领域，而双目视觉则是三维重建中的一项重要技术，它利用左右摄像机拍摄出的立体图像对，依据其中包含的几何关系将场景的三维信息重构出来。(Three-dimensional reconstruction of the research is an important subject of computer vision field, while binocular vision is three-dimensional reconstruction of an important technology, which uses about a three-dimensional camera image pair, Yi Ju contains the three-dimensional geometry of the scene Reconstruction of information out.)

matlab工具箱的理论与应用，对于刚接触matlab的朋友来说是很有用的(matlab toolbox of theoretical and applied, for friends刚接触matlab is very useful)

- K means algorithm is performed with different initial centroids in order to get the best clustering. - The total cost is calculated by summing the distance of each point to its cluster centre and then summing over all the clusters.Based on the minimum overall cost achieved during each iteration of iterKMeans the pixel assignment to their respective clusters are made and final compressed image is obtained. This algorithm will run slower as the number of clusters , size of the image and number of iterations increase.