1)  Graph-Cut
Graph-Cut
2)  graph cut
图切割
1.
Two algorithms,graph cut and random walk based on graph theory,were applied to motion segmentation.
将两种基于图论的算法图切割与随机游走应用于运动对象的分割。
2.
In this paper,for resolving these two problems,a new image mosaic method based on graph cut is presented.
为解决这两个问题,提出了一种基于图切割的图像拼接方法。
3.
Secondly,the mean-shift to segment the video frames and combine the segment results by refining the initial estimated moving object with the computation of a graph cut was used.
然后利用均值偏移法准确估计运动物体的边缘并利用图切割方法建立两者之间联系。
3)  graph cut
Graph Cut
1.
This paper proposes an efficient method for texture synthesis based on graph cut technique and edge map.
提出一种带边界匹配的基于Graph Cut的快速纹理合成算法。
4)  Graph cut
图切分
1.
This paper presented a method of extracting faces automatically based on graph cut.
基于图切分理论,提出了一种自动分割人脸的方法。
5)  graph cut
图割
1.
The graph cut technique is then applied to produce the segmentation result which is consistent to the user s in.
网格模型分片在计算机图形学应用中具有重要意义,本文提出了一种基于网格上的调和场和图割技术的网格模型分片算法。
2.
This paper presents a total variation(TV) image denoising algorithm based on graph cut.
本文提出一种基于图割的全变差(TV)图像去噪算法。
3.
The graph cut algorithm is one of high effective optimal methods in the stereo images matching.
图割算法是图像立体匹配算法中一种高效的最优化计算方法。
6)  graph cut
图的切割
1.
We adopt graph cut algorithm to compute the best patch-based synthesis path between the overlaps.
针对拼贴纹理块时产生的局部性边界不匹配现象,用图的切割算法寻找块重叠区域的最优拼接路径,有效地提高了纹理合成质量。
参考词条
补充资料：and-or graph
分子式：
CAS号：

性质：一种系统地将问题分解为互相独立的小问题，然后分而解决的方法。与或图中有两种代表性的节点：“与节点”和“或节点”。“与节点”指所有的后续节点都有解时它才有解；“或节点”指各个后续节点均完全独立，只要其中有一个有解它就有解。

说明：补充资料仅用于学习参考，请勿用于其它任何用途。