搜索资源列表
NGC_ACM
- 图割（GC)和主动轮廓模型（ACM)相结合的一种图像分割方法，既可以进行局部图像的分割，也可进行全局图像的分割，简单实用。-A combination of graph cuts (GC) and the active contour model (ACM) image segmentation method, either local image segmentation, global image segmentation, simple and practical.
segment
- We de¯ ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an e±cient segmentation algorithm based on this predicate, and show that although this algo
map-program
- 简单绘制出常见标准benchmark函数的二维网格图，清晰的看出函数的最优值和局部最优，是单峰还是多峰函数-Simple map out common standard benchmark function of two-dimensional grid graph, clear see function of the optimal value and local optimum, is unimodal or multimodal function
seg-ijcv
- This paper addresses the problem of segmenting an image into regions. We de¯ ne a predicate for measuring the evidence for a boundary between two regions using a graph-based representation of the image. We then develop an e±cient segmentation
mxgraph_java
- Mxgraph是一个优秀的拖拉图形界面设计工具，相信对这方面有经验的，一定听说过。功能强大，界面美观。-The mxGraph package contains a client software, written in Javascr ipt, and a series of backends for various languages. The client software is a graph component with an optional application wrapper
CSS
- CSS鼠标经过图实现变色，淘宝图专用，代码详见文件，若不能实现，请检查代码，自己动手修改下图片路径等-CSS mouse passes graph implementation discoloration, Taobao Figure dedicated, the code is detailed in documents, hitch a ride local s all of them ears personal Workers thermal personal heat supply m
Edge-Detection
- 与以往关注图像局部特征和局部连续性的方法不同，本文中的方法能够提取关于图像的全局印象。为此，我们将图像分割问题转化为图划分问题并提出了划分中的一种全局判别准则——Ncut (Normalized Cut)-Concerned with the past image local characteristics and continuity of local methods, the methods herein can extract images on the overall impressio
localminima
- This the program to find the local minima of the histogram and then to find the smooth function of the graph-This is the program to find the local minima of the histogram and then to find the smooth function of the graph
modDRF.pdf
- In this paper we present Discriminative Random Fields (DRF), a discrim- inative framework for the classification of natural image regions by incor- porating neighborhood spatial dependencies in the labels as well as the observed data. The proposed mo
code_registration_release_v1.0
- 非刚性表面检测和配准。一种新的非刚性基于局部熵图匹配方法。-a novel high-order affinity graph is constructed to model the consistency of local topology. A hierarchical clustering approach is then used to locate the nonrigid surfaces
LineMatchingSourceCode
- 图像匹配是图像处理的基本问题，同时也一个难点，本代码是基于直线描述子的场景匹配。-Line segment matching plays an important role in image processing and computer vision, while it remains a challenging task for images under various transformations. In this work, we present a line matching alg
xyle
- 拉普拉斯降维方法，是非线性数据降维方法，通过构建相似关系图来重构数据局部流形结构特征。-Laplace dimension reduction method is non-linear data dimensionality reduction method, by constructing a graph similar to reconstruct the structure of local manifoldof the data.
LEM-Algorithm
- LEM（拉普拉斯特征映射）算法，拉普拉斯特征映射是基于局部邻域，保持局部结构的流形学习方法。LEM通过一个无向加权图刻画流形上数据点间的近邻关系，图的顶点为原始数据点，图的边对应点之间的近邻关系，边的权值对应近邻点之间的相似程度（也可以是某种距离），LEM在低维嵌入空间中尽量保持图中数据点之间的近邻关系，然后求取嵌入坐标。通俗的说，LEM认为在高维数据空间离得近的点在低维嵌入空间也应该离得近-LEM (Laplace feature mapping) algorithm, Laplace fea
4.2
- 基于dijkstra和广度搜索的加权有向图有必经点的点对点的最短路径算法，路径必须经过要求的必经点，且不成环。 该算法采用了一种自适应调整的方法，经过多次迭代，使解收敛。 但只是寻找了一个略优的可行解（每次迭代都基于贪婪算法寻找），不能保证最优解。而且如果图过于稀疏，因为收敛速度过快，可能导致问题无解（收敛于一个局部最优解，没有经过所有点）。 解决相对稠密的图（每个点的平均出入度4以上），表现良好。 备注：里面有一个QT的工程，可以直接打开（源码里没用QT的库）-Weigh
fgm_2012_05_12
- 分解图匹配（Factorized Graph Matching）源码-Graph matching (GM) is a fundamental problem in computer science, and it plays a central role to solve correspondence problems in computer vision. GM problems that incorporate pairwise constraints can be formulate
curves
- 通过读取数据文件绘制曲线图，具有放大，缩小，向上，向下，向左以及向右移动曲线的功能，能够显示局部曲线的能力：环境：Vs2010+QT5.5-The ability to read the data file by drawing a graph, with zoom, up, down, left and right to move the curve function, can display the local curve: Environment: Vs2010+QT5.5
Hermes
- Hermes算法 随着越来越多可连接的嵌入式设备，大量在网络上的资源，以云计算的形式，变得更容易获得。这些设备要么遭受严格电池使用限制，或有限的处理能力，像传感器，不能够本地运行计算复杂型任务。利用远程资源，更高效的应用程序，需要大量的数据处理和计算才可以及时实现可接受的性能。因此计算卸载 -将发送计算密集型任务给资源更丰富的服务设备。是一种潜在的处理本地资源，和缩短处理时间的方式。-With mobile devices increasingly able to connect to
LPP
- lpp算法实现,Locality Preserving Projections 局部保持投影算法 hexiaofei的论文(lppLocality Preserving Projections (LPP) builds a graph incorporating neighborhood information of the data set. Using the notion of the Laplacian of the graph, we then compute a transforma
bipartiteLocalModel
- 二分图的局部模型代码，用于解决二分图问题，及其二分图的链路预测问题(Bipartite map of the local model code, used to solve the bipartite graph problem, and its bipartite graph link prediction problem)
算法
- floyd算法又称为插点法，是一种利用动态规划的思想寻找给定的加权图中多源点之间最短路径的算法，模拟退火算法是局部最优解能概率性地跳出并最终趋于全局最优，遗传算法是一种通过模拟自然进化过程搜索最优解的方法。(The Floyd algorithm is also known as the insertion point method, which is a multi weighted graph using the idea of dynamic programming for the giv