particle_filter_resumpling

matlab与C++混合编程，写的很详细，与各位分享(matlab and C++ mixed programming, written in great detail, to share with you)

matlab的二值化代码,将一副路面的图形中的边界线,显示出来(matlab' s binary code, a road graph of the boundary line, displayed)

说明：  约瑟夫问题的实现：设有n个人围坐在圆桌周围，现从某个位置m（1≤m≤n）上的人开始报数，报数到k的人就站出来。下一个人，即原来的第k+1个位置上的人，又从1开始报数，再报数到k的人站出来。依此重复下去，直到全部的人都站出来为止。试设计一个程序求出出列序列。(Joseph realized the problem: There are n people sitting around the round table, is from a position of m (1 ≤ m ≤ n) reported on the number of people began to be reported to the k number of people to come forward. The next person, that is, the original positions on the first k+1 people, and from the number reported at 1, then the number reported to the k to stand up. So repeat this until all the others can stand up. Try to design a program derived from the column sequence.)

Matlab教程,希望能对大家有用^_^(Matlab Guide, we hope that the useful ^ _ ^)

这些文档里包含了大量MATLAB GUI的实例和方法对GUI图形界面编程很有帮助(These documents contain MATLAB GUI examples and methods to help the GUI graphical interface programming)

程序实现了naive bayes classifier， 并附有对美国参议院根据投票情况来判断议员属于民主党还是共和党的例子。(Program achieved a naive bayes classifier, along with the U.S. Senate voting to determine under Democrat and Republican members belonging examples.)

Pan-Tompkins algorithm in Matlab for ECG signal analysis.

利用最速下降法计算最小曲面的面积，初始条件为0，边界条件为正方形固定边界。(Using steepest descent method to calculate the minimum surface area. Initial condition is 0, while boundary condition is square fixed values.)

实现了Gardner算法的仿真，可以直观的分析其实现同步的过程(Realize the simulation of Gardner algorithm ,and the process of synchronization can be analyzed intuitively.)

说明：  图论算法及其MATLAB 程序代码 1.求赋权图G = (V, E , F )中任意两点间的最短路的Warshall-Floyd 算法、Kruskal 避圈法 2.求二部图G 的最大匹配的算法(匈牙利算法)、利用可行点标记求最佳匹配的算法 3.从一个可行流f 开始, 求最大流的Ford--Fulkerson 标号算法 6.(Graph Theory Algorithm and MATLAB program code 1. Seeking weighted graph G = (V, E, F) in the shortest path between any two points of the Warshall-Floyd algorithm, Kruskal avoid the circle method 2. Seeking the maximum bipartite graph G matching algorithm (the Hungarian algorithm), using feasible point mark seeking the best match algorithm 3. a feasible flow f from the beginning, find the maximum flow of the Ford- Fulkerson Labeling Algorithm 6.)