visual_ddk_drv

Description of the file: template matching source of Chamfer matching algorithm. It s OpenCV implementation

关于算法设计最经典的教材，非常值得阅读，对一些较经典的算法都进行了详细的介绍(On the algorithm design and classic materials, well worth reading, for some of the more classical algorithms have carried out a detailed introduction)

可以对数量少、残缺、不完整的数据进行预测，如人口、缺水量等。也可以对灾害发生时间进行预测。(Can be a small number, mutilated, incomplete data to predict, such as population, water shortage and so on. You can also predict the time of occurrence of the disaster.)

悬置功能计算的，能量解耦的方法，优化及其位移的计算(The calculation of suspended function, energy decoupling method, optimization and calculation of displacement)

windows gui wrapper for fb

VisualC++和MATLAB接口应用(VisualC++ and MATLAB Interface Application)

svm分类器,实现线性svm分类，可以在matlab中或是vc++中编译运行，首先要进行编译(svm linear classifier)

盲源分离的的简单易用 适合初学者你们慢慢学习下我只能帮你到这了(signal separation snr matlab code)

递归法求解整数划分。 整数划分，是指把一个正整数n写成如下形式： n=m1+m2+…+mi （其中mi为正整数，并且1 <= mi <= n），则{m1,m2,...,mi}为n的一个划分。 如果{m1,m2,...,mi}中的最大值不超过m，即max(m1,m2,...,mi)<=m，则称它属于n的一个m划分。这里我们记n的m划分的个数为f(n,m) (Recursive method integer division. Integer division, refers to a positive integer n written as follows: n = m1+m2+ ...+mi (where mi is a positive integer, and 1 < = mi < = n), then {m1, m2, ..., mi} is a division of n. If {m1, m2, ..., mi} does not exceed the maximum value of m, i.e., max (m1, m2, ..., mi) < = m, m n is said that it belongs to a division. Where m is the number of division n our mind is f (n, m) )

automatic number plate using C