Graph cut method is based on the theory of graphics, and it is one of hot spots in international image segmentation field recent years.
图切分方法是一种基于图论的分割方法，也是近年来国际图像分割领域的一个研究热点。
A new weight calculation method based on the statistics of gradient direction histogram is presented here in order to robustly realize graph cut.
本文给出新的基于梯度方向直方图统计的权值计算方法，实现稳定的图切割。
In this paper, for resolving these two problems, a new image Mosaic method based on graph cut is presented.
为解决这两个问题，提出了一种基于图切割的图像拼接方法。
In this note, no using the contraction method, we prove that if a graph G is one edge short of having two edge-disjoint spanning trees, then G has a cut edge or G is supereulerian.
本文不利用收缩方法，直接证明了：当图G至多差一边有两棵边不相交的生成树时，G是超欧拉图或者G有割边。
A recursive spectral bisection method is applied to partition non-structured triangular meshes in parallel CFD for the treatment of load balance and minimum cut graph bisection.
将递归谱对剖分方法应用于流体力学并行计算中的非结构网格分割，以解决负载平衡和最小切割问题。
The number of the intersection points which some conjugate states of M sequence are in the state-graph of M sequence has closely relation to the cut-joining method of M sequence .
序列中的共轭状态在M序列的状态图中的交点个数与M序列的剪接构造法有密切的关系。
The number of the intersection points which some conjugate states of M sequence are in the state-graph of M sequence has closely relation to the cut-joining method of M sequence .
序列中的共轭状态在M序列的状态图中的交点个数与M序列的剪接构造法有密切的关系。
应用推荐