This paper presents a total variation(TV) image denoising algorithm based on graph cut.
本文提出一种基于图割的全变差（TV）图像去噪算法。
The graph cut algorithm is one of high effective optimal methods in the stereo images matching.
图割算法是图像立体匹配算法中一种高效的最优化计算方法。
Two algorithms, graph cut and random walk based on graph theory, were applied to motion segmentation.
将两种基于图论的算法图切割与随机游走应用于运动对象的分割。
In this paper, for resolving these two problems, a new image Mosaic method based on graph cut is presented.
为解决这两个问题，提出了一种基于图切割的图像拼接方法。
Results show that for a single object, a clean and smooth segmentation can be quickly achieved by the graph cut.
结果表明：基于图切割算法可针对单目标快速、有效地进行分割，并获得干净、光滑的分割结果；
Graph cut method is based on the theory of graphics, and it is one of hot spots in international image segmentation field recent years.
图切分方法是一种基于图论的分割方法，也是近年来国际图像分割领域的一个研究热点。
Objective To propose a modified graph cut algorithm under the elliptical shape constraint to segment the ultrasonogram of cervical lymph nodes.
目的本研究的目的在于了解舌不同区域淋巴引流的特点以及初级淋巴结在颈部的分布特征。
A new weight calculation method based on the statistics of gradient direction histogram is presented here in order to robustly realize graph cut.
本文给出新的基于梯度方向直方图统计的权值计算方法，实现稳定的图切割。
Aiming at the problem of poor real-time ability of graph cut, this paper suggests a remote sensing image segmentation approach based on quarter-tree and graph cut.
针对图割算法实时性差的问题，提出一种基于四叉树与图割的遥感图像分割方法。
To improve the efficiency of graph cut algorithm and reduce user interaction, the graph cut and mean shift algorithm were combined to automatically segment 3D vertebra images.
为提高图割算法的效率并减少用户交互量，提出将图割与均值漂移算法结合应用的脊椎骨自动分割方法。
Moreover, to improve the disparity accuracy, a novel energy function is well designed to restrict the depth-continuity of an image and applied to the Graph Cut algorithm to describe the image feature.
并针对图像的深度连续性约束，定义了一个反映图像自身特征的新能量函数，应用于图割算法，提高了视差计算精度。
Julie once complained that I cut cantaloupes all jaggedly, like a graph of the NASDAQ.
朱莉曾埋怨我哈密瓜切得参差不齐，就像纳斯达克曲线。
This happens if the graph is disconnected or has a cut vertex.
如果一个图是不连通的或有割点，就发生这种情况。
This thesis introduces and illustrates a general framework to integrate the areas of image segmentation and graph-cut theory.
本文介绍和阐述了整合图像分割和图割理论的基本框架。
This paper proposes two algorithms based on priority analysis and graph traversal respectively to automatically choose the section cut of key features such as holes and slots.
根据零件的孔、槽等剖切特征，提出基于优先度和基于图遍历的两种自动搜索关键特征产生剖切线的算法，并分别结合实例进行了比较。
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有割边。
Finally, for the spectral radius of a graph with a cut vertex, we give an inequality concerning the spectral radius of the graph and its subgraphs.
最后，对于有割点的图的谱半径给出一个与子图的谱半径有关的一个不等式。
Using graph theory of adjacency matrix as a conversion, a depth-first search to the entire map, can be cut at all possible paths.
利用图论中的邻接矩阵作为转换点，深度优先搜索整个有向图，可以得到所有可能的切分形式。
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 max-cut problem is a standard NP-hard problem in graph graphic theory.
最大割问题是图论中的一个典型的NP困难问题。
G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
The algorithm use a binary digit to divide the vertex set of a non-direction graph, and employ the incident sets of the vertices in the subgraph to produce opposite cut sets.
该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。
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序列的剪接构造法有密切的关系。
A new approach is proposed in this paper, based on the cut space and the cycle space in the graph theory.
但是与相对较为成熟的圈空间理论相比，对割空间的研究则显得较少。
The curves that are stable under various distortions are extracted in Graph-cut Theory, which is fully using gray level, texture and spatial information of image.
曲线的提取以图分割理论为基础，结合了图像中灰度、纹理和空间的多种信息，得到在各种畸变下仍然能保持相对稳定的区域边界为待配准曲线。
The progressive segmentation algorithm can be seamlessly combined with multi-scale banded graph-cut optimizations to reduce the computational complexities in the banded optimizations.
渐进式分割算法可与多尺度图窄带分割算法无缝地结合，降低了对窄带进行优化的计算复杂度。
The progressive segmentation algorithm can be seamlessly combined with multi-scale banded graph-cut optimizations to reduce the computational complexities in the banded optimizations.
渐进式分割算法可与多尺度图窄带分割算法无缝地结合，降低了对窄带进行优化的计算复杂度。
应用推荐