搜索资源列表
DigImgsequent
- 程序可以很好的实现在原图的基础之上挖出下图和用来进行匹配的模板-procedures can be very good at achieving maximum dug up the foundation under the plan and used for the template matching
pipei
- 图像匹配的的原图和目标图片，很实用的，欢迎下寨-image matching the maximum and objectives of the pictures, very practical and welcome Xiaqian
stereo-maximum-flow-upload
- 关于一篇经典的立体匹配的文献的源代码。该文献的主要算法称为maximum flow。程序的使用说明在文件夹中。-on a stereo matching classic literature source. The document known as the maximum flow algorithm. Procedures for use in the folder.
hisense
- 程序的主要思想是先对数组进行处理，使其有序，处理后的结果存放在t1.txt文件中。。然后在此基础上建立索引，使在查字典时可以减少比较的次数，节省程序的时间。再利用最大匹配算法对程序进行分词，分词的结果保存在t2.txt文件中。然后再拿分好词的文件与libing_test文件进行比较匹配率，匹配结果存放在result.txt文件中。-procedures main idea is first to array processing, it orderly, After processing the
2202341311301152
- 在灰度变换里涉及到灰度变换处理，窗口变换处理，分段线性变换处理，灰度分析均衡化处理，灰度匹配处理；投影法中涉及到水平投影和纯直投影；直方图显示中涉及到原图直方图，变换后直方图，及其R、G、B直方图统计等，是入门的不错的选择，值得-in gray transform Lane involving gray transform, the window transform, piecewise linear transformation, Analysis of gray balance, match
imageindex
- 图像匹配的的原图和目标图片，很实用的，欢迎下寨-image matching the maximum and objectives of the pictures, very practical and welcome Xiaqian
hgr
- 求二分图最大匹配 匈牙利算法-Seeking the maximum bipartite graph matching for bipartite graph maximum matching algorithm Hungary
Maximum.matching.algorithm.in.general.graph.o(n^3
- A matching on a graph is a set of edges, no two of which share a vertex.
MaximumMatching
- 利用最大匹配法进行分词。需要一个词典。就可以进行分词。性能很好-Carried out using the maximum matching word segmentation. Need a dictionary. Segmentation can be carried out. Good performance
The_flow_and_the_maximal_matching1
- 关于最大流问题，与最大匹配的讲解。内容比较浅显易懂。-On the maximum flow problem, with the largest matching explained. The study were easy to understand.
hungary
- 求最大匹配 匈牙利算法 输入二分图 输出最大匹配-Hungary, seeking maximum matching algorithm input bipartite graph maximum matching output
General-graph-matching
- ACM竞赛中 一般图的最大匹配 带花树-ACM contest the general graph maximum matching with trees and flowers. . . .
SF
- 中文分词在中文信息处理中是最最基础的，无论机器翻译亦或信息检索还是其他相关应用，如果涉及中文，都离不开中文分词，因此中文分词具有极高的地位。中文分词入门最简单应该是最大匹配法-Chinese word segmentation in Chinese information processing is the most basic, whether in machine translation Yihuo information retrieval, or other related applic
Bipartite-graph-matching-problem)
- 关于二分图中一些定义，定理及如何求解最大流的问题-Bipartite graph on some definitions, theorems and how to solve the problem of maximum flow
QingXiHua
- 该算法是关于图像清晰化的算法，里边包含了光流法，块匹配，凸集投影和最大后验概率等，是很好的参考东西。-The algorithm is an algorithm for image clarity, inside includes optical flow, block matching, convex set projection and maximum a posteriori probability, is a good reference for things.
Algorithm-template
- C++ 写的一些算法模板 ，比如Kruskal、KMP、欧几里德算法、最大匹配(匈牙利算法)、最小费用最大流、字符串的哈希方法、增广路算法、网络最大流_邻接表等-C++ write some algorithms template, such as Kruskal, KMP, Euclid arithmetic, maximal matching (Hungary) is proposed, the minimum cost and maximum flow, string hash metho
Template-matching
- 模板匹配主要是采用基于灰度信息的匹配算法，其中是统计模板与原图像的相关系数，得到最大值的地方，就是相似度最大的地方，也就是成功地找到了匹配的像素点。具体的算法如下。其中，im_matched为原图像，im_template为模板图像。MaxR为最大相似度系数。-Template matching matching algorithm based on gray-scale information, which is the the statistical template with the co
image-matching
- 图像匹配是指通过一定的匹配算法在两幅或多幅图像之间识别同名点，如二维图像匹配中通过比较目标区和搜索区中相同大小的窗口的相关系数，取搜索区中相关系数最大所对应的窗口中心点作为同名点。其实质是在基元相似性的条件下，运用匹配准则的最佳搜索问题。-Image matching means through a certain matching algorithm identification between two or more images corresponding points, such as
AnyMap_Match
- 任意图的最大匹配算法，值得一学。毕竟各位不是只要会会匈牙利算法的那种人吧？-arbitrary map of the maximum matching algorithm, it is worth a study. After all, you would not say that the kind of Hungary algorithm people? Ha ha
stereo-matching
- 对灰度图像进行立体匹配，在图像的最大视差范围内进行搜索-To stereo matching of gray image, the image of the maximum parallax within the scope of the search