Description: 本文用Ｃ语言实现了优化算法－最小费用最大流算法，主要用于图论领域-Using C programming language, the optimization algorithm-minimum cost maximum flow algorithm, mainly for the field of graph theory Platform: |
Size: 3072 |
Author:申辉 |
Hits:
Description: A program to demonstrate the optimization process of ant colony optimization for the traveling saleman problem (TSP). The cities are shown as red circles, the pheromone on the connections between them (fully connected graph) by gray lines. The darker the grey, the more pheromone is currently on the edge. During the optimization, the currently best found tour is drawn in red. To run the optimization, first create a random TSP, then create an ant colony, and finally run the optimization. Platform: |
Size: 20480 |
Author:无心 |
Hits:
Description: Graph-cut implementation is used for combinatorial optimization, which is a fast and robust means to achieve stereo matching, image restoration, segmentation. Platform: |
Size: 45056 |
Author:Wenmiao Lu |
Hits:
Description: 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. Platform: |
Size: 4487168 |
Author:wang wei |
Hits:
Description: 蚁群优化算法是一种基于自然启发的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. Platform: |
Size: 236544 |
Author:wangliang |
Hits:
Description: 粒子群算法的实例，应用于无线网络节点的动态布署等。图和表显示结果-Examples of particle swarm optimization applied to the wireless network nodes, such as dynamic deployment. Graph and table shows the results of Platform: |
Size: 4096 |
Author:QGP |
Hits:
Description: We propose a technique that allows a person to design a new photograph
with substantially less effort. This paper presents a method that generates a composite image when a user types
in nouns, such as “boat” and “sand.” The artist can optionally design an intended image by specifying other
constraints. Our algorithm formulates the constraints as queries to search an automatically annotated image
database. The desired photograph, not a collage, is then synthesized using graph-cut optimization, optionally
allowing for further user interaction to edit or choose among alternative generated photos. An implementation of
our approach, shown in the associated video, demonstrates our contributions of (1) a method for creating specific
images with minimal human effort, and (2) a combined algorithm for automatically building an image library with
semantic annotations from any photo collection.-We propose a technique that allows a person to design a new photographwith substantially less effort. This paper presents a method that generates a composite image when a user typesin nouns, such as Platform: |
Size: 1703936 |
Author:焦亚民 |
Hits:
Description: Any convex optimization problem has geometric interpretation. If a given
optimization problem can be transformed to a convex equivalent, then this
interpretive benefit is acquired. That is a powerful attraction: the ability to
visualize geometry of an optimization problem. Conversely, recent advances
in geometry and in graph theory hold convex optimization within their proofs’
core. Platform: |
Size: 2161664 |
Author:nakula |
Hits:
Description: 使用动态规划求多段图的C++源程序，用于满足最优化问题且问题能转换成一个有向图问题的求解，可以直接运行！-The use of dynamic programming for multi-stage plan of C++ source code, designed to meet the optimization problem and the problem can be converted into a directed graph to solve the problem, you can directly run! Platform: |
Size: 229376 |
Author:张凯兵 |
Hits:
Description: 采取邻接矩阵的搜索算法实现了对图的着色，是一种数值优化算法-Adjacency matrix to a search algorithm for graph coloring, is a numerical optimization algorithm Platform: |
Size: 207872 |
Author:yangke |
Hits:
Description: 《图论和组合优化》比较专业的计算机书籍；相关的博士或对算法爱好者可以参考阅读。-" Graph Theory and Combinatorial Optimization" more professional computer books relevant doctorate or algorithm enthusiasts can consult and read. Platform: |
Size: 13804544 |
Author:gouyabin |
Hits:
Description: 基于粒子群优化的无线MESH网信道分配算法通用MATLAB源码，本算法基于冲突图的粒子群优化算法而来。-Particle Swarm Optimization for Wireless MESH Network Channel Assignment General MATLAB source code, the algorithm is based on the conflict graph from PSO. Platform: |
Size: 4096 |
Author:成龙 |
Hits:
Description: 蚁群算法是一种用来在图中寻找优化路径的机率型算法。是一种求解组合最优化问题的新型通用启发式方法，该方法具有正反馈、分布式计算和富于建设性的贪婪启发式搜索的特点。通过建立适当的数学模型，基于故障过电流的配电网故障定位变为一种非线性全局寻优问题。-Ant colony algorithm is a method used to find optimal path in the graph the probability-based algorithm. Is a combination of optimization problems to solve new general heuristic method, which has a positive feedback, distributed computing and constructive and the greedy heuristic search features. Through the establishment of an appropriate mathematical model, over-current fault-based distribution network fault location into a nonlinear global optimization problem. Platform: |
Size: 3072 |
Author:prince |
Hits:
Description: graph cut 优化算法的最新版本，包含C++版本（在VS2005以上版本可以调通）和Matlab接口，-graph cut optimization algorithm of the latest version, includes C++ version (or later in the VS2005 can be transferred through) and the Matlab interface Platform: |
Size: 67584 |
Author:tanghuang |
Hits:
Description: graph cut 优化算法的最新版本，包含和Matlab接口，已编译，以及自己的一个简单测试例子程序MyTest，还有一篇经典论文及自己的读书笔记-graph cut optimization algorithm of the latest version, includes and Matlab interface has been compiled, and their example of a simple test program MyTest, there is a classic paper and his reading notes Platform: |
Size: 47104 |
Author:tanghuang |
Hits:
Description: Yuri Boykov s and Vladimir Kolmogorov s work on graph cuts and MRF optimization has been extensively cited in the academia, and their maximum flow implementation is widely used in computer vision and image processing research. Platform: |
Size: 139264 |
Author:utrade1 |
Hits:
Description: 算法大全 全书分30章及2附录（在MATLAB中实现）对常用数学算法进行汇总介绍。
主要包括：线性规划、非线性规划、动态规划、图与网络、排队论、对策论、层次分析法、插值与拟合、数据的统计描述和分析、方差分析、回归分析、微分方程建模、稳定状态模型、常微分方程解法、差分方程模型、马氏链模型、变分法模型、神经网络模型、偏微分方程的数值解、目标规划、模糊数值模型、现代优化算法、时间序列模型、存贮论、经济与金融的优化问题、生产与服务运作管理中的优化问题、灰色系统理论及其应用、多元分析、偏最小二乘回归以及附录-Complete collection of algorithm including 30 chapters and 2 appendices: linear programming, nonlinear programming, dynamic programming, graph and networks, queuing theory, game theory, the level of analysis, interpolation and fitting, statistical description and analysis of data , analysis of variance, regression analysis, differential equations modeling, steady-state model, ordinary differential equation solution, difference equation model, Markov chain model, variational method model, neural network model, the numerical solution of partial differential equations, goal programming, fuzzy numerical model, modern optimization algorithms, time series models, storage theory, the optimization of economic and financial issues, production and service operations management in the optimization problem, gray system theory and its applications, multivariate analysis, partial least squares regression, and Appendix
Platform: |
Size: 7684096 |
Author:商志远 |
Hits:
Search - graph optimization