Search - graph

Search - graph - List

【Data structs】 stream DL : 0: 网络流算法涉及：数据结构(图论)、算法、ACM 分类有最大流、最小费用最大流、最小割-Network flow algorithm involving: data structures (graph theory), algorithm, ACM classification has maximum flow, minimum cost maximum flow, minimum cut
Update : 2024-04-29 Size : 91136 Publisher : sql
【Special Effects】 Graph_Cut DL : 0: Graph Cutshi是最近在计算机视觉中研究和应用比较多的优化算法，典型的用于stereo matching, image restortion, texture synthesis等应用，以上代码给出了graph cut，mean shift, 以及相关的ppm/pgm图像借口，本来是用于stereo matching的，已经把相关的matching的实现代码给去掉了。大家可以以此为平台做一些相关的研究和应用。 -Graph Cutshi recently in computer vision research and application of a relatively large number of optimization algorithms, typical for the stereo matching, image restortion, texture synthesis applications, the above code gives the graph cut, mean shift, and the associated ppm/pgm images an excuse, it is used for stereo matching, and has been related to matching the code to realize removed. U.S. can also be used as a platform to do some related research and applications.
Update : 2024-04-29 Size : 4487168 Publisher : wang wei
【Special Effects】 ModifySpace DL : 0: 根据分块图像的均值与标准差将图像表示成三种状态：边缘态、平坦态、纹理态。然后计算状态关联图，提取出图像的空间特征。可用于图像检索。 -Under the sub-block images of the mean and standard deviation images express into three states: the edge of state, the flat state, texture state. And then calculating the state relation graph, extracted spatial features of images. Can be used for image retrieval.
Update : 2024-04-29 Size : 1024 Publisher : Owenli
【Special Effects】 An_Experimental_Comparison_of_maxflow_aigorithm.ra DL : 0: 是基于Graph cuts 的源程序，用来求解Min-Cut/Max-Flow.-Graph cuts based on the source code for solving Min-Cut/Max-Flow.
Update : 2024-04-29 Size : 108544 Publisher : 余丽红
【Special Effects】 maxflow_fast_approximate_energy_minimization_via_g DL : 0: 如何利用Graph cuts 快速逼近最小化能量。-How to use Graph cuts fast approaching the minimum energy.
Update : 2024-04-29 Size : 82944 Publisher : 余丽红
【Special Effects】 Phase_unrapping_using_Graph_cuts DL : 0: 用Graph cuts 来解决磁共振图像的 phase unwrapping。-Graph cuts used to solve the magnetic resonance images of the phase unwrapping.
Update : 2024-04-29 Size : 140288 Publisher : 余丽红
【Special Effects】 maxflow_fast2 DL : 0: Software for energy minimization with graph cuts。-Software for energy minimization with graph cuts.
Update : 2024-04-29 Size : 43008 Publisher : 余丽红
【matlab】 PUMAdemos DL : 0: ％％％ Demos for PUMA algorithms ％％％ We present four matlab demos for PUMA. demo1, demo2, demo3, and demo4 illustrate PUMA working with different parameters and with four different images. All you need to do is to run each of the demos. Please be sure that all the files are put on an accessible path for matlab. Notice that this code is intended for research purposes only. For further reference see "Phase Unwrapping via Graph Cuts, IEEE Transactions on Image Processing, 2007- Demos for PUMA algorithms We present four matlab demos for PUMA. Demo1, demo2, demo3, and demo4 illustrate PUMA working with different parameters and with four different images.All you need to do is to run each of the demos . Please be sure thatall the files are put on an accessible path for matlab.Notice that this code is intended for research purposes only.For further reference see
Update : 2024-04-29 Size : 56320 Publisher : 类坐困
【Special Effects】 NcutImage_8 DL : 0: 利用正规化图模型进行图像分割程序，NcutImage_8.zip-Graph model the use of regularization procedures for image segmentation, NcutImage_8.zip
Update : 2024-04-29 Size : 107520 Publisher : yan
【Graph program】 graph DL : 0: 用于图模型算法的一些简单程序graph.zip-Algorithm for the graph model of a few simple procedures graph.zip
Update : 2024-04-29 Size : 52224 Publisher : yan
【Special Effects】 effcientGraphBasedImageSegmentation DL : 0: An important article about Graph-based image segmentation,very useful for those who reseach in this field
Update : 2024-04-29 Size : 277504 Publisher : 姬宝金
【Graph program】 Graph-basedImageSegmentation DL : 0: A good material about Graph-based image segmentation,hope it is useful for those who need it
Update : 2024-04-29 Size : 5475328 Publisher : 姬宝金
【Documents】 match DL : 0: 详细介绍了二分图匹配，值得一看。尤其是搞大学生程序设计竞赛的，更值得一看。-Detailed information on bipartite graph matching, worth a visit. In particular, engage in Collegiate Programming Contest, and more worth a visit.
Update : 2024-04-29 Size : 173056 Publisher : 吴索铸
【AI-NN-PR】 ACO DL : 0: 蚁群优化算法是一种基于自然启发的metaheuristic算法,从其提出到现在历经10多年的发展到目前已经成为一种解决组合优化问题的有效工具。最大团问题是一个经典的NP难的组合优化问题,很多实际问题都可以抽象为对无向图上最大团问题的求解,所以,对最大团问题的研究无论在理论上还是实际上都有重要意义。 -Ant colony optimization algorithm is a metaheuristic based on natural-inspired algorithms, from their proposed up to now after 10 years of development to the present has become a kind of combinatorial optimization problems to solve an effective tool. Maximum Clique problem is a classic NP hard combinatorial optimization problem, a lot of practical problems can be abstracted as undirected graph of the largest corporations to solve the problem, therefore, the largest corporation on the issue of research both in theory and in fact have a major significance.
Update : 2024-04-29 Size : 236544 Publisher : wangliang
【Data structs】 tuzhaosewenti DL : 0: 图着色问题的回溯算法，图着色问题是一个NP-完全问题.-Graph Coloring Problem of backtracking algorithms, graph coloring problem is an NP-complete problem.
Update : 2024-04-29 Size : 1024 Publisher : 张金水
【Special Effects】 texturize_gimp_plugin_version_1.0 DL : 0: implement paper Graphcut Textures: Image and Video Synthesis Using Graph Cuts 利用graphcut算法进行纹理合成-implement paperGraphcut Textures: Image and Video Synthesis Using Graph Cuts algorithm using texture synthesis graphcut
Update : 2024-04-29 Size : 316416 Publisher : changfeng
【Special Effects】 GrabCutSource DL : 0: 最经典之做，保证别人没有上传过实现文章 “GrabCut" Interactive Foreground Extraction using Iterated Graph Cuts 用graphcut实现图像分割，效果非常好-The most classic to do to ensure that other people do not realize uploaded article GrabCut Interactive Foreground Extraction using Iterated Graph Cuts with graphcut realize image segmentation, has very good results
Update : 2024-04-29 Size : 1389568 Publisher : changfeng
【AI-NN-PR】 Dominantset DL : 1: 一种较新的聚类算法 Dominant-set 的代码，包括聚类算法的代码和测试代码。该算法最大特点就是基于图理论的，相对于Normalized Cut,计算复杂度低很多，况且能自动决定类的个数 -A relatively new clustering algorithm Dominant-set the code, including the clustering algorithm code and test code. Most prominent feature of the algorithm is based on graph theory, and compared with the Normalized Cut, much lower computational complexity, decision Moreover automatically the number of categories
Update : 2024-04-29 Size : 3072 Publisher : 曾祥林
【Mathimatics-Numerical algorithms】 max_planar_sa DL : 0: 用经典的局部搜索算法模拟退火算法求解一个图的最大可平面子图。-With the classic local search algorithm simulated annealing algorithm for solving a graph of maximum planar subgraph.
Update : 2024-04-29 Size : 55296 Publisher : 张清国
【Data structs】 treeandpicture DL : 0: 利用邻接矩阵的图广度优先遍历算法, 利用子指针数组的普通树前根遍历算法-The use of adjacency matrix of the graph breadth-first traversal algorithm, using sub-array pointer before the root of the general tree traversal algorithm
Update : 2024-04-29 Size : 11264 Publisher : 左

« 1 2 ... 5 6 7 8 9 1011 12 13 14 15 ... 50 »