53

基于字符轮廓与形态学处理的车牌定位算法，做图像处理及车牌定位的朋友可以看一下，本文毕业设计部分(Character-based profile and the morphological processing of license plate location algorithm to do image processing and license plate location of friends can look at this part of graduation)

Dijkstra routing algorithm example

指纹识别源代码，用matlab编程实现的指纹识别源代码，简单易懂，非常实用(Using Guide:matlab 6.5 version (or over version) + image proceesing tools The 1st step, change the files directory as the matlab current directory The 2nd step, in the "command" window, input "GUI", then "Enter" The 3rd step, GUI will be shown. )

本文在阐述聚类分析方法的基础上重点研究FCM聚类算法。FCM算法是一种基于划分的聚类算法，它的思想是使得被划分到同一簇的对象之间相似度最大，而不同簇之间的相似度最小。最后基于MATLAB实现了对图像信息的聚类。( This paper describes the basis of cluster analysis methods and focus on the FCM clustering algorithm. FCM algorithm is a clustering algorithm based on division and the idea is to make it to the same cluster is divided into the biggest similarity between the objects, while the minimum similarity between different clusters. Finally, I realize the implementation of image information of the cluster based on MATLAB.)

matlab教材附带的代码 可以运行.关于通信方面的仿真。(the matlab code about communitinication)

台湾人写的GFSK调制和解调，非常清晰，便于学习(Taiwanese write GFSK modulation and demodulation, very clear, easy to learn)

说明：  《matlab仿真技术与应用》综合实验.pdf。《matlab仿真技术与应用》综合实验.pdf(&quot Matlab simulation technology and application of&quot integrated experiment. Pdf)

find out minimum spanning tree

金融的matlab的工具入门书籍，包括期权定价公式的matlab使用！(An introduction to matlab of finance,with the operation of Black-scholes option pricing model！)

说明：  :针对遗传算法易陷入局部最优的不足,在标准遗传算法基础上加入了三个新的操作- 复原、重构和录优操作,使改 进后的遗传算法收敛于全局最优,并在此基础上以路边约束、动态避障和路径最短作为适应度函数,提出了动态避障的路径 规划方法。通过实验仿真验证了算法的有效性、准确性和实时性,并与基于以往的遗传算法的路径规划方法进行比较,结果 表明本文提出的方法在产生的路径长度和算法运行时间上都具有更优的性能。(: Genetic algorithm for the lack of easy to fall into local optimum, in the standard genetic algorithm based on the insertion of three new operations- rehabilitation, reconstruction, and excellent operational record, so that the improved genetic algorithm converges to the global optimum, and in this by the roadside on the basis of constraints, dynamic obstacle avoidance and the shortest path as the fitness function is proposed dynamic obstacle avoidance path planning method. Simulation results through experiments the effectiveness of the algorithm, accuracy and real-time, and with previous genetic algorithm based path planning method to compare the results show that the method proposed in the resulting path length and algorithms have a running time better performance.)