基于图割优化的图像密集匹配算法。
The algorithm of dense matching of images based on graph cuts optimization.
本文提出一种基于图割的全变差（TV）图像去噪算法。
This paper presents a total variation(TV) image denoising algorithm based on graph cut.
本文介绍和阐述了整合图像分割和图割理论的基本框架。
This thesis introduces and illustrates a general framework to integrate the areas of image segmentation and graph-cut theory.
图割算法是图像立体匹配算法中一种高效的最优化计算方法。
The graph cut algorithm is one of high effective optimal methods in the stereo images matching.
针对图割算法实时性差的问题，提出一种基于四叉树与图割的遥感图像分割方法。
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.
如果一个图是不连通的或有割点，就发生这种情况。
This happens if the graph is disconnected or has a cut vertex.
根据标号有向块的指数型生成函数，研究了具有唯一一个割点的标号有向连通图及所有割点都在一个块上的标号有向连通图的计数问题。
The essay has a study on enumeration question labeled oriented connected graphs with only one cut vertices and labeled oriented connected graphs that all of cut vertices are in same block.
一个图是超级限制边连通的，如果它的任一极小限制边割都孤立一条有最小边度的边。
G is called a super restricted edge connected graph if every minimum restricted edge cut separates exactly one edge.
通过绘制这种新型切割器的切割图和计算割茬高度，论证了该新型切割器适用于收割麻黄草的可行性。
The article proves that the new cutter is applicable for ephedra reaping by protracting the cutting graph of new cutter and calculating stubble heights.
图28线割穿线孔能以选定的边为基准按标准距离创建。
Figure 28 Wire Threading hole is created based on normal distance to the selected edge.
对于网络拓扑而言模型得到的割点分布即为网络中关键节点的分布，而块图就是安全审计域的规划分布。
The division point in this model was called security node and the block graphics was called audit domain distributing graphics.
最后，对于有割点的图的谱半径给出一个与子图的谱半径有关的一个不等式。
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.
本文不利用收缩方法，直接证明了：当图G至多差一边有两棵边不相交的生成树时，G是超欧拉图或者G有割边。
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.
同时给出4连通图4圈上和边点割原子及分离对上的可去边的分布。
Moreover, the distribution of removable edges in the edge-vertex cut atom and its separating pair for 4-connected graphs was obtained.
图的割宽问题在一般情形下，是NP难的，但对于树的情形有多项式算法。
The cutwidth problem is known that the problem for general graphs is NP hard while it is polynomially solvable for trees.
该算法利用二进制数分割无向图的顶点集，通过对子图各顶点的关联集的运算产生相应的割集。
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.
利用二元决策图(BDD)中的B—割集和节点概率，提出了基于BDD的关联故障树定量分析新算法。
By the B-cut sets and the probabilities of the nodes of Binary Decision Diagrams (BDD), a new quantitative analysis algorithm of coherent fault tree based on BDD is presented in this paper.
将最小割集和最小径集的概念引入了因果图理论，并用于重大安全事故的定性和定量分析中。
Qualitative analysis and quantitative analysis are made by using of fault tree analysis, minimum cut sets and importance are calculated.
将最小割集和最小径集的概念引入了因果图理论，并用于重大安全事故的定性和定量分析中。
Qualitative analysis and quantitative analysis are made by using of fault tree analysis, minimum cut sets and importance are calculated.
应用推荐